| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hanfu (0) - 10 freq handfu (1) - 10 freq hanf (1) - 2 freq haunfu (1) - 8 freq han (2) - 393 freq naffu (2) - 1 freq awfu (2) - 132 freq nfu (2) - 1 freq hanna (2) - 11 freq haffi (2) - 3 freq hanky (2) - 16 freq hanny (2) - 1 freq aawfu (2) - 1 freq sinfu (2) - 3 freq half (2) - 539 freq hauf- (2) - 1 freq halfa (2) - 2 freq afu (2) - 3 freq hau (2) - 1 freq arfu (2) - 1 freq haufs (2) - 5 freq hauf (2) - 730 freq hanoi (2) - 1 freq hatefu (2) - 5 freq haaf (2) - 34 freq |
hanfu (0) - 10 freq hanf (1) - 2 freq haunfu (1) - 8 freq haunfa (2) - 1 freq hanfae (2) - 3 freq handfu (2) - 10 freq haundfu (3) - 13 freq haunfus (3) - 2 freq hand (3) - 319 freq hang (3) - 48 freq hant (3) - 6 freq hann (3) - 23 freq hans (3) - 206 freq hane (3) - 4 freq handy (3) - 56 freq hanlo (3) - 1 freq haff (3) - 4 freq hanle (3) - 4 freq haunful (3) - 1 freq painfu (3) - 5 freq haf (3) - 9 freq hank (3) - 9 freq hindu (3) - 8 freq banf (3) - 1 freq minfu (3) - 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.181553 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.328152 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.028337 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.037473 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.000907 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. |