| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| surcastecly (0) - 1 freq surcastik (4) - 2 freq sarcastic (4) - 11 freq norwasterly (4) - 1 freq sarcastically (4) - 8 freq scantily (5) - 1 freq quarterly (5) - 3 freq sou-westerly (5) - 1 freq castel (5) - 8 freq wasterly (5) - 2 freq sauncastle (5) - 1 freq quately (5) - 21 freq strangely (5) - 9 freq furstly (5) - 2 freq sedately (5) - 1 freq scarcely (5) - 4 freq strategy (5) - 60 freq purportedly (5) - 1 freq surely (5) - 184 freq sisterly (5) - 1 freq castell (5) - 1 freq easterly (5) - 4 freq castels (5) - 2 freq supposedly (5) - 16 freq purposely (5) - 1 freq |
surcastecly (0) - 1 freq sarcastic (5) - 11 freq sarcastically (5) - 8 freq surcastik (6) - 2 freq norwasterly (7) - 1 freq sauncastle (7) - 1 freq scarcely (8) - 4 freq castell (8) - 1 freq sisterly (8) - 1 freq forecastable (8) - 2 freq spectacle (8) - 7 freq furstly (8) - 2 freq scratchy (8) - 49 freq swcoastal (8) - 1 freq castel (8) - 8 freq scantily (8) - 1 freq sou-westerly (8) - 1 freq hescastle (9) - 1 freq seicontly (9) - 1 freq successful (9) - 22 freq earnestly (9) - 4 freq sarcasm (9) - 12 freq strictly (9) - 14 freq practical (9) - 48 freq quarterly (9) - 3 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 - SRKSTKL surcastecly - 1 freq sarcastically - 8 freq |
SURCASTECLY |
| Time to execute Levenshtein function - 0.265109 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.466142 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.030417 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.039524 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.005600 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. |