| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| surnames (0) - 4 freq surname (1) - 12 freq furnaces (2) - 1 freq surfaces (2) - 6 freq signages (3) - 2 freq scrapes (3) - 10 freq surnem (3) - 2 freq shames (3) - 2 freq screams (3) - 32 freq surpass (3) - 2 freq sumtimes (3) - 12 freq names (3) - 300 freq urnae (3) - 31 freq burnes (3) - 2 freq fornaces (3) - 2 freq snakes (3) - 32 freq frames (3) - 18 freq unnamed (3) - 4 freq snares (3) - 4 freq stramps (3) - 1 freq drames (3) - 7 freq strakes (3) - 1 freq surpasses (3) - 1 freq straes (3) - 3 freq tsunamis (3) - 1 freq |
surnames (0) - 4 freq surname (2) - 12 freq sarnies (4) - 1 freq surnem (4) - 2 freq surfaces (4) - 6 freq furnaces (4) - 1 freq surfies (5) - 2 freq sourness (5) - 1 freq tournamen (5) - 1 freq tsunamis (5) - 1 freq sunties (5) - 2 freq skames (5) - 2 freq sorners (5) - 2 freq jurnals (5) - 1 freq streams (5) - 37 freq sorraes (5) - 3 freq sumtymes (5) - 3 freq burnies (5) - 1 freq survives (5) - 9 freq syringes (5) - 1 freq surmise (5) - 3 freq schames (5) - 2 freq sumtimes (5) - 12 freq names (5) - 300 freq fornaces (5) - 2 freq |
SoundEx code - S655 surmoontit - 1 freq sermon - 29 freq screamin - 72 freq surnem - 2 freq surnames - 4 freq swarmin - 6 freq scrannin - 6 freq screaman - 5 freq surname - 12 freq screamin' - 1 freq sherman - 1 freq sermons - 9 freq screaminly - 1 freq scaremongerin - 2 freq screaming - 8 freq squirmin - 3 freq swairmin - 2 freq scrimin - 2 freq sereaman - 1 freq swearin-in - 1 freq surrounnins - 1 freq scorninly - 1 freq scare-mongerin - 1 freq sairmons - 1 freq screening - 1 freq screenin - 2 freq |
MetaPhone code - SRNMS surnames - 4 freq |
SURNAMES |
| Time to execute Levenshtein function - 0.201084 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.370789 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.027904 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.041053 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.000768 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. |