| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| fitbaw (0) - 217 freq fitba (1) - 315 freq fitbaws (1) - 6 freq fitba' (1) - 12 freq fitbaa (1) - 10 freq fitbas (1) - 1 freq firbaw (1) - 1 freq fotbaw (1) - 1 freq fit-faw (2) - 1 freq fita (2) - 1 freq fitfaa (2) - 1 freq fitabw (2) - 1 freq fitna (2) - 40 freq fuitfaw (2) - 1 freq fitba's (2) - 2 freq fitbans (2) - 1 freq futba (2) - 1 freq fatbaws (2) - 1 freq fuitbaa (2) - 1 freq fitbit (2) - 2 freq 'fitba (2) - 1 freq yitba (2) - 1 freq futbal (2) - 1 freq kitbag (2) - 2 freq fitbaÂ’ (2) - 10 freq |
fitbaw (0) - 217 freq fotbaw (1) - 1 freq fitabw (2) - 1 freq fitbas (2) - 1 freq firbaw (2) - 1 freq fitbaws (2) - 6 freq fitbaa (2) - 10 freq fitba' (2) - 12 freq fitba (2) - 315 freq fitbit (3) - 2 freq fatbaws (3) - 1 freq fuitfaw (3) - 1 freq futba (3) - 1 freq netbaw (3) - 1 freq fuitbaa (3) - 1 freq futbal (3) - 1 freq meatbaw (4) - 4 freq fitman (4) - 22 freq futbol (4) - 2 freq fitwye (4) - 1 freq ifbw (4) - 1 freq footba (4) - 2 freq fittan (4) - 1 freq footbal (4) - 1 freq tbw (4) - 1 freq |
SoundEx code - F310 fitbaw - 217 freq fed-up - 6 freq fitba - 315 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 - 217 freq fitba - 315 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 |
FITBAW |
| Time to execute Levenshtein function - 0.177518 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.355912 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.030916 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.039028 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.000855 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. |