| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bachled (0) - 1 freq bauchled (1) - 6 freq bachle (1) - 1 freq bathed (2) - 13 freq tackled (2) - 1 freq wachlet (2) - 1 freq battled (2) - 2 freq trachled (2) - 5 freq babbled (2) - 2 freq bauchle (2) - 26 freq dauchled (2) - 3 freq balled (2) - 6 freq baaled (2) - 17 freq bauchlet (2) - 1 freq dachle (2) - 1 freq lached (2) - 5 freq buckled (2) - 7 freq baffled (2) - 4 freq backed (2) - 27 freq hauchled (2) - 1 freq bawled (2) - 27 freq beached (2) - 9 freq bauchles (2) - 4 freq bashed (2) - 8 freq pochled (2) - 3 freq |
bachled (0) - 1 freq bauchled (1) - 6 freq bachle (2) - 1 freq bauchles (3) - 4 freq bauchlet (3) - 1 freq rochled (3) - 2 freq hochled (3) - 1 freq pochled (3) - 3 freq beached (3) - 9 freq buckled (3) - 7 freq bauchle (3) - 26 freq fauchled (3) - 1 freq bachly (3) - 1 freq bachlt (3) - 1 freq pauchled (3) - 12 freq rauchled (3) - 1 freq dauchled (3) - 3 freq hauchled (3) - 1 freq cackled (4) - 2 freq schuled (4) - 3 freq peuchled (4) - 1 freq bauchly (4) - 1 freq beachend (4) - 1 freq bauchlin (4) - 1 freq bauchlie (4) - 1 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 |
BACHLED |
| Time to execute Levenshtein function - 0.282730 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.621862 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.062207 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.041422 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.000914 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. |