Saltar al contenido principal

Sergio Luján Mora

Catedrático de Universidad

An Algorithm for Computing the Invariant Distance from Word Position

Sergio Luján-Mora
Technical report. June 2000. Available in
(TR-01-06) Informe interno / Internal report


There are many problems involving string matching. The string matching bases in a number of similarity or distance measures, and many of them are special cases or generalisations of the Levenshtein distance. In this paper, we focus on the problem of evaluating an invariant distance from word position between two strings: e.g., the strings "Universidad de Alicante" and "Alicante, Universidad de" refer to the same concept, so the distance ought to be low, in order to consider them as very similar strings.