Heuristics: intelligent search strategies for computer problem solving
Heuristics: intelligent search strategies for computer problem solving
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
The nature of statistical learning theory
The nature of statistical learning theory
Meaningful change detection in structured data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
An Algorithm that Learns What‘s in a Name
Machine Learning - Special issue on natural language learning
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
Kernel methods for relation extraction
The Journal of Machine Learning Research
Three new probabilistic models for dependency parsing: an exploration
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 1
BLEU: a method for automatic evaluation of machine translation
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Loosely tree-based alignment for machine translation
ACL '03 Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - Volume 1
Question answering passage retrieval using dependency relations
Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval
A survey on tree edit distance and related problems
Theoretical Computer Science
Dependency tree kernels for relation extraction
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Automatic learning of textual entailments with cross-pair similarities
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Unsupervised construction of large paraphrase corpora: exploiting massively parallel news sources
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
Non-projective dependency parsing using spanning tree algorithms
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Learning probabilistic models of tree edit distance
Pattern Recognition
Modeling semantic containment and exclusion in natural language inference
COLING '08 Proceedings of the 22nd International Conference on Computational Linguistics - Volume 1
RTE '07 Proceedings of the ACL-PASCAL Workshop on Textual Entailment and Paraphrasing
Quasi-synchronous grammars: alignment by soft projection of syntactic dependencies
StatMT '06 Proceedings of the Workshop on Statistical Machine Translation
Paraphrase identification as probabilistic quasi-synchronous recognition
ACL '09 Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 1 - Volume 1
Efficient convolution kernels for dependency and constituent syntactic trees
ECML'06 Proceedings of the 17th European conference on Machine Learning
PEM: a paraphrase evaluation metric exploiting parallel texts
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
User Behaviors in Related Word Retrieval and New Word Detection: A Collaborative Perspective
ACM Transactions on Asian Language Information Processing (TALIP)
A survey on question answering technology from an information retrieval perspective
Information Sciences: an International Journal
A probabilistic lexical model for ranking textual inferences
SemEval '12 Proceedings of the First Joint Conference on Lexical and Computational Semantics - Volume 1: Proceedings of the main conference and the shared task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation
Efficient search for transformation-based inference
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Long Papers - Volume 1
Using discourse information for paraphrase extraction
EMNLP-CoNLL '12 Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning
Building structures from classifiers for passage reranking
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
An introduction to string re-writing kernel
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Natural language inference for arabic using extended tree edit distance with subtrees
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
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.