{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:00Z","timestamp":1778300940097,"version":"3.51.4"},"reference-count":0,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2002,2,14]],"date-time":"2002-02-14T00:00:00Z","timestamp":1013644800000},"content-version":"unspecified","delay-in-days":75,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Nat. Lang. Eng."],"published-print":{"date-parts":[[2001,12]]},"abstract":"<jats:p>In this paper, we take a detailed look at the performance of components of an idealized \nquestion answering system on two different tasks: the TREC Question Answering task \nand a set of reading comprehension exams. We carry out three types of analysis: inherent \nproperties of the data, feature analysis, and performance bounds. Based on these analyses \nwe explain some of the performance results of the current generation of Q\/A systems and \nmake predictions on future work. In particular, we present four findings: (1) Q\/A system \nperformance is correlated with answer repetition; (2) relative overlap scores are more effective \nthan absolute overlap scores; (3) equivalence classes on scoring functions can be used to \nquantify performance bounds; and (4) perfect answer typing still leaves a great deal of \nambiguity for a Q\/A system because sentences often contain several items of the same type.<\/jats:p>","DOI":"10.1017\/s1351324901002819","type":"journal-article","created":{"date-parts":[[2002,7,27]],"date-time":"2002-07-27T09:49:03Z","timestamp":1027763343000},"page":"325-342","source":"Crossref","is-referenced-by-count":33,"title":["Analyses for elucidating current question \nanswering technology"],"prefix":"10.1017","volume":"7","author":[{"given":"MARC","family":"LIGHT","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"GIDEON S.","family":"MANN","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ELLEN","family":"RILOFF","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ERIC","family":"BRECK","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2002,2,14]]},"container-title":["Natural Language Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1351324901002819","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T17:32:54Z","timestamp":1557250374000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1351324901002819\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,12]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,12]]}},"alternative-id":["S1351324901002819"],"URL":"https:\/\/doi.org\/10.1017\/s1351324901002819","relation":{},"ISSN":["1351-3249","1469-8110"],"issn-type":[{"value":"1351-3249","type":"print"},{"value":"1469-8110","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,12]]}}}