| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| birlinnbooks (0) - 1 freq birlinn (5) - 8 freq rinaboots (5) - 1 freq beltiebooks (5) - 1 freq birlins (5) - 1 freq ionabooks (5) - 1 freq rounaboots (6) - 1 freq mirligoes (6) - 3 freq billions (6) - 7 freq hornbook (6) - 2 freq hiraboots (6) - 2 freq birlin (6) - 156 freq hymn-books (6) - 1 freq brooks (6) - 4 freq galileobooks (6) - 1 freq birling (6) - 1 freq rainbows (6) - 2 freq rainbow's (6) - 1 freq lesson-books (6) - 5 freq sittinrooms (6) - 1 freq springboords (6) - 1 freq freightbooks (6) - 1 freq barlinnie (6) - 7 freq brinks (6) - 1 freq blinns (6) - 1 freq |
birlinnbooks (0) - 1 freq birlins (8) - 1 freq birlinn (8) - 8 freq beltiebooks (8) - 1 freq polygonbooks (9) - 1 freq binnacks (9) - 1 freq barlornock (9) - 1 freq brinks (9) - 1 freq blinks (9) - 14 freq barlinnie (9) - 7 freq blinns (9) - 1 freq airlann's (9) - 1 freq blinness (9) - 4 freq bannocks (9) - 42 freq ionabooks (9) - 1 freq rinaboots (9) - 1 freq blahniks (10) - 1 freq birlin-gunn (10) - 1 freq bibliothecks (10) - 2 freq roonaboots (10) - 3 freq blanks (10) - 3 freq binnock (10) - 1 freq burnins (10) - 1 freq blonnie's (10) - 1 freq burnbanksy (10) - 1 freq |
SoundEx code - B645 birlin - 156 freq brilliant - 161 freq barelins - 1 freq barrelin - 1 freq burlin - 8 freq barlinnie - 7 freq birlinn - 8 freq birlins - 1 freq birlan - 18 freq berlin - 14 freq brillant - 1 freq brawlin' - 1 freq brilliance - 11 freq brøllin - 1 freq brölin - 1 freq birlin-gunn - 1 freq bruilyiement - 1 freq brilliantly - 2 freq braelanders - 1 freq brallin - 1 freq bruiliement - 1 freq birling - 1 freq birlling - 1 freq birlinnbooks - 1 freq brolin - 1 freq barrowlands - 2 freq brillaint - 1 freq |
MetaPhone code - BRLNBKS birlinnbooks - 1 freq |
BIRLINNBOOKS |
| Time to execute Levenshtein function - 0.238869 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.390796 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.027403 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.038461 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.000925 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. |