| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| knurlie (0) - 1 freq knurlied (1) - 1 freq knurlt (2) - 1 freq anerlie (2) - 68 freq gurlie (2) - 11 freq snorlie (2) - 1 freq haurlie (2) - 4 freq knurly (2) - 1 freq hurlie (2) - 1 freq gnurlit (2) - 3 freq knurl (2) - 2 freq nursie (2) - 4 freq jaurie (3) - 1 freq purlies (3) - 1 freq wullie (3) - 422 freq nudie (3) - 2 freq spirlie (3) - 7 freq aurrie (3) - 1 freq fullie (3) - 3 freq knarled (3) - 1 freq frumlie (3) - 3 freq purdie (3) - 16 freq swurlin (3) - 1 freq gumlie (3) - 4 freq narrie (3) - 1 freq |
knurlie (0) - 1 freq knurly (2) - 1 freq knurl (2) - 2 freq knurlied (2) - 1 freq knurlt (3) - 1 freq anerlie (3) - 68 freq snorlie (3) - 1 freq kinelie (4) - 1 freq unrulie (4) - 1 freq knarled (4) - 1 freq unnerlie (4) - 1 freq innerlie (4) - 7 freq ainerlie (4) - 2 freq kynlie (4) - 3 freq lanerlie (4) - 2 freq haurlie (4) - 4 freq gurlie (4) - 11 freq hurlie (4) - 1 freq gnurlit (4) - 3 freq nursie (4) - 4 freq kyndlie (4) - 4 freq kindlie (4) - 3 freq newlie (5) - 1 freq kneelin (5) - 19 freq truelie (5) - 2 freq |
SoundEx code - K564 knurl - 2 freq knarled - 1 freq knar-holes - 2 freq knurlt - 1 freq knurlie - 1 freq knurly - 1 freq knurlied - 1 freq |
MetaPhone code - NRL nearly - 289 freq 'nearly' - 1 freq knurl - 2 freq narrowly - 1 freq near-low - 1 freq 'nearly - 1 freq knurlie - 1 freq nirl - 1 freq knurly - 1 freq narraly - 1 freq nairly - 1 freq nrl - 1 freq neerly - 1 freq |
KNURLIE |
| Time to execute Levenshtein function - 0.286363 milliseconds The Levenshtein distance is the number of characters you have to replace, insert or delete to transform one word into another, its useful for detecting typos and alternative spellings |
Time to execute Double Levenshtein function - 0.796544 milliseconds In a stroke of genius, this runs the Levenshtein function twice, once without vowels and adds the distance together, giving double weight to consonants. |
Time to execute SoundEx function - 0.073536 milliseconds Soundex is a phonetic algorithm for indexing names by sound, as pronounced in English. The goal is for homophones to be encoded to the same representation so that they can be matched despite minor differences in spelling. |
Time to execute MetaPhone function - 0.087035 milliseconds Metaphone is a phonetic algorithm, published by Lawrence Philips in 1990, for indexing words by their English pronunciation.[1] It fundamentally improves on the Soundex algorithm by using information about variations and inconsistencies in English spelling and pronunciation to produce a more accurate encoding, which does a better job of matching words and names which sound similar. |
Time to execute Manually curated function - 0.001082 milliseconds Manual Curation uses a lookup table / lexicon which has been created by hand which links words to their lemmas, and includes obvious typos and spelling variations. Not all words are covered. |