XML Information Retrieval through Tree Edit Distance and Structural Summaries

2011 ◽  
pp. 73-83 ◽  
Author(s):  
Cyril Laitang ◽  
Mohand Boughanem ◽  
Karen Pinel-Sauvagnat
Keyword(s):  
Information Retrieval ◽  
Edit Distance ◽  
Tree Edit Distance

scholarly journals Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)

2020 ◽  
Vol 16 (4) ◽  
pp. 1-22
Author(s):  
Karl Bringmann ◽  
Paweł Gawrychowski ◽  
Shay Mozes ◽  
Oren Weimann
Keyword(s):  
Edit Distance ◽  
Tree Edit Distance

scholarly journals An optimal decomposition algorithm for tree edit distance

2009 ◽  
Vol 6 (1) ◽  
pp. 1-19 ◽  
Author(s):  
Erik D. Demaine ◽  
Shay Mozes ◽  
Benjamin Rossman ◽  
Oren Weimann
Keyword(s):  
Edit Distance ◽  
Decomposition Algorithm ◽  
Tree Edit Distance

scholarly journals Natural Language Inference for Arabic Using Extended Tree Edit Distance with Subtrees

2013 ◽  
Vol 48 ◽  
pp. 1-22 ◽  
Author(s):  
M. Alabbas ◽  
A. Ramsay
Keyword(s):  
Natural Language Processing ◽  
Natural Language ◽  
Language Processing ◽  
Edit Distance ◽  
Arabic Text ◽  
Tree Edit Distance ◽  
Single Node ◽  
Preliminary Results ◽  
Standard Algorithm ◽  
Standard Tree

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.

Sign in / Sign up

Export Citation Format

Share Document