Question Answering over Unstructured Data without Domain Restrictions
| dc.creator | Leidner, Jochen L. | |
| dc.date | 2002-07-14 | |
| dc.date | 2002-07-18 | |
| dc.date.accessioned | 2026-07-07T03:18:41Z | |
| dc.date.available | 2026-07-07T03:18:41Z | |
| dc.description | Information needs are naturally represented as questions. Automatic Natural-Language Question Answering (NLQA) has only recently become a practical task on a larger scale and without domain constraints. This paper gives a brief introduction to the field, its history and the impact of systematic evaluation competitions. It is then demonstrated that an NLQA system for English can be built and evaluated in a very short time using off-the-shelf parsers and thesauri. The system is based on Robust Minimal Recursion Semantics (RMRS) and is portable with respect to the parser used as a frontend. It applies atomic term unification supported by question classification and WordNet lookup for semantic similarity matching of parsed question representation and free text. | |
| dc.description | 8 pages, 6 figures, 5 tables. To appear in Proc. TaCoS'02, Potsdam, Germany | |
| dc.identifier | https://arxiv.org/abs/cs/0207058 | |
| dc.identifier | http://arxiv.org/abs/cs/0207058 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/31210 | |
| dc.subject | Computation and Language | |
| dc.subject | Information Retrieval | |
| dc.subject | I.2.7; H.3.1 | |
| dc.title | Question Answering over Unstructured Data without Domain Restrictions | |
| dc.type | text |