| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| gsfwswljwd (0) - 1 freq swelled (6) - 8 freq zsxjwcdljd (6) - 1 freq shawled (6) - 1 freq jofrhwld (6) - 1 freq swalla'd (6) - 1 freq swallows (6) - 9 freq swallowed (6) - 9 freq dlfwbwpw (6) - 1 freq scowled (6) - 3 freq swirled (6) - 3 freq guffawed (6) - 2 freq grawwww (6) - 1 freq gowled (6) - 3 freq sprawled (6) - 9 freq grawwwwww (6) - 1 freq scushled (6) - 1 freq fwsuji (6) - 1 freq nflwd (6) - 1 freq swallow (6) - 12 freq fustled (6) - 1 freq gippsland (6) - 1 freq wswjpu (6) - 1 freq swalled (6) - 6 freq fsworld (6) - 1 freq |
gsfwswljwd (0) - 1 freq swallowed (11) - 9 freq goswald (11) - 1 freq gfeadjrd (12) - 1 freq sweeled (12) - 6 freq fissled (12) - 1 freq scrawled (12) - 4 freq swilled (12) - 1 freq fsworld (12) - 1 freq gowld (12) - 11 freq suxswgowu (12) - 1 freq swallied (12) - 15 freq fowlded (12) - 3 freq swallaed (12) - 34 freq swald (12) - 2 freq swallyed (12) - 1 freq fussled (12) - 7 freq grassland (12) - 3 freq oswald (12) - 4 freq swalled (12) - 6 freq growled (12) - 14 freq scowlded (12) - 1 freq gsalaw (12) - 1 freq swalla'd (12) - 1 freq swallows (12) - 9 freq |
SoundEx code - G124 gippsland - 1 freq gsfwswljwd - 1 freq goevaazcld - 1 freq gbqlw - 1 freq gwfqioihlb - 1 freq |
MetaPhone code - KSFSLJT gsfwswljwd - 1 freq |
GSFWSWLJWD |
| Time to execute Levenshtein function - 0.201734 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.428078 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.028691 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.041389 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.000921 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. |