| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bruilyiement (0) - 1 freq bruiliement (1) - 1 freq brulziement (2) - 1 freq bruilyie (4) - 1 freq brillident (4) - 1 freq griement (5) - 1 freq brulyie (5) - 1 freq bellement (5) - 3 freq habiliment (5) - 1 freq muivement (5) - 37 freq brilliant (5) - 161 freq buildeen (5) - 1 freq juidgement (5) - 1 freq fulfilment (5) - 1 freq bumbazement (5) - 6 freq replacement (5) - 12 freq argiement (5) - 25 freq airgiement (5) - 2 freq perliement (5) - 1 freq praisident (6) - 2 freq believe't (6) - 4 freq braisent (6) - 2 freq pliament (6) - 1 freq ornyment (6) - 1 freq bainishment (6) - 1 freq |
bruilyiement (0) - 1 freq bruiliement (1) - 1 freq brulziement (3) - 1 freq perliement (6) - 1 freq bellement (6) - 3 freq brilliant (6) - 161 freq brillident (6) - 1 freq airgiement (7) - 2 freq derailment (7) - 2 freq argiement (7) - 25 freq bereavement (7) - 4 freq bruilyie (7) - 1 freq rolment (7) - 1 freq parliament (7) - 77 freq brillant (7) - 1 freq habiliment (7) - 1 freq griement (7) - 1 freq pairliament (7) - 68 freq brawment (7) - 1 freq brillaint (7) - 1 freq element (8) - 45 freq devilment (8) - 3 freq obligement (8) - 2 freq airgiment (8) - 1 freq argiment (8) - 2 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 - BRLYMNT bruilyiement - 1 freq |
BRUILYIEMENT |
| Time to execute Levenshtein function - 0.252208 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.488727 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.031945 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.041712 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.000988 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. |