| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thirldom (0) - 8 freq thirldad (2) - 3 freq whilom (3) - 1 freq thirsday (3) - 1 freq phildo (3) - 2 freq thirled (3) - 20 freq third (3) - 211 freq heirloom (3) - 1 freq thirls (3) - 5 freq thirlit (3) - 8 freq thirday (3) - 1 freq thirlin (3) - 7 freq thirlins (3) - 4 freq thirdly (3) - 1 freq bairndom (3) - 1 freq thirle (3) - 2 freq thirds (3) - 2 freq jarldom (3) - 1 freq thirl't (3) - 1 freq thirlt (3) - 36 freq thir'd (3) - 3 freq thirl (3) - 3 freq thill (4) - 1 freq irpdo (4) - 1 freq 'dildo (4) - 1 freq |
thirldom (0) - 8 freq thirldad (3) - 3 freq thirled (4) - 20 freq jarldom (5) - 1 freq thirle (5) - 2 freq thirdly (5) - 1 freq thirl't (5) - 1 freq thirlt (5) - 36 freq thirl (5) - 3 freq thirlins (5) - 4 freq thir'd (5) - 3 freq thirds (5) - 2 freq third (5) - 211 freq thirsday (5) - 1 freq thirlin (5) - 7 freq thirls (5) - 5 freq heirloom (5) - 1 freq thirday (5) - 1 freq thirlit (5) - 8 freq erldome (6) - 2 freq therd (6) - 2 freq thrid (6) - 20 freq harld (6) - 1 freq tirrandom (6) - 1 freq thrades (6) - 1 freq |
SoundEx code - T643 thirlt - 36 freq thirled - 20 freq trailed - 17 freq thirldom - 8 freq trolled - 1 freq trail't - 4 freq tirlt - 2 freq tirlit - 2 freq trailt - 7 freq thirlit - 8 freq thrilled - 8 freq trilled - 1 freq traaled - 1 freq trawlt - 1 freq tirled - 6 freq throu-lat - 1 freq twirled - 2 freq traawled - 1 freq thirl't - 1 freq trawled - 3 freq €˜thirled - 1 freq trolley-dolly - 1 freq trialt - 1 freq trelt - 1 freq three-leidit - 2 freq thirldad - 3 freq therealtimcore - 1 freq theworld - 1 freq |
MetaPhone code - 0RLTM thirldom - 8 freq |
THIRLDOM |
| Time to execute Levenshtein function - 0.320277 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.717623 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.075454 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.087223 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.000870 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. |