| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| teckled (0) - 1 freq tickled (1) - 8 freq teckle (1) - 5 freq tackled (1) - 1 freq heckled (1) - 1 freq keckled (1) - 11 freq decked (2) - 8 freq keckle (2) - 8 freq tickles (2) - 5 freq tinkled (2) - 4 freq rickled (2) - 1 freq tickler (2) - 4 freq suckled (2) - 3 freq buckled (2) - 7 freq teckie (2) - 1 freq trickled (2) - 2 freq heckle (2) - 2 freq trackled (2) - 1 freq tackle (2) - 30 freq speckled (2) - 3 freq tecklin (2) - 1 freq keckles (2) - 2 freq ticked (2) - 5 freq tackles (2) - 3 freq huckled (2) - 12 freq |
teckled (0) - 1 freq tackled (1) - 1 freq tickled (1) - 8 freq heckled (2) - 1 freq keckled (2) - 11 freq teckle (2) - 5 freq huckled (3) - 12 freq tickle (3) - 13 freq tackles (3) - 3 freq ticked (3) - 5 freq tecklin (3) - 1 freq tacklet (3) - 1 freq tucked (3) - 36 freq hickled (3) - 1 freq tackle (3) - 30 freq pickled (3) - 10 freq cockled (3) - 2 freq tacked (3) - 2 freq cackled (3) - 2 freq suckled (3) - 3 freq tickles (3) - 5 freq tinkled (3) - 4 freq rickled (3) - 1 freq tickler (3) - 4 freq buckled (3) - 7 freq |
SoundEx code - T243 taigelt - 12 freq taislet - 2 freq taigilt - 2 freq tagliatelle - 2 freq taiglt - 2 freq ticklit - 1 freq taigled - 3 freq tickled - 8 freq tackled - 1 freq tousled - 1 freq taegelt - 1 freq taisled - 1 freq tjaldur - 1 freq taiselt - 1 freq toosled - 2 freq taiglit - 2 freq tusseled - 1 freq touseled - 1 freq teckled - 1 freq touslt - 2 freq tousilt - 1 freq touzelt - 1 freq taiglet - 1 freq tacklet - 1 freq touslet - 1 freq tooslet - 1 freq theslidedown - 5 freq thesltn - 2 freq tickledpink - 1 freq |
MetaPhone code - TKLT taiglt - 2 freq ticklit - 1 freq taigled - 3 freq tickled - 8 freq tackled - 1 freq dugald - 13 freq taiglit - 2 freq teckled - 1 freq taiglet - 1 freq tacklet - 1 freq |
TECKLED |
| Time to execute Levenshtein function - 0.202890 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.390492 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.028079 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.040043 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.000874 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. |