| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| sarcasm (0) - 12 freq sarcasms (1) - 1 freq marcas (2) - 3 freq carcase (2) - 1 freq carcass (2) - 9 freq sachs (3) - 4 freq scam (3) - 11 freq sarah (3) - 40 freq sacan (3) - 1 freq parkash (3) - 1 freq slrc's (3) - 2 freq marras (3) - 6 freq marias (3) - 1 freq barca (3) - 1 freq sancts (3) - 4 freq sangam (3) - 1 freq arase (3) - 1 freq sark's (3) - 1 freq surpass (3) - 2 freq sarves (3) - 2 freq sarcastic (3) - 11 freq arcade (3) - 8 freq staircase (3) - 8 freq morcas (3) - 1 freq yakcam (3) - 35 freq |
sarcasm (0) - 12 freq sarcasms (2) - 1 freq racism (4) - 28 freq carcass (4) - 9 freq marcas (4) - 3 freq carcase (4) - 1 freq sars (5) - 1 freq scream (5) - 67 freq farces (5) - 1 freq arcs (5) - 1 freq exorcism (5) - 3 freq fascism (5) - 4 freq caircass (5) - 1 freq lyricism (5) - 1 freq sacrum (5) - 1 freq sursum (5) - 1 freq sources (5) - 24 freq sanctum (5) - 1 freq spasm (5) - 1 freq scram (5) - 1 freq sara's (5) - 1 freq sorras (5) - 6 freq marxism (5) - 2 freq orcas (5) - 5 freq marcus (5) - 2 freq |
SoundEx code - S622 sources - 24 freq screeches - 3 freq square-goes - 1 freq square-gos - 1 freq sarcasm - 12 freq scroggis - 1 freq skreichs - 7 freq surgical - 5 freq skreighs - 5 freq scraichs - 2 freq surcastik - 2 freq surcastecly - 1 freq scairses - 1 freq sarcastically - 8 freq skraichs - 5 freq sarcastic - 11 freq sarky-smiled - 1 freq sarcasms - 1 freq screichs - 4 freq sharkies - 1 freq scriechs - 1 freq share-sized - 1 freq scraighs - 1 freq soorces - 15 freq skrekowizc - 1 freq searches - 4 freq scurrie-keech - 1 freq sairches - 1 freq surzhik - 2 freq screiches - 1 freq |
MetaPhone code - SRKSM sarcasm - 12 freq |
SARCASM |
| Time to execute Levenshtein function - 0.206186 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.404774 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.027629 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.037349 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.000897 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. |