• No results found

Tree edit distance

Approximating Tree Edit Distance through String Edit Distance

Approximating Tree Edit Distance through String Edit Distance

... the tree edit distance, we studied a relation between the tree edit distance and the sting edit distance for the Euler strings ...the tree edit ...

34

Learning Stochastic Tree Edit Distance

Learning Stochastic Tree Edit Distance

... of tree structured ...between tree pairs. The most studied distance is likely the tree edit distance (ED) for which improvements in terms of complexity have been achieved during ...

13

Decomposition algorithms for the tree edit distance problem

Decomposition algorithms for the tree edit distance problem

... We call decomposition according to Eq. (2) , involving leftmost forests, a right de- composition, and decomposition according to Eq. (3) , involving rightmost forests, a left decomposition. In the sequel, we use the word ...

24

Optimal Decomposition Strategy For Tree Edit Distance

Optimal Decomposition Strategy For Tree Edit Distance

... (Tree Edit Distance) The edit distance between two trees T 1 and T 2 is the minimum cost to change T 1 to T 2 via a sequence of basic edit ...string edit distance ...

78

A survey on tree edit distance and related problems

A survey on tree edit distance and related problems

... the tree edit distance and alignment distance problems are even MAX SNP-hard ...unordered tree edit distance problem, such that disjoint subtrees are mapped to disjoint ...

23

Learning Probabilistic Models of Tree Edit Distance

Learning Probabilistic Models of Tree Edit Distance

... for tree-structured ...the tree edit distance (ED) has been subject of investigations for many years in order to improve its computational ...the tree ED needs a priori fixed ...

40

Automatic Wrapper Adaptation by Tree Edit Distance Matching

Automatic Wrapper Adaptation by Tree Edit Distance Matching

... other tree edit distance approaches working with permutations; although, intuitively, simple tree matching based algorithms can not handle permutations on nodes, maybe it is possible to ...

14

Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics

Tree Edit Distance Problems: Algorithms and Applications to Bioinformatics

... words: tree edit distance, dynamic programming, largest common sub- tree, tree alignment ...because tree struc- tured data often appear in bioinformatics and other ...

11

Tree Edit Distance as a Baseline Approach for Paraphrase Representation

Tree Edit Distance as a Baseline Approach for Paraphrase Representation

... of Tree Edit Distance as a paraphrase representation ...ing Edit Distance Textual Entailment Suite show that, as Tree Edit Distance consists of a purely syntactic ...

7

Exact algorithms for computing the tree edit distance between unordered trees

Exact algorithms for computing the tree edit distance between unordered trees

... the tree edit distance problem for unordered trees is NP-hard ...related tree inclusion problem, Kilpeläinen and Mannila showed that it is solved in polynomial time if the maximum degree is ...

13

DTD based costs for Tree-Edit distance in Structured Information Retrieval

DTD based costs for Tree-Edit distance in Structured Information Retrieval

... 1. Tree representation of an XML document and a query in which we want a “movie” directed by “Terry Gilliam” with the actor “Benicio del Toro” and with a character named “Dr ...uses Tree-Edit ...

15

DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance

DTED: Evaluation of Machine Translation Structure Using Dependency Parsing and Tree Edit Distance

... The most straightforward way of executing a tree edit distance is simply to give equal weight- ing to all operations on all nodes. This gives us a simple measure of the structural similarity of the ...

8

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless {APSP} can)

Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless {APSP} can)

... a tree pattern matching problem is the recent SODA’16 quadratic lower bound for exact pattern matching [ 2 ] (the problem of deciding whether one tree is a subtree of ...in tree pattern matching, and ...

25

Answer Extraction as Sequence Tagging with Tree Edit Distance

Answer Extraction as Sequence Tagging with Tree Edit Distance

... bels: B - ANSWER (beginning of answer), I - ANSWER (inside of answer), O (outside of answer). Besides local POS / NER / DEP features, at each to- ken we need to inspect the entire input to connect the answer sentence ...

10

Optimising Tree Edit Distance with Subtrees for Textual Entailment

Optimising Tree Edit Distance with Subtrees for Textual Entailment

... ETED+ABC: this system uses the ABC algo- rithm to estimate the costs of edit single opera- tions and threshold(s) for ETED. For binary de- cision output, the chromosome is {cost of delet- ing a node, cost of ...

9

An edit distance between graph correspondences.

An edit distance between graph correspondences.

... the distance between two data structures is the edit ...string edit distance [ 7 ], tree edit distance [ 8 ] and graph edit distance [ 9 – 11 ...The ...

10

Edit Tree Distance Alignments for Semantic Role Labelling

Edit Tree Distance Alignments for Semantic Role Labelling

... Accuracy is measured as the percentage of se- mantic labels correctly predicted. The implementation of the Tree SRL system takes several days to run a single experiment. It makes non viable the idea of using the ...

6

Graph edit distance or graph edit pseudo-distance?

Graph edit distance or graph edit pseudo-distance?

... Graph Edit Distance to be directly related to the maximal common sub- ...Graph Edit Distance is exactly the same than deducting the maximal common ...specific distance between minutiae ...

7

Minimum Edit Distance. Definition of Minimum Edit Distance

Minimum Edit Distance. Definition of Minimum Edit Distance

... I wanted to get across the idea that this was dynamic, this was multistage… I thought, let’s … take a word that has an absolutely precise meaning, namely dynamic… it’s impossible to us[r] ...
An edit distance for Reeb graphs

An edit distance for Reeb graphs

... In this paper we focus on the second step of the shape retrieval pipeline, assuming that Reeb graphs have been chosen as shape signatures in the first step. The goal of this paper is to investigate theoretical aspects of ...

15

Show all 10000 documents...

Related subjects