| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hanfu (0) - 1 freq han (2) - 2 freq hanfu (2) - 10 freq hanf (3) - 2 freq an (3) - 4 freq handfu (3) - 10 freq haunfu (3) - 8 freq handful (3) - 3 freq halfs (3) - 1 freq hanbug (3) - 11 freq hanfae (3) - 3 freq hanfoos (3) - 1 freq hae (3) - 1 freq hanfaes (3) - 1 freq janet (3) - 1 freq haunful (3) - 1 freq hame (3) - 1 freq haunfus (3) - 2 freq hane (4) - 4 freq hangry (4) - 3 freq languge (4) - 1 freq hauge (4) - 2 freq handlume (4) - 1 freq haus (4) - 1 freq danube (4) - 1 freq |
hanfu (0) - 1 freq han (3) - 2 freq hanfu (4) - 10 freq hae (5) - 1 freq hanfoos (5) - 1 freq hanfaes (5) - 1 freq haunfus (5) - 2 freq hanfae (5) - 3 freq hame (5) - 1 freq janet (5) - 1 freq haunful (5) - 1 freq an (5) - 4 freq hanf (5) - 2 freq haunfu (5) - 8 freq halfs (5) - 1 freq sayin (6) - 1 freq aroun (6) - 1 freq her (6) - 1 freq haanfae (6) - 6 freq linin (6) - 1 freq haunfae (6) - 9 freq haunfast (6) - 2 freq dons (6) - 2 freq haunfa (6) - 1 freq thin (6) - 1 freq |
SoundEx code - H510 hanfae - 3 freq hmph - 1 freq haanfae - 6 freq hump - 15 freq hmmph - 8 freq 'hmmph - 2 freq haunfu - 8 freq haunfa - 1 freq hemp - 3 freq humpf - 1 freq humpie - 1 freq humf - 1 freq haunfae - 9 freq humph - 15 freq hanfu - 10 freq hanf - 2 freq hmv - 2 freq hmyv - 1 freq humphy - 52 freq hamnivo - 1 freq hamnavoe - 4 freq hyne-aff - 1 freq hempie - 2 freq humbie - 1 freq hinny-bee - 1 freq hmfff - 1 freq humfy - 1 freq hmbbw - 1 freq hoomp - 1 freq hmmmph - 1 freq hannahb - 6 freq hanfu - 1 freq hnb - 1 freq hmp - 1 freq |
MetaPhone code - HNF hanfae - 3 freq haanfae - 6 freq haunfu - 8 freq haunfa - 1 freq haunfae - 9 freq hanfu - 10 freq hanf - 2 freq hanfu - 1 freq |
HANFU |
| Time to execute Levenshtein function - 0.206135 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.347769 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.027964 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.039453 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.001036 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. |