| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| barrowlands (0) - 2 freq barrowload (3) - 1 freq barrowman (3) - 1 freq bruntlands (4) - 4 freq lowlands (4) - 5 freq €œlowlands (4) - 1 freq garlands (4) - 2 freq hairtlands (4) - 1 freq barrowafc (4) - 1 freq barrows (4) - 1 freq lawlands (4) - 4 freq cartlands (4) - 1 freq backlands (4) - 1 freq boglands (4) - 1 freq aeroplanes (4) - 3 freq barronis (4) - 1 freq borderlands (4) - 2 freq marrows (5) - 1 freq marra-banes (5) - 1 freq bollards (5) - 2 freq harrowing (5) - 1 freq brediland (5) - 2 freq barbarians (5) - 2 freq baryons (5) - 1 freq narrowed (5) - 5 freq |
barrowlands (0) - 2 freq barrowload (5) - 1 freq borderlands (6) - 2 freq bruntlands (6) - 4 freq barrowman (6) - 1 freq backlands (7) - 1 freq boglands (7) - 1 freq cartlands (7) - 1 freq barronis (7) - 1 freq lawlands (7) - 4 freq €œlowlands (7) - 1 freq lowlands (7) - 5 freq hairtlands (7) - 1 freq garlands (7) - 2 freq barrows (7) - 1 freq surroonds (8) - 3 freq browls (8) - 2 freq birthland's (8) - 1 freq sirroonds (8) - 1 freq heartlands (8) - 2 freq brown's (8) - 6 freq brigands (8) - 1 freq barrelled (8) - 3 freq prowlandson (8) - 1 freq barelins (8) - 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 - BRLNTS barrowlands - 2 freq |
BARROWLANDS |
| Time to execute Levenshtein function - 0.205214 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.367842 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.027657 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.037528 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.000881 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. |