| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twilts (0) - 1 freq twits (1) - 1 freq twilt (1) - 2 freq twists (1) - 10 freq wilts (1) - 1 freq tilts (1) - 9 freq tuils (2) - 13 freq hilts (2) - 1 freq tilth (2) - 4 freq taills (2) - 2 freq taits (2) - 1 freq tints (2) - 3 freq wints (2) - 49 freq tails (2) - 54 freq wills (2) - 3 freq tail's (2) - 2 freq trists (2) - 1 freq wiles (2) - 11 freq thits (2) - 1 freq tits (2) - 33 freq milts (2) - 1 freq twist (2) - 48 freq twalth (2) - 1 freq twit (2) - 9 freq stilts (2) - 9 freq |
twilts (0) - 1 freq tilts (2) - 9 freq twists (2) - 10 freq wilts (2) - 1 freq twits (2) - 1 freq twilt (2) - 2 freq walts (3) - 1 freq twalth (3) - 1 freq toilets (3) - 32 freq tweets (3) - 56 freq twalt (3) - 2 freq twelth (3) - 1 freq welts (3) - 1 freq twats (3) - 2 freq twatts (3) - 1 freq twill (4) - 1 freq towts (4) - 5 freq swifts (4) - 4 freq tumults (4) - 1 freq tairts (4) - 5 freq towarts (4) - 5 freq twelves (4) - 1 freq twitty (4) - 1 freq wilt (4) - 3 freq wilds (4) - 7 freq |
SoundEx code - T432 toilets - 32 freq telt's - 4 freq twilts - 1 freq tilts - 9 freq twalt-centurie - 1 freq teletext - 1 freq tellitslantbook - 1 freq |
MetaPhone code - TWLTS twilts - 1 freq |
TWILTS |
| Time to execute Levenshtein function - 0.241817 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.364254 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.028906 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.037885 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.000975 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. |