| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| timmert (0) - 1 freq timmer (1) - 80 freq timmers (1) - 6 freq simmerd (2) - 1 freq stammert (2) - 2 freq himmest (2) - 4 freq timers (2) - 5 freq tempert (2) - 2 freq kimmer (2) - 6 freq timbers (2) - 5 freq immers (2) - 2 freq yammert (2) - 1 freq timmer's (2) - 1 freq timmered (2) - 1 freq simmers (2) - 16 freq vimmer (2) - 3 freq simmer (2) - 314 freq impert (2) - 1 freq hammert (2) - 4 freq timmerin (2) - 4 freq limmers (2) - 4 freq tummelt (2) - 17 freq skimmert (2) - 1 freq glimmert (2) - 2 freq timer (2) - 6 freq |
timmert (0) - 1 freq timmers (2) - 6 freq timmer (2) - 80 freq yammert (3) - 1 freq hemmert (3) - 4 freq timmered (3) - 1 freq hammert (3) - 4 freq haimmert (3) - 1 freq nummert (3) - 4 freq timmerin (3) - 4 freq stammert (3) - 2 freq tummelt (3) - 17 freq tempert (3) - 2 freq immer (4) - 2 freq limmer (4) - 19 freq simmet (4) - 3 freq jimmer (4) - 5 freq zimmer (4) - 3 freq hammart (4) - 1 freq cummerit (4) - 1 freq temperit (4) - 1 freq haimmerit (4) - 2 freq tummilt (4) - 8 freq tummlt (4) - 8 freq tummlet (4) - 3 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 |
TIMMERT |
| Time to execute Levenshtein function - 0.215230 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.410697 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.030132 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.037834 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.000843 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. |