| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| blears (0) - 2 freq bleats (1) - 1 freq bleers (1) - 1 freq blear (1) - 3 freq bears (1) - 37 freq lears (1) - 2 freq bleary (1) - 7 freq clears (1) - 19 freq bleart (1) - 5 freq lars (2) - 1 freq beats (2) - 34 freq 'lea's (2) - 1 freq lear's (2) - 1 freq gears (2) - 15 freq rears (2) - 2 freq fleas (2) - 13 freq boers (2) - 1 freq bleery (2) - 1 freq bilers (2) - 1 freq wears (2) - 55 freq leary (2) - 1 freq beaks (2) - 7 freq cleart (2) - 9 freq 'ears (2) - 8 freq blewarts (2) - 2 freq |
blears (0) - 2 freq bleers (1) - 1 freq balers (2) - 1 freq bleats (2) - 1 freq blurs (2) - 1 freq bilers (2) - 1 freq bylers (2) - 2 freq bleart (2) - 5 freq clears (2) - 19 freq blear (2) - 3 freq bears (2) - 37 freq lears (2) - 2 freq bleary (2) - 7 freq bleared (3) - 7 freq baars (3) - 1 freq blaa's (3) - 1 freq bleeds (3) - 6 freq bless (3) - 44 freq blads (3) - 9 freq gleers (3) - 1 freq blens (3) - 1 freq boars (3) - 3 freq blearie (3) - 5 freq leirs (3) - 1 freq blaws (3) - 55 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 - BLRS bleers - 1 freq blears - 2 freq blair's - 1 freq bilers - 1 freq balers - 1 freq bullers - 2 freq biler's - 1 freq bylers - 2 freq blurs - 1 freq boolers - 1 freq blairius - 1 freq belarus - 3 freq byler's - 1 freq |
BLEARS |
| Time to execute Levenshtein function - 0.490951 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 - 1.082930 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.093202 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.107306 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.000873 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. |