| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| twirlin (0) - 5 freq twirling (1) - 1 freq twirlin' (1) - 1 freq tirlin (1) - 13 freq thirlin (1) - 7 freq swirlin (1) - 21 freq tillin (2) - 3 freq dirlin (2) - 45 freq stirlin (2) - 23 freq smirlin (2) - 1 freq wirkin (2) - 159 freq twistlin (2) - 1 freq trimlin (2) - 1 freq swirlan (2) - 2 freq twistin (2) - 14 freq trillin (2) - 1 freq toilin (2) - 2 freq swurlin (2) - 1 freq wirin (2) - 2 freq tairgin (2) - 1 freq skirlin (2) - 48 freq wirdin (2) - 2 freq tirin (2) - 4 freq teirin (2) - 6 freq twinnin (2) - 1 freq |
twirlin (0) - 5 freq twirling (2) - 1 freq swirlin (2) - 21 freq thirlin (2) - 7 freq tirlin (2) - 13 freq twirlin' (2) - 1 freq sworlin (3) - 1 freq swurlin (3) - 1 freq twirled (3) - 2 freq swirlan (3) - 2 freq tirlan (3) - 5 freq tweelin (3) - 2 freq twirl (3) - 5 freq twirls (3) - 1 freq thirlins (4) - 4 freq twiggin (4) - 1 freq tinlin (4) - 1 freq tirlis (4) - 1 freq twistin (4) - 14 freq twinkin (4) - 1 freq taiglin (4) - 3 freq twinin (4) - 6 freq swirling (4) - 2 freq hirlin (4) - 1 freq stirlin (4) - 23 freq |
SoundEx code - T645 trailin - 27 freq trilingual - 8 freq truelins - 4 freq thirlin-tae - 1 freq trailing - 6 freq tirlin - 13 freq twirlin' - 1 freq trailen - 1 freq tirlan - 5 freq traalin - 1 freq thairlane - 4 freq treelined - 1 freq thirlins - 4 freq thirlin - 7 freq trewlins - 3 freq twirlin - 5 freq trellan - 2 freq trawlin - 12 freq tri-lingual - 1 freq trillin - 1 freq tree-lined - 2 freq tarland - 4 freq tarlan - 4 freq trillions - 1 freq trilingualism - 1 freq trillion - 1 freq twirling - 1 freq trailin' - 1 freq trolling - 3 freq trollin - 1 freq thrilling - 1 freq therealmac - 1 freq |
MetaPhone code - TWRLN twirlin' - 1 freq twirlin - 5 freq |
TWIRLIN |
| Time to execute Levenshtein function - 0.250410 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.372190 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.027151 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.038480 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. |