| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoosecoats (0) - 1 freq hoosecoat (1) - 2 freq housecoat (2) - 2 freq hooseholds (3) - 1 freq hoose-taps (3) - 1 freq hoosemates (3) - 1 freq hooseboun (4) - 1 freq hooseless (4) - 1 freq norseroots (4) - 1 freq hoose-names (4) - 1 freq hoosemaid (4) - 7 freq hoosewives (4) - 1 freq hoosehold (4) - 12 freq hoosewark (4) - 5 freq hoosehauds (4) - 5 freq hoosehald (4) - 1 freq scoats (4) - 1 freq hotspots (4) - 2 freq hooses (4) - 255 freq hoosebay (4) - 3 freq overcoats (4) - 1 freq goosefat (4) - 1 freq hoosemaids (4) - 1 freq horoscopes (4) - 1 freq hoscote (4) - 39 freq |
hoosecoats (0) - 1 freq hoosecoat (2) - 2 freq housecoat (3) - 2 freq hoosemates (4) - 1 freq hoscote (5) - 39 freq scoats (5) - 1 freq hoose-taps (5) - 1 freq doocots (6) - 2 freq hosts (6) - 13 freq hoosemaids (6) - 1 freq hoose's (6) - 5 freq overcoats (6) - 1 freq forscots (6) - 1 freq hoasts (6) - 8 freq scouts (6) - 3 freq scots (6) - 6843 freq scoots (6) - 2 freq hoolets (6) - 5 freq 'scots (6) - 17 freq horoscopes (6) - 1 freq hooses (6) - 255 freq sects (6) - 2 freq hoosewives (6) - 1 freq hooseless (6) - 1 freq hoosehauds (6) - 5 freq |
SoundEx code - H223 heichest - 24 freq housecoat - 2 freq highest - 21 freq hugest - 1 freq hijacked - 2 freq heich-stannèrt - 1 freq heighest - 2 freq hege-syde - 1 freq high-status - 2 freq heychesters - 2 freq heychester - 1 freq hescastle - 1 freq hoosecoat - 2 freq hoosecoats - 1 freq |
MetaPhone code - HSKTS hoosecoats - 1 freq |
HOOSECOATS |
| Time to execute Levenshtein function - 0.298229 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.499555 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.027822 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.037712 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.000935 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. |