| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| berlin (0) - 14 freq derlin (1) - 1 freq berkin (1) - 1 freq beilin (1) - 3 freq burlin (1) - 8 freq birlin (1) - 156 freq beelin (1) - 22 freq beylin (1) - 1 freq bealin (1) - 32 freq merlin (1) - 6 freq bellin (1) - 3 freq gurlin (2) - 4 freq birzin (2) - 3 freq birrin (2) - 4 freq belic (2) - 1 freq herkin (2) - 3 freq bekkin (2) - 1 freq bedein (2) - 2 freq bulin (2) - 1 freq tirlin (2) - 13 freq ballin (2) - 3 freq besoin (2) - 1 freq heilin (2) - 1 freq herdin (2) - 15 freq aerlie (2) - 10 freq |
berlin (0) - 14 freq burlin (1) - 8 freq birlin (1) - 156 freq merlin (2) - 6 freq birlan (2) - 18 freq brolin (2) - 1 freq bealin (2) - 32 freq bellin (2) - 3 freq beylin (2) - 1 freq berkin (2) - 1 freq derlin (2) - 1 freq beelin (2) - 22 freq beilin (2) - 3 freq birblin (3) - 1 freq bern (3) - 10 freq barjin (3) - 2 freq norlin (3) - 171 freq erline (3) - 1 freq curlin (3) - 17 freq barlic (3) - 1 freq beeline (3) - 3 freq burnin (3) - 131 freq dirlin (3) - 45 freq bawlin (3) - 19 freq mirlin (3) - 3 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 |
BERLIN |
| Time to execute Levenshtein function - 0.209584 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.447559 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.027591 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.037435 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.000978 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. |