| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bampots (0) - 8 freq bampot's (1) - 1 freq bampot (1) - 30 freq lamposts (2) - 1 freq taypots (2) - 1 freq ballots (2) - 1 freq lumpots (2) - 1 freq 'bampots' (2) - 1 freq campos (2) - 1 freq smoots (3) - 2 freq moots (3) - 3 freq batons (3) - 1 freq pasports (3) - 1 freq bams (3) - 19 freq campus (3) - 5 freq taepot (3) - 1 freq famous (3) - 97 freq aamos (3) - 5 freq dampit (3) - 1 freq bump's (3) - 1 freq maggots (3) - 3 freq carpets (3) - 7 freq campers (3) - 2 freq bampÔt (3) - 1 freq damp't (3) - 1 freq |
bampots (0) - 8 freq bampot (2) - 30 freq bampot's (2) - 1 freq lumpots (3) - 1 freq lempets (4) - 2 freq limpets (4) - 2 freq limpits (4) - 1 freq bump's (4) - 1 freq bumpit (4) - 4 freq campos (4) - 1 freq taypots (4) - 1 freq lamposts (4) - 1 freq tempts (4) - 2 freq ballots (4) - 1 freq bumps (4) - 8 freq 'bampots' (4) - 1 freq maments (5) - 1 freq bants (5) - 5 freq competes (5) - 1 freq aboots (5) - 15 freq ballats (5) - 1 freq baests (5) - 13 freq hamlets (5) - 1 freq ramparts (5) - 2 freq pampas (5) - 1 freq |
SoundEx code - B513 bumped - 23 freq bombed - 7 freq benefit - 74 freq bampots'll - 1 freq bampot - 30 freq benifit - 1 freq bampot's - 1 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq bampôtisserie - 1 freq benefits - 54 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.209217 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.390586 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.031248 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.041575 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.000916 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. |