In article
<····································@79g2000hsk.googlegroups.com>,
Francogrex <······@grex.org> wrote:
> Hello, I have a question about matching strings.
> Suppose I have the following strings:
> "tets"
> "estt"
> "rtes7"
> "gstes"
> "tes5t"
> Is there a straightforward and simple Lisp procedure to determine how
> related each string is to the reference string "test", for example to
> say that "tets" is similar to "test" with a probability of 0.9 or
> something of that sort? Thanks
There's nothing built into Lisp for this. Google for "edit distance".
--
Barry Margolin, ······@alum.mit.edu
Arlington, MA
*** PLEASE post questions in newsgroups, not directly to me ***
*** PLEASE don't copy me on replies, I'll read them in the group ***
Barry Margolin <······@alum.mit.edu> writes:
> There's nothing built into Lisp for this. Google for "edit distance".
"Levenshtein distance" is also a good search term. If you tack "lisp"
onto it, several promising links show up on the first page of google.
...Peder...
--
I wish a new life awaited _me_ in some off-world colony.
In article <··············@beto.netfonds.no>,
·····@news.klingenberg.no (Peder O. Klingenberg) wrote:
> Barry Margolin <······@alum.mit.edu> writes:
>
> > There's nothing built into Lisp for this. Google for "edit distance".
>
> "Levenshtein distance" is also a good search term. If you tack "lisp"
> onto it, several promising links show up on the first page of google.
Since the very first page that Google finds is the Wikipedia article on
Levenshtein distance, I decided to stick with the term that's easier to
spell and remember in my post.
--
Barry Margolin, ······@alum.mit.edu
Arlington, MA
*** PLEASE post questions in newsgroups, not directly to me ***
*** PLEASE don't copy me on replies, I'll read them in the group ***