Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
biler (0) - 8 freq boiler (1) - 4 freq biled (1) - 38 freq bilet (1) - 3 freq byler (1) - 3 freq baler (1) - 4 freq biyler (1) - 1 freq bileq (1) - 1 freq biter (1) - 1 freq bile (1) - 56 freq b'iler (1) - 1 freq wiler (1) - 1 freq biles (1) - 14 freq bilers (1) - 1 freq biker (1) - 3 freq bier (1) - 3 freq wilder (2) - 4 freq riled (2) - 9 freq blem (2) - 2 freq bigder (2) - 7 freq bale (2) - 8 freq ainer (2) - 2 freq biked (2) - 1 freq uiser (2) - 5 freq ilev (2) - 1 freq |
biler (0) - 8 freq baler (1) - 4 freq byler (1) - 3 freq biyler (1) - 1 freq boiler (1) - 4 freq beyler (2) - 1 freq bier (2) - 3 freq balr (2) - 1 freq bluer (2) - 1 freq bolero (2) - 2 freq biker (2) - 3 freq blur (2) - 14 freq blear (2) - 3 freq bilers (2) - 1 freq bileq (2) - 1 freq bilet (2) - 3 freq biled (2) - 38 freq biter (2) - 1 freq bile (2) - 56 freq biles (2) - 14 freq wiler (2) - 1 freq b'iler (2) - 1 freq be'er (3) - 1 freq wler (3) - 1 freq bole (3) - 4 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 |
BILER |
Time to execute Levenshtein function - 0.226027 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.354026 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.029205 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.037088 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.000892 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. |