| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backsliding (0) - 1 freq backsliders (3) - 1 freq backslider (3) - 1 freq backslide (3) - 1 freq backlins (4) - 18 freq cackling (4) - 2 freq blacksidend (4) - 1 freq back-lyin (4) - 1 freq blacksiden (4) - 1 freq backpacking (4) - 1 freq backside (4) - 26 freq sliding (4) - 6 freq tackling (4) - 2 freq backspeirin (4) - 4 freq backsides (4) - 2 freq backing (4) - 3 freq backslappin (4) - 1 freq according (5) - 26 freq basslin (5) - 1 freq ruckling (5) - 1 freq crackling (5) - 1 freq packing (5) - 6 freq backin' (5) - 1 freq bucklin (5) - 7 freq packaging (5) - 2 freq |
backsliding (0) - 1 freq backsliders (5) - 1 freq backslide (5) - 1 freq backslider (5) - 1 freq tackling (7) - 2 freq sliding (7) - 6 freq backsides (7) - 2 freq backslappin (7) - 1 freq backside (7) - 26 freq backing (7) - 3 freq backspeirin (7) - 4 freq backlins (7) - 18 freq backpacking (7) - 1 freq blacksidend (7) - 1 freq cackling (7) - 2 freq blacksiden (7) - 1 freq back-lyin (7) - 1 freq colluding (8) - 1 freq backson' (8) - 1 freq beckoning (8) - 1 freq backleens (8) - 1 freq backson (8) - 12 freq including (8) - 22 freq backgairden (8) - 1 freq backgarden (8) - 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 - BKSLTNK backsliding - 1 freq |
BACKSLIDING |
| Time to execute Levenshtein function - 0.192221 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.391543 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.028599 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.037465 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.000964 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. |