Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
houzils (0) - 1 freq hooziss (2) - 1 freq huils (2) - 5 freq fouzilt (2) - 1 freq houls (2) - 10 freq bouls (3) - 2 freq houffs (3) - 1 freq touzles (3) - 1 freq mozzies (3) - 1 freq hazily (3) - 1 freq rouls (3) - 2 freq coils (3) - 11 freq houlds (3) - 1 freq houss (3) - 64 freq modils (3) - 1 freq hails (3) - 6 freq doutis (3) - 1 freq ouzel (3) - 2 freq fooils (3) - 1 freq houssis (3) - 3 freq fossils (3) - 10 freq horrals (3) - 1 freq pupils (3) - 79 freq puils (3) - 10 freq zils (3) - 1 freq |
houzils (0) - 1 freq houls (3) - 10 freq hazels (3) - 2 freq hooziss (3) - 1 freq huils (3) - 5 freq hovels (4) - 1 freq hauls (4) - 1 freq zils (4) - 1 freq hizzies (4) - 4 freq haunels (4) - 1 freq huzzas (4) - 1 freq huls (4) - 6 freq hotels (4) - 9 freq hulls (4) - 9 freq hols (4) - 6 freq huills (4) - 1 freq hollies (4) - 2 freq hurls (4) - 4 freq hazily (4) - 1 freq howls (4) - 15 freq hools (4) - 2 freq hails (4) - 6 freq fouzilt (4) - 1 freq touzles (4) - 1 freq cuils (5) - 1 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 - HSLS hooseless - 1 freq houzils - 1 freq hazels - 2 freq |
HOUZILS |
Time to execute Levenshtein function - 0.201653 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.337674 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.032647 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.043989 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.000920 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. |