is there possiblity how to include levenshtein distance in regular expression query?
Except making union between permutations. Like searching "hello" with L.d. 1
.ello | h.llo | he.lo | hel.o | hell.
this is a lot stupid and un-usable for larger numbers of L.d.
No comments:
Post a Comment