Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
helmstock (0) - 1 freq re-stock (3) - 1 freq hey-stack (3) - 1 freq holistic (4) - 4 freq stock (4) - 102 freq rootstock (4) - 1 freq eistok (4) - 1 freq helmet (4) - 15 freq haystack (4) - 2 freq helmets (4) - 9 freq eemock (4) - 8 freq helmits (4) - 1 freq humplock (4) - 4 freq gemstone (4) - 1 freq helms (4) - 2 freq elastic (4) - 16 freq fermstockin (4) - 1 freq shell-shock (4) - 1 freq beattock (4) - 1 freq piltock (4) - 1 freq livestock (4) - 6 freq hillock (4) - 8 freq heidstone (4) - 2 freq lassock (4) - 2 freq peatstack (4) - 1 freq |
helmstock (0) - 1 freq hey-stack (5) - 1 freq haystack (6) - 2 freq livestock (6) - 6 freq drumstick (6) - 1 freq re-stock (6) - 1 freq bamstick (6) - 4 freq holistic (6) - 4 freq wordstock (7) - 1 freq hammock (7) - 4 freq plutock (7) - 17 freq midstock (7) - 1 freq elastics (7) - 1 freq glowstick (7) - 1 freq elestic (7) - 2 freq haimlock (7) - 7 freq slapstick (7) - 1 freq plasticky (7) - 4 freq hamesick (7) - 1 freq broomstick (7) - 6 freq homesick (7) - 1 freq wirdstock (7) - 1 freq peatstack (7) - 1 freq lipstick (7) - 20 freq hermiston (7) - 1 freq |
SoundEx code - H452 hielans - 17 freq haliness - 2 freq helms - 2 freq holmes - 16 freq holms - 8 freq h'lang - 4 freq healins - 1 freq hauling - 1 freq helen's - 3 freq howling - 3 freq holiness - 1 freq hillington - 2 freq hallions - 51 freq heilans - 8 freq heilins - 1 freq healing - 7 freq hollowness - 1 freq helensburgh - 3 freq hell-makers - 1 freq hallowmas - 1 freq helmstock - 1 freq halieness - 1 freq hallanshakar - 1 freq hallans - 1 freq halloweens - 2 freq hallanshackers - 1 freq haleness - 1 freq hallaeen's - 1 freq hellomag - 1 freq hlmcidm - 1 freq hollyhnews - 1 freq helenmcclements - 1 freq |
MetaPhone code - HLMSTK helmstock - 1 freq |
HELMSTOCK |
Time to execute Levenshtein function - 0.224970 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.373874 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.027587 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.040243 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.001003 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. |