Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hospice (0) - 6 freq hospices (1) - 1 freq hostile (2) - 13 freq hoffice (2) - 1 freq hossie (2) - 1 freq hoswick (2) - 1 freq spice (2) - 1 freq hosepipe (2) - 1 freq howpie (2) - 1 freq spice (2) - 25 freq haskie (3) - 2 freq motrice (3) - 1 freq topics (3) - 17 freq mornice (3) - 2 freq mosaic (3) - 4 freq spile (3) - 11 freq horsie (3) - 7 freq copie (3) - 17 freq hose (3) - 18 freq hostin (3) - 16 freq lossie (3) - 7 freq hussie (3) - 1 freq posie (3) - 1 freq heapie (3) - 1 freq hoodie (3) - 16 freq |
hospice (0) - 6 freq hospices (2) - 1 freq hosepipe (3) - 1 freq spice (3) - 25 freq spicy (4) - 11 freq hosp (4) - 1 freq myspace (4) - 1 freq space (4) - 282 freq espece (4) - 1 freq spic (4) - 1 freq hostile (4) - 13 freq spice (4) - 1 freq hossie (4) - 1 freq hoswick (4) - 1 freq howpie (4) - 1 freq hoffice (4) - 1 freq justice (5) - 67 freq spine (5) - 26 freq heidspace (5) - 1 freq respite (5) - 4 freq spite (5) - 72 freq hastie (5) - 1 freq toapic (5) - 1 freq hostit (5) - 7 freq inspire (5) - 24 freq |
SoundEx code - H212 hospice - 6 freq hoosewife's - 1 freq hesps - 2 freq housewife's - 1 freq hauchue-pauchtie - 1 freq hoosewives - 1 freq hospices - 1 freq hxwps - 1 freq hawickfps - 1 freq hkzfeosn - 1 freq hugggggvsssss - 1 freq hxvsqv - 1 freq hcofyka - 1 freq hqffgczinr - 1 freq hgpg - 1 freq hgqpzt - 1 freq |
MetaPhone code - HSPS hospice - 6 freq hesps - 2 freq |
HOSPICE |
Time to execute Levenshtein function - 0.209288 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.346743 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.027098 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.037160 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.000828 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. |