Papers with NAQ
Answerable or Not: Devising a Dataset for Extending Machine Reading Comprehension (C18-1)
Copied to clipboard
| Challenge: | Existing MRC algorithms assume that each question is answerable by looking at text passages, but to realize human-like language comprehension ability, a machine should be able to distinguish not-answerable questions from answerable questions. |
| Approach: | They propose a method for automatically assigning difficulty level labels to a dataset that alters an existing MRC dataset and describes the resulting dataset. |
| Outcome: | The proposed method can detect NAQs in a dataset with difficulty level labels and is valid and potentially useful in the development of advanced MRC models. |