Publication Date
| In 2026 | 0 |
| Since 2025 | 0 |
| Since 2022 (last 5 years) | 0 |
| Since 2017 (last 10 years) | 2 |
| Since 2007 (last 20 years) | 2 |
Descriptor
| Accuracy | 2 |
| Classification | 2 |
| Connected Discourse | 2 |
| Natural Language Processing | 2 |
| Artificial Intelligence | 1 |
| Computational Linguistics | 1 |
| Computer Uses in Education | 1 |
| Difficulty Level | 1 |
| Educational Technology | 1 |
| Inferences | 1 |
| Models | 1 |
| More ▼ | |
Source
| Grantee Submission | 2 |
Author
| Danielle S. McNamara | 1 |
| Dascalu, Mihai | 1 |
| McNamara, Danielle S. | 1 |
| Mihai Dascalu | 1 |
| Nicula, Bogdan | 1 |
| Perret, Cecile A. | 1 |
| Philippe Dessus | 1 |
| Scott A. Crossley | 1 |
| Stefan Trausan-Matu | 1 |
Publication Type
| Reports - Research | 2 |
| Speeches/Meeting Papers | 1 |
Education Level
Audience
Location
Laws, Policies, & Programs
Assessments and Surveys
What Works Clearinghouse Rating
Nicula, Bogdan; Perret, Cecile A.; Dascalu, Mihai; McNamara, Danielle S. – Grantee Submission, 2020
Open-ended comprehension questions are a common type of assessment used to evaluate how well students understand one of multiple documents. Our aim is to use natural language processing (NLP) to infer the level and type of inferencing within readers' answers to comprehension questions using linguistic and semantic features within their responses.…
Descriptors: Natural Language Processing, Taxonomy, Responses, Semantics
Mihai Dascalu; Scott A. Crossley; Danielle S. McNamara; Philippe Dessus; Stefan Trausan-Matu – Grantee Submission, 2018
A critical task for tutors is to provide learners with suitable reading materials in terms of difficulty. The challenge of this endeavor is increased by students' individual variability and the multiple levels in which complexity can vary, thus arguing for the necessity of automated systems to support teachers. This chapter describes…
Descriptors: Reading Materials, Difficulty Level, Natural Language Processing, Artificial Intelligence

Peer reviewed
Direct link
