| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| effete (0) - 4 freq effeks (2) - 1 freq effeir (2) - 1 freq effek (2) - 4 freq effeck (2) - 36 freq fete (2) - 1 freq refete (2) - 1 freq effects (2) - 23 freq effect (2) - 94 freq effie (2) - 11 freq effert (2) - 1 freq affere (2) - 1 freq offece (2) - 1 freq effel (2) - 1 freq eeeze (3) - 1 freq haffets (3) - 6 freq espece (3) - 1 freq lvfeze (3) - 1 freq fute (3) - 1 freq mete (3) - 4 freq endeth (3) - 1 freq offers (3) - 67 freq eet (3) - 581 freq fiet (3) - 2 freq repete (3) - 1 freq |
effete (0) - 4 freq effel (3) - 1 freq affere (3) - 1 freq effert (3) - 1 freq afft (3) - 1 freq offt (3) - 1 freq fifety (3) - 1 freq fft (3) - 1 freq effie (3) - 11 freq offece (3) - 1 freq effek (3) - 4 freq effect (3) - 94 freq refete (3) - 1 freq fete (3) - 1 freq ufft (3) - 1 freq effeir (3) - 1 freq affeome (4) - 1 freq flyte (4) - 17 freq effray (4) - 1 freq effair (4) - 1 freq fret (4) - 18 freq afte (4) - 1 freq fiftie (4) - 12 freq fuftie (4) - 4 freq fite (4) - 199 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 - 69 freq eaught - 1 freq evyte - 2 freq evade - 2 freq eft - 3 freq eeight - 1 freq eighty - 13 freq effete - 4 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.202096 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.414695 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.027138 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.076360 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.001328 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. |