| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| backcloth (0) - 1 freq backeth (3) - 1 freq backchat (3) - 4 freq backlit (3) - 1 freq backlash (3) - 1 freq watchcloth (3) - 2 freq waxcloth (3) - 2 freq back-room (4) - 1 freq back-door (4) - 2 freq backlins (4) - 18 freq backdrop (4) - 3 freq backairts (4) - 1 freq bucklt (4) - 2 freq backwart (4) - 7 freq jackboot (4) - 1 freq backwarts (4) - 3 freq backrooms (4) - 1 freq backswash (4) - 1 freq facecloots (4) - 1 freq backson (4) - 12 freq ballot (4) - 10 freq backdoors (4) - 1 freq backless (4) - 1 freq backgroon (4) - 1 freq backson' (4) - 1 freq |
backcloth (0) - 1 freq seckclaith (5) - 3 freq backlit (5) - 1 freq backlash (5) - 1 freq backeth (5) - 1 freq backchat (5) - 4 freq bucklit (6) - 1 freq buckelt (6) - 2 freq bucklt (6) - 2 freq bucklet (6) - 1 freq back-claiths (6) - 1 freq watchcloth (6) - 2 freq waxcloth (6) - 2 freq bakelite (7) - 3 freq oilcloth (7) - 3 freq blacksmith (7) - 4 freq backairts (7) - 1 freq backbeat (7) - 1 freq backdate (7) - 1 freq backflips (7) - 1 freq back-chat (7) - 1 freq facecloot (7) - 8 freq backaboot (7) - 2 freq cloth (7) - 16 freq back-lyin (7) - 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 - BKKL0 backcloth - 1 freq |
BACKCLOTH |
| Time to execute Levenshtein function - 0.404582 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.688740 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.029640 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.072579 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.000889 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. |