| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| baurley-bree (0) - 1 freq barley-bree (1) - 1 freq care-free (5) - 1 freq bracky-bree (5) - 4 freq baurley (5) - 2 freq brummil-bree (5) - 1 freq bluey-green (5) - 1 freq barleycorn (5) - 8 freq aiple-tree (5) - 1 freq dule-tree (5) - 1 freq allez-bleu (6) - 1 freq purple-green (6) - 1 freq aipple-tree (6) - 1 freq argle-barle (6) - 1 freq bull-bate (6) - 3 freq burley (6) - 1 freq bullybeef (6) - 1 freq bare-arsed (6) - 1 freq baudelaire (6) - 81 freq alc-free (6) - 1 freq carefree (6) - 6 freq baw-bee (6) - 1 freq burd's-ee (6) - 1 freq epple-tree (6) - 1 freq fancy-free (6) - 2 freq |
baurley-bree (0) - 1 freq barley-bree (1) - 1 freq bracky-bree (7) - 4 freq brummil-bree (7) - 1 freq bull-bate (8) - 3 freq blue-grey (8) - 3 freq barley-sugar (8) - 3 freq bairn-bed (8) - 1 freq hurly-burly (8) - 3 freq blue-blae (8) - 1 freq baurley (8) - 2 freq care-free (8) - 1 freq barleycorn (8) - 8 freq aiple-tree (8) - 1 freq bluey-green (8) - 1 freq dule-tree (8) - 1 freq bare-banes (9) - 1 freq barleys (9) - 1 freq faur-ben (9) - 1 freq grey-blue (9) - 3 freq bourtree (9) - 3 freq barbra (9) - 1 freq barley (9) - 33 freq reek-free (9) - 1 freq kirk-brae (9) - 1 freq |
SoundEx code - B641 bye-yer-leave - 1 freq beirial-beakers - 1 freq barley-bree - 1 freq baurley-bree - 1 freq brulafu - 1 freq |
MetaPhone code - BRLBR barley-bree - 1 freq baurley-bree - 1 freq |
BAURLEY-BREE |
| Time to execute Levenshtein function - 0.223826 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.405479 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.027907 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.041021 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.000893 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. |