| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thirled (0) - 20 freq tirled (1) - 6 freq thirle (1) - 2 freq twirled (1) - 2 freq third (2) - 211 freq teitled (2) - 1 freq toiled (2) - 2 freq dirled (2) - 11 freq whurled (2) - 1 freq swirled (2) - 3 freq trilled (2) - 1 freq chirmed (2) - 2 freq shired (2) - 5 freq snirled (2) - 2 freq thinned (2) - 3 freq tirred (2) - 2 freq thistled (2) - 1 freq thirlt (2) - 36 freq shirley (2) - 9 freq titled (2) - 2 freq tilled (2) - 3 freq skirled (2) - 101 freq hired (2) - 27 freq thirl't (2) - 1 freq thirldad (2) - 3 freq |
thirled (0) - 20 freq tirled (2) - 6 freq twirled (2) - 2 freq thirle (2) - 2 freq thirl (3) - 3 freq thrilled (3) - 8 freq unthirled (3) - 1 freq thirldad (3) - 3 freq harled (3) - 6 freq thirlin (3) - 7 freq tholed (3) - 46 freq thirlit (3) - 8 freq hurled (3) - 21 freq thirlt (3) - 36 freq thir'd (3) - 3 freq thirls (3) - 5 freq threed (3) - 8 freq third (3) - 211 freq whurled (3) - 1 freq tholyd (4) - 1 freq thraad (4) - 1 freq thistled (4) - 1 freq traaled (4) - 1 freq thurd (4) - 15 freq teitled (4) - 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 - 0RLT thirlt - 36 freq thirled - 20 freq thirlit - 8 freq thrilled - 8 freq throu-lat - 1 freq thirl't - 1 freq €˜thirled - 1 freq |
THIRLED |
| Time to execute Levenshtein function - 0.199157 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.361123 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.027904 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.037512 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.000879 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. |