Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fitba (0) - 314 freq fitbaw (1) - 209 freq fitna (1) - 40 freq fitbaa (1) - 10 freq fitba' (1) - 12 freq 'fitba (1) - 1 freq yitba (1) - 1 freq fitbas (1) - 1 freq futba (1) - 1 freq fita (1) - 1 freq fitbit (2) - 2 freq fitba's (2) - 2 freq citbo (2) - 1 freq firra (2) - 1 freq filla (2) - 1 freq fite (2) - 198 freq fitbaws (2) - 6 freq fitly (2) - 1 freq fit'ba' (2) - 1 freq simba (2) - 1 freq nitb (2) - 1 freq fibf (2) - 1 freq fiona (2) - 42 freq fit'n (2) - 1 freq footba (2) - 2 freq |
fitba (0) - 314 freq fitbaa (1) - 10 freq futba (1) - 1 freq fuitbaa (2) - 1 freq footba (2) - 2 freq fitbas (2) - 1 freq fita (2) - 1 freq fitba' (2) - 12 freq fitna (2) - 40 freq fitbaw (2) - 209 freq 'fitba (2) - 1 freq yitba (2) - 1 freq fitty (3) - 3 freq fib (3) - 3 freq fit' (3) - 2 freq i'fitba (3) - 4 freq fitfaa (3) - 1 freq fiter (3) - 1 freq fibo (3) - 1 freq fotbaw (3) - 1 freq fiteha (3) - 1 freq fited (3) - 1 freq fitt (3) - 41 freq firby (3) - 1 freq aitbo (3) - 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 |
FITBA |
Time to execute Levenshtein function - 0.170042 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.324641 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.027749 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.036406 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.000802 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. |