| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bamboo (0) - 9 freq bambi (2) - 1 freq bamber (2) - 2 freq bimbo (2) - 1 freq taboo (2) - 4 freq aboo (2) - 2 freq lambo (2) - 1 freq bambuco (2) - 2 freq gambol (2) - 1 freq jambo (2) - 5 freq bampot (2) - 30 freq balboa (2) - 1 freq baboon (2) - 1 freq jambos (2) - 3 freq gambo (2) - 1 freq rambo (2) - 1 freq bombed (3) - 7 freq bammin (3) - 3 freq basso (3) - 2 freq moo (3) - 173 freq labor (3) - 1 freq ramrod (3) - 1 freq baobab (3) - 5 freq bomb (3) - 30 freq amok (3) - 1 freq |
bamboo (0) - 9 freq bambi (2) - 1 freq bimbo (2) - 1 freq bombe (3) - 1 freq balboa (3) - 1 freq gambo (3) - 1 freq bomb (3) - 30 freq bombay (3) - 5 freq rambo (3) - 1 freq bumbee (3) - 4 freq lambo (3) - 1 freq jambo (3) - 5 freq bambuco (3) - 2 freq bamber (3) - 2 freq gameboy (4) - 1 freq bombin (4) - 4 freq symbo (4) - 1 freq lamb (4) - 62 freq bomber (4) - 3 freq mumbo (4) - 5 freq bobo (4) - 9 freq combo (4) - 5 freq tomboy (4) - 1 freq bame (4) - 2 freq bumble (4) - 2 freq |
SoundEx code - B510 bumbee - 4 freq bamboo - 9 freq bumph - 3 freq bump - 23 freq bonnify - 2 freq bomb - 30 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 - 18 freq bammy - 2 freq bum - 43 freq 'bam - 1 freq bomb - 30 freq bmw - 4 freq bombay - 5 freq baim - 1 freq beem - 5 freq boom - 30 freq bam - 38 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.169585 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.361181 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.029606 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.038636 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.000826 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. |