| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effin (0) - 14 freq eff-in (1) - 1 freq effie (1) - 11 freq affin (1) - 2 freq effi (1) - 1 freq elfin (1) - 5 freq geffin (1) - 1 freq offin (1) - 20 freq eftir (2) - 499 freq eldin (2) - 3 freq eenin (2) - 5 freq efi (2) - 1 freq fin (2) - 1547 freq puffin (2) - 33 freq muffin (2) - 16 freq soffin (2) - 1 freq coffin (2) - 65 freq laffin (2) - 7 freq effies (2) - 1 freq ebbin (2) - 3 freq edwin (2) - 29 freq eggin (2) - 5 freq leafin (2) - 3 freq eekin (2) - 1 freq fein (2) - 3 freq |
effin (0) - 14 freq offin (1) - 20 freq affin (1) - 2 freq iffen (2) - 4 freq affen (2) - 118 freq geffin (2) - 1 freq offen (2) - 17 freq effie (2) - 11 freq elfin (2) - 5 freq effi (2) - 1 freq eff-in (2) - 1 freq waffin (3) - 18 freq fyin (3) - 1 freq doffin (3) - 2 freq ffi (3) - 1 freq siffin (3) - 1 freq offing (3) - 1 freq offcn (3) - 1 freq fuffin (3) - 2 freq f-in (3) - 1 freq baffin (3) - 1 freq affix (3) - 1 freq eff (3) - 13 freq effek (3) - 4 freq effair (3) - 1 freq |
SoundEx code - E150 even - 2579 freq eyven - 8 freq ehappin - 1 freq ebony - 1 freq 'even - 6 freq effin - 14 freq evn - 1 freq ebbin - 3 freq evin - 64 freq eyvnoo - 7 freq eff-in - 1 freq ebban - 1 freq evein - 3 freq ev'n - 1 freq eevin - 5 freq evan - 12 freq epona - 1 freq €˜even - 2 freq €œeven - 3 freq ebvn - 1 freq |
MetaPhone code - EFN even - 2579 freq eyven - 8 freq 'even - 6 freq effin - 14 freq evn - 1 freq evin - 64 freq eyvnoo - 7 freq eff-in - 1 freq evein - 3 freq ev'n - 1 freq eevin - 5 freq evan - 12 freq €˜even - 2 freq €œeven - 3 freq eoghan - 1 freq |
EFFIN |
| Time to execute Levenshtein function - 0.176032 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.349699 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.027692 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.036461 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.000791 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. |