| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barbie (0) - 3 freq barkie (1) - 1 freq babie (1) - 1 freq barnie (1) - 1 freq barbies (1) - 3 freq bardie (1) - 1 freq baabie (1) - 21 freq babbie (1) - 34 freq barrie (1) - 15 freq barmie (1) - 1 freq baukie (2) - 2 freq barbwire (2) - 1 freq mabbie (2) - 1 freq markie (2) - 2 freq warie (2) - 1 freq bardies (2) - 1 freq brie (2) - 3 freq bathie (2) - 2 freq barkit (2) - 8 freq babies (2) - 28 freq bawkie (2) - 1 freq bafhie (2) - 2 freq bawbee (2) - 23 freq fabbie (2) - 2 freq earlie (2) - 7 freq |
barbie (0) - 3 freq baabie (2) - 21 freq barrie (2) - 15 freq barmie (2) - 1 freq bardie (2) - 1 freq babbie (2) - 34 freq barbies (2) - 3 freq babie (2) - 1 freq barkie (2) - 1 freq barnie (2) - 1 freq byrb (3) - 1 freq birdie (3) - 35 freq bairnie (3) - 70 freq burnie (3) - 16 freq barke (3) - 1 freq barin (3) - 4 freq corbie (3) - 27 freq bernie (3) - 2 freq barge (3) - 15 freq noarbie (3) - 2 freq barber (3) - 7 freq barque (3) - 2 freq birkie (3) - 27 freq abbie (3) - 59 freq bobbie (3) - 15 freq |
SoundEx code - B610 brave - 134 freq bribe - 3 freq barrafu - 2 freq 'brave - 1 freq barbie - 3 freq brief - 38 freq bravi - 1 freq barrowfu - 2 freq brev - 31 freq baarafu - 2 freq broup - 1 freq burp - 9 freq barf - 7 freq borrow-foo - 1 freq burraview - 2 freq beryaev - 1 freq brave' - 1 freq €˜brief - 1 freq buuuurp - 1 freq barrafae - 1 freq bruv - 2 freq brava - 1 freq byrb - 1 freq byreboy - 1 freq bref - 1 freq |
MetaPhone code - BRB bribe - 3 freq barbie - 3 freq byrb - 1 freq byreboy - 1 freq |
BARBIE |
| Time to execute Levenshtein function - 0.233233 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.394247 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.028303 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.038088 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.000923 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. |