| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bruilyie (0) - 1 freq brulyie (1) - 1 freq brulzie (2) - 1 freq tuilyie (2) - 2 freq bruil (3) - 1 freq baillie (3) - 17 freq uillie (3) - 1 freq bruikit (3) - 2 freq billie (3) - 33 freq braalie (3) - 3 freq braidlie (3) - 3 freq tuilie (3) - 1 freq bluidie (3) - 15 freq bauldie (3) - 2 freq roilie (3) - 1 freq spulyie (3) - 5 freq spuilzie (3) - 1 freq bullyin (3) - 17 freq drumlie (3) - 14 freq bruisit (3) - 2 freq druiblie (3) - 1 freq bruise (3) - 15 freq bruistit (3) - 1 freq breistie (3) - 3 freq trulie (3) - 4 freq |
bruilyie (0) - 1 freq brulyie (1) - 1 freq bruil (3) - 1 freq brulzie (3) - 1 freq braalie (3) - 3 freq burly (4) - 6 freq brawlie (4) - 28 freq braali (4) - 27 freq trulie (4) - 4 freq bailie (4) - 7 freq brucie (4) - 28 freq truelie (4) - 2 freq braaly (4) - 42 freq bonilie (4) - 1 freq bridie (4) - 35 freq bruise (4) - 15 freq buile (4) - 1 freq braille (4) - 6 freq tuilyie (4) - 2 freq baillie (4) - 17 freq roilie (4) - 1 freq braidlie (4) - 3 freq billie (4) - 33 freq rilee (5) - 1 freq brice (5) - 2 freq |
SoundEx code - B640 barrel - 42 freq birl - 93 freq baurel - 2 freq bruil - 1 freq brawly - 37 freq brawlie - 28 freq barely - 97 freq burl - 6 freq barley - 33 freq bar-l - 1 freq baurley - 2 freq buirial - 4 freq brolly - 15 freq brill - 12 freq burial - 12 freq burly - 6 freq bareley - 1 freq beerial - 10 freq burrel - 1 freq braaly - 42 freq bruilyie - 1 freq brulyie - 1 freq beryl - 2 freq borrelia - 1 freq braali - 27 freq 'braali - 1 freq 'birl - 1 freq braalie - 3 freq brel - 2 freq beriall - 1 freq burrell - 4 freq berryhill - 6 freq burel - 1 freq braille - 6 freq brawl - 1 freq brally - 4 freq barolo - 1 freq birly - 10 freq €œbirly - 1 freq €œbraaly - 2 freq bheurla - 2 freq bburlu - 1 freq barl - 1 freq braally - 1 freq burley - 1 freq barlow - 1 freq beurla - 1 freq |
MetaPhone code - BRLY bruilyie - 1 freq brulyie - 1 freq |
BRUILYIE |
| Time to execute Levenshtein function - 0.210341 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.380656 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.027777 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.041754 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.000956 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. |