| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hospital (0) - 192 freq hospital' (1) - 1 freq ospital (1) - 8 freq hoaspital (1) - 21 freq hospitals (1) - 7 freq hostipal (2) - 2 freq spital (2) - 1 freq hoaspitul (2) - 1 freq ospitals (2) - 1 freq hospitable (2) - 1 freq hoaspitals (2) - 1 freq hospital's (2) - 2 freq hospital (2) - 1 freq spitals (3) - 1 freq caipital (3) - 2 freq orbital (3) - 3 freq spittal (3) - 1 freq hospice (3) - 6 freq hospitality (3) - 13 freq ospittle (3) - 2 freq hopit (3) - 6 freq posstal (3) - 1 freq hostel (3) - 14 freq hoppit (3) - 2 freq hospices (3) - 1 freq |
hospital (0) - 192 freq hoaspital (1) - 21 freq hoaspitul (2) - 1 freq hospitals (2) - 7 freq hospital' (2) - 1 freq ospital (2) - 8 freq hoaspitals (3) - 1 freq spital (3) - 1 freq hospitable (3) - 1 freq hostel (4) - 14 freq hospital (4) - 1 freq hospitality (4) - 13 freq hospital's (4) - 2 freq hostipal (4) - 2 freq ospitals (4) - 1 freq spinal (5) - 3 freq hostile (5) - 13 freq howpit (5) - 19 freq postal (5) - 3 freq hostit (5) - 7 freq hospitalitie (5) - 1 freq capital (5) - 90 freq speitel (5) - 1 freq hospices (5) - 1 freq spiral (5) - 11 freq |
SoundEx code - H213 hospital - 192 freq howzaboot - 3 freq high-pitched - 4 freq hospitality - 13 freq hoaspital - 21 freq hesped - 1 freq hospital's - 2 freq high-pedigreed - 1 freq hospitals - 7 freq heich-pitched - 1 freq hoaspitals - 1 freq hoaspitul - 1 freq hospital' - 1 freq hospitable - 1 freq hospitalitie - 1 freq hospital - 1 freq hjqofdjdau - 1 freq hhkgpdaozp - 1 freq howsabout - 1 freq hugefoodlover - 1 freq hoozaboot - 2 freq hzvfdhq - 1 freq |
MetaPhone code - HSPTL hospital - 192 freq hoaspital - 21 freq hoaspitul - 1 freq hospital' - 1 freq hospital - 1 freq |
HOSPITAL |
| Time to execute Levenshtein function - 0.207655 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.370164 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.027901 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.042946 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.001196 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. |