| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twitchin (0) - 9 freq witchin (1) - 2 freq twitchan (1) - 2 freq titchin (1) - 2 freq switchin (1) - 9 freq swithin (2) - 1 freq hitchin (2) - 1 freq bitchin (2) - 2 freq switching (2) - 5 freq within (2) - 185 freq twitch (2) - 12 freq switchin' (2) - 1 freq thatchin (2) - 2 freq twitches (2) - 2 freq winchin (2) - 15 freq bewitchin (2) - 1 freq twitched (2) - 7 freq sitchin (2) - 1 freq stitchin (2) - 1 freq witchie (2) - 3 freq pitchin (2) - 2 freq mitchin (2) - 2 freq twitchy (2) - 2 freq taichin (2) - 11 freq tichin (2) - 1 freq |
twitchin (0) - 9 freq twitchan (1) - 2 freq titchin (2) - 2 freq switchin (2) - 9 freq witchin (2) - 2 freq thatchin (3) - 2 freq twitches (3) - 2 freq watchin (3) - 386 freq bewitchin (3) - 1 freq twitch (3) - 12 freq swutchin (3) - 1 freq twitchy (3) - 2 freq twitched (3) - 7 freq swatchin (3) - 1 freq tichin (4) - 1 freq stritchin (4) - 1 freq watchn (4) - 1 freq waatchin (4) - 24 freq rewatchin (4) - 2 freq watchen (4) - 7 freq watchan (4) - 20 freq taichin (4) - 11 freq itchin (4) - 11 freq kitchin (4) - 2 freq bitchin (4) - 2 freq |
SoundEx code - T325 twitchin - 9 freq thatchin - 2 freq twa-thoosan'd - 1 freq twitchan - 2 freq titchin - 2 freq tattie-howkin - 4 freq tuithsome - 1 freq tedisome - 1 freq tattie-scones - 1 freq titchmarsh - 1 freq tudqnoqneq - 1 freq |
MetaPhone code - TWXN twitchin - 9 freq twitchan - 2 freq |
TWITCHIN |
| Time to execute Levenshtein function - 0.195484 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.361568 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.027592 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.037839 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.000818 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. |