Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
scrauchles (0) - 2 freq scrauchlet (1) - 2 freq strauchles (1) - 4 freq scrauchle (1) - 4 freq sprauchles (1) - 1 freq scratches (2) - 4 freq shauchles (2) - 2 freq sprauchle (2) - 1 freq sprauchlet (2) - 1 freq trauchles (2) - 29 freq sprauchled (2) - 7 freq sprachles (2) - 1 freq scrauchlin (2) - 1 freq strauchle (2) - 22 freq snauchles (2) - 1 freq strauchled (2) - 7 freq scraibles (3) - 1 freq rauchle (3) - 7 freq hauchles (3) - 1 freq scraichs (3) - 2 freq scrauchin (3) - 2 freq sprachle (3) - 5 freq trauchlers (3) - 1 freq strauchlin (3) - 6 freq sprauchlin (3) - 7 freq |
scrauchles (0) - 2 freq scrauchle (2) - 4 freq sprauchles (2) - 1 freq scrauchlet (2) - 2 freq strauchles (2) - 4 freq sprachles (3) - 1 freq scrauchlin (3) - 1 freq strauchle (4) - 22 freq snauchles (4) - 1 freq screeches (4) - 3 freq scraichs (4) - 2 freq screiches (4) - 1 freq strauchled (4) - 7 freq sprauchlet (4) - 1 freq sprauchle (4) - 1 freq sprauchled (4) - 7 freq scratches (4) - 4 freq shauchles (4) - 2 freq trauchles (4) - 29 freq crouches (5) - 2 freq sprauchlt (5) - 4 freq scrubbles (5) - 1 freq sprachled (5) - 2 freq scriechs (5) - 1 freq straachle (5) - 2 freq |
SoundEx code - S624 seriously - 72 freq skyrie-seelent - 1 freq scrauchles - 2 freq serious-like - 2 freq scrauchle - 4 freq screws'll - 1 freq sircul - 1 freq seriouslee - 1 freq square-sailed - 1 freq sairiously - 8 freq sarky-lookin - 1 freq scargill - 3 freq searchlights - 2 freq scarcely - 4 freq skarcelins - 5 freq sirkil - 1 freq syer-cloot - 1 freq scragland - 1 freq squaresail - 1 freq scarcelins - 5 freq searecelins - 1 freq sairious-like - 1 freq sairiouslie - 1 freq sairiouslik - 1 freq scrauchlin - 1 freq scrauchlet - 2 freq seriouslie - 2 freq searchlight - 1 freq squerr-slice - 1 freq |
MetaPhone code - SKRXLS scrauchles - 2 freq |
SCRAUCHLES |
Time to execute Levenshtein function - 0.212073 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.418968 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.029108 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.037175 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.000860 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. |