| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| efuc (0) - 1 freq efc (1) - 1 freq sruc (2) - 1 freq uc (2) - 2 freq fc (2) - 54 freq eaux (2) - 2 freq fuk (2) - 2 freq dfc (2) - 2 freq erun (2) - 2 freq mfc (2) - 7 freq ebc (2) - 1 freq fue (2) - 1 freq epuf (2) - 1 freq eff (2) - 13 freq 'fur (2) - 8 freq tuc (2) - 1 freq bfu (2) - 1 freq effi (2) - 1 freq fu' (2) - 47 freq efh (2) - 1 freq fpc (2) - 3 freq emus (2) - 1 freq esdc (2) - 1 freq elc (2) - 5 freq efouy (2) - 1 freq |
efuc (0) - 1 freq efc (1) - 1 freq fic (2) - 1 freq afc (2) - 27 freq fc (2) - 54 freq ofc (2) - 1 freq fac (2) - 18 freq face (3) - 1711 freq eft (3) - 3 freq fub (3) - 2 freq ef (3) - 14 freq evoc (3) - 1 freq xuc (3) - 1 freq etc (3) - 191 freq enc (3) - 1 freq frc (3) - 1 freq fxc (3) - 1 freq efi (3) - 1 freq qfc (3) - 1 freq efj (3) - 1 freq muc (3) - 1 freq fux (3) - 1 freq fu (3) - 379 freq duc (3) - 2 freq ful (3) - 51 freq |
SoundEx code - E120 eves - 1 freq effeck - 36 freq epic - 20 freq evoke - 3 freq eevees - 1 freq effecks - 21 freq ebc - 1 freq ee-baws - 1 freq effie's - 1 freq ebbs - 5 freq effek - 4 freq eyebas - 1 freq effeks - 1 freq eaves - 2 freq evacuee - 1 freq ep's - 2 freq efuc - 1 freq evfejh - 1 freq ebbes - 1 freq evoc - 1 freq eifgw - 1 freq efj - 1 freq evz - 1 freq ebka - 1 freq eeweeehvoq - 1 freq ebswe - 1 freq epusgw - 1 freq eiwahhwyfx - 1 freq efc - 1 freq effies - 1 freq ebg - 1 freq evoygu - 1 freq |
MetaPhone code - EFK effeck - 36 freq evoke - 3 freq effek - 4 freq evacuee - 1 freq efuc - 1 freq evoc - 1 freq eifgw - 1 freq efc - 1 freq evoygu - 1 freq |
EFUC |
| Time to execute Levenshtein function - 0.299257 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.509401 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.029022 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.037640 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.000895 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. |