| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| saggy-bawed (0) - 1 freq sae-cawed (4) - 8 freq lang-baked (4) - 1 freq riggy-bane (4) - 2 freq lang-faced (5) - 4 freq slack-jawed (5) - 2 freq argy-bargy (5) - 12 freq so-cawed (5) - 2 freq sun-baked (5) - 1 freq say-awa (5) - 5 freq back-bowed (5) - 1 freq lang-clawed (5) - 1 freq hauf-baked (5) - 1 freq sagged (5) - 1 freq saxty-fower (5) - 4 freq ragged (6) - 16 freq langfaced (6) - 1 freq half-naked (6) - 1 freq guffawed (6) - 2 freq wire-baned (6) - 1 freq wart-faced (6) - 2 freq jaury-booled (6) - 1 freq baggage (6) - 10 freq egg-fried (6) - 1 freq sarky-smiled (6) - 1 freq |
saggy-bawed (0) - 1 freq lang-baked (7) - 1 freq riggy-bane (7) - 2 freq sae-cawed (7) - 8 freq sun-baked (8) - 1 freq back-bowed (8) - 1 freq so-cawed (8) - 2 freq sagged (8) - 1 freq ruggirbaw (9) - 1 freq seik-bed (9) - 1 freq ruggerbaw (9) - 3 freq suggested (9) - 31 freq egg-fried (9) - 1 freq slugabed (9) - 1 freq dough-baw (9) - 1 freq argy-bargy (9) - 12 freq lang-faced (9) - 4 freq lang-clawed (9) - 1 freq slack-jawed (9) - 2 freq say-awa (9) - 5 freq hauf-baked (9) - 1 freq cage-burd (9) - 1 freq sun-bed (9) - 4 freq saxty-fower (9) - 4 freq swaggered (10) - 4 freq |
SoundEx code - S213 saggy-bawed - 1 freq six-fit - 2 freq sauch-patternt - 1 freq six-fit-four - 3 freq six-foot - 1 freq seeck-beds - 1 freq six-feet - 1 freq shoogie-boats - 1 freq suackbuts - 1 freq seik-bed - 1 freq sax-fit - 1 freq suspetioun - 1 freq suspeitioun - 1 freq susbtrate - 1 freq susceptible - 3 freq sesspit - 1 freq |
MetaPhone code - SKBWT saggy-bawed - 1 freq |
SAGGY-BAWED |
| Time to execute Levenshtein function - 0.210374 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.392090 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.027622 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.043397 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.000952 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. |