| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barleycorn (0) - 7 freq barneyin (4) - 1 freq barley-bree (4) - 1 freq barleys (4) - 1 freq carleton (4) - 1 freq bardlorn (4) - 1 freq ballycairn (4) - 1 freq haycorn (4) - 2 freq alcorn (4) - 7 freq carsethorn (4) - 5 freq barley (4) - 31 freq careworn (4) - 1 freq aibercorn (4) - 2 freq barley's (4) - 1 freq balerno (5) - 2 freq barbers (5) - 3 freq bryson (5) - 2 freq baneyerd (5) - 1 freq parlor (5) - 1 freq barron (5) - 7 freq barber (5) - 7 freq baldoon (5) - 1 freq breton (5) - 5 freq bastern (5) - 2 freq barren (5) - 15 freq |
barleycorn (0) - 7 freq ballycairn (5) - 1 freq aibercorn (5) - 2 freq alcorn (6) - 7 freq bardlorn (6) - 1 freq bleckin (7) - 1 freq barcelone (7) - 1 freq barcelona (7) - 10 freq shilcorn (7) - 2 freq balcormo (7) - 1 freq brechin (7) - 14 freq barberin (7) - 1 freq barterin (7) - 1 freq ballycarry (7) - 4 freq bleachin (7) - 4 freq brethern (7) - 3 freq breckin (7) - 2 freq barneyin (7) - 1 freq barlic (7) - 1 freq barroun (7) - 1 freq barren (7) - 15 freq balcony (7) - 19 freq forlorn (7) - 8 freq barbican (7) - 1 freq carleton (7) - 1 freq |
SoundEx code - B642 barleycorn - 7 freq birls - 31 freq burials - 1 freq barrels - 18 freq brylcreemt - 1 freq barley-sugar - 3 freq birrless - 4 freq burls - 5 freq barlic - 1 freq brylcreem - 3 freq browls - 2 freq barlass - 1 freq beerials - 4 freq barls - 1 freq braw-lookin - 4 freq barley-shuggar - 1 freq bröls - 1 freq barley's - 1 freq brollies - 2 freq brulzie - 1 freq beerial's - 1 freq burlesques - 1 freq borealis - 2 freq burrell's - 1 freq barrel-kistit - 1 freq beirials - 1 freq brollie's - 1 freq barleys - 1 freq brulziement - 1 freq burial-shroud - 1 freq brawlik - 1 freq barreless - 3 freq brylcream - 1 freq |
MetaPhone code - BRLKRN barleycorn - 7 freq |
BARLEYCORN |
| Time to execute Levenshtein function - 0.186979 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.339139 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.027725 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.037138 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.000840 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. |