| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| brulziement (0) - 1 freq bruilyiement (2) - 1 freq bruiliement (2) - 1 freq perliement (4) - 1 freq brulzie (4) - 1 freq fulfilment (4) - 1 freq bazement (4) - 1 freq argiement (4) - 25 freq griement (4) - 1 freq brillident (4) - 1 freq bellement (4) - 3 freq implement (5) - 10 freq brulyie (5) - 1 freq airgiement (5) - 2 freq muivement (5) - 37 freq element (5) - 45 freq greement (5) - 20 freq rolment (5) - 1 freq amusement (5) - 6 freq placement (5) - 6 freq brilliant (5) - 161 freq belligerent (5) - 1 freq muivment (5) - 5 freq brawment (5) - 1 freq foundiment (5) - 1 freq |
brulziement (0) - 1 freq bruiliement (3) - 1 freq bruilyiement (3) - 1 freq brillident (6) - 1 freq bazement (6) - 1 freq bellement (6) - 3 freq perliement (6) - 1 freq bumbazement (7) - 6 freq obleigement (7) - 2 freq obligement (7) - 2 freq rolment (7) - 1 freq brawment (7) - 1 freq bereavement (7) - 4 freq argiement (7) - 25 freq griement (7) - 1 freq brulzie (7) - 1 freq brilliant (7) - 161 freq parliament (7) - 77 freq paliament (8) - 1 freq blaikent (8) - 1 freq prouncement (8) - 1 freq perlament (8) - 8 freq bremen (8) - 1 freq raiment (8) - 2 freq requirement (8) - 7 freq |
SoundEx code - B642 barleycorn - 8 freq birls - 31 freq burials - 1 freq barrels - 18 freq brylcreemt - 1 freq barley-sugar - 3 freq birrless - 4 freq burls - 5 freq barlic - 1 freq brylcreem - 3 freq browls - 2 freq barlass - 1 freq beerials - 4 freq barls - 1 freq braw-lookin - 4 freq barley-shuggar - 1 freq bröls - 1 freq barley's - 1 freq brollies - 2 freq brulzie - 1 freq beerial's - 1 freq burlesques - 1 freq borealis - 2 freq burrell's - 1 freq barrel-kistit - 1 freq beirials - 1 freq brollie's - 1 freq barleys - 1 freq brulziement - 1 freq burial-shroud - 1 freq brawlik - 1 freq barreless - 3 freq brylcream - 1 freq |
MetaPhone code - BRLSMNT brulziement - 1 freq |
BRULZIEMENT |
| Time to execute Levenshtein function - 0.271151 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.481444 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.035572 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.042929 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.001056 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. |