| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bampot (0) - 30 freq bampots (1) - 8 freq ballot (2) - 10 freq campit (2) - 2 freq bampÔt (2) - 1 freq bampôt (2) - 3 freq bampot's (2) - 1 freq dampit (2) - 1 freq bumpit (2) - 4 freq bamboo (2) - 9 freq dampt (2) - 3 freq bappit (2) - 1 freq damp't (2) - 1 freq rampit (2) - 2 freq lampit (2) - 2 freq jampt (2) - 1 freq campt (2) - 2 freq taypot (2) - 5 freq taepot (2) - 1 freq campos (2) - 1 freq bampin (2) - 1 freq baloos (3) - 1 freq hapt (3) - 5 freq lempit (3) - 2 freq abbot (3) - 5 freq |
bampot (0) - 30 freq bumpit (2) - 4 freq bampots (2) - 8 freq rampit (3) - 2 freq lampit (3) - 2 freq campt (3) - 2 freq bampin (3) - 1 freq dampt (3) - 3 freq jampt (3) - 1 freq bappit (3) - 1 freq campit (3) - 2 freq dampit (3) - 1 freq lumpit (4) - 1 freq mumpt (4) - 2 freq blempt (4) - 2 freq pumpt (4) - 1 freq bumt (4) - 1 freq limpit (4) - 1 freq jumpet (4) - 1 freq jimpt (4) - 1 freq bxypt (4) - 1 freq compt (4) - 1 freq bumps (4) - 9 freq byamat (4) - 1 freq mumpit (4) - 2 freq |
SoundEx code - B513 bumped - 23 freq bombed - 7 freq benefit - 73 freq bampots'll - 1 freq bampot - 30 freq benifit - 1 freq benefit-of - 1 freq benifits - 1 freq benefits - 55 freq bampot's - 1 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq bampôtisserie - 1 freq benefitit - 1 freq benefeits - 1 freq bampots - 8 freq banefed - 2 freq benefittit - 2 freq benefited - 2 freq 'bampots' - 1 freq benefitin - 2 freq benifitit - 1 freq benefitted - 1 freq |
MetaPhone code - BMPT bumped - 23 freq bampot - 30 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq |
BAMPOT |
| Time to execute Levenshtein function - 0.185811 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.346198 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.027824 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.069736 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.000921 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. |