| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| berlin (0) - 14 freq birlin (1) - 154 freq bellin (1) - 3 freq merlin (1) - 6 freq beelin (1) - 22 freq beilin (1) - 3 freq beylin (1) - 1 freq berkin (1) - 1 freq bealin (1) - 32 freq burlin (1) - 8 freq derlin (1) - 1 freq eryin (2) - 3 freq borrin (2) - 1 freq mellin (2) - 64 freq bearin (2) - 28 freq erline (2) - 1 freq purlin (2) - 1 freq bekkin (2) - 1 freq derklin (2) - 1 freq pewlin (2) - 1 freq bailin (2) - 3 freq ballin (2) - 3 freq yerkin (2) - 4 freq gerkin (2) - 1 freq werrin (2) - 3 freq |
berlin (0) - 14 freq birlin (1) - 154 freq burlin (1) - 8 freq bealin (2) - 32 freq brolin (2) - 1 freq berkin (2) - 1 freq derlin (2) - 1 freq birlan (2) - 18 freq beylin (2) - 1 freq merlin (2) - 6 freq bellin (2) - 3 freq beelin (2) - 22 freq beilin (2) - 3 freq barlic (3) - 1 freq boolin (3) - 16 freq birling (3) - 1 freq reelin (3) - 16 freq birlins (3) - 1 freq birlinn (3) - 8 freq borin (3) - 46 freq bardin (3) - 1 freq norlin (3) - 170 freq bilin (3) - 41 freq bulin (3) - 1 freq beeryin (3) - 1 freq |
SoundEx code - B645 birlin - 154 freq brilliant - 158 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 - 154 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.179341 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.338453 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.027342 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.037993 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.000851 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. |