| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barbecues (0) - 1 freq barbecued (1) - 1 freq barbecue (1) - 7 freq breeches (3) - 1 freq baabees (3) - 1 freq barber's (3) - 3 freq barbers (3) - 3 freq barques (3) - 1 freq barbeeeq (3) - 1 freq barbies (3) - 3 freq bawbees (3) - 23 freq barbadoes (3) - 1 freq warbles (4) - 3 freq babes (4) - 5 freq aaredies (4) - 1 freq brecks (4) - 1 freq particles (4) - 6 freq parterres (4) - 1 freq bareness (4) - 1 freq barleys (4) - 1 freq arteries (4) - 5 freq careous (4) - 1 freq maybees (4) - 1 freq branches (4) - 51 freq basques (4) - 1 freq |
barbecues (0) - 1 freq barbecued (2) - 1 freq barbecue (2) - 7 freq barbies (4) - 3 freq barbadoes (4) - 1 freq barbers (4) - 3 freq barbs (5) - 1 freq bruces (5) - 13 freq braces (5) - 12 freq barbarous (5) - 3 freq brucies (5) - 4 freq barbados (5) - 6 freq barbican (5) - 1 freq barques (5) - 1 freq baabees (5) - 1 freq breeches (5) - 1 freq bawbees (5) - 23 freq barbeeeq (5) - 1 freq barber's (5) - 3 freq babbies (6) - 13 freq barley's (6) - 1 freq marbles (6) - 5 freq breenges (6) - 10 freq barbar's (6) - 5 freq bawbee's (6) - 14 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 - 7 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 - BRBKS barbecues - 1 freq |
BARBECUES |
| Time to execute Levenshtein function - 0.206665 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.346013 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.028463 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.045706 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.001046 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. |