Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
twisted (0) - 24 freq twister (1) - 2 freq twistet (1) - 3 freq twise (2) - 11 freq swished (2) - 2 freq existed (2) - 6 freq twittee (2) - 1 freq twiter (2) - 1 freq triste (2) - 1 freq winted (2) - 41 freq twiced (2) - 13 freq wasted (2) - 24 freq twigged (2) - 3 freq tested (2) - 21 freq taisled (2) - 1 freq laisted (2) - 3 freq taised (2) - 1 freq misted (2) - 2 freq tised (2) - 1 freq fisted (2) - 1 freq tweated (2) - 1 freq wissed (2) - 13 freq bristed (2) - 3 freq twined (2) - 11 freq wished (2) - 61 freq |
twisted (0) - 24 freq twistet (2) - 3 freq twister (2) - 2 freq twuster (3) - 4 freq tasted (3) - 20 freq twisty (3) - 2 freq tweated (3) - 1 freq trusted (3) - 18 freq toasted (3) - 3 freq tested (3) - 21 freq twistin (3) - 14 freq wasted (3) - 24 freq trysted (3) - 4 freq twists (3) - 10 freq twist (3) - 48 freq waisted (3) - 1 freq twistit (3) - 38 freq tweeted (3) - 8 freq wised (4) - 1 freq foisted (4) - 1 freq tinted (4) - 2 freq taistet (4) - 1 freq twirled (4) - 2 freq €œtwisted (4) - 1 freq tilted (4) - 5 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 |
TWISTED |
Time to execute Levenshtein function - 0.312115 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.610440 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.027531 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.068369 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.000924 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. |