Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
buik-leet (0) - 1 freq buik-leets (1) - 1 freq buik-lear (2) - 2 freq wurd-leet (3) - 1 freq buikless (3) - 1 freq bucklet (3) - 1 freq buik-lair (3) - 1 freq birslet (4) - 1 freq big-wee (4) - 1 freq puilee (4) - 1 freq bile't (4) - 1 freq buckle (4) - 12 freq buckshee (4) - 3 freq brig-jeest (4) - 1 freq buckled (4) - 7 freq billet (4) - 1 freq six-feet (4) - 1 freq bukklers (4) - 1 freq um-eet (4) - 1 freq boileen (4) - 1 freq guid-een (4) - 1 freq buirdlie (4) - 3 freq buildit (4) - 1 freq bucket (4) - 75 freq mucklest (4) - 8 freq |
buik-leet (0) - 1 freq buik-leets (2) - 1 freq buik-lear (3) - 2 freq buik-lair (4) - 1 freq bucklet (5) - 1 freq booklet (5) - 5 freq bundlet (6) - 2 freq bucklit (6) - 1 freq built (6) - 123 freq back-seat (6) - 1 freq bleet (6) - 2 freq buckelt (6) - 2 freq bilet (6) - 3 freq bucklt (6) - 2 freq bullet (6) - 32 freq buik-room (6) - 1 freq buikless (6) - 1 freq birslet (6) - 1 freq wurd-leet (6) - 1 freq billet (6) - 1 freq backlit (7) - 1 freq baikit (7) - 1 freq be-eft (7) - 1 freq luik-alike (7) - 1 freq sik-like (7) - 2 freq |
SoundEx code - B243 bauchled - 6 freq bogleheid - 1 freq buckled - 7 freq bauchelt - 3 freq bakelite - 3 freq booklet - 5 freq bachlt - 1 freq boggle-eed - 1 freq bachled - 1 freq bucklt - 2 freq bekalite - 1 freq backslide - 1 freq basalt - 2 freq buik-leet - 1 freq buik-leets - 1 freq bauchilt - 2 freq bi-cultural - 1 freq bucklit - 1 freq buckelt - 2 freq becloods - 1 freq backcloth - 1 freq backlit - 1 freq back-claiths - 1 freq backslider - 1 freq backsliders - 1 freq bauchlet - 1 freq bucklet - 1 freq boglet - 1 freq bzlitwvj - 1 freq backsliding - 1 freq bighollywood - 3 freq |
MetaPhone code - BKLT buckled - 7 freq bakelite - 3 freq booklet - 5 freq boggle-eed - 1 freq bucklt - 2 freq bekalite - 1 freq buik-leet - 1 freq bucklit - 1 freq buckelt - 2 freq backlit - 1 freq bucklet - 1 freq boglet - 1 freq |
BUIK-LEET |
Time to execute Levenshtein function - 0.709173 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.093290 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.087214 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.098308 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.000852 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. |