Results 11 to 20 of about 1,895,967 (280)
A contextual normalised edit distance [PDF]
2008 IEEE 24th International Conference on Data Engineering Workshop, 2008 In order to better fit a variety of pattern recognition problems over strings, using a normalised version of the edit or Levenshtein distance is considered to be an appropriate approach. The goal of normalisation is to take into account the lengths of the strings.
Colin de la Higuera, Luisa Micó
core +8 more sources
2018 24th International Conference on Pattern Recognition (ICPR), 2018 In this paper, we present a novel distance metric called Segmentation Edit Distance (SED) and its use as a segmentation evaluation metric. In segmentation evaluation, the difference or distance of a test segmentation and the associated ground truth segmentation are measured in order to compare different algorithms.
Daniel Pucher, Walter G. Kropatsch
core +7 more sources
Edit Distance with Block Deletions [PDF]
Algorithms, 2011 Several variants of the edit distance problem with block deletions are considered. Polynomial time optimal algorithms are presented for the edit distance with block deletions allowing character insertions and character moves, but without block moves.
Dana Shapira, James A. Storer
doaj +3 more sources
Edit distance for timed automata [PDF]
Proceedings of the 17th international conference on Hybrid systems: computation and control, 2014 The edit distance between two (untimed) traces is the minimum cost of a sequence of edit operations (insertion, deletion, or substitution) needed to transform one trace to the other. Edit distances have been extensively studied in the untimed setting, and form the basis for approximate matching of sequences in different domains such as coding theory ...
Krishnendu Chatterjee +2 more
openaire +4 more sources
Map Edit Distance vs. Graph Edit Distance for Matching Images [PDF]
, 2013 Generalized maps are widely used to model the topology of nD objects (such as 2D or 3D images) by means of incidence and adjacency relationships between cells (0D vertices, 1D edges, 2D faces, 3D volumes, ...). Recently, we have introduced a map edit distance.
Camille Combier +2 more
openaire +3 more sources
CoRRWe define and investigate the Fréchet edit distance problem. Given two polygonal curves $π$ and $σ$ and a threshhold value $δ>0$, we seek the minimum number of edits to $σ$ such that the Fréchet distance between the edited $σ$ and $π$ is at most $δ$. For the edit operations we consider three cases, namely, deletion of vertices, insertion of vertices,
Emily Fox +3 more
openaire +7 more sources
Graph Edit Distance or Graph Edit Pseudo-Distance? [PDF]
, 2016 Graph Edit Distance has been intensively used since its appearance in 1983. This distance is very appropriate if we want to compare a pair of attributed graphs from any domain and obtain not only a distance, but also the best correspondence between nodes of the involved graphs.
Francesc Serratosa +2 more
openaire +3 more sources
Approximating Edit Distance Efficiently [PDF]
45th Annual IEEE Symposium on Foundations of Computer Science, 2004 Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time 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-distortion embeddings into normed spaces, approximate nearest ...
Ziv Bar-Yossef +3 more
openaire +2 more sources
Proceedings of the Sixth Workshop on Structured Prediction for NLP, 2022 We propose the neural string edit distance model for string-pair matching and string transduction based on learnable string edit distance. We modify the original expectation-maximization learned edit distance algorithm into a differentiable loss function, allowing us to integrate it into a neural network providing a contextual representation of the ...
Libovický, Jindřich, Fraser, Alexander
openaire +5 more sources
FURY: Fuzzy unification and resolution based on edit distance [PDF]
, 2000 We present a theoretically founded framework for fuzzy unification and resolution based on edit distance over trees. Our framework extends classical unification and resolution conservatively. We prove important properties of the framework and develop
Schroeder, M, Gilbert, D
core +6 more sources