| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barelins (0) - 1 freq darlins (2) - 4 freq barnekins (2) - 1 freq baegins (2) - 1 freq darklins (2) - 1 freq backlins (2) - 18 freq bargains (2) - 7 freq baklins (2) - 7 freq baseline (2) - 2 freq barins (2) - 4 freq birlins (2) - 1 freq hamelins (2) - 1 freq javelins (2) - 4 freq ravelins (2) - 1 freq warslins (2) - 1 freq barrelin (2) - 1 freq bawling (3) - 1 freq bardin (3) - 1 freq yirdlins (3) - 1 freq garglin (3) - 2 freq brekin (3) - 7 freq truelins (3) - 4 freq barfin (3) - 1 freq careyin (3) - 1 freq bareness (3) - 1 freq |
barelins (0) - 1 freq birlins (2) - 1 freq baklins (3) - 7 freq bargains (3) - 7 freq barins (3) - 4 freq darlins (3) - 4 freq perlins (4) - 3 freq brenns (4) - 1 freq beareens (4) - 1 freq butlins (4) - 1 freq barnis (4) - 1 freq railins (4) - 22 freq nearlins (4) - 6 freq norlins (4) - 1 freq burlin (4) - 8 freq brains (4) - 60 freq borealis (4) - 2 freq yirlins (4) - 1 freq burnins (4) - 1 freq barleys (4) - 1 freq derlins (4) - 1 freq yorlins (4) - 3 freq carlines (4) - 3 freq barls (4) - 1 freq barns (4) - 8 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 - BRLNS barelins - 1 freq birlins - 1 freq brilliance - 11 freq |
BARELINS |
| Time to execute Levenshtein function - 0.314634 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.552096 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.027694 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.074575 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.006033 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. |