Results 21 to 30 of about 1,791,230 (278)
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
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
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ó
openaire +2 more sources
The Smoothed Complexity of Edit Distance [PDF]
ACM Transactions on Algorithms, 2008 We initiate the study of the smoothed complexity of sequence alignment, by proposing a semi-random 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.
Alexandr Andoni, Robert Krauthgamer
openaire +3 more sources
The Edit Distance Function of Some Graphs
Discussiones Mathematicae Graph Theory, 2020 The edit distance function of a hereditary property is the asymptotically largest edit distance between a graph of density p ∈ [0, 1] and . Denote by Pn and Cn the path graph of order n and the cycle graph of order n, respectively. Let C2n*C_{2n}^* be
Hu Yumei, Shi Yongtang, Wei Yarong
doaj +1 more source
Approximating the Geometric Edit Distance
Algorithmica, 2022 Edit distance is a measurement of similarity between two sequences such as strings, point sequences, or polygonal curves. Many matching problems from a variety of areas, such as signal analysis, bioinformatics, etc., need to be solved in a geometric space. Therefore, the geometric edit distance (GED) has been studied.
Kyle Fox, Xinyi Li
openaire +6 more sources
The extended edit distance metric [PDF]
2008 International Workshop on Content-Based Multimedia Indexing, 2008 Technical ...
Muhammad Fuad, Muhammad Marwan +1 more
openaire +4 more sources
The Duality of Similarity and Metric Spaces
Applied Sciences, 2021 We introduce a new mathematical basis for similarity space. For the first time, we describe the relationship between distance and similarity from set theory. Then, we derive generally valid relations for the conversion between similarity and a metric and
Ondřej Rozinek, Jan Mareš
doaj +1 more source
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]
, 2015 Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King +5 more
core +1 more source
AlBi-HHU/homo-edit-distance: Initial Release
, 2020 <p>Implementation of the homo-edit-distance algorithm.</p ...
Maren Brand +5 more
core +2 more sources