| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bucksburn (0) - 1 freq blackburn (3) - 5 freq cockburn (3) - 9 freq busrun (4) - 1 freq backson (4) - 12 freq backhaun (4) - 1 freq buckquoy (4) - 1 freq lisburn (4) - 1 freq bucketin (4) - 2 freq beckgrun (4) - 1 freq auburn (4) - 4 freq backgrunn (4) - 1 freq backburner (4) - 1 freq bucklin (4) - 7 freq buckin (4) - 3 freq backbeen (4) - 1 freq buckshee (4) - 3 freq burbury (4) - 2 freq cockburns (4) - 2 freq quicksaun (4) - 2 freq buckhaven (4) - 1 freq coburn (4) - 3 freq bucks (4) - 8 freq back-burden (4) - 1 freq backgrun (4) - 16 freq |
bucksburn (0) - 1 freq cockburn (5) - 9 freq blackburn (5) - 5 freq beckgrun (6) - 1 freq backburner (6) - 1 freq backbeen (6) - 1 freq backspeirin (6) - 4 freq back-burden (6) - 1 freq backson (6) - 12 freq backgrun (6) - 16 freq bukksin (7) - 1 freq blackburd (7) - 1 freq broxburn (7) - 5 freq backspeirt (7) - 1 freq bookbairn (7) - 2 freq backbone (7) - 1 freq back-burdeen (7) - 1 freq nickybyrne (7) - 4 freq backgroon (7) - 1 freq bucks (7) - 8 freq bickerin (7) - 7 freq backbane (7) - 2 freq coburn (7) - 3 freq bucklin (7) - 7 freq bucketin (7) - 2 freq |
SoundEx code - B216 backfired - 3 freq backburner - 1 freq back-brakin - 1 freq backspeirin - 4 freq back-brekin' - 1 freq back-a-fore - 1 freq back-breakin - 1 freq back-speirin - 1 freq backspeirt - 1 freq bishopbriggs - 1 freq back-burdeen - 1 freq back-burdeens - 1 freq back-burden - 1 freq baccy-broon - 1 freq biosphere - 2 freq bucksburn - 1 freq back-buirds - 1 freq boys-fur-rags - 2 freq backfires - 1 freq byjavers - 1 freq bigbirds - 1 freq bbcsport - 5 freq bbcsportscot - 18 freq backfire - 1 freq bigburnssupper - 1 freq bbcsportsound - 6 freq bbcfour - 2 freq bqzjprojuf - 1 freq bkprimary - 2 freq bookbairn - 2 freq bbcsportwales - 1 freq bshipyardfc - 1 freq bbcspringwatch - 1 freq |
MetaPhone code - BKSBRN baccy-broon - 1 freq bucksburn - 1 freq |
BUCKSBURN |
| Time to execute Levenshtein function - 0.235158 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.465364 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.033188 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.038658 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.000982 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. |