Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tempt (0) - 9 freq templ (1) - 2 freq temp (1) - 734 freq temps (1) - 1 freq tempo (1) - 4 freq tempit (1) - 11 freq hempt (1) - 1 freq temptt (1) - 1 freq tempts (1) - 2 freq temp- (1) - 7 freq tumt (2) - 1 freq kempe (2) - 3 freq dept (2) - 7 freq tel't (2) - 2 freq teet (2) - 13 freq empty (2) - 213 freq jampt (2) - 1 freq temote (2) - 1 freq tent (2) - 460 freq teapot (2) - 10 freq teemt (2) - 3 freq dempz (2) - 2 freq tems (2) - 1 freq cept (2) - 25 freq dampt (2) - 3 freq |
tempt (0) - 9 freq tempit (1) - 11 freq hempt (2) - 1 freq temp- (2) - 7 freq temptt (2) - 1 freq tempts (2) - 2 freq tempo (2) - 4 freq templ (2) - 2 freq temp (2) - 734 freq temps (2) - 1 freq tempest (3) - 5 freq kempit (3) - 2 freq tempin (3) - 4 freq mumpt (3) - 2 freq stampt (3) - 4 freq timpo (3) - 1 freq jimpt (3) - 1 freq timit (3) - 1 freq teem't (3) - 4 freq attempt (3) - 81 freq campt (3) - 2 freq tempter (3) - 1 freq temptan (3) - 2 freq tippt (3) - 1 freq compt (3) - 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 - TMPT tempt - 9 freq dumped - 26 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 |
TEMPT tempt - 9 freq temp - 734 freq temptation - 22 freq tempted - 23 freq tempit - 11 freq |
Time to execute Levenshtein function - 0.171784 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.325006 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.028205 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.037355 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.000954 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. |