| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| footed (0) - 1 freq fooled (1) - 7 freq dooted (1) - 4 freq rooted (1) - 12 freq foofed (1) - 1 freq booted (1) - 6 freq footer (1) - 14 freq ooted (1) - 1 freq cooled (2) - 4 freq fauted (2) - 1 freq yoosed (2) - 1 freq fitted (2) - 27 freq rotted (2) - 1 freq flooded (2) - 8 freq roosted (2) - 2 freq fooste (2) - 1 freq foyed (2) - 1 freq sooked (2) - 23 freq shooted (2) - 1 freq voted (2) - 39 freq fixted (2) - 1 freq looten (2) - 1 freq fostex (2) - 1 freq footy (2) - 3 freq hootel (2) - 3 freq |
footed (0) - 1 freq ooted (2) - 1 freq fauted (2) - 1 freq fited (2) - 1 freq fated (2) - 1 freq footer (2) - 14 freq dooted (2) - 4 freq fooled (2) - 7 freq booted (2) - 6 freq rooted (2) - 12 freq foofed (2) - 1 freq doted (3) - 1 freq fetid (3) - 3 freq footan (3) - 1 freq footered (3) - 5 freq foot (3) - 74 freq noted (3) - 23 freq footin (3) - 1 freq fisted (3) - 1 freq routed (3) - 2 freq opted (3) - 5 freq fouter (3) - 6 freq outed (3) - 2 freq foxed (3) - 2 freq footh (3) - 4 freq |
SoundEx code - F330 fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq f-teeth - 1 freq fited - 1 freq fittet - 3 freq feedeth - 1 freq fit-hadd - 1 freq feddit - 1 freq fedit - 1 freq footed - 1 freq fated - 1 freq fithaud - 3 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq |
MetaPhone code - FTT fadit - 10 freq faded - 16 freq fauted - 1 freq fittit - 26 freq fetid - 3 freq fitted - 27 freq fiytit - 1 freq votit - 42 freq fited - 1 freq voted - 39 freq fittet - 3 freq votet - 1 freq feddit - 1 freq fedit - 1 freq photied - 1 freq footed - 1 freq fated - 1 freq vottit - 1 freq feedit - 1 freq fautit - 3 freq fittid - 1 freq fettit - 1 freq fittaedee - 1 freq vetoed - 1 freq vdett - 1 freq ftd - 1 freq |
FOOTED |
| Time to execute Levenshtein function - 0.176730 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.343090 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.030565 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.037892 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.000839 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. |