| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bylers (0) - 2 freq bilers (1) - 1 freq balers (1) - 1 freq byles (1) - 5 freq jylers (1) - 3 freq byler (1) - 3 freq tylers (1) - 1 freq byler's (1) - 1 freq bulders (2) - 1 freq boers (2) - 1 freq jyle's (2) - 1 freq syvers (2) - 2 freq kyles (2) - 3 freq byleid (2) - 9 freq yeers (2) - 2 freq allers (2) - 1 freq tyles (2) - 1 freq byker (2) - 1 freq wyles (2) - 2 freq splers (2) - 1 freq biler's (2) - 1 freq biler (2) - 8 freq rulers (2) - 8 freq biles (2) - 14 freq byleids (2) - 9 freq |
bylers (0) - 2 freq balers (1) - 1 freq bilers (1) - 1 freq boolers (2) - 1 freq blurs (2) - 1 freq blears (2) - 2 freq bleers (2) - 1 freq byler's (2) - 1 freq byler (2) - 3 freq tylers (2) - 1 freq byles (2) - 5 freq jylers (2) - 3 freq beers (3) - 13 freq beyler (3) - 1 freq byres (3) - 21 freq boxers (3) - 1 freq biyler (3) - 1 freq eilers (3) - 1 freq belters (3) - 6 freq boles (3) - 1 freq blebs (3) - 1 freq bless (3) - 44 freq bullers (3) - 2 freq briers (3) - 2 freq baler (3) - 4 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 |
BYLERS |
| Time to execute Levenshtein function - 0.421318 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.289777 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.087597 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.099924 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.001227 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. |