Design and realization of a modular architecture for textual entailment
- 13 December 2013
- journal article
- research article
- Published by Cambridge University Press (CUP) in Natural Language Engineering
- Vol. 21 (2) , 167-200
Abstract
A key challenge at the core of many Natural Language Processing (NLP) tasks is the ability to determine which conclusions can be inferred from a given natural language text. This problem, called theRecognition of Textual Entailment (RTE), has initiated the development of a range of algorithms, methods, and technologies. Unfortunately, research on Textual Entailment (TE), like semantics research more generally, is fragmented into studies focussing on various aspects of semantics such as world knowledge, lexical and syntactic relations, or more specialized kinds of inference. This fragmentation has problematic practical consequences. Notably, interoperability among the existing RTE systems is poor, and reuse of resources and algorithms is mostly infeasible. This also makes systematic evaluations very difficult to carry out. Finally, textual entailment presents a wide array of approaches to potential end users with little guidance on which to pick. Our contribution to this situation is the novel EXCITEMENT architecture, which was developed to enable and encourage the consolidation of methods and resources in the textual entailment area. It decomposes RTE into components with strongly typed interfaces. We specify (a) a modular linguistic analysis pipeline and (b) a decomposition of the ‘core’ RTE methods into top-level algorithms and subcomponents. We identify four major subcomponent types, including knowledge bases and alignment methods. The architecture was developed with a focus on generality, supporting all major approaches to RTE and encouraging language independence. We illustrate the feasibility of the architecture by constructing mappings of major existing systems onto the architecture. The practical implementation of this architecture forms the EXCITEMENT open platform. It is a suite of textual entailment algorithms and components which contains the three systems named above, including linguistic-analysis pipelines for three languages (English, German, and Italian), and comprises a number of linguistic resources. By addressing the problems outlined above, the platform provides a comprehensive and flexible basis for research and experimentation in textual entailment and is available as open source software under the GNU General Public License.Keywords
This publication has 21 references indexed in Scilit:
- Learning Entailment Relations by Global Graph Structure OptimizationComputational Linguistics, 2012
- A machine learning approach to textual entailment recognitionNatural Language Engineering, 2009
- Recognizing entailment in intelligent tutoring systemsNatural Language Engineering, 2009
- Inferring textual entailment with a probabilistically sound calculusNatural Language Engineering, 2009
- Recognizing textual relatedness with predicate-argument structures2009
- Testing the Reasoning for Question Answering ValidationJournal of Logic and Computation, 2007
- Proceedings of the Workshop on Frontiers in Corpus Annotations II Pie in the Sky - CorpusAnno '052005
- UIMA: an architectural approach to unstructured information processing in the corporate research environmentNatural Language Engineering, 2004
- GATE, a General Architecture for Text EngineeringComputers and the Humanities, 2002
- Enriching the knowledge sources used in a maximum entropy part-of-speech tagger2000