Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hagglet (0) - 2 freq haglet (1) - 1 freq haigle (2) - 1 freq haggart (2) - 3 freq taiglet (2) - 1 freq waggles (2) - 1 freq hanklet (2) - 2 freq maggle (2) - 1 freq gaggle (2) - 5 freq haggit (2) - 3 freq waggled (2) - 2 freq hamlet (2) - 10 freq aggle (2) - 2 freq aggled (2) - 1 freq haggie (2) - 1 freq raggle (2) - 207 freq tanglet (2) - 1 freq eaglet (2) - 14 freq hagglin (2) - 1 freq haggult (2) - 1 freq shaggle (2) - 1 freq hajget (2) - 1 freq hagged (2) - 2 freq haunlet (2) - 2 freq hogget (2) - 1 freq |
hagglet (0) - 2 freq haggult (2) - 1 freq haglet (2) - 1 freq hagglin (3) - 1 freq haggit (3) - 3 freq haggart (3) - 3 freq hogget (3) - 1 freq hagged (4) - 2 freq shaggle (4) - 1 freq hacklet (4) - 1 freq haunlet (4) - 2 freq higgledy (4) - 1 freq waggilt (4) - 1 freq geeglet (4) - 1 freq pugglit (4) - 1 freq higgilty (4) - 1 freq huggit (4) - 1 freq waggelt (4) - 1 freq hajget (4) - 1 freq haigle (4) - 1 freq hanklet (4) - 2 freq taiglet (4) - 1 freq waggled (4) - 2 freq gaggle (4) - 5 freq eaglet (4) - 14 freq |
SoundEx code - H243 haglet - 1 freq huckled - 12 freq heckled - 1 freq hauchled - 1 freq higgeldy-piggeldy - 1 freq hochlet - 1 freq higgledy - 1 freq hoosehold - 12 freq huckelt - 1 freq hochled - 1 freq haggult - 1 freq household - 10 freq heckelt - 1 freq heukelt - 2 freq hoosehald - 1 freq higgledy-piggledy - 1 freq higgelty-piggelty - 1 freq heighlit - 1 freq heich-leid - 1 freq hechl't - 2 freq hochl't - 2 freq hazeldean' - 1 freq hickled - 1 freq hacklet - 1 freq hechlet - 1 freq househald - 2 freq high-heeled - 1 freq hoosehauld - 2 freq hushlet - 1 freq hagglet - 2 freq higgilty - 1 freq hazelheed - 1 freq hooseholds - 1 freq |
MetaPhone code - HKLT haglet - 1 freq huckled - 12 freq heckled - 1 freq higgledy - 1 freq huckelt - 1 freq haggult - 1 freq heckelt - 1 freq heukelt - 2 freq hickled - 1 freq hacklet - 1 freq hagglet - 2 freq higgilty - 1 freq |
HAGGLET |
Time to execute Levenshtein function - 0.189463 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.343159 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.027930 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.038674 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.000933 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. |