| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hooler (0) - 1 freq hooley (1) - 5 freq hoolet (1) - 106 freq holler (1) - 2 freq hooled (1) - 1 freq hooer (1) - 2 freq hooker (1) - 4 freq hoover (1) - 18 freq houler (1) - 1 freq cooler (1) - 12 freq hoofed (2) - 3 freq hoor (2) - 64 freq hools (2) - 2 freq hooers (2) - 2 freq hooiver (2) - 14 freq dooter (2) - 3 freq dooer (2) - 1 freq modler (2) - 1 freq ooter (2) - 25 freq shooter (2) - 2 freq shooder (2) - 132 freq tooter (2) - 4 freq hostler (2) - 18 freq boiler (2) - 4 freq poller (2) - 1 freq |
hooler (0) - 1 freq houler (1) - 1 freq hoover (2) - 18 freq hauler (2) - 1 freq healer (2) - 3 freq hooker (2) - 4 freq cooler (2) - 12 freq hooley (2) - 5 freq hoolet (2) - 106 freq hooer (2) - 2 freq hooled (2) - 1 freq holler (2) - 2 freq heller (3) - 3 freq houer (3) - 7 freq hoker (3) - 1 freq houlet (3) - 9 freq hozier (3) - 1 freq hoolin (3) - 6 freq holey (3) - 4 freq hoyle (3) - 3 freq ouler (3) - 8 freq holes (3) - 73 freq hoola (3) - 2 freq holder (3) - 2 freq couler (3) - 1 freq |
SoundEx code - H460 hellery - 3 freq hillary - 1 freq houler - 1 freq hauler - 1 freq healer - 3 freq hooler - 1 freq hilary - 2 freq holler - 2 freq 'heller' - 1 freq heller - 3 freq |
MetaPhone code - HLR hellery - 3 freq hillary - 1 freq houler - 1 freq hauler - 1 freq healer - 3 freq hooler - 1 freq hilary - 2 freq holler - 2 freq 'heller' - 1 freq heller - 3 freq |
HOOLER |
| Time to execute Levenshtein function - 0.197277 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.374959 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.027205 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.037421 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.000884 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. |