| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hoose-huntin (0) - 2 freq clood-hentin (5) - 1 freq loosenin (5) - 2 freq hooseboun (5) - 1 freq hoose-spurgie (5) - 1 freq hoose-end (5) - 2 freq hook-haundit (5) - 17 freq horse-tradin (5) - 1 freq kinnen-huntin (5) - 1 freq rose-tintit (5) - 2 freq goose-guts (5) - 2 freq heid-huntit (5) - 1 freq goose-gut (5) - 1 freq hooshin (5) - 1 freq house-heid (5) - 1 freq hoose-fronts (5) - 1 freq sechtin (6) - 1 freq moose-till (6) - 1 freq loup-hunter (6) - 1 freq hauntin (6) - 4 freq persecutin (6) - 1 freq horsesheen (6) - 1 freq hoochin (6) - 2 freq rooshtie (6) - 1 freq rose-gundy (6) - 1 freq |
hoose-huntin (0) - 2 freq heid-huntit (7) - 1 freq house-heid (8) - 1 freq hoose-fronts (8) - 1 freq rose-tintit (8) - 2 freq iver-hantin (8) - 1 freq hooshin (8) - 1 freq hoose-end (8) - 2 freq hook-haundit (8) - 17 freq clood-hentin (8) - 1 freq dismountin (9) - 1 freq shuitin (9) - 4 freq shuttin (9) - 39 freq struntin (9) - 2 freq hentin (9) - 4 freq house-born (9) - 1 freq hostin (9) - 16 freq ghaist-hauntit (9) - 1 freq hoistin (9) - 2 freq hoastin (9) - 18 freq hook-haunds (9) - 3 freq waashinton (9) - 1 freq low-hangin (9) - 1 freq hie-thinkin (9) - 1 freq hoose-names (9) - 1 freq |
SoundEx code - H253 hoose-end - 2 freq hoosemaid - 6 freq hous-maid - 1 freq husn't - 2 freq hoosemaids - 1 freq hexameter - 1 freq hasn't - 6 freq hackneyed - 2 freq housomdevir - 5 freq howsomdevir - 2 freq hook-haunds - 3 freq hook-haundit - 17 freq hookhaundit - 2 freq hey-sned - 1 freq 'hackneydness' - 1 freq housemaid - 1 freq heich-haunit - 1 freq hyacinth - 1 freq hyacinths - 3 freq haesn't - 1 freq hoose-huntin - 2 freq housomdever - 1 freq hoosemates - 1 freq hazmat - 1 freq hassendean - 1 freq hasnt - 1 freq higgindazs - 1 freq |
MetaPhone code - HSHNTN hoose-huntin - 2 freq |
HOOSE-HUNTIN |
| Time to execute Levenshtein function - 0.317177 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.526278 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.027077 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.037058 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.000836 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. |