| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| broomloan (0) - 1 freq brooooon (3) - 1 freq blooman (3) - 8 freq broodan (3) - 1 freq booman (3) - 2 freq brooklyn (3) - 2 freq brownlea (4) - 1 freq brokkan (4) - 1 freq bristlan (4) - 1 freq croonan (4) - 1 freq bloomeen (4) - 1 freq borman (4) - 1 freq brolin (4) - 1 freq brimman (4) - 1 freq roostan (4) - 1 freq rollon (4) - 1 freq bloomin (4) - 28 freq plooman (4) - 8 freq rollan (4) - 2 freq bookan (4) - 1 freq bemoan (4) - 1 freq broon (4) - 500 freq brazilian (4) - 1 freq rootan (4) - 1 freq drookleen (4) - 1 freq |
broomloan (0) - 1 freq brooklyn (4) - 2 freq borman (5) - 1 freq brolin (5) - 1 freq rumlan (5) - 1 freq brazilian (5) - 1 freq broomielaw (5) - 2 freq brimman (5) - 1 freq brooooon (5) - 1 freq broodan (5) - 1 freq blooman (5) - 8 freq booman (5) - 2 freq broom (6) - 18 freq boolin (6) - 16 freq groomin (6) - 4 freq broonin (6) - 2 freq croodlin (6) - 5 freq broodin (6) - 5 freq droolin (6) - 3 freq broona (6) - 1 freq broostlin (6) - 1 freq brimmin (6) - 13 freq bycommon (6) - 2 freq becoman (6) - 2 freq growlan (6) - 3 freq |
SoundEx code - B654 brimless - 1 freq brammles - 10 freq brammle - 2 freq bairnless - 3 freq brainless - 1 freq bairn'll - 7 freq bairnlik - 1 freq bairnlike - 4 freq brummles - 4 freq brownlee - 1 freq bairn-life - 2 freq bairmless - 2 freq broomielaw - 2 freq beremeal - 1 freq bramleys - 1 freq beremael - 1 freq bermeal - 1 freq brummil-bree - 1 freq brummils - 2 freq brummil - 2 freq baronial - 1 freq brammils - 1 freq broomloan - 1 freq bairn-less - 1 freq brummle - 1 freq bairn-like - 1 freq bairn-likeness - 1 freq brownlea - 1 freq bairnlie - 2 freq bairnly - 1 freq broomhilldons - 6 freq barrmill - 2 freq barnhill - 1 freq brianelliman - 1 freq burnleyofficial - 1 freq brianwilliamrob - 1 freq broomhall - 1 freq bryanwilson - 1 freq barriehamill - 1 freq |
MetaPhone code - BRMLN broomloan - 1 freq |
BROOMLOAN |
| Time to execute Levenshtein function - 0.244912 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.621512 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.039026 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.042858 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. |