| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| tempted (0) - 23 freq tempter (1) - 1 freq temptet (1) - 1 freq emptied (2) - 20 freq tempts (2) - 2 freq temptit (2) - 11 freq tamped (2) - 1 freq texted (2) - 4 freq tempt (2) - 9 freq temper (2) - 50 freq teeted (2) - 1 freq temptin (2) - 11 freq empied (2) - 3 freq temptt (2) - 1 freq temple (2) - 87 freq tented (2) - 1 freq tempered (2) - 3 freq temple' (2) - 2 freq temptised (2) - 1 freq temote (2) - 1 freq attempted (2) - 11 freq tested (2) - 21 freq temptan (2) - 2 freq temples (2) - 10 freq peinted (3) - 1 freq |
tempted (0) - 23 freq temptet (2) - 1 freq tempter (2) - 1 freq attempted (3) - 11 freq tempered (3) - 3 freq temptt (3) - 1 freq tempt (3) - 9 freq temptin (3) - 11 freq tamped (3) - 1 freq emptied (3) - 20 freq tempts (3) - 2 freq temptit (3) - 11 freq temptan (3) - 2 freq temptised (3) - 1 freq tiptaed (4) - 3 freq tiptoed (4) - 2 freq temote (4) - 1 freq tempit (4) - 11 freq temples (4) - 10 freq tested (4) - 21 freq texted (4) - 4 freq temper (4) - 50 freq temple' (4) - 2 freq empied (4) - 3 freq teeted (4) - 1 freq |
SoundEx code - T513 temptation - 22 freq tempt - 9 freq then-bit - 1 freq tempted - 23 freq thumped - 5 freq tounfuit - 2 freq temptit - 11 freq temptt - 1 freq temptin - 11 freq thumbit - 1 freq ten-foot - 2 freq tempit - 11 freq temptet - 1 freq tempter - 1 freq thumpeth - 1 freq timptations - 1 freq timptation's - 1 freq timptation - 1 freq temptan - 2 freq temptations - 2 freq tempts - 2 freq temptautioun - 1 freq thumpit - 2 freq ten-fit - 1 freq temptised - 1 freq tinpot - 3 freq tamped - 1 freq ten-foot-pole - 1 freq tempting - 3 freq temptress - 1 freq tenfeettallabdn - 1 freq |
MetaPhone code - TMPTT tempted - 23 freq temptit - 11 freq temptet - 1 freq |
TEMPTED tempt - 9 freq temp - 734 freq temptation - 22 freq tempted - 23 freq tempit - 11 freq |
| Time to execute Levenshtein function - 0.787439 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 - 1.092262 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.034890 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.085695 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.000914 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. |