Invention Grant
- Patent Title: Determining comprehensiveness of question paper given syllabus
-
Application No.: US15210099Application Date: 2016-07-14
-
Publication No.: US10558931B2Publication Date: 2020-02-11
- Inventor: Amit P. Bohra , Krishna Kummamuru , Swapnasarit Sahu , Abhishek Shivkumar
- Applicant: International Business Machines Corporation
- Applicant Address: US NY Armonk
- Assignee: International Business Machines Corporation
- Current Assignee: International Business Machines Corporation
- Current Assignee Address: US NY Armonk
- Agent Stephen R. Tkacs; Stephen J. Walder, Jr.; Reza Sarbakhsh
- Main IPC: G06N7/00
- IPC: G06N7/00 ; G06N5/04 ; G06F16/22 ; G06F16/2452 ; G09B7/00

Abstract:
A mechanism is provided in a data processing system for determining comprehensiveness of a question paper given a syllabus of topics. An answer and evidence generator of a question answering system executing on the data processing system finds one or more answers based on the syllabus of topics for each question in the question paper. The answer and evidence generator identifies evidence for the one or more answers in the syllabus for each question in the question paper. A concept identifier of the question answering system identifies a set of concepts in the syllabus corresponding to the evidence for each question in the question paper to form a plurality of sets of concepts. The mechanism determines a value for a comprehensiveness metric for the question paper with respect to the syllabus of topics based on the plurality of sets of concepts.
Public/Granted literature
- US20160321556A1 Determining Comprehensiveness of Question Paper Given Syllabus Public/Granted day:2016-11-03
Information query
IPC分类:
G | 物理 |
G06 | 计算;推算或计数 |
G06N | 基于特定计算模型的计算机系统 |
G06N7/00 | 基于特定数学模式的计算机系统 |