Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
byler (0) - 3 freq byle (1) - 16 freq byker (1) - 1 freq byled (1) - 3 freq baler (1) - 4 freq biler (1) - 8 freq biyler (1) - 1 freq byles (1) - 5 freq beyler (1) - 1 freq bylers (1) - 2 freq tyler (1) - 15 freq yle (2) - 2 freq brier (2) - 5 freq fyber (2) - 1 freq blen (2) - 1 freq bilers (2) - 1 freq ryder (2) - 1 freq bale (2) - 8 freq blem (2) - 2 freq bye (2) - 115 freq syver (2) - 4 freq byfe (2) - 1 freq bylt (2) - 7 freq byke (2) - 8 freq fyled (2) - 4 freq |
byler (0) - 3 freq biler (1) - 8 freq beyler (1) - 1 freq biyler (1) - 1 freq baler (1) - 4 freq bolero (2) - 2 freq balr (2) - 1 freq blur (2) - 14 freq boiler (2) - 4 freq bluer (2) - 1 freq blear (2) - 3 freq byled (2) - 3 freq byker (2) - 1 freq byle (2) - 16 freq bylers (2) - 2 freq byles (2) - 5 freq tyler (2) - 15 freq baled (3) - 2 freq bylie (3) - 1 freq blew (3) - 117 freq bile (3) - 56 freq tylor (3) - 1 freq bynear (3) - 2 freq bu'er (3) - 2 freq aller (3) - 2 freq |
SoundEx code - B460 biler - 8 freq bellower - 1 freq boiler - 4 freq blearie - 5 freq blair' - 1 freq blair - 62 freq bleery - 1 freq blur - 14 freq bleary - 7 freq blare - 3 freq blurr - 1 freq beyler - 1 freq b'iler - 1 freq blirry - 1 freq blurry - 7 freq bueller - 1 freq baler - 4 freq byler - 3 freq bolero - 2 freq blear - 3 freq blue-ray - 1 freq bluer - 1 freq biyler - 1 freq blower - 2 freq €˜blawearie - 1 freq blawearie - 2 freq bliree - 1 freq balr - 1 freq blauweerie - 1 freq |
MetaPhone code - BLR biler - 8 freq boiler - 4 freq blearie - 5 freq blair' - 1 freq blair - 62 freq bleery - 1 freq blur - 14 freq bleary - 7 freq blare - 3 freq blurr - 1 freq beyler - 1 freq b'iler - 1 freq blirry - 1 freq blurry - 7 freq bueller - 1 freq baler - 4 freq byler - 3 freq bolero - 2 freq blear - 3 freq blue-ray - 1 freq bluer - 1 freq biyler - 1 freq bliree - 1 freq balr - 1 freq |
BYLER |
Time to execute Levenshtein function - 0.183453 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.358785 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.028307 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.038784 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.000915 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. |