| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| burlin (0) - 8 freq birlin (1) - 156 freq bulin (1) - 1 freq hurlin (1) - 21 freq surlin (1) - 1 freq burnin (1) - 131 freq furlin (1) - 15 freq berlin (1) - 14 freq gurlin (1) - 4 freq butlin (1) - 2 freq buryin (1) - 6 freq purlin (1) - 1 freq curlin (1) - 17 freq burpin (1) - 1 freq buntin (2) - 4 freq furmin (2) - 1 freq burton (2) - 2 freq bylin (2) - 13 freq tursin (2) - 1 freq barfin (2) - 1 freq wullin (2) - 23 freq ballin (2) - 3 freq butlins (2) - 1 freq fulin (2) - 2 freq curlit (2) - 1 freq |
burlin (0) - 8 freq birlin (1) - 156 freq berlin (1) - 14 freq buryin (2) - 6 freq purlin (2) - 1 freq butlin (2) - 2 freq birlan (2) - 18 freq brolin (2) - 1 freq curlin (2) - 17 freq burpin (2) - 1 freq gurlin (2) - 4 freq bulin (2) - 1 freq surlin (2) - 1 freq hurlin (2) - 21 freq burnin (2) - 131 freq furlin (2) - 15 freq burron (3) - 1 freq birlinn (3) - 8 freq boilin (3) - 6 freq birling (3) - 1 freq berkin (3) - 1 freq bardin (3) - 1 freq burren (3) - 1 freq bealin (3) - 32 freq burran (3) - 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 - BRLN birlin - 156 freq barrelin - 1 freq burlin - 8 freq barlinnie - 7 freq birlinn - 8 freq birlan - 18 freq berlin - 14 freq brawlin' - 1 freq brøllin - 1 freq brölin - 1 freq brallin - 1 freq brolin - 1 freq |
BURLIN |
| Time to execute Levenshtein function - 0.207670 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.466880 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.036792 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.040060 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.001066 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. |