| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hughesms (0) - 1 freq hughes (2) - 5 freq hughesie (2) - 1 freq hugest (3) - 1 freq highest (3) - 21 freq highers (3) - 12 freq hugh's (3) - 4 freq highness (3) - 1 freq huggsss (3) - 1 freq hughie's (3) - 6 freq hughespeg (3) - 1 freq huggises (3) - 1 freq suggests (3) - 22 freq duchess (3) - 246 freq burghers (4) - 2 freq roughest (4) - 3 freq smugness (4) - 2 freq schisms (4) - 1 freq suggest (4) - 47 freq supress (4) - 1 freq chess (4) - 4 freq highlans (4) - 1 freq gleams (4) - 2 freq hunnerts (4) - 1 freq hugh (4) - 87 freq |
hughesms (0) - 1 freq hughes (4) - 5 freq hughesie (4) - 1 freq huggsss (5) - 1 freq hughie's (5) - 6 freq highness (5) - 1 freq huggises (5) - 1 freq hughespeg (5) - 1 freq hugh's (5) - 4 freq highest (5) - 21 freq highers (5) - 12 freq hhsm (6) - 1 freq haughs (6) - 8 freq heighest (6) - 2 freq highways (6) - 3 freq highnesses (6) - 1 freq highheels (6) - 1 freq haggis's (6) - 1 freq haggises (6) - 3 freq highs (6) - 1 freq heughs (6) - 7 freq ghosts (6) - 23 freq suggests (6) - 22 freq schisms (6) - 1 freq haagless (6) - 1 freq |
SoundEx code - H225 high-jinks - 1 freq hause-chynes - 1 freq hcwkomn - 1 freq hughesms - 1 freq hhsxwqnfmu - 1 freq hexagon - 1 freq hawickhighnews - 1 freq hughosmond - 1 freq hughgmeechan - 1 freq hhzciyjiwm - 1 freq |
MetaPhone code - HFSMS hughesms - 1 freq |
HUGHESMS |
| Time to execute Levenshtein function - 0.435033 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.096748 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.089629 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.117614 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.001102 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. |