| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bamboo (0) - 9 freq jambos (2) - 3 freq lambo (2) - 1 freq bambi (2) - 1 freq balboa (2) - 1 freq bambuco (2) - 2 freq bampot (2) - 30 freq bimbo (2) - 1 freq gambo (2) - 1 freq bamber (2) - 2 freq jambo (2) - 5 freq taboo (2) - 4 freq baboon (2) - 1 freq rambo (2) - 1 freq aboo (2) - 2 freq gambol (2) - 1 freq barbie (3) - 3 freq amoco (3) - 1 freq a'foo (3) - 1 freq bab (3) - 13 freq bobo (3) - 9 freq buddoo (3) - 1 freq waefoo (3) - 1 freq boohoo (3) - 1 freq crambo (3) - 1 freq |
bamboo (0) - 9 freq bimbo (2) - 1 freq bambi (2) - 1 freq bombay (3) - 5 freq bomb (3) - 31 freq bombe (3) - 1 freq rambo (3) - 1 freq bamber (3) - 2 freq jambo (3) - 5 freq gambo (3) - 1 freq lambo (3) - 1 freq balboa (3) - 1 freq bumbee (3) - 4 freq bambuco (3) - 2 freq bammy (4) - 2 freq samba (4) - 1 freq jamb (4) - 2 freq lambie (4) - 3 freq gameboy (4) - 1 freq bam (4) - 39 freq dumbo (4) - 2 freq bambaze (4) - 1 freq camby (4) - 1 freq bomber (4) - 3 freq tomboy (4) - 1 freq |
SoundEx code - B510 bumbee - 4 freq bamboo - 9 freq bumph - 3 freq bump - 23 freq bonnify - 2 freq bomb - 31 freq 'bmv - 1 freq bombay - 5 freq bnb - 1 freq banff - 45 freq b'nb - 2 freq benbuie - 2 freq bombe - 1 freq bumpy - 1 freq bambi - 1 freq banffie - 2 freq bnp - 1 freq banoffee - 1 freq bvnwupi - 1 freq banf - 1 freq bumff - 1 freq bimbo - 1 freq |
MetaPhone code - BM bumbee - 4 freq bamboo - 9 freq beeame - 1 freq beam - 19 freq bammy - 2 freq bum - 44 freq 'bam - 1 freq bomb - 31 freq bmw - 4 freq bombay - 5 freq baim - 1 freq beem - 5 freq boom - 30 freq bam - 39 freq bim - 2 freq bo'm - 1 freq baimie - 1 freq bom - 3 freq bum' - 1 freq bame - 2 freq baum - 2 freq bombe - 1 freq beame - 1 freq bambi - 1 freq bem - 1 freq bm - 5 freq bmi - 1 freq bimbo - 1 freq |
BAMBOO |
| Time to execute Levenshtein function - 0.173297 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.325608 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.027993 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.037820 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.000925 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. |