| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haancuffs (0) - 6 freq haancuff (1) - 4 freq haanless (4) - 1 freq hawickfps (4) - 1 freq haands (4) - 43 freq snuffs (4) - 1 freq haundfus (4) - 3 freq haans (4) - 26 freq haunbuffed (4) - 1 freq handcuffed (4) - 2 freq haan's (4) - 8 freq anuff (4) - 28 freq haand's (4) - 2 freq ancus (4) - 2 freq haandless (4) - 1 freq haad-aff (4) - 1 freq haaf's (4) - 1 freq haanfae (4) - 6 freq haircuts (4) - 2 freq haandfoo (4) - 1 freq haufs (4) - 5 freq houffs (4) - 1 freq haunfus (4) - 2 freq huffs (4) - 2 freq annuff (4) - 1 freq |
haancuffs (0) - 6 freq haancuff (2) - 4 freq haunbuffed (6) - 1 freq handcuffed (6) - 2 freq scuffs (6) - 1 freq cuffs (6) - 7 freq haunfus (6) - 2 freq haundfus (6) - 3 freq huffs (6) - 2 freq snuffs (6) - 1 freq houffs (6) - 1 freq hancairts (7) - 1 freq annuff (7) - 1 freq coffs (7) - 2 freq nyaffs (7) - 6 freq hauncairts (7) - 1 freq hanfaes (7) - 1 freq gnyaffs (7) - 1 freq howffs (7) - 5 freq sniffs (7) - 5 freq hanfoos (7) - 1 freq scoffs (7) - 5 freq scaffs (7) - 1 freq haands (7) - 43 freq ancus (7) - 2 freq |
SoundEx code - H521 hings-everythin - 1 freq haunspikes - 1 freq hungover - 5 freq haancuffs - 6 freq henceforth - 2 freq hangover - 13 freq hings've - 1 freq hangovers - 4 freq hanky-panky - 1 freq hung-up - 1 freq haunspail - 1 freq homespun - 1 freq hansper - 1 freq haancuff - 4 freq hemisphere - 2 freq hangblaa - 1 freq hngqpepv - 1 freq hmmkzv - 1 freq hmwzfubk - 1 freq |
MetaPhone code - HNKFS haancuffs - 6 freq |
HAANCUFFS |
| Time to execute Levenshtein function - 0.215435 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.467230 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.037654 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.079183 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.000970 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. |