| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effecks (0) - 21 freq effeck (1) - 36 freq effects (1) - 23 freq affecks (1) - 6 freq effeks (1) - 1 freq reflecks (2) - 8 freq affeck (2) - 7 freq effect's (2) - 1 freq effeirs (2) - 13 freq expecks (2) - 3 freq fecks (2) - 3 freq flecks (2) - 3 freq effect (2) - 94 freq effek (2) - 4 freq affects (2) - 9 freq elbicks (3) - 1 freq heffers (3) - 1 freq fects (3) - 5 freq recks (3) - 20 freq affect (3) - 10 freq peffers (3) - 2 freq begecks (3) - 1 freq offess (3) - 1 freq frocks (3) - 16 freq focks (3) - 7 freq |
effecks (0) - 21 freq affecks (1) - 6 freq effeks (2) - 1 freq effeck (2) - 36 freq effects (2) - 23 freq affects (3) - 9 freq flecks (3) - 3 freq fecks (3) - 3 freq affeck (3) - 7 freq facks (4) - 15 freq afftaks (4) - 1 freq flicks (4) - 7 freq focks (4) - 7 freq offices (4) - 17 freq frocks (4) - 16 freq fucks (4) - 11 freq effek (4) - 4 freq effeirs (4) - 13 freq effect's (4) - 1 freq reflecks (4) - 8 freq effect (4) - 94 freq expecks (4) - 3 freq flocks (4) - 10 freq flechs (5) - 8 freq infects (5) - 1 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 - EFKS effecks - 21 freq evokes - 1 freq effeks - 1 freq evacuees - 1 freq |
EFFECKS |
| Time to execute Levenshtein function - 0.266606 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.369324 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.027380 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.037669 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.000830 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. |