| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backerly (0) - 1 freq backers (2) - 2 freq sickerly (2) - 2 freq bakery (2) - 16 freq backeth (3) - 1 freq mackerel (3) - 8 freq rockery (3) - 1 freq bicker (3) - 12 freq packer (3) - 1 freq anerly (3) - 7 freq lakely (3) - 2 freq back-pey (3) - 1 freq ackers (3) - 16 freq aikeray (3) - 2 freq backgrun (3) - 16 freq bicker' (3) - 1 freq cackelt (3) - 1 freq bickered (3) - 1 freq backend (3) - 4 freq brickelly (3) - 1 freq wickedly (3) - 1 freq hacker's (3) - 1 freq backed (3) - 27 freq blackberry (3) - 1 freq mockery (3) - 9 freq |
backerly (0) - 1 freq backers (3) - 2 freq sickerly (3) - 2 freq bickered (4) - 1 freq bickerin (4) - 7 freq bicker' (4) - 1 freq bickert (4) - 3 freq bicker (4) - 12 freq mackerel (4) - 8 freq bakery (4) - 16 freq packers (5) - 1 freq bachly (5) - 1 freq quackery (5) - 1 freq lackly (5) - 4 freq bakers (5) - 24 freq backdrap (5) - 1 freq bacteria (5) - 4 freq baiker (5) - 1 freq mackers (5) - 1 freq barely (5) - 97 freq backarts (5) - 10 freq bankers (5) - 4 freq basker (5) - 1 freq cockerel (5) - 5 freq backroad (5) - 1 freq |
SoundEx code - B264 bogeyroll - 1 freq boy-girl-boy-girl - 1 freq backerly - 1 freq back-rollin - 1 freq baggerel - 1 freq bookerlonglist - 1 freq biker-like - 1 freq bizarrely - 1 freq |
MetaPhone code - BKRL backerly - 1 freq baggerel - 1 freq |
BACKERLY |
| Time to execute Levenshtein function - 0.264957 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.393312 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.027646 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.038140 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.000942 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. |