| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tempin (0) - 4 freq tempit (1) - 11 freq temptin (1) - 11 freq teapin (1) - 1 freq kempin (1) - 5 freq teein (2) - 2 freq kempins (2) - 1 freq temp- (2) - 7 freq jumpin (2) - 61 freq tellin (2) - 611 freq weppin (2) - 1 freq lumpin (2) - 1 freq textin (2) - 8 freq tempting (2) - 3 freq jimpin (2) - 4 freq rampin (2) - 4 freq weepin (2) - 1 freq helpin (2) - 87 freq tewin (2) - 1 freq tendin (2) - 9 freq thumpin (2) - 19 freq hempie (2) - 2 freq tumlin (2) - 1 freq temptit (2) - 11 freq testin (2) - 15 freq |
tempin (0) - 4 freq tampan (2) - 1 freq teapin (2) - 1 freq kempin (2) - 5 freq temptin (2) - 11 freq tempit (2) - 11 freq stumpin (3) - 4 freq dumpin (3) - 5 freq timin (3) - 6 freq teimin (3) - 1 freq tempo (3) - 4 freq toppin (3) - 5 freq trumpin (3) - 5 freq temp (3) - 734 freq stompin (3) - 4 freq templ (3) - 2 freq trampin (3) - 15 freq temple (3) - 87 freq limpin (3) - 3 freq tappin (3) - 22 freq temps (3) - 1 freq tempt (3) - 9 freq temper (3) - 50 freq gampin (3) - 1 freq stampin (3) - 17 freq |
SoundEx code - T515 thumbin - 3 freq thumpin - 19 freq temuivin - 1 freq thumpen - 1 freq tampan - 1 freq tempin - 4 freq tenpenny - 1 freq thumban - 1 freq tiompan - 1 freq thumping - 2 freq tommiehoban - 3 freq themoviemike - 3 freq teamfinderscot - 4 freq |
MetaPhone code - TMPN dampen - 1 freq tampan - 1 freq tempin - 4 freq dumpin - 5 freq dumpin - 1 freq |
TEMPIN |
| Time to execute Levenshtein function - 0.202621 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.397212 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.027568 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.036950 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.000927 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. |