| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| thumped (0) - 5 freq thumper (1) - 1 freq thumpen (1) - 1 freq humped (1) - 2 freq trumped (1) - 2 freq thoumed (2) - 1 freq thunked (2) - 3 freq themed (2) - 2 freq humphd (2) - 1 freq mumped (2) - 1 freq thumsel (2) - 1 freq tramped (2) - 11 freq champed (2) - 2 freq whupped (2) - 3 freq thumpin (2) - 18 freq pumped (2) - 15 freq thump's (2) - 1 freq chummed (2) - 1 freq bumped (2) - 23 freq hummed (2) - 10 freq tumed (2) - 1 freq humphed (2) - 9 freq tamped (2) - 1 freq thumps (2) - 3 freq dumped (2) - 21 freq |
thumped (0) - 5 freq trumped (2) - 2 freq humped (2) - 2 freq thumper (2) - 1 freq thumpen (2) - 1 freq thumpin (3) - 18 freq thumpit (3) - 2 freq thumps (3) - 3 freq champed (3) - 2 freq tamped (3) - 1 freq thump (3) - 32 freq tramped (3) - 11 freq themed (3) - 2 freq thoumed (3) - 1 freq lumped (4) - 2 freq thumpeth (4) - 1 freq trampid (4) - 1 freq trumpet (4) - 25 freq thrummed (4) - 3 freq trumpled (4) - 1 freq thoomed (4) - 3 freq slumped (4) - 13 freq thomp (4) - 1 freq jumped (4) - 66 freq stumped (4) - 3 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 - 0MPT thumped - 5 freq thumpit - 2 freq |
THUMPED |
| Time to execute Levenshtein function - 0.182049 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.375097 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.027449 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.036946 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.000795 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. |