Re: [PATCH] add 'string-distance' to calculate Levenshtein distance

[Juri Linkov]

>> Attached is latest patch. It will use byte compare aglorithm if both
>> strings are not multi-byte strings.
>
> Thanks, let's give people a few days to comment.

I have no comments on this implementation, but I wonder if it's possible
to adapt this algorithm to implement fuzzy search with the distance?
This supposes there is a customizable option that defines a preferred
default distance, and then the search functions search text in the buffer
to find the strings similar to the search string.  I don't know if it
the same how is implemented for “Similarity search” in LibreOffice Writer.
But it seems this could find the same text as char-fold search matching
equivalent characters and ignoring diacritics or glyphless characters
like “word joiner”.