Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
brulyie (0) - 1 freq brulzie (1) - 1 freq bruilyie (1) - 1 freq bulfie (2) - 1 freq brucie (2) - 28 freq brummie (2) - 1 freq fulyie (2) - 2 freq bauldie (2) - 2 freq spulyie (2) - 5 freq trulie (2) - 4 freq tulyie (2) - 6 freq bruntie (2) - 6 freq brodie (3) - 4 freq sulie (3) - 1 freq bruckit (3) - 3 freq fulie (3) - 1 freq bryce (3) - 5 freq blyue (3) - 1 freq ruthie (3) - 4 freq brollies (3) - 2 freq paulie (3) - 1 freq grumfie (3) - 1 freq grunnie (3) - 13 freq renyie (3) - 1 freq relyin (3) - 7 freq |
brulyie (0) - 1 freq bruilyie (1) - 1 freq brulzie (2) - 1 freq braalie (3) - 3 freq trulie (3) - 4 freq bruil (3) - 1 freq brucie (3) - 28 freq bruit (4) - 7 freq barely (4) - 96 freq boule (4) - 3 freq blye (4) - 2 freq birly (4) - 10 freq rule (4) - 164 freq bradie (4) - 1 freq bryde (4) - 2 freq bourie (4) - 5 freq bailie (4) - 6 freq burnie (4) - 16 freq belie (4) - 2 freq bylie (4) - 1 freq unrulie (4) - 1 freq brusi (4) - 25 freq brolin (4) - 1 freq brulafu (4) - 1 freq baillie (4) - 17 freq |
SoundEx code - B640 barrel - 40 freq birl - 92 freq baurel - 2 freq bruil - 1 freq brawly - 36 freq brawlie - 28 freq barely - 96 freq burl - 6 freq barley - 31 freq bar-l - 1 freq baurley - 2 freq buirial - 4 freq brolly - 15 freq brill - 12 freq burial - 12 freq burly - 5 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 |
BRULYIE |
Time to execute Levenshtein function - 0.359296 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.763982 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.066970 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.040144 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. |