| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hushloch (0) - 1 freq fushlochs (2) - 1 freq shooch (3) - 1 freq gulloch (3) - 4 freq tulloch (3) - 8 freq hushlet (3) - 1 freq hushlin (3) - 1 freq humplock (3) - 4 freq dessloch (3) - 4 freq hughock (3) - 8 freq sloch (3) - 4 freq hushle (3) - 1 freq muntloch (3) - 1 freq squalloch (4) - 2 freq goloch (4) - 2 freq hullo (4) - 39 freq huch (4) - 1 freq cushions (4) - 11 freq auroch (4) - 2 freq fushioun (4) - 3 freq hushie (4) - 3 freq slock (4) - 8 freq hillock (4) - 8 freq hush (4) - 35 freq haimlock (4) - 7 freq |
hushloch (0) - 1 freq fushlochs (4) - 1 freq sloch (5) - 4 freq dessloch (5) - 4 freq hushle (5) - 1 freq hushlin (5) - 1 freq hushlet (5) - 1 freq shooch (5) - 1 freq saveloch (6) - 1 freq meshach (6) - 1 freq heimlich (6) - 1 freq shyooch (6) - 1 freq shuch (6) - 3 freq sheuch (6) - 70 freq slouch (6) - 2 freq highlicht (6) - 3 freq sea-loch (6) - 1 freq tulloch (6) - 8 freq gulloch (6) - 4 freq muntloch (6) - 1 freq hughock (6) - 8 freq humplock (6) - 4 freq belloch (7) - 3 freq is-och (7) - 1 freq 'shoosh (7) - 2 freq |
SoundEx code - H242 highlights - 14 freq hackles - 3 freq hauchles - 1 freq highlight - 16 freq hochles - 1 freq heh-class - 1 freq huckles - 1 freq hooseless - 1 freq highheels - 1 freq hooselessness - 1 freq heighlichtin - 3 freq heighlicht - 3 freq heighlichts - 5 freq heighlichted - 7 freq hechle's - 2 freq hecklesome - 1 freq hushloch - 1 freq hasillgreen' - 1 freq highlichts - 4 freq houzils - 1 freq hie-gloss - 1 freq highly-skilled - 1 freq highlichtit - 1 freq haagless - 1 freq highlicht - 3 freq howcleuch - 4 freq howcleuchsheil - 3 freq howcleuchshiel - 1 freq hazels - 2 freq highlichtin - 1 freq hazelglasgow - 4 freq highlighting - 3 freq |
MetaPhone code - HXLX hushloch - 1 freq |
HUSHLOCH |
| Time to execute Levenshtein function - 0.786426 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 - 1.306727 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.180951 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.120124 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.000881 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. |