| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thrilled (0) - 8 freq trilled (1) - 1 freq thriller (1) - 1 freq tripled (2) - 1 freq grilled (2) - 2 freq tilled (2) - 3 freq trolled (2) - 1 freq chilled (2) - 9 freq thrill (2) - 18 freq thrived (2) - 6 freq thrillers (2) - 1 freq thrills (2) - 6 freq trifled (2) - 1 freq thirled (2) - 20 freq thries (3) - 2 freq thirle (3) - 2 freq spilled (3) - 5 freq shelled (3) - 2 freq skeilled (3) - 1 freq trawled (3) - 3 freq trinnled (3) - 2 freq hailed (3) - 14 freq tilted (3) - 5 freq thistled (3) - 1 freq enthralled (3) - 1 freq |
thrilled (0) - 8 freq trilled (2) - 1 freq thriller (2) - 1 freq thrill (3) - 18 freq thrills (3) - 6 freq trolled (3) - 1 freq thirled (3) - 20 freq thrall (4) - 4 freq thrillers (4) - 1 freq trifled (4) - 1 freq enthralled (4) - 1 freq thrived (4) - 6 freq tripled (4) - 1 freq grilled (4) - 2 freq tilled (4) - 3 freq chilled (4) - 9 freq strolled (5) - 4 freq thranged (5) - 6 freq carolled (5) - 1 freq throwed (5) - 12 freq thirldad (5) - 3 freq rolled (5) - 54 freq tholed (5) - 45 freq traaled (5) - 1 freq telled (5) - 2 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 - 0RLT thirlt - 36 freq thirled - 20 freq thirlit - 8 freq thrilled - 8 freq throu-lat - 1 freq thirl't - 1 freq €˜thirled - 1 freq |
THRILLED |
| Time to execute Levenshtein function - 0.181102 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.358416 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.027291 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.036784 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.000796 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. |