Results 211 to 220 of about 7,310 (242)

Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes

Fundamenta Informaticae, 2009
This article proposes an approximation of the tree edit distance through the string edit distance for binary tree codes, instead of for Euler strings introduced by Akutsu (2006). Here, a binary tree code is a string obtained by traversing a binary tree representation with two kinds of dummy nodes of a tree in preorder. Then, we show that σ/2 ≤ τ ≤ (h +
Aratsu, Taku, Hirata, Kouichi, Kuboyama, Tetsuji   +2 more
openaire   +1 more source

Top-Down Tree Edit-Distance of Regular Tree Languages

International Journal of Advances in Engineering Sciences and Applied Mathematics, 2014
We study the edit-distance of regular tree languages. The edit-distance is a useful metric for measuring the similarity or dissimilarity between two objects. A regular tree language is a set of trees accepted by a finite-state tree automaton or described by a regular tree grammar.
Sang-Ki Ko, Yo-Sub Han, Kai Salomaa
openaire   +1 more source

Analysis of Tree Edit Distance Algorithms

2003
In this article, we study the behaviour of dynamic programming methods for the tree edit distance problem, such as [4] and [2]. We show that those two algorithms may be described in a more general framework of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.
Dulucq, Serge, Touzet, Hélène
openaire   +2 more sources

Tree Edit Distance and Maximum Agreement Subtree

Information Processing Letters, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Tree Edit Distance from Information Theory

2003
This paper presents a method for estimating the cost of tree edit operations. The approach poses the problem as that of estimating a generative model for a set of tree samples. The generative model uses the tree-union as the structural archetype for every tree in the distribution and assigns to each node in the archetype the probability that the node ...
TORSELLO, Andrea, Edwin R. Hancock
openaire   +2 more sources

Computing text similarity using Tree Edit Distance

2015 Annual Conference of the North American Fuzzy Information Processing Society (NAFIPS) held jointly with 2015 5th World Conference on Soft Computing (WConSC), 2015
In this paper, we propose the application of the Tree Edit Distance (TED) for calculation of similarity between syntactic n-grams for further detection of soft similarity between texts. The computation of text similarity is the basic task for many natural language processing problems, and it is an open research field.
Grigori Sidorov, Helena Gomez-Adorno, Ilia Markov, David Pinto, Nahun Loya   +4 more
openaire   +1 more source

TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE

International Journal of Foundations of Computer Science, 2014
In this paper, we investigate the problem of computing structural sensitive variations of an unordered tree edit distance. First, we focus on the variations tractable by the algorithms including the submodule of a network algorithm, either the minimum cost maximum flow algorithm or the maximum weighted bipartite matching algorithm.
Yamamoto, Yoshiyuki, Hirata, Kouichi, Kuboyama, Tetsuji   +2 more
openaire   +1 more source

Tree Edit Distances from Singularity Theory

2005
An representation based on the singularity structure of the gradient magnitude over scale is used as the atoms in a space of images. This representation is summarized as a rooted tree. The generic transitions of the functional of the scale space images are analysed and listed for the scale parameter and one free parameter.
openaire   +1 more source

Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling

2001
This paper investigates an approach to tree edit distance problem with weighted nodes. We show that any tree obtained with a sequence of cut and relabel operations is a subtree of the transitive closure of the original tree. Furthermore, we show that the necessary condition for any subtree to be a solution can be reduced to a clique problem in a ...
TORSELLO, Andrea, HANCOCK E. R.
openaire   +1 more source

Faster algorithms for guided tree edit distance

Information Processing Letters, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source