Encoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case

Anthology ID:: W08-2004
Volume:: Coling 2008: Proceedings of the 3rd Textgraphs workshop on Graph-based Algorithms for Natural Language Processing
Month:: August
Year:: 2008
Address:: Manchester, UK
Editors:: Irina Matveeva, Chris Biemann, Monojit Choudhury, Mona Diab
Venue:: TextGraphs
SIG:: SIGLEX
Publisher:: Coling 2008 Organizing Committee
Note:
Pages:: 25–32
Language:
URL:: https://aclanthology.org/W08-2004
DOI:
Bibkey:
Cite (ACL):: Alessandro Moschitti and Fabio Massimo Zanzotto. 2008. Encoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case. In Coling 2008: Proceedings of the 3rd Textgraphs workshop on Graph-based Algorithms for Natural Language Processing, pages 25–32, Manchester, UK. Coling 2008 Organizing Committee.
Cite (Informal):: Encoding Tree Pair-Based Graphs in Learning Algorithms: The Textual Entailment Recognition Case (Moschitti & Zanzotto, TextGraphs 2008)
Copy Citation:
PDF:: https://preview.aclanthology.org/nschneid-patch-5/W08-2004.pdf