The current sort algorithm used to sort the tokenised strings is alphabetical sort. This has shortcomings such as when two similar words begin with different letters.
I propose the addition of Levenstein sort on the tokens themselves to improve the accuracy in such instances.
The current sort algorithm used to sort the tokenised strings is alphabetical sort. This has shortcomings such as when two similar words begin with different letters. I propose the addition of Levenstein sort on the tokens themselves to improve the accuracy in such instances.