| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| bad-mouths (0) - 1 freq yarmouth (4) - 6 freq mouths (4) - 7 freq mammoths (4) - 3 freq drouths (4) - 1 freq badmoothin (4) - 1 freq baadmooth (4) - 1 freq monmouth (5) - 4 freq drouthy (5) - 17 freq baths (5) - 35 freq bauthes (5) - 1 freq back-pouch (5) - 1 freq bedclothes (5) - 1 freq faamous (5) - 1 freq drouth (5) - 49 freq boughs (5) - 7 freq awmous (5) - 4 freq heymouthe (5) - 1 freq admits (5) - 2 freq balmour (5) - 1 freq fawmous (5) - 10 freq bancouris (5) - 1 freq moths (5) - 7 freq laid-out (5) - 1 freq ballots (5) - 1 freq |
bad-mouths (0) - 1 freq badmoothin (6) - 1 freq baadmooth (6) - 1 freq bed-mate (7) - 1 freq bedclothes (7) - 1 freq lood-mooth (7) - 1 freq mouths (7) - 7 freq drouths (7) - 1 freq mammoths (7) - 3 freq broths (8) - 1 freq red-coats (8) - 1 freq drooths (8) - 1 freq aald-mither (8) - 1 freq mooths (8) - 74 freq closemouths (8) - 1 freq smooths (8) - 1 freq wide-moothed (8) - 1 freq burn-mooth (8) - 1 freq bi-monthly (8) - 1 freq moths (8) - 7 freq booths (8) - 5 freq baths (8) - 35 freq bedclathes (8) - 1 freq bauthes (8) - 1 freq yarmouth (8) - 6 freq |
SoundEx code - B353 buttoned - 11 freq bathin-huts - 1 freq bad-mouths - 1 freq battened - 2 freq bedmate - 2 freq but-and - 1 freq badmoothin - 1 freq bed-ends - 1 freq baadmooth - 1 freq bed-mate - 1 freq but-end - 2 freq btinternet - 12 freq bydand - 1 freq bdantarctica - 1 freq |
MetaPhone code - BTM0S bad-mouths - 1 freq |
BAD-MOUTHS |
| Time to execute Levenshtein function - 0.196791 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.352304 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.026961 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.037017 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.000822 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. |