| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bampots (0) - 8 freq bampot's (1) - 1 freq bampot (1) - 30 freq 'bampots' (2) - 1 freq taypots (2) - 1 freq ballots (2) - 1 freq campos (2) - 1 freq lamposts (2) - 1 freq lumpots (2) - 1 freq barrows (3) - 1 freq baloons (3) - 1 freq rampit (3) - 2 freq tempts (3) - 2 freq bampots'll (3) - 1 freq waments (3) - 1 freq hamlets (3) - 1 freq mammoth (3) - 8 freq dampt (3) - 3 freq barons (3) - 3 freq limpits (3) - 1 freq famous (3) - 105 freq baests (3) - 13 freq amoonts (3) - 10 freq dampnes (3) - 1 freq bats (3) - 34 freq |
bampots (0) - 8 freq bampot (2) - 30 freq bampot's (2) - 1 freq lumpots (3) - 1 freq tempts (4) - 2 freq bumps (4) - 9 freq limpits (4) - 1 freq 'bampots' (4) - 1 freq bump's (4) - 1 freq taypots (4) - 1 freq lempets (4) - 2 freq ballots (4) - 1 freq campos (4) - 1 freq lamposts (4) - 1 freq limpets (4) - 2 freq bumpit (4) - 4 freq baskets (5) - 8 freq bandits (5) - 5 freq baits (5) - 3 freq campers (5) - 2 freq bappy's (5) - 3 freq carpets (5) - 8 freq pampas (5) - 1 freq laments (5) - 9 freq bampin (5) - 1 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 - BMPTS bampot's - 1 freq bampots - 8 freq 'bampots' - 1 freq |
BAMPOTS |
| Time to execute Levenshtein function - 0.211301 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.362672 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.027775 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.039003 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.001014 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. |