Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Computing the Edit-Distance between Unrooted Ordered Trees
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
A survey on tree edit distance and related problems
Theoretical Computer Science
Arabic Natural Language Processing
Arabic Natural Language Processing
Multilingual dependency analysis with a two-stage discriminative parser
CoNLL-X '06 Proceedings of the Tenth Conference on Computational Natural Language Learning
Developing an Arabic treebank: methods, guidelines, procedures, and tools
Semitic '04 Proceedings of the Workshop on Computational Approaches to Arabic Script-based Languages
Generating an entailment corpus from news headlines
EMSEE '05 Proceedings of the ACL Workshop on Empirical Modeling of Semantic Equivalence and Entailment
An optimal decomposition algorithm for tree edit distance
ACM Transactions on Algorithms (TALG)
Optimizing textual entailment recognition using particle swarm optimization
TextInfer '09 Proceedings of the 2009 Workshop on Applied Textual Inference
Natural language inference
Tree edit models for recognizing textual entailments, paraphrases, and answers to questions
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
RTED: a robust algorithm for the tree edit distance
Proceedings of the VLDB Endowment
The PASCAL recognising textual entailment challenge
MLCW'05 Proceedings of the First international conference on Machine Learning Challenges: evaluating Predictive Uncertainty Visual Object Classification, and Recognizing Textual Entailment
| Hi-index | 0.00 |
Many natural language processing (NLP) applications require the computation of similarities between pairs of syntactic or semantic trees. Many researchers have used tree edit distance for this task, but this technique suffers from the drawback that it deals with single node operations only. We have extended the standard tree edit distance algorithm to deal with subtree transformation operations as well as single nodes. The extended algorithm with subtree operations, TED+ST, is more effective and flexible than the standard algorithm, especially for applications that pay attention to relations among nodes (e.g. in linguistic trees, deleting a modifier subtree should be cheaper than the sum of deleting its components individually). We describe the use of TED+ST for checking entailment between two Arabic text snippets. The preliminary results of using TED+ST were encouraging when compared with two string-based approaches and with the standard algorithm.