Re: Minimum levenshtein distance for a set of words

From: David C. Ullrich <ullrich@xxxxxxxxxxxxxxxx>
Date: Mon, 30 May 2005 08:17:50 -0500

On 30 May 2005 03:27:05 -0700, "weinzier" <l.weinzierl@xxxxxxxxx>
wrote:

>Is there a unique word which minimizes the levenshtein distance to any
>of the elements of a given set of words?

Clearly not. Consider the set {'ab', 'ac'}; there is more than
one word that gives this minimum.

>Where can i find an algorithm?
>
>Any hints on links and literature are welcome...

About five minutes ago I had no idea what the "levenshtein distance"
was. I tried

www.google.com

************************

David C. Ullrich
.

Follow-Ups:
- Re: Minimum levenshtein distance for a set of words
  - From: weinzier

References:
- Minimum levenshtein distance for a set of words
  - From: weinzier

Prev by Date: Re: Trisecting An Angle
Next by Date: Re: Help with basic vector question
Previous by thread: Minimum levenshtein distance for a set of words
Next by thread: Re: Minimum levenshtein distance for a set of words
Index(es):
- Date
- Thread