| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| temptit (0) - 11 freq temptet (1) - 1 freq emptit (1) - 1 freq temptt (1) - 1 freq temptin (1) - 10 freq tempit (1) - 11 freq testit (2) - 10 freq tempted (2) - 22 freq kempit (2) - 2 freq attemptit (2) - 7 freq teetit (2) - 5 freq tempert (2) - 2 freq tempest (2) - 4 freq tempter (2) - 1 freq tentit (2) - 8 freq tempin (2) - 4 freq demotit (2) - 1 freq lempit (2) - 2 freq tempting (2) - 3 freq tempts (2) - 2 freq tempt (2) - 8 freq emptie (2) - 1 freq temptan (2) - 2 freq teapit (2) - 1 freq temperit (2) - 1 freq |
temptit (0) - 11 freq temptt (1) - 1 freq temptet (1) - 1 freq temptin (2) - 10 freq tempit (2) - 11 freq emptit (2) - 1 freq tempts (3) - 2 freq tempter (3) - 1 freq tempt (3) - 8 freq temperit (3) - 1 freq emptiet (3) - 1 freq tempest (3) - 4 freq temptan (3) - 2 freq attemptit (3) - 7 freq tempted (3) - 22 freq tempert (3) - 2 freq competit (4) - 1 freq kempit (4) - 2 freq attemptet (4) - 1 freq testit (4) - 10 freq teapit (4) - 1 freq computit (4) - 2 freq template (4) - 6 freq demotit (4) - 1 freq tempin (4) - 4 freq |
SoundEx code - T513 temptation - 22 freq tempt - 8 freq then-bit - 1 freq tempted - 22 freq thumped - 5 freq tounfuit - 2 freq temptit - 11 freq temptt - 1 freq temptin - 10 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 - 22 freq temptit - 11 freq temptet - 1 freq |
TEMPTIT |
| Time to execute Levenshtein function - 0.295792 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.600056 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.027622 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.065928 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.000784 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. |