Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
texted (0) - 4 freq teeted (1) - 1 freq tented (1) - 1 freq tested (1) - 21 freq textur (2) - 1 freq rested (2) - 11 freq tekked (2) - 1 freq elted (2) - 1 freq tufted (2) - 1 freq reeted (2) - 4 freq sterted (2) - 238 freq trated (2) - 1 freq tinted (2) - 2 freq heated (2) - 9 freq leeted (2) - 1 freq tilted (2) - 5 freq lested (2) - 4 freq teemed (2) - 21 freq telled (2) - 2 freq vexed (2) - 47 freq tutted (2) - 3 freq exited (2) - 1 freq taxed (2) - 4 freq belted (2) - 14 freq teuked (2) - 1 freq |
texted (0) - 4 freq teeted (2) - 1 freq tested (2) - 21 freq tented (2) - 1 freq textin (3) - 8 freq texts (3) - 100 freq tasted (3) - 20 freq tutted (3) - 3 freq taxed (3) - 4 freq textured (3) - 2 freq toted (3) - 1 freq tilted (3) - 5 freq exited (3) - 1 freq tinted (3) - 2 freq text (3) - 168 freq fixted (3) - 1 freq textur (3) - 1 freq tufted (3) - 1 freq tweeted (3) - 8 freq tweated (3) - 1 freq trated (3) - 1 freq treated (3) - 42 freq texters (4) - 1 freq vested (4) - 2 freq text's (4) - 1 freq |
SoundEx code - T233 tastit - 29 freq tasted - 20 freq tested - 21 freq thochtit - 2 freq tousie-heidit - 2 freq twisted - 24 freq twistit-an-an - 1 freq tastit- - 1 freq twistit - 37 freq toastit - 5 freq testit - 10 freq tichtit - 1 freq taistet - 1 freq texted - 4 freq twustit - 1 freq tax-dodgers - 1 freq tistet - 2 freq taisted- - 1 freq twistet - 3 freq tastet - 1 freq taistit - 1 freq tasted- - 1 freq thocht-oot - 1 freq thick-heided - 1 freq €œtwisted - 1 freq toasted - 3 freq twisteddoodles - 1 freq |
MetaPhone code - TKSTT texted - 4 freq |
TEXTED |
Time to execute Levenshtein function - 0.206329 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.370094 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.028294 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.039659 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.000823 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. |