Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tattiebogle (0) - 12 freq tattie-bogle (1) - 2 freq tattlebogle (1) - 1 freq tattie-boggle (2) - 1 freq tattie-bogils (3) - 1 freq tattie-bogle's (3) - 1 freq tattiebootie (3) - 1 freq tattie-bye (4) - 1 freq tattle-tale (4) - 1 freq tattiesoup (4) - 1 freq tattibye (4) - 1 freq tottiewie (5) - 1 freq taigle (5) - 10 freq tattie (5) - 158 freq tattiepark (5) - 1 freq tattle (5) - 3 freq tattie-based (5) - 1 freq taible (5) - 2 freq cattie-face (5) - 14 freq tatties-av (5) - 1 freq tarrible (5) - 7 freq alfieboe (5) - 1 freq tveriebodie (5) - 1 freq tatties (5) - 1 freq tattieshaws (5) - 1 freq |
tattiebogle (0) - 12 freq tattlebogle (2) - 1 freq tattie-bogle (2) - 2 freq tattie-boggle (4) - 1 freq tattiebootie (5) - 1 freq tattie-bogils (5) - 1 freq tattie-bogle's (6) - 1 freq tattibye (6) - 1 freq tattle (7) - 3 freq tattle-tale (7) - 1 freq tattiesoup (7) - 1 freq tattie-bye (7) - 1 freq taeble (8) - 3 freq tatterie (8) - 1 freq katiebella (8) - 6 freq tactile (8) - 1 freq tatties (8) - 195 freq tea-table (8) - 1 freq tatties (8) - 1 freq attainable (8) - 2 freq ktthegoalie (8) - 1 freq tatties' (8) - 1 freq tattie's (8) - 1 freq tangible (8) - 4 freq tattie-based (8) - 1 freq |
SoundEx code - T312 toothpick' - 1 freq toothpaste - 11 freq tattie-bogils - 1 freq tattie-bogle's - 1 freq toothpick - 1 freq tattie-bogle - 2 freq tattiebogle - 12 freq teethpaest - 2 freq tattie-boggle - 1 freq tuithpaste - 1 freq tattie-based - 1 freq tattie-pickin - 1 freq |
MetaPhone code - TTBKL tattie-bogle - 2 freq tattiebogle - 12 freq tattie-boggle - 1 freq |
TATTIEBOGLE |
Time to execute Levenshtein function - 0.231636 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.377292 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.027572 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.037585 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.000943 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. |