| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bampôt (0) - 3 freq bampôt' (1) - 1 freq bampÔt (1) - 1 freq bampot (2) - 30 freq bappit (3) - 1 freq bumpit (3) - 4 freq rampit (3) - 2 freq campt (3) - 2 freq dampt (3) - 3 freq lamplit (3) - 1 freq lampit (3) - 1 freq bampots (3) - 8 freq rampant (3) - 11 freq rampart (3) - 2 freq dampit (3) - 1 freq campit (3) - 2 freq damp't (3) - 1 freq jampt (3) - 1 freq bampin (3) - 1 freq baagest (4) - 7 freq ramparts (4) - 2 freq bummelt (4) - 1 freq balbutt (4) - 8 freq barrett (4) - 1 freq happit (4) - 102 freq |
bampôt (0) - 3 freq bampÔt (2) - 1 freq bampôt' (2) - 1 freq bampot (4) - 30 freq bumpit (5) - 4 freq dampit (6) - 1 freq rampart (6) - 2 freq campit (6) - 2 freq jampt (6) - 1 freq bampin (6) - 1 freq rampant (6) - 11 freq damp't (6) - 1 freq bampots (6) - 8 freq bappit (6) - 1 freq campt (6) - 2 freq rampit (6) - 2 freq lamplit (6) - 1 freq lampit (6) - 1 freq dampt (6) - 3 freq lamppost (7) - 1 freq humpit (7) - 1 freq rumpelt (7) - 1 freq impect (7) - 1 freq wumpilt (7) - 1 freq rumplet (7) - 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 - BMPT bumped - 23 freq bampot - 30 freq bumpit - 4 freq bampÔt - 1 freq bampôt' - 1 freq bampôt - 3 freq |
BAMPÔT |
| Time to execute Levenshtein function - 0.214305 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.382208 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.030656 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.041863 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.000938 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. |