| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| timmered (0) - 1 freq timbered (1) - 1 freq tichered (2) - 2 freq stammered (2) - 4 freq trimmeled (2) - 1 freq tempered (2) - 3 freq tippered (2) - 1 freq yammered (2) - 8 freq timmer's (2) - 1 freq tiltered (2) - 1 freq shimmered (2) - 2 freq simmerd (2) - 1 freq hummered (2) - 1 freq immersed (2) - 4 freq immersd (2) - 1 freq hammered (2) - 13 freq skimmered (2) - 2 freq timmert (2) - 1 freq timmer (2) - 80 freq tittered (2) - 1 freq timmerin (2) - 4 freq haimmered (2) - 4 freq glimmered (2) - 5 freq timmers (2) - 6 freq hemmered (2) - 4 freq |
timmered (0) - 1 freq timbered (2) - 1 freq timmert (3) - 1 freq hammered (3) - 13 freq hummered (3) - 1 freq timmer (3) - 80 freq haimmered (3) - 4 freq hemmered (3) - 4 freq simmerd (3) - 1 freq timmerin (3) - 4 freq timmers (3) - 6 freq stammered (3) - 4 freq yammered (3) - 8 freq tempered (3) - 3 freq tiltered (4) - 1 freq immersd (4) - 1 freq timurd (4) - 1 freq shimmered (4) - 2 freq tichered (4) - 2 freq timmd (4) - 1 freq trimmeled (4) - 1 freq glimmered (4) - 5 freq immersed (4) - 4 freq skimmered (4) - 2 freq timmer's (4) - 1 freq |
SoundEx code - T563 thunnert - 2 freq temerity - 1 freq thunnered - 4 freq timmert - 1 freq timurd - 1 freq thunner-rider - 1 freq thummart - 2 freq €˜thummart - 1 freq timmered - 1 freq temerat - 1 freq tounward - 1 freq tenortuesday - 1 freq tionurtj - 1 freq timmorton - 1 freq |
MetaPhone code - TMRT temerity - 1 freq timmert - 1 freq timurd - 1 freq timbered - 1 freq timmered - 1 freq temerat - 1 freq daumert - 1 freq damart - 1 freq |
TIMMERED |
| Time to execute Levenshtein function - 0.500261 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.805620 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.030351 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.095970 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.000917 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. |