| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twustit (0) - 1 freq trustit (1) - 16 freq twistit (1) - 38 freq twustin (1) - 3 freq trustin (2) - 6 freq trystit (2) - 23 freq brustit (2) - 2 freq tauntit (2) - 2 freq rustit (2) - 3 freq tweetit (2) - 2 freq toastit (2) - 5 freq foustit (2) - 1 freq dustit (2) - 5 freq wastit (2) - 21 freq tousit (2) - 1 freq taistit (2) - 1 freq bustit (2) - 2 freq roustit (2) - 5 freq twuntie (2) - 8 freq testit (2) - 10 freq twistet (2) - 3 freq twistin (2) - 14 freq twuster (2) - 4 freq tastit (2) - 29 freq twynit (3) - 2 freq |
twustit (0) - 1 freq twistit (1) - 38 freq twistet (2) - 3 freq twustin (2) - 3 freq trustit (2) - 16 freq testit (3) - 10 freq taistit (3) - 1 freq tastit (3) - 29 freq wastit (3) - 21 freq twuster (3) - 4 freq twistin (3) - 14 freq twisitt (3) - 1 freq toastit (3) - 5 freq tweetit (3) - 2 freq trystit (3) - 23 freq traistit (4) - 2 freq tweistin (4) - 1 freq rowstit (4) - 3 freq tistet (4) - 2 freq twist (4) - 48 freq twentiet (4) - 3 freq attestit (4) - 6 freq twatt (4) - 7 freq twintiet (4) - 4 freq tastet (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 - 38 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 - TWSTT twisted - 24 freq twistit - 38 freq twustit - 1 freq twistet - 3 freq €œtwisted - 1 freq |
TWUSTIT |
| Time to execute Levenshtein function - 0.454884 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.813411 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.084966 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.095203 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.000931 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. |