You may also find it useful to look at DP-like algorithms in the
speech recognition area (alignment of phonetic sequences with phonetic
dictionary entries) as well as the bionformatics area (especially if
you need to apply efficient searching for common subsequences).
Best,
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
George Demetriou
Dept. of Computer Science Room: 219
The University of Sheffield Tel: +44 (0) 114 2221894
Regent Court FAX: +44 (0) 114 2221810
211 Portobello Street e-mail: demetri@dcs.shef.ac.uk
Sheffield, S1 4DP, UK
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
----------------------------------------------------------------
>Hello, corpora list-
> Can anyone point me to relatively recent work (roughly
>the last five years) on fast methods of computing edit distance?
>I'm interested in algorithms that compare pairs of individual words
>(not algorithms that search long text strings for approximate matches
>of words). Opinions on fastest methods welcome also. I'll post a
>summary of responses to the list. Thanks-
>
>Mark
>
>-------------------------
>Dr. Mark Lewellen
>L&H-AppTek
>mlewellen@apptek.com
>