Results 1  10
of
1,782
Learning String Edit Distance
, 1997
"... In many applications, it is necessary to determine the similarity of two strings. A widelyused notion of string similarity is the edit distance: the minimum number of insertions, deletions, and substitutions required to transform one string into the other. In this report, we provide a stochastic mo ..."
Abstract

Cited by 252 (2 self)
 Add to MetaCart
In many applications, it is necessary to determine the similarity of two strings. A widelyused notion of string similarity is the edit distance: the minimum number of insertions, deletions, and substitutions required to transform one string into the other. In this report, we provide a stochastic
Simple fast algorithms for the editing distance between trees and related problems
 SIAM J. COMPUT
, 1989
"... Ordered labeled trees are trees in which the lefttoright order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching i ..."
Abstract

Cited by 405 (12 self)
 Add to MetaCart
Ordered labeled trees are trees in which the lefttoright order among siblings is. significant. The distance between two ordered trees is considered to be the weighted number of edit operations (insert, delete, and modify) to transform one tree to another. The problem of approximate tree matching
Approximating edit distance efficiently
 In Proc. FOCS 2004
, 2004
"... Edit distance has been extensively studied for the past several years. Nevertheless, no lineartime algorithm is known to compute the edit distance between two strings, or even to approximate it to within a modest factor. Furthermore, for various natural algorithmic problems such as lowdistortion e ..."
Abstract

Cited by 36 (5 self)
 Add to MetaCart
Edit distance has been extensively studied for the past several years. Nevertheless, no lineartime algorithm is known to compute the edit distance between two strings, or even to approximate it to within a modest factor. Furthermore, for various natural algorithmic problems such as low
A survey on tree edit distance and related problems
 Theor. Comput. Sci
, 2005
"... We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or ..."
Abstract

Cited by 181 (1 self)
 Add to MetaCart
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one
Bayesian graph edit distance
 IEEE Transactions on Pattern Analysis and Machine Intelligence
, 2000
"... AbstractÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of editdistance originally introduced for graphmatching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability distribution ..."
Abstract

Cited by 60 (5 self)
 Add to MetaCart
AbstractÐThis paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of editdistance originally introduced for graphmatching by Sanfeliu and Fu [1]. We show how the Levenshtein distance can be used to model the probability
Edit Distance of Regular Languages
"... The edit distance of a pair of strings, and of a string and a language are well known concepts that have various applications in optical character recognition (OCR) and document image analysis (DIA). In the present paper, a generalization is proposed, viz., the edit distance of two regular languag ..."
Abstract
 Add to MetaCart
The edit distance of a pair of strings, and of a string and a language are well known concepts that have various applications in optical character recognition (OCR) and document image analysis (DIA). In the present paper, a generalization is proposed, viz., the edit distance of two regular
ON THE COMPUTATION OF EDIT DISTANCE FUNCTIONS
"... Abstract. The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H. This p ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
Abstract. The edit distance between two graphs on the same labeled vertex set is the symmetric difference of the edge sets. The edit distance function of hereditary property, H, is a function of p ∈ [0, 1] and is the limit of the maximum normalized distance between a graph of density p and H
EditDistance of Weighted Automata
 In JeanMarc Champarnaud and Denis Maurel, editor, Seventh International Conference, CIAA 2002
, 2002
"... The editdistance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings. This definition can be extend ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
The editdistance of two strings is the minimal cost of a sequence of symbol insertions, deletions, or substitutions transforming one string into the other. The definition is used in various contexts to give a measure of the difference or similarity between two strings. This definition can
The smoothed complexity of edit distance
 IN PROC. OF ICALP
, 2008
"... We initiate the study of the smoothed complexity of sequence alignment, by proposing a semirandom model of edit distance between two input strings, generated as follows. First, an adversary chooses two binary strings of length d and a longest common subsequence A of them. Then, every character is ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
We initiate the study of the smoothed complexity of sequence alignment, by proposing a semirandom model of edit distance between two input strings, generated as follows. First, an adversary chooses two binary strings of length d and a longest common subsequence A of them. Then, every character
Edit distance and its computation
, 2007
"... In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi’s Regularity Lemma directly. Using these new methods, we are able to compute the edit di ..."
Abstract

Cited by 6 (4 self)
 Add to MetaCart
In this paper, we provide a method for determining the asymptotic value of the maximum edit distance from a given hereditary property. This method permits the edit distance to be computed without using Szemerédi’s Regularity Lemma directly. Using these new methods, we are able to compute the edit
Results 1  10
of
1,782