| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| ospital (0) - 8 freq spital (1) - 1 freq ospitals (1) - 1 freq hospital (1) - 194 freq orbital (2) - 3 freq spitals (2) - 1 freq hospitals (2) - 7 freq spinal (2) - 3 freq ospittle (2) - 2 freq spittal (2) - 1 freq spiral (2) - 10 freq capital (2) - 88 freq hospital' (2) - 1 freq hoaspital (2) - 21 freq hospital (3) - 1 freq spit (3) - 69 freq spitin (3) - 2 freq hospitable (3) - 1 freq topical (3) - 5 freq spill (3) - 22 freq ossigar (3) - 1 freq onpit (3) - 1 freq stal (3) - 4 freq epinal (3) - 1 freq spits (3) - 24 freq |
ospital (0) - 8 freq spital (1) - 1 freq hospital (2) - 194 freq ospitals (2) - 1 freq spiral (3) - 10 freq hoaspital (3) - 21 freq speitel (3) - 1 freq spittal (3) - 1 freq capital (3) - 88 freq ospittle (3) - 2 freq spitals (3) - 1 freq spinal (3) - 3 freq petal (4) - 10 freq hoaspitul (4) - 1 freq spiel (4) - 19 freq spitz (4) - 1 freq speal (4) - 1 freq spittle (4) - 8 freq spite (4) - 72 freq caipital (4) - 2 freq capietal (4) - 1 freq spatula (4) - 2 freq spit' (4) - 1 freq soctal (4) - 1 freq spill (4) - 22 freq |
SoundEx code - O213 occupeed - 1 freq occupied - 20 freq occupation - 14 freq ospital - 8 freq occupations - 4 freq occupyd - 1 freq occupation's - 1 freq ospitals - 1 freq ossified - 1 freq ospittle - 2 freq oucpbdu - 1 freq ojbt - 1 freq ozvotbhk - 1 freq |
MetaPhone code - OSPTL ospital - 8 freq ospittle - 2 freq |
OSPITAL |
| Time to execute Levenshtein function - 0.197845 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.349822 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.029162 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.036735 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.000837 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. |