| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effete (0) - 4 freq affere (2) - 1 freq fete (2) - 1 freq effects (2) - 23 freq refete (2) - 1 freq effek (2) - 4 freq effeks (2) - 1 freq effeir (2) - 1 freq effie (2) - 11 freq effert (2) - 1 freq effect (2) - 94 freq offece (2) - 1 freq effeck (2) - 36 freq offered (3) - 47 freq affae (3) - 3 freq caffee (3) - 2 freq offie (3) - 2 freq offees (3) - 1 freq eugene (3) - 1 freq equate (3) - 5 freq excite (3) - 2 freq effective (3) - 36 freq endite (3) - 1 freq refeese (3) - 1 freq eee (3) - 3 freq |
effete (0) - 4 freq effect (3) - 94 freq effert (3) - 1 freq offece (3) - 1 freq offt (3) - 1 freq fft (3) - 1 freq fifety (3) - 1 freq effie (3) - 11 freq fete (3) - 1 freq affere (3) - 1 freq effeir (3) - 1 freq afft (3) - 1 freq refete (3) - 1 freq effek (3) - 4 freq fyftie (4) - 1 freq eft (4) - 3 freq affest (4) - 1 freq buffet (4) - 11 freq flute (4) - 8 freq effin (4) - 14 freq fite (4) - 198 freq iffen (4) - 4 freq afte (4) - 1 freq forte (4) - 5 freq flet (4) - 30 freq |
SoundEx code - E130 evyte - 2 freq evade - 2 freq e-boat - 2 freq eft - 3 freq ebbit - 1 freq effete - 4 freq ev'dy - 1 freq evite - 12 freq eveit - 3 freq evdy - 7 freq ept - 1 freq ebbhid - 1 freq efty' - 1 freq epty - 1 freq |
MetaPhone code - EFT eight - 66 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq effete - 4 freq eighty - 12 freq ev'dy - 1 freq eyght - 4 freq evite - 12 freq eveit - 3 freq evdy - 7 freq €œeight - 1 freq €˜eighty - 1 freq efty' - 1 freq |
EFFETE |
| Time to execute Levenshtein function - 0.191339 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.323227 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.033937 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.048537 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.000985 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. |