Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
fitbrig (0) - 1 freq fitbit (2) - 2 freq i'brig (2) - 1 freq trig (3) - 41 freq fierie (3) - 2 freq firing (3) - 3 freq finerie (3) - 2 freq fittie (3) - 131 freq futtrit (3) - 1 freq fitching (3) - 1 freq fitbaa (3) - 10 freq fittid (3) - 1 freq fitivir (3) - 2 freq fitba' (3) - 12 freq citric (3) - 2 freq fit'r (3) - 5 freq fitbans (3) - 1 freq firin (3) - 29 freq pitril (3) - 7 freq vibrio (3) - 1 freq fitzroy (3) - 1 freq fit're (3) - 2 freq firg (3) - 1 freq fitba (3) - 315 freq firrit (3) - 1 freq |
fitbrig (0) - 1 freq coatbrig (4) - 1 freq i'brig (4) - 1 freq fitbit (4) - 2 freq fabric (5) - 19 freq fitting (5) - 9 freq fitbaws (5) - 6 freq fitba (5) - 315 freq firg (5) - 1 freq fitbaÂ’ (5) - 10 freq fitbaw (5) - 217 freq kitbag (5) - 2 freq footbridge (5) - 1 freq fittret (5) - 1 freq fibre (5) - 8 freq fibres (5) - 2 freq brig (5) - 266 freq fitbas (5) - 1 freq fit're (5) - 2 freq fiter (5) - 1 freq fitba's (5) - 2 freq fitivir (5) - 2 freq fitzroy (5) - 1 freq fitbaa (5) - 10 freq futtrit (5) - 1 freq |
SoundEx code - F316 fitprints - 8 freq fitivver - 31 freq fitever - 14 freq faut-free - 2 freq fitiver - 66 freq fit-ivver's - 1 freq 'fitivver - 1 freq fitprents - 1 freq fuitprents - 1 freq fittiver - 4 freq fitbrig - 1 freq footprints - 6 freq fitprent - 1 freq futprints - 1 freq €˜fativer - 1 freq fativer - 1 freq fuitprints - 1 freq fitiver's - 1 freq fitivir - 2 freq footbridge - 1 freq fit-for-fit - 1 freq fittivir - 1 freq fittiebar - 10 freq fittiebariscalling - 1 freq fittiebarchunty - 1 freq fedupboredstiff - 10 freq |
MetaPhone code - FTBRK fitbrig - 1 freq |
FITBRIG |
Time to execute Levenshtein function - 0.233785 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.376751 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.030839 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.037046 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.000882 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. |