| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| foyydbw (0) - 1 freq foredaw (3) - 2 freq foyed (3) - 1 freq foy (4) - 35 freq iiiydaw (4) - 1 freq forby (4) - 491 freq torydon (4) - 1 freq fob (4) - 4 freq ozatbw (4) - 1 freq hoyed (4) - 8 freq foxed (4) - 2 freq fonds (4) - 1 freq voyd (4) - 2 freq founded (4) - 3 freq day-daw (4) - 1 freq fondly (4) - 8 freq foondin (4) - 13 freq foond (4) - 140 freq footba (4) - 2 freq yxdb (4) - 1 freq fow (4) - 2 freq floyd (4) - 3 freq boyd (4) - 13 freq fordel (4) - 7 freq feydom (4) - 2 freq |
foyydbw (0) - 1 freq fotbaw (5) - 1 freq fdb (5) - 1 freq fitabw (5) - 1 freq foyed (5) - 1 freq foredaw (5) - 2 freq foods (6) - 6 freq foreby (6) - 2 freq fogsw (6) - 1 freq foresaw (6) - 1 freq fobs (6) - 1 freq foudre (6) - 1 freq fyew (6) - 8 freq sydb (6) - 1 freq rzyebw (6) - 1 freq wodw (6) - 1 freq ifbw (6) - 1 freq goodby (6) - 1 freq flyb (6) - 1 freq fodder (6) - 9 freq cydbd (6) - 1 freq food (6) - 208 freq fyow (6) - 50 freq foody (6) - 2 freq aydbr (6) - 1 freq |
SoundEx code - F310 fitbaw - 209 freq fed-up - 6 freq fitba - 314 freq fatefu' - 1 freq fatefu - 5 freq faithfu - 22 freq fitba' - 12 freq fuitfaw - 1 freq fitbaa - 10 freq fitabw - 1 freq futba - 1 freq fit've - 1 freq footba - 2 freq fit-faw - 1 freq fit'v - 1 freq fitfaa - 1 freq fuitbaa - 1 freq fuit-boy - 1 freq feed-hoop - 1 freq fptp - 7 freq fethfu - 1 freq €œfitba - 1 freq 'fitba - 1 freq foyydbw - 1 freq fdb - 1 freq fit'ba' - 1 freq fitbaÂ’ - 10 freq fdyiueavee - 1 freq fotbaw - 1 freq |
MetaPhone code - FTB fitbaw - 209 freq fitba - 314 freq fitba' - 12 freq fitbaa - 10 freq fitabw - 1 freq futba - 1 freq footba - 2 freq fuitbaa - 1 freq fuit-boy - 1 freq €œfitba - 1 freq vdb - 3 freq 'fitba - 1 freq foyydbw - 1 freq fdb - 1 freq fit'ba' - 1 freq fitbaÂ’ - 10 freq fotbaw - 1 freq |
FOYYDBW |
| Time to execute Levenshtein function - 0.245074 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.541352 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.029126 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.043163 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.000881 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. |