| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| becloods (0) - 1 freq bloods (2) - 5 freq cloods (2) - 98 freq i'cloods (2) - 1 freq bedrooms (3) - 7 freq belongs (3) - 14 freq becomes (3) - 44 freq i'clood (3) - 1 freq bellochs (3) - 1 freq blood' (3) - 1 freq records (3) - 34 freq begood (3) - 11 freq bellows (3) - 6 freq clods (3) - 6 freq floods (3) - 13 freq seconds (3) - 94 freq broods (3) - 1 freq balloons (3) - 16 freq beckons (3) - 5 freq croods (3) - 30 freq cloody (3) - 6 freq baloos (3) - 1 freq clouds (3) - 85 freq becos (3) - 1 freq baloons (3) - 1 freq |
becloods (0) - 1 freq i'cloods (3) - 1 freq cloods (3) - 98 freq bloods (3) - 5 freq clods (4) - 6 freq beilds (4) - 1 freq clouds (4) - 85 freq bleds (5) - 1 freq clooks (5) - 4 freq cloos (5) - 1 freq blood (5) - 141 freq cloots (5) - 31 freq kloods (5) - 1 freq blooms (5) - 9 freq by-leids (5) - 2 freq builds (5) - 3 freq blads (5) - 9 freq uncleids (5) - 1 freq bleeds (5) - 6 freq scolds (5) - 2 freq blauds (5) - 1 freq cluds (5) - 9 freq bloody (5) - 258 freq bields (5) - 13 freq byleids (5) - 9 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 - BKLTS buik-leets - 1 freq becloods - 1 freq |
BECLOODS |
| Time to execute Levenshtein function - 0.412336 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.704190 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.087152 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.095946 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.001272 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. |