Abstract
How tough is a given question-answering problem? Answers to this question differ greatly among different researchers and groups. To begin rectifying this, we start by giving a quick, simple, propaedeutic formalization of a question-answering problem class. This formalization is just a starting point and should let us answer, at least roughly, this question: What is the relative toughness of two unsolved QA problem classes?. © 2014 Springer International Publishing.
Cite
CITATION STYLE
Govindarajulu, N. S., Licato, J., & Bringsjord, S. (2014). Toward a formalization of QA problem classes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8598 LNAI, pp. 228–233). Springer Verlag. https://doi.org/10.1007/978-3-319-09274-4_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
