| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bauchelt (0) - 3 freq fauchelt (1) - 2 freq wauchelt (1) - 2 freq pauchelt (1) - 2 freq bauchilt (1) - 2 freq shauchelt (2) - 3 freq dachelt (2) - 1 freq trauchelt (2) - 16 freq bachlt (2) - 1 freq pauchilt (2) - 1 freq bauchly (2) - 1 freq bauchle (2) - 26 freq buckelt (2) - 2 freq bauchil (2) - 3 freq bauchlet (2) - 1 freq bucher (3) - 1 freq wauchil (3) - 1 freq bauthes (3) - 1 freq pauchle (3) - 20 freq bucht (3) - 4 freq batcheler (3) - 1 freq cancelt (3) - 3 freq sprauchelt (3) - 3 freq naucht (3) - 3 freq dashelt (3) - 3 freq |
bauchelt (0) - 3 freq bauchilt (1) - 2 freq bauchlet (2) - 1 freq bachlt (2) - 1 freq wauchelt (2) - 2 freq fauchelt (2) - 2 freq pauchelt (2) - 2 freq buckelt (3) - 2 freq bauchil (3) - 3 freq bauchle (3) - 26 freq bauchly (3) - 1 freq dachelt (3) - 1 freq pauchilt (3) - 1 freq bauchlin (4) - 1 freq bachelor (4) - 4 freq bucklt (4) - 2 freq bauchled (4) - 6 freq buchart (4) - 1 freq pochelt (4) - 1 freq buchtit (4) - 4 freq bauchlie (4) - 1 freq boucht (4) - 5 freq bucht (4) - 4 freq bachly (4) - 1 freq bauchles (4) - 4 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 |
BAUCHELT |
| Time to execute Levenshtein function - 0.205805 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.362806 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.027615 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.037691 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.000926 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. |