| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bachlt (0) - 1 freq bachly (1) - 1 freq bachle (1) - 1 freq bachled (2) - 1 freq facht (2) - 1 freq boacht (2) - 1 freq nacht (2) - 2 freq lacht (2) - 1 freq bauchle (2) - 26 freq bycht (2) - 1 freq bauchelt (2) - 3 freq fahlt (2) - 1 freq yacht (2) - 11 freq beachit (2) - 6 freq bicht (2) - 2 freq bach (2) - 2 freq dachle (2) - 1 freq basalt (2) - 2 freq bucht (2) - 4 freq wacht (2) - 1 freq bocht (2) - 219 freq dachelt (2) - 1 freq cachet (2) - 1 freq backet (2) - 8 freq backit (2) - 8 freq |
bachlt (0) - 1 freq bauchilt (2) - 2 freq bauchlet (2) - 1 freq bachle (2) - 1 freq bachly (2) - 1 freq bauchelt (2) - 3 freq bucht (3) - 4 freq dachelt (3) - 1 freq backlit (3) - 1 freq wachlet (3) - 1 freq bicht (3) - 2 freq bucklt (3) - 2 freq bauchly (3) - 1 freq bocht (3) - 219 freq bauchle (3) - 26 freq beachit (3) - 6 freq bycht (3) - 1 freq boacht (3) - 1 freq bachled (3) - 1 freq wauchelt (4) - 2 freq pauchelt (4) - 2 freq buckelt (4) - 2 freq pochelt (4) - 1 freq buchart (4) - 1 freq bauchil (4) - 3 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 - BXLT bauchled - 6 freq bauchelt - 3 freq bachlt - 1 freq bachled - 1 freq bauchilt - 2 freq bauchlet - 1 freq |
BACHLT |
| Time to execute Levenshtein function - 0.291211 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.356324 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.029692 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.038907 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.000874 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. |