Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
skreichs (0) - 7 freq skraichs (1) - 5 freq skreicht (1) - 7 freq skreich (1) - 31 freq skreichd (1) - 1 freq skreighs (1) - 5 freq screichs (1) - 4 freq skreichan (2) - 1 freq screicht (2) - 1 freq skreives (2) - 1 freq skreigh (2) - 2 freq skeich (2) - 11 freq skreids (2) - 6 freq screiches (2) - 1 freq skraichy (2) - 1 freq skraich (2) - 13 freq skreichin (2) - 11 freq skreiched (2) - 16 freq skraicht (2) - 2 freq screich (2) - 18 freq scraichs (2) - 2 freq sprechs (2) - 2 freq skreivens (3) - 2 freq screiched (3) - 3 freq streiks (3) - 3 freq |
skreichs (0) - 7 freq skraichs (1) - 5 freq skreighs (2) - 5 freq skreichd (2) - 1 freq screichs (2) - 4 freq skreich (2) - 31 freq skreicht (2) - 7 freq skreichin (3) - 11 freq skraich (3) - 13 freq skreiched (3) - 16 freq scraichs (3) - 2 freq skraichy (3) - 1 freq skraicht (3) - 2 freq sprechs (3) - 2 freq screiches (3) - 1 freq skreichan (3) - 1 freq skraichin (4) - 16 freq screeches (4) - 3 freq skraiched (4) - 53 freq skraichit (4) - 1 freq skreechin (4) - 1 freq skraichie (4) - 3 freq scriechs (4) - 1 freq skriech (4) - 3 freq skreigh (4) - 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 - SKRXS screeches - 3 freq skreichs - 7 freq scratchy's - 7 freq scraichs - 2 freq skraichs - 5 freq scratches - 4 freq screichs - 4 freq scriechs - 1 freq screiches - 1 freq |
SKREICHS |
Time to execute Levenshtein function - 0.191445 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.342461 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.027077 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.036789 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.000778 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. |