Date of Original Version

6-2010

Type

Conference Proceeding

Journal Title

Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies

First Page

1011

Last Page

1019

Rights Management

Copyright 2010 ACL

Abstract or Description

We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and effective method for modeling pairs of semantically related sentences. To efficiently extract sequences of edits, we employ a tree kernel as a heuristic in a greedy search routine. We describe a logistic regression model that uses 33 syntactic features of edit sequences to classify the sentence pairs. The approach leads to competitive performance in recognizing textual entailment, paraphrase identification, and answer selection for question answering

Creative Commons License

Creative Commons Attribution-Noncommercial-Share Alike 3.0 License
This work is licensed under a Creative Commons Attribution-Noncommercial-Share Alike 3.0 License.

Share

COinS
 

Published In

Proceedings of the Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, 1011-1019.