| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| temptised (0) - 1 freq emptied (2) - 20 freq tempted (2) - 23 freq memorised (3) - 2 freq temptet (3) - 1 freq despised (3) - 2 freq empties (3) - 6 freq tempter (3) - 1 freq emptiet (3) - 1 freq temptin (3) - 11 freq feminised (3) - 1 freq emptie (3) - 1 freq comprised (3) - 8 freq dumpised (3) - 4 freq bemuised (3) - 1 freq tempered (3) - 3 freq televised (3) - 3 freq temptit (3) - 11 freq tempting (3) - 3 freq baptised (3) - 27 freq demonised (3) - 3 freq empied (3) - 3 freq tempts (3) - 2 freq prised (4) - 3 freq temote (4) - 1 freq |
temptised (0) - 1 freq tempted (3) - 23 freq tempts (4) - 2 freq emptied (4) - 20 freq dumpised (5) - 4 freq tempered (5) - 3 freq baptised (5) - 27 freq comprised (5) - 8 freq temptit (5) - 11 freq tempting (5) - 3 freq temptet (5) - 1 freq tempter (5) - 1 freq empties (5) - 6 freq temptin (5) - 11 freq temples (6) - 10 freq tomaties (6) - 1 freq imposed (6) - 9 freq attempted (6) - 11 freq tempers (6) - 2 freq tempest (6) - 5 freq temptt (6) - 1 freq tempit (6) - 11 freq tempus (6) - 1 freq templates (6) - 2 freq tiptaed (6) - 3 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 - TMPTST temptised - 1 freq |
TEMPTISED |
| Time to execute Levenshtein function - 0.259073 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.505323 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.034542 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.046263 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.000941 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. |