Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
bleurgh (0) - 1 freq bleuch (2) - 2 freq pleugh (2) - 2 freq burgh (2) - 18 freq blush (3) - 11 freq lurgy (3) - 1 freq clergy (3) - 2 freq bleenge (3) - 1 freq blarge (3) - 1 freq lurch (3) - 6 freq pleuch (3) - 12 freq blear (3) - 3 freq bleert (3) - 1 freq bleudy (3) - 1 freq cleuch (3) - 18 freq beuch (3) - 2 freq blurr (3) - 1 freq bleers (3) - 1 freq teugh (3) - 1 freq blur (3) - 14 freq berth (3) - 21 freq burg (3) - 1 freq bleirit (3) - 2 freq leuch (3) - 96 freq blugga (3) - 3 freq |
bleurgh (0) - 1 freq burgh (3) - 18 freq brugh (4) - 2 freq brough (4) - 5 freq blarge (4) - 1 freq beragh (4) - 2 freq pleugh (4) - 2 freq bleuch (4) - 2 freq emburgh (5) - 1 freq bleart (5) - 5 freq blemish (5) - 1 freq laugh (5) - 260 freq reugh (5) - 1 freq plough (5) - 7 freq bleered (5) - 1 freq €˜urgh (5) - 2 freq bleared (5) - 7 freq bleach (5) - 13 freq bleary (5) - 7 freq urgh (5) - 2 freq blurt (5) - 1 freq burghs (5) - 7 freq leigh (5) - 2 freq berg (5) - 1 freq sleigh (5) - 9 freq |
SoundEx code - B462 bleers - 1 freq blears - 2 freq blair's - 1 freq bilers - 1 freq blairgowrie - 4 freq balers - 1 freq ballyraggin - 1 freq blarge - 1 freq bullers - 2 freq biler's - 1 freq bylers - 2 freq boiler-suit - 1 freq blurs - 1 freq bylerhoose - 5 freq boolers - 1 freq belarussian - 1 freq blorachin - 1 freq bylerhous - 1 freq bulrush - 1 freq blairius - 1 freq bilerhoose - 2 freq boiler-hoose - 1 freq belarusian - 7 freq belarus - 3 freq blarged - 1 freq blairkaylor - 2 freq blairhaugh - 1 freq blowers - 1 freq bleurgh - 1 freq byler's - 1 freq |
MetaPhone code - BLRF belly-rive - 1 freq bleurgh - 1 freq |
BLEURGH |
Time to execute Levenshtein function - 0.286750 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.411358 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.029260 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.040237 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.000897 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. |