| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| temerity (0) - 1 freq severity (2) - 4 freq temerat (2) - 1 freq temperit (2) - 1 freq eternity (3) - 18 freq emery (3) - 1 freq steerit (3) - 2 freq therty (3) - 11 freq tempit (3) - 11 freq merit (3) - 17 freq teetit (3) - 5 freq verity (3) - 2 freq serenity (3) - 2 freq emergit (3) - 1 freq beerit (3) - 4 freq uteelity (3) - 1 freq remerkit (3) - 2 freq security (3) - 55 freq meenity (3) - 2 freq temperate (3) - 3 freq celebrity (3) - 17 freq dexterity (3) - 1 freq tenerife (3) - 3 freq americy (3) - 1 freq tempert (3) - 2 freq |
temerity (0) - 1 freq temerat (2) - 1 freq temperit (3) - 1 freq tempit (4) - 11 freq temperate (4) - 3 freq tempert (4) - 2 freq therty (4) - 11 freq merit (4) - 17 freq severity (4) - 4 freq tamer (5) - 2 freq tolerate (5) - 7 freq timerous (5) - 2 freq smert (5) - 44 freq smeerit (5) - 1 freq thurty (5) - 1 freq torty (5) - 1 freq thereto (5) - 1 freq tempt (5) - 9 freq tarty (5) - 1 freq mert (5) - 1 freq tamet (5) - 1 freq traety (5) - 1 freq marit (5) - 1 freq threit (5) - 18 freq tourit (5) - 2 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 |
TEMERITY |
| Time to execute Levenshtein function - 0.302256 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.403357 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.029083 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.040660 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.000938 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. |