| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hugggggvsssss (0) - 1 freq hugggggsssss (1) - 9 freq hugggggssssss (1) - 2 freq huggggggsssss (1) - 5 freq hugggggggsssss (2) - 4 freq huggggssssss (2) - 1 freq hugggggssss (2) - 19 freq huggggggssss (2) - 10 freq hugggggggssss (2) - 11 freq huggggggssssss (2) - 3 freq hugggsssss (3) - 2 freq hugggggsss (3) - 10 freq huggggssss (3) - 6 freq huggggggggsssss (3) - 1 freq huggggggggssss (3) - 3 freq hugggggggsdss (3) - 1 freq hugggggggssssss (3) - 1 freq huggggggsss (3) - 2 freq huggggggssssß (3) - 1 freq huggggggggssssss (4) - 5 freq hugggggss (4) - 2 freq huggggggss (4) - 1 freq huggggsss (4) - 6 freq hugggggggggssss (4) - 1 freq hugggssss (4) - 4 freq |
hugggggvsssss (0) - 1 freq hugggggssssss (2) - 2 freq huggggggsssss (2) - 5 freq hugggggsssss (2) - 9 freq hugggggggssss (4) - 11 freq huggggggssssss (4) - 3 freq huggggggssss (4) - 10 freq hugggggssss (4) - 19 freq huggggssssss (4) - 1 freq hugggggggsssss (4) - 4 freq hugggggggssssss (6) - 1 freq huggggggsss (6) - 2 freq huggggggssssß (6) - 1 freq hugggggggsdss (6) - 1 freq huggggggggsssss (6) - 1 freq huggggggggssss (6) - 3 freq huggggssss (6) - 6 freq hugggggsss (6) - 10 freq hugggsssss (6) - 2 freq hugggssss (8) - 4 freq hugggggggsssssss (8) - 1 freq hugggggggggssss (8) - 1 freq hugggggss (8) - 2 freq huggggggggssssss (8) - 5 freq huggggggss (8) - 1 freq |
SoundEx code - H212 hospice - 6 freq hoosewife's - 1 freq hesps - 2 freq housewife's - 1 freq hauchue-pauchtie - 1 freq hoosewives - 1 freq hospices - 1 freq hxwps - 1 freq hawickfps - 1 freq hkzfeosn - 1 freq hugggggvsssss - 1 freq hxvsqv - 1 freq hcofyka - 1 freq hqffgczinr - 1 freq hgpg - 1 freq hgqpzt - 1 freq |
MetaPhone code - HKFS hugggggvsssss - 1 freq |
HUGGGGGVSSSSS |
| Time to execute Levenshtein function - 0.227114 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.392802 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.027860 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.043385 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.000875 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. |