Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
tempit (0) - 11 freq tempt (1) - 8 freq tempin (1) - 4 freq teapit (1) - 1 freq lempit (1) - 2 freq temptt (1) - 1 freq temptit (1) - 11 freq kempit (1) - 2 freq tentit (2) - 8 freq kepit (2) - 3 freq templ (2) - 2 freq bumpit (2) - 4 freq trampit (2) - 6 freq emptit (2) - 1 freq seepit (2) - 4 freq temptet (2) - 1 freq tepid (2) - 1 freq temple (2) - 86 freq telit (2) - 1 freq limpit (2) - 1 freq heapit (2) - 4 freq nemmit (2) - 1 freq tippit (2) - 10 freq keppit (2) - 17 freq hempie (2) - 2 freq |
tempit (0) - 11 freq tempt (1) - 8 freq temptit (2) - 11 freq temptt (2) - 1 freq kempit (2) - 2 freq tempin (2) - 4 freq teapit (2) - 1 freq lempit (2) - 2 freq teapot (3) - 10 freq temperit (3) - 1 freq lampit (3) - 1 freq dumpit (3) - 6 freq humpit (3) - 1 freq dampit (3) - 1 freq temper (3) - 50 freq typit (3) - 3 freq timit (3) - 1 freq temp (3) - 734 freq tempts (3) - 2 freq campit (3) - 2 freq tempert (3) - 2 freq rampit (3) - 2 freq lumpit (3) - 1 freq tumit (3) - 1 freq stampit (3) - 12 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 |
TEMPIT tempt - 8 freq temp - 734 freq temptation - 22 freq tempted - 22 freq tempit - 11 freq |
Time to execute Levenshtein function - 0.191167 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.396638 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.056040 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.037928 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.035047 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. |