| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoosekeeper (0) - 8 freq housekeeper (1) - 3 freq housskeiper (3) - 1 freq shoapkeeper (4) - 7 freq goalkeeper (4) - 4 freq timekeeper (4) - 3 freq shopkeeper (4) - 3 freq hooseaiver (4) - 1 freq hoosaeiver (4) - 3 freq gatekeeper (4) - 1 freq horsecheer (4) - 1 freq gamekeeper (4) - 3 freq hoosomever (4) - 1 freq hoosoever (4) - 4 freq hoosumever (4) - 16 freq steeper (5) - 1 freq gatekeepers (5) - 11 freq hoosewives (5) - 1 freq coonseeler (5) - 1 freq 'hoosoever (5) - 1 freq hooseen- (5) - 1 freq hoose-end (5) - 2 freq gettkeeper (5) - 1 freq housome'er (5) - 1 freq shopkeepers (5) - 1 freq |
hoosekeeper (0) - 8 freq housekeeper (1) - 3 freq housskeiper (4) - 1 freq gamekeeper (6) - 3 freq hoosomever (6) - 1 freq hoosumever (6) - 16 freq gatekeeper (6) - 1 freq hoosoever (6) - 4 freq hoosaeiver (6) - 3 freq shoapkeeper (6) - 7 freq goalkeeper (6) - 4 freq timekeeper (6) - 3 freq shopkeeper (6) - 3 freq hooseaiver (6) - 1 freq sweeper (7) - 3 freq hooker (7) - 4 freq housomever (7) - 5 freq innkeeper (7) - 1 freq housome'er (7) - 1 freq hoosumiver (7) - 2 freq keeper (7) - 43 freq housumever (7) - 1 freq hoosomiver (7) - 1 freq steeper (7) - 1 freq horsecheer (7) - 1 freq |
SoundEx code - H221 hoosekeeper - 8 freq high-speed - 2 freq housekeeper - 3 freq hocus-pocus - 1 freq heich-chief - 1 freq haggis-burgers - 3 freq haggis-bashin - 1 freq hoose-spurgie - 1 freq hkhjaf - 1 freq haggisfan - 1 freq hwxwcpkmvd - 1 freq hughespeg - 1 freq |
MetaPhone code - HSKPR hoosekeeper - 8 freq housekeeper - 3 freq housskeiper - 1 freq |
HOOSEKEEPER |
| Time to execute Levenshtein function - 0.196742 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.337665 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.028233 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.037001 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.000845 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. |