| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| temptin (0) - 10 freq tempting (1) - 3 freq tempin (1) - 4 freq temptit (1) - 11 freq temptan (1) - 2 freq emptie (2) - 1 freq tempter (2) - 1 freq demption (2) - 1 freq textin (2) - 8 freq teetin (2) - 10 freq tempts (2) - 2 freq temptt (2) - 1 freq testin (2) - 15 freq attemptin (2) - 9 freq teapin (2) - 1 freq tempt (2) - 8 freq kempton (2) - 4 freq emptyin (2) - 6 freq teitin (2) - 1 freq tempted (2) - 22 freq kempin (2) - 5 freq tentin (2) - 10 freq tempit (2) - 11 freq ceptin (2) - 6 freq emptit (2) - 1 freq |
temptin (0) - 10 freq temptan (1) - 2 freq temptit (2) - 11 freq tempting (2) - 3 freq tempin (2) - 4 freq kempton (3) - 4 freq tempt (3) - 8 freq emptyin (3) - 6 freq tempit (3) - 11 freq attemptin (3) - 9 freq tempted (3) - 22 freq temptt (3) - 1 freq tempter (3) - 1 freq demption (3) - 1 freq tempts (3) - 2 freq temptet (3) - 1 freq tampson (4) - 1 freq templeton (4) - 2 freq competin (4) - 3 freq temptation (4) - 22 freq gumption (4) - 12 freq exemption (4) - 2 freq tampan (4) - 1 freq computin (4) - 3 freq kempin (4) - 5 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 - TMPTN temptin - 10 freq temptan - 2 freq |
TEMPTIN |
| Time to execute Levenshtein function - 0.203085 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.337117 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.028495 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.036859 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.000865 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. |