The Harmonic Edit Distance

11/08/2020
by   Bob Pepin, et al.
0

This short note introduces a new distance between strings, where the cost of an insertion or deletion is inversely proportional to the string length. It improves upon previous results by admitting a simple, explicit formula involving only the length of the longest common subsequence and satisfying the triangle inequality at the same time, while not requiring any parameter tuning.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/28/2018

Near-Linear Time Insertion-Deletion Codes and (1+ε)-Approximating Edit Distance via Indexing

We introduce fast-decodable indexing schemes for edit distance which can...
research
02/26/2020

Streaming with Oracle: New Streaming Algorithms for Edit Distance and LCS

The edit distance (ED) and longest common subsequence (LCS) are two fund...
research
02/26/2020

Asymmetric Streaming Algorithms for Edit Distance and LCS

The edit distance (ED) and longest common subsequence (LCS) are two fund...
research
11/10/2018

Efficiently Approximating Edit Distance Between Pseudorandom Strings

We present an algorithm for approximating the edit distance ed(x, y) bet...
research
01/17/2020

Duplication with transposition distance to the root for q-ary strings

We study the duplication with transposition distance between strings of ...
research
08/30/2020

Precise Expression for the Algorithmic Information Distance

We consider the notion of information distance between two objects x and...
research
09/01/2021

Algorithme de recherche approximative dans un dictionnaire fondé sur une distance d'édition définie par blocs

We propose an algorithm for approximative dictionary lookup, where alter...

Please sign up or login with your details

Forgot password? Click here to reset