Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
hasnt (0) - 1 freq hasna (1) - 29 freq hasni (1) - 1 freq haint (1) - 3 freq wasnt (1) - 6 freq hasn (1) - 3 freq haunt (1) - 28 freq hant (1) - 6 freq hast (1) - 2 freq hasn't (1) - 6 freq maset (2) - 1 freq habit (2) - 50 freq whant (2) - 15 freq haivt (2) - 1 freq haund (2) - 384 freq hannet (2) - 2 freq last (2) - 1873 freq kaint (2) - 4 freq wasna (2) - 80 freq hosst (2) - 1 freq tasht (2) - 1 freq haft (2) - 2 freq han (2) - 393 freq wannt (2) - 1 freq hasnae (2) - 43 freq |
hasnt (0) - 1 freq haunt (2) - 28 freq hast (2) - 2 freq hasn't (2) - 6 freq hasn (2) - 3 freq hant (2) - 6 freq wasnt (2) - 6 freq hasni (2) - 1 freq haint (2) - 3 freq hasna (2) - 29 freq hunt (3) - 62 freq hst (3) - 1 freq husna (3) - 1 freq saint (3) - 43 freq hasty (3) - 6 freq hesna (3) - 12 freq haist (3) - 5 freq host (3) - 37 freq hent (3) - 6 freq hint (3) - 78 freq disnt (3) - 1 freq snt (3) - 1 freq hausna (3) - 1 freq havent (3) - 3 freq haunit (3) - 2 freq |
SoundEx code - H253 hoose-end - 2 freq hoosemaid - 7 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 - HSNT hoose-end - 2 freq husn't - 2 freq hasn't - 6 freq hey-sned - 1 freq haesn't - 1 freq hasnt - 1 freq |
HASNT |
Time to execute Levenshtein function - 0.228473 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.388731 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.031457 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.038005 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.000900 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. |