| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bamber (0) - 2 freq amber (1) - 13 freq camber (1) - 1 freq bomber (1) - 3 freq barber (1) - 7 freq baer (2) - 2 freq bombe (2) - 1 freq damper (2) - 3 freq barter (2) - 3 freq caber (2) - 4 freq timber (2) - 4 freq tamper (2) - 1 freq hammer (2) - 44 freq number (2) - 174 freq aaber (2) - 22 freq bummer (2) - 21 freq bather (2) - 59 freq bawbee (2) - 23 freq lammer (2) - 2 freq pamper (2) - 2 freq banker (2) - 12 freq basker (2) - 1 freq bame (2) - 2 freq barbera (2) - 1 freq badger (2) - 6 freq |
bamber (0) - 2 freq bomber (1) - 3 freq barber (2) - 7 freq camber (2) - 1 freq amber (2) - 13 freq bumper (3) - 4 freq barbar (3) - 29 freq maimber (3) - 14 freq comber (3) - 2 freq lumber (3) - 5 freq umber (3) - 2 freq bombers (3) - 7 freq limber (3) - 2 freq bamboo (3) - 9 freq barbera (3) - 1 freq number (3) - 174 freq bambi (3) - 1 freq member (3) - 75 freq bombe (3) - 1 freq beamer (3) - 12 freq bombed (3) - 7 freq timber (3) - 4 freq bieber (3) - 1 freq humber (3) - 2 freq bumbee (3) - 4 freq |
SoundEx code - B516 bombers - 7 freq bonfires - 8 freq bonfire - 28 freq banefire - 3 freq bumper - 4 freq bonnieburgh - 9 freq bonaparte - 2 freq bambrick - 1 freq bumper's - 1 freq 'bombardment - 1 freq bomber's - 1 freq bombardments - 1 freq bombardment - 1 freq bonefire - 1 freq bonaparty - 1 freq bomber - 3 freq bonfrost - 1 freq bombards - 1 freq bumbard - 1 freq bonnybrig - 1 freq bamber - 2 freq bonfire-bit - 1 freq bombardit - 1 freq binfire - 1 freq beanieforindy - 1 freq |
MetaPhone code - BMR bummer - 21 freq beamer - 12 freq boomer - 1 freq bawmurrie - 1 freq bomber - 3 freq bummerie - 1 freq beemer - 2 freq bamber - 2 freq bmr - 1 freq |
BAMBER |
| Time to execute Levenshtein function - 0.207247 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.394444 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.028797 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.041566 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.000950 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. |