| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| jaffilt (0) - 1 freq baffelt (2) - 1 freq oaffirt (2) - 2 freq haffit (2) - 1 freq affil (2) - 7 freq waffit (2) - 2 freq baffle (3) - 2 freq jiggilt (3) - 1 freq haffet (3) - 5 freq wauffit (3) - 1 freq saufit (3) - 1 freq wafft (3) - 5 freq oaffish (3) - 1 freq raffie (3) - 1 freq jaffa (3) - 5 freq daffies (3) - 4 freq affie (3) - 6 freq affin (3) - 2 freq railt (3) - 1 freq jaskit (3) - 1 freq waffle (3) - 8 freq fuffily (3) - 1 freq affset (3) - 2 freq sailt (3) - 2 freq afflict (3) - 2 freq |
jaffilt (0) - 1 freq baffelt (3) - 1 freq waffit (4) - 2 freq affil (4) - 7 freq oaffirt (4) - 2 freq haffit (4) - 1 freq affect (5) - 10 freq jeffsto (5) - 1 freq raffle (5) - 13 freq fuffily (5) - 1 freq huffily (5) - 3 freq affset (5) - 2 freq jufflin (5) - 1 freq dafft (5) - 2 freq filt (5) - 8 freq effirt (5) - 3 freq waffle (5) - 8 freq afft (5) - 1 freq affest (5) - 1 freq baffel (5) - 1 freq afflict (5) - 2 freq wafft (5) - 5 freq jangelt (5) - 1 freq jaffa (5) - 5 freq wauffit (5) - 1 freq |
SoundEx code - J143 jibbled - 1 freq jaffilt - 1 freq |
MetaPhone code - JFLT jaffilt - 1 freq |
JAFFILT |
| Time to execute Levenshtein function - 0.345653 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.534116 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.033451 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.047367 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.000910 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. |