| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backslide (0) - 1 freq backslider (1) - 1 freq backside (1) - 26 freq backsides (2) - 2 freq blackside (2) - 2 freq bakside (2) - 2 freq backsliders (2) - 1 freq backlins (3) - 18 freq dockside (3) - 9 freq backshift (3) - 1 freq darkside (3) - 1 freq backwise (3) - 1 freq baeside (3) - 1 freq backie (3) - 19 freq backfire (3) - 1 freq backsliding (3) - 1 freq backid (3) - 1 freq backsyke (3) - 1 freq bakelite (3) - 3 freq jacksie (3) - 3 freq landslide (3) - 1 freq backflips (3) - 1 freq backlit (3) - 1 freq macklike (3) - 1 freq backstage (3) - 5 freq |
backslide (0) - 1 freq backside (2) - 26 freq backslider (2) - 1 freq backsliders (4) - 1 freq bakside (4) - 2 freq backsides (4) - 2 freq blackside (4) - 2 freq backsliding (5) - 1 freq backid (5) - 1 freq backstage (5) - 5 freq buckled (5) - 7 freq backlit (5) - 1 freq backsyke (5) - 1 freq dockside (5) - 9 freq backseat (6) - 4 freq backyard (6) - 1 freq buckshee (6) - 3 freq backson (6) - 12 freq back-lyin (6) - 1 freq backs (6) - 93 freq bockid (6) - 1 freq backies (6) - 5 freq buckle (6) - 11 freq backfired (6) - 3 freq backson' (6) - 1 freq |
SoundEx code - B243 bauchled - 6 freq bogleheid - 1 freq buckled - 7 freq bauchelt - 3 freq bakelite - 3 freq booklet - 5 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 - BKSLT backslide - 1 freq |
BACKSLIDE |
| Time to execute Levenshtein function - 0.301513 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.540595 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.036331 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.047494 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.001090 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. |