debian-user wrote: >> You can use that: >> >> https://en.wikipedia.org/wiki/Levenshtein_distance > > Levenshtein distance isn't suited to the problem. > It compares the entirety of two strings. Emanuel is > interesting in comparing one string against substrings of > a potentially much larger string, or even substrings of the > first string in random order against portions of the > second string!
Yes, this is how I see it as well. But maybe I'm wrong and it can be included as part of some bigger algorithm, maybe? -- underground experts united https://dataswamp.org/~incal
