PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

A Discriminative Model of Stochastic Edit Distance in the form of a Conditional Transducer
Marc Bernard, Jean-Christophe Janodet and Marc Sebban
In: 8th International Colloquium on Grammatical Inference (ICGI'06), 20-22 Sep 2006, Chofu, Tokyo, Japan.


Many real-world applications such as spell-checking or DNA analysis use the Levenshtein edit-distance to compute similarities between strings. In practice, the costs of the primitive edit operations (insertion, deletion and substitution of symbols) are generally hand-tuned. In this paper, we propose an algorithm to learn these costs. The underlying model is a probabilitic transducer, computed by using grammatical inference techniques, that allows us to learn both the structure and the probabilities of the model. Beyond the fact that the learned transducers are neither deterministic nor stochastic in the standard terminology, they are conditional, thus independant from the distributions of the input strings. Finally, we show through experiments that our method allows us to design cost functions that depend on the string context where the edit operations are used. In other words, we get kinds of context-sensitive edit distances.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:2170
Deposited By:Jean-Christophe Janodet
Deposited On:22 November 2006