| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| slack-gabbed (0) - 1 freq slack-jawed (3) - 2 freq black-backed (4) - 1 freq stack-yaird (5) - 2 freq bleck-gouned (5) - 1 freq blak-haired (5) - 1 freq paunch-gabbed (5) - 1 freq scrabbed (5) - 3 freq blackmailed (5) - 1 freq lang-nebbed (5) - 1 freq black-eyed (5) - 2 freq black-nebbit (5) - 1 freq slackened (5) - 2 freq scabbed (5) - 2 freq slugabed (5) - 1 freq bleck-wamed (5) - 3 freq lang-hained (6) - 1 freq slaked (6) - 1 freq slacken (6) - 1 freq blackwater (6) - 1 freq back-alley (6) - 1 freq seeck-beds (6) - 1 freq lang-gane (6) - 2 freq blacked (6) - 4 freq rock-faced (6) - 1 freq |
slack-gabbed (0) - 1 freq slack-jawed (6) - 2 freq paunch-gabbed (8) - 1 freq black-nebbit (8) - 1 freq bleck-gouned (8) - 1 freq black-backed (8) - 1 freq scabbed (9) - 2 freq slugabed (9) - 1 freq black-eyed (9) - 2 freq bleck-wamed (9) - 3 freq slackened (9) - 2 freq lang-nebbed (9) - 1 freq scrabbed (9) - 3 freq stack-yaird (9) - 2 freq black-a-viced (10) - 1 freq gleg-gabbit (10) - 2 freq slocked (10) - 2 freq blackbird (10) - 4 freq blackguard (10) - 1 freq back-bowed (10) - 1 freq black-moothed (10) - 1 freq seik-bed (10) - 1 freq slicked (10) - 3 freq blackboard (10) - 5 freq blackburd (10) - 1 freq |
SoundEx code - S421 slack-gabbed - 1 freq salzburg - 1 freq sel-sufficiency - 1 freq sel-expression - 2 freq sleazeballs - 1 freq slxbf - 1 freq sillyshib - 1 freq slugabed - 1 freq slzvxzdqm - 1 freq |
MetaPhone code - SLKKBT slack-gabbed - 1 freq |
SLACK-GABBED |
| Time to execute Levenshtein function - 0.518778 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 - 1.582764 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.082664 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.097391 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.000869 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. |