| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| buik-leets (0) - 1 freq buik-leet (1) - 1 freq buik-lear (3) - 2 freq buikless (3) - 1 freq bukklers (4) - 1 freq buik-shops (4) - 2 freq buitless (4) - 1 freq buik-lair (4) - 1 freq buikies (4) - 3 freq buckets (4) - 25 freq bullets (4) - 29 freq backleens (4) - 1 freq buikskelfs (4) - 1 freq buckles (4) - 2 freq bucklet (4) - 1 freq builders (4) - 10 freq bukkets (4) - 1 freq bikelists (4) - 1 freq wurd-leet (4) - 1 freq billets (4) - 3 freq bullet (5) - 32 freq brak-oots (5) - 1 freq buik-shelves (5) - 1 freq muinless (5) - 4 freq builder (5) - 14 freq |
buik-leets (0) - 1 freq buik-leet (2) - 1 freq buikless (5) - 1 freq buik-lear (5) - 2 freq bukkets (6) - 1 freq bullets (6) - 29 freq bikelists (6) - 1 freq billets (6) - 3 freq buik-lair (6) - 1 freq bukklers (6) - 1 freq booklet (7) - 5 freq bleats (7) - 1 freq bracelets (7) - 3 freq breek-legs (7) - 1 freq reek-less (7) - 1 freq faik-pats (7) - 1 freq skelets (7) - 2 freq brak-oots (7) - 1 freq by-leids (7) - 2 freq bye-leids (7) - 3 freq bukkits (7) - 1 freq buckets (7) - 25 freq buikskelfs (7) - 1 freq backleens (7) - 1 freq buckles (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 - BKLTS buik-leets - 1 freq becloods - 1 freq |
BUIK-LEETS |
| Time to execute Levenshtein function - 0.436816 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.629981 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.029972 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.095081 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.000846 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. |