| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barbican (0) - 1 freq barman (3) - 25 freq merican (3) - 1 freq jamaican (3) - 13 freq barfin (3) - 1 freq barbara (3) - 22 freq bartisans (3) - 1 freq baidan (3) - 1 freq barbie (3) - 3 freq arabian (3) - 1 freq martian (3) - 7 freq marzipan (3) - 2 freq cardifan (3) - 1 freq cardigan (3) - 18 freq barbies (3) - 3 freq 'arabian (3) - 1 freq barrin (3) - 7 freq barricade (3) - 1 freq vatican (3) - 1 freq arisan (3) - 1 freq bardin (3) - 1 freq barca (3) - 1 freq babbin (3) - 4 freq bardic (3) - 5 freq verbisan (3) - 3 freq |
barbican (0) - 1 freq barbarian (4) - 2 freq barberin (4) - 1 freq barbecue (4) - 8 freq barkin (5) - 27 freq babicka (5) - 1 freq barbar (5) - 29 freq serbian (5) - 1 freq burrian (5) - 1 freq bargin (5) - 2 freq barkan (5) - 2 freq barlic (5) - 1 freq birian (5) - 1 freq barbera (5) - 1 freq brian (5) - 581 freq barbecued (5) - 1 freq bribin (5) - 1 freq bracin (5) - 2 freq birblin (5) - 1 freq rubicon (5) - 3 freq barbra (5) - 1 freq barin (5) - 4 freq aafrican (5) - 1 freq orbitan (5) - 2 freq corsican (5) - 4 freq |
SoundEx code - B612 bare-faced - 4 freq barefaced - 2 freq bravest - 5 freq brae-face - 6 freq braeface - 3 freq barra-boys - 1 freq barbecue - 8 freq brawbuskit - 1 freq barbican - 1 freq briefcase - 12 freq briefs - 2 freq barbs - 1 freq bribes - 2 freq barbecues - 1 freq barabbas - 4 freq barbecued - 1 freq braves - 3 freq barbies - 3 freq barbeeeq - 1 freq brbzg - 1 freq barrabest - 2 freq briefcaseni - 1 freq barrowafc - 1 freq |
MetaPhone code - BRBKN barbican - 1 freq |
BARBICAN |
| Time to execute Levenshtein function - 0.381681 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.622377 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.029346 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.081253 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.000857 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. |