Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
new-fillt (0) - 1 freq new-kilt (2) - 1 freq newmill (3) - 1 freq new-stellt (3) - 1 freq refill (4) - 3 freq new-fanglet (4) - 1 freq lea-field (4) - 1 freq neilly (4) - 12 freq newall (4) - 1 freq new-lined (4) - 1 freq refills (4) - 1 freq new-fangl't (4) - 1 freq neville (4) - 14 freq fufillt (4) - 1 freq nettrill (4) - 1 freq newsnight (4) - 2 freq new-fand (4) - 1 freq saw-mill (4) - 1 freq new-fund (4) - 1 freq fillt (4) - 52 freq new-bocht (4) - 2 freq ten-fit (4) - 1 freq new-fangit (4) - 1 freq awfill (4) - 1 freq new-fangelt (4) - 3 freq |
new-fillt (0) - 1 freq new-kilt (4) - 1 freq new-stellt (5) - 1 freq new-fangit (6) - 1 freq new-fangelt (6) - 3 freq wind-fillt (6) - 1 freq new-fanglet (6) - 1 freq newmill (6) - 1 freq awfill (7) - 1 freq new-bocht (7) - 2 freq fillt (7) - 52 freq new-fund (7) - 1 freq new-auld (7) - 2 freq new-bladit (7) - 1 freq saw-mill (7) - 1 freq newlot (7) - 5 freq new-faa (7) - 1 freq w-will (7) - 1 freq newall (7) - 1 freq new-fangl't (7) - 1 freq fufillt (7) - 1 freq new-fand (7) - 1 freq new-lined (7) - 1 freq new-farrant (8) - 4 freq feiillit (8) - 1 freq |
SoundEx code - N143 nibbled - 8 freq nibblt - 1 freq nobility - 12 freq new-bladit - 1 freq nibbelt - 2 freq nobilities - 1 freq novelty - 9 freq nobilitie - 1 freq nuffield - 3 freq €œnew-build - 1 freq new-fillt - 1 freq nflwd - 1 freq nafvhltkxv - 1 freq napulitano - 1 freq nibbledbyducks - 1 freq |
MetaPhone code - NFLT novelty - 9 freq nuffield - 3 freq new-fillt - 1 freq nflwd - 1 freq |
NEW-FILLT |
Time to execute Levenshtein function - 0.200319 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.365359 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.027694 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.037835 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.000933 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. |