| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thrilled (0) - 8 freq thriller (1) - 1 freq trilled (1) - 1 freq thirled (2) - 20 freq grilled (2) - 2 freq tripled (2) - 1 freq tilled (2) - 3 freq thrill (2) - 18 freq chilled (2) - 9 freq drilled (2) - 1 freq trifled (2) - 1 freq thrills (2) - 6 freq trolled (2) - 1 freq thrillers (2) - 1 freq thrived (2) - 7 freq trifles (3) - 1 freq spilled (3) - 4 freq thistled (3) - 1 freq tried (3) - 687 freq ruilled (3) - 1 freq tailed (3) - 7 freq swilled (3) - 1 freq driller (3) - 5 freq marlled (3) - 1 freq twirled (3) - 2 freq |
thrilled (0) - 8 freq thriller (2) - 1 freq trilled (2) - 1 freq trolled (3) - 1 freq thrill (3) - 18 freq thrills (3) - 6 freq thirled (3) - 20 freq thrillers (4) - 1 freq thrall (4) - 4 freq thrived (4) - 7 freq enthralled (4) - 1 freq tripled (4) - 1 freq trifled (4) - 1 freq tilled (4) - 3 freq grilled (4) - 2 freq drilled (4) - 1 freq chilled (4) - 9 freq trolley (5) - 27 freq thranged (5) - 6 freq halled (5) - 2 freq shrivelled (5) - 1 freq trills (5) - 2 freq thurible (5) - 2 freq thirle (5) - 2 freq trawled (5) - 3 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.191985 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.346847 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.029246 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.037214 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.000878 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. |