Edit distance

About: Edit distance is a research topic. Over the lifetime, 2887 publications have been published within this topic receiving 71491 citations.

Phonetic distance calculation method for similarity comparison between phonetic transcriptions of foreign words

Abstract: A phonetic distance calculation method for similarity comparison between phonetic transcriptions of foreign words. A system manager defines character element transformation patterns occurrable between phonetic transcriptions derived from the same foreign language. A system generates new phonetic transcriptions according to the defined character element transformation patterns and assigns a demerit mark to each of the generated phonetic transcriptions according to a phonetic distance. A minimum phonetic distance between each of the generated phonetic transcriptions and a given phonetic transcription is calculated on the basis of a minimum edit distance calculation method. Any one of the generated phonetic transcriptions with a smallest one of the calculated minimum phonetic distances is determined to be most similar to the given phonetic transcription. Therefore, a document retrieval operation can accurately be performed in a document retrieval system and a document retrieval time can be reduced therein, resulting in a significant improvement in the performance of the document retrieval system.

Fifty years of spellchecking

Abstract: A short history of spellchecking from the late 1950s to the present day, describing its development through dictionary lookup, affix stripping, correction, confusion sets, and edit distance to the use of gigantic databases.

Visual analytics of delays and interaction in movement data

Abstract: The analysis of interaction between movement trajectories is of interest for various domains when movement of multiple objects is concerned. Interaction often includes a delayed response, making it difficult to detect interaction with current methods that compare movement at specific time intervals. We propose analyses and visualizations, on a local and global scale, of delayed movement responses, where an action is followed by a reaction over time, on trajectories recorded simultaneously. We developed a novel approach to compute the global delay in subquadratic time using a fast Fourier transform FFT. Central to our local analysis of delays is the computation of a matching between the trajectories in a so-called delay space. It encodes the similarities between all pairs of points of the trajectories. In the visualization, the edges of the matching are bundled into patches, such that shape and color of a patch help to encode changes in an interaction pattern. To evaluate our approach experimentally, we have implemented it as a prototype visual analytics tool and have applied the tool on three bidimensional data sets. For this we used various measures to compute the delay space, including the directional distance, a new similarity measure, which captures more complex interactions by combining directional and spatial characteristics. We compare matchings of various methods computing similarity between trajectories. We also compare various procedures to compute the matching in the delay space, specifically the Frechet distance, dynamic time warping DTW, and edit distance ED. Finally, we demonstrate how to validate the consistency of pairwise matchings by computing matchings between more than two trajectories.

An accurate estimation of the Levenshtein distance using metric trees and Manhattan distance

Abstract: This paper presents an original clone detection technique which is an accurate approximation of the Levenshtein distance. It uses groups of tokens extracted from source code called windowed-tokens. From these, frequency vectors are then constructed and compared with the Manhattan distance in a metric tree. The goal of this new technique is to provide a very high precision clone detection technique while keeping a high recall. Precision and recall measurement is done with respect to the Levenshtein distance. The testbench is a large scale open source software. The collected results proved the technique to be fast, simple, and accurate. Finally, this article presents further research opportunities.

A Dynamic Edit Distance Table

Abstract: In this paper we consider the incremental/decremental version of the edit distance problem: given a solution to the edit distance between two strings A and B, find a solution to the edit distance between A and B′ where B = aB (incremental) or bB′ = B (decremental). As a solution for the edit distance between A and B, we define the difference representation of the D-table, which leads to a simple and intuitive algorithm for the incremental/decremental edit distance problem.