Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
temptt (0) - 1 freq tempts (1) - 2 freq temptet (1) - 1 freq tempt (1) - 8 freq tempit (1) - 11 freq temptit (1) - 11 freq temote (2) - 1 freq empty (2) - 207 freq teapot (2) - 10 freq tempo (2) - 4 freq temptan (2) - 2 freq lempit (2) - 2 freq temper (2) - 50 freq hempt (2) - 1 freq temptin (2) - 10 freq telttt (2) - 1 freq temp- (2) - 7 freq tempin (2) - 4 freq temple (2) - 86 freq tempus (2) - 1 freq templ (2) - 2 freq temp (2) - 734 freq tempter (2) - 1 freq kempit (2) - 2 freq tempest (2) - 4 freq |
temptt (0) - 1 freq temptet (1) - 1 freq temptit (1) - 11 freq tempt (2) - 8 freq tempts (2) - 2 freq tempit (2) - 11 freq tempter (3) - 1 freq tempest (3) - 4 freq tempert (3) - 2 freq temptin (3) - 10 freq tempted (3) - 22 freq emptit (3) - 1 freq temptan (3) - 2 freq teapit (4) - 1 freq empty (4) - 207 freq teapot (4) - 10 freq temote (4) - 1 freq temps (4) - 1 freq temper (4) - 50 freq attemptet (4) - 1 freq attemptit (4) - 7 freq emptiet (4) - 1 freq template (4) - 6 freq tempo (4) - 4 freq temperit (4) - 1 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 - TMPT tempt - 8 freq dumped - 21 freq temptt - 1 freq dampt - 3 freq damp't - 1 freq dumpit - 6 freq dumpid - 1 freq dump'd - 1 freq tempit - 11 freq dumpty - 6 freq dampit - 1 freq tamped - 1 freq |
TEMPTT |
Time to execute Levenshtein function - 0.195015 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.371697 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.030941 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.040943 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.000888 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. |