| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunfae (0) - 8 freq haunfa (1) - 1 freq haanfae (1) - 6 freq hanfae (1) - 3 freq haundie (2) - 1 freq havnae (2) - 22 freq haunful (2) - 1 freq haunnle (2) - 7 freq haenae (2) - 18 freq gaunnae (2) - 135 freq hanfaes (2) - 1 freq gauntae (2) - 1 freq gaunae (2) - 39 freq launfaa (2) - 2 freq hasnae (2) - 41 freq maunae (2) - 2 freq handfae (2) - 2 freq haunbag (2) - 9 freq maunnae (2) - 3 freq haunle (2) - 26 freq haundle (2) - 9 freq haunfus (2) - 2 freq haunfast (2) - 2 freq haunfu (2) - 8 freq gaun'ae (2) - 28 freq |
haunfae (0) - 8 freq haanfae (1) - 6 freq hanfae (1) - 3 freq haunfa (1) - 1 freq haunfu (2) - 8 freq haunle (3) - 26 freq handfae (3) - 2 freq hauna (3) - 5 freq hanf (3) - 2 freq launfaa (3) - 2 freq hanfu (3) - 10 freq haunfus (3) - 2 freq haenae (3) - 18 freq haunful (3) - 1 freq hanfaes (3) - 1 freq haundie (3) - 1 freq hunda (4) - 1 freq hauf (4) - 704 freq hantie (4) - 4 freq hunde (4) - 1 freq haulf (4) - 4 freq haunit (4) - 2 freq haunt (4) - 28 freq hunkie (4) - 20 freq haundy (4) - 18 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 |
HAUNFAE |
| Time to execute Levenshtein function - 0.272596 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.350240 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.027397 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.037538 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.000803 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. |