| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hafolk (0) - 1 freq harold (2) - 13 freq folk (2) - 1713 freq 'folk (2) - 2 freq €œfolk (2) - 1 freq hail (3) - 265 freq halo's (3) - 1 freq hancock (3) - 3 freq walk (3) - 483 freq halls (3) - 13 freq howk (3) - 67 freq hole (3) - 257 freq haemly (3) - 1 freq hjook (3) - 2 freq hark (3) - 15 freq €˜fock (3) - 2 freq yalk (3) - 1 freq haulf (3) - 4 freq hardly (3) - 215 freq haik (3) - 4 freq hankle (3) - 1 freq folk' (3) - 3 freq haals (3) - 9 freq harl (3) - 5 freq hallo (3) - 5 freq |
hafolk (0) - 1 freq folk (3) - 1713 freq 'folk (3) - 2 freq foulk (4) - 15 freq folke (4) - 1 freq hulk (4) - 4 freq folky (4) - 1 freq filk (4) - 12 freq €œfolk (4) - 1 freq harold (4) - 13 freq haf (5) - 9 freq i'fowk (5) - 2 freq fock (5) - 288 freq hoak (5) - 5 freq baulk (5) - 1 freq hmolj (5) - 1 freq foak (5) - 3 freq haal (5) - 42 freq hask (5) - 4 freq fook (5) - 2 freq talk (5) - 496 freq aafil (5) - 199 freq haigle (5) - 1 freq waulk (5) - 1 freq hooly (5) - 6 freq |
SoundEx code - H142 howplessly - 2 freq hopeless - 12 freq hauf-licht - 6 freq hauflicht - 1 freq haiveless - 1 freq hobbles - 2 freq howplessness - 2 freq hovels - 1 freq hauf-likit - 1 freq hapless - 11 freq hopelessness - 2 freq hauf-lachin - 1 freq howpless - 5 freq hopless - 1 freq hubbleskyu - 2 freq hovel's - 1 freq hoppless - 1 freq haveless - 1 freq hafolk - 1 freq hubbelskyu - 1 freq hubbilshue - 1 freq hopelessly - 1 freq €˜hopelessly - 1 freq hauf-light - 2 freq hauf-lauchin - 1 freq hplayspiano - 1 freq |
MetaPhone code - HFLK hafolk - 1 freq |
HAFOLK |
| Time to execute Levenshtein function - 0.495471 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 - 1.018528 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.077153 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.086955 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.000936 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. |