Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
skraichs (0) - 5 freq skraich (1) - 13 freq skraicht (1) - 2 freq scraichs (1) - 2 freq skraichy (1) - 1 freq skreichs (1) - 7 freq skreighs (2) - 5 freq skraiks (2) - 1 freq scraich (2) - 14 freq skreicht (2) - 7 freq scraighs (2) - 1 freq skreichd (2) - 1 freq spraicht (2) - 1 freq skraichin (2) - 16 freq scraicht (2) - 9 freq straicht (2) - 127 freq skraiched (2) - 53 freq skaiths (2) - 3 freq skreich (2) - 31 freq screichs (2) - 4 freq skraichie (2) - 3 freq seraich (2) - 1 freq seraicht (2) - 2 freq skraichit (2) - 1 freq straight (3) - 217 freq |
skraichs (0) - 5 freq skreichs (1) - 7 freq skraicht (2) - 2 freq skraichy (2) - 1 freq skraich (2) - 13 freq scraichs (2) - 2 freq skraiched (3) - 53 freq skreich (3) - 31 freq skraichie (3) - 3 freq skraichin (3) - 16 freq screichs (3) - 4 freq skreichd (3) - 1 freq skreicht (3) - 7 freq skreighs (3) - 5 freq skraichit (3) - 1 freq skreichan (4) - 1 freq skreichin (4) - 11 freq scriechs (4) - 1 freq skreiched (4) - 16 freq screiches (4) - 1 freq skeanachs (4) - 2 freq skriech (4) - 3 freq sprechs (4) - 2 freq seraich (4) - 1 freq skaiths (4) - 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 - 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 |
SKRAICHS |
Time to execute Levenshtein function - 0.312977 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.674099 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.031902 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.070466 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.000859 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. |