| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunfu (0) - 8 freq haunfa (1) - 1 freq haunful (1) - 1 freq haundfu (1) - 13 freq hanfu (1) - 10 freq haunfus (1) - 2 freq haund (2) - 384 freq haunts (2) - 13 freq haundfus (2) - 3 freq hanf (2) - 2 freq haufs (2) - 5 freq hauns (2) - 507 freq haundful (2) - 1 freq haun' (2) - 2 freq painfu (2) - 4 freq haunt (2) - 28 freq haun (2) - 900 freq hauf-fu (2) - 2 freq halpfu (2) - 1 freq haulf (2) - 4 freq haun- (2) - 1 freq haunit (2) - 2 freq haundy (2) - 18 freq hatefu (2) - 5 freq haunel (2) - 3 freq |
haunfu (0) - 8 freq hanfu (1) - 10 freq haunfa (1) - 1 freq haunfae (2) - 8 freq haunfus (2) - 2 freq hanf (2) - 2 freq haundfu (2) - 13 freq haunful (2) - 1 freq haunel (3) - 3 freq hauna (3) - 5 freq hatefu (3) - 5 freq haunit (3) - 2 freq haundy (3) - 18 freq hauf (3) - 704 freq haunle (3) - 26 freq hanfae (3) - 3 freq haunil (3) - 1 freq haun- (3) - 1 freq lounfu (3) - 1 freq haunin (3) - 7 freq handfu (3) - 10 freq hauns (3) - 507 freq haulf (3) - 4 freq haun' (3) - 2 freq painfu (3) - 4 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 hanfu - 10 freq hanf - 2 freq humph - 14 freq hmv - 2 freq hmyv - 1 freq haunfae - 8 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 hanfu - 10 freq hanf - 2 freq haunfae - 8 freq hanfu - 1 freq |
HAUNFU |
| Time to execute Levenshtein function - 0.175662 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.344697 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.027859 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.036915 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.000769 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. |