| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haunbuik (0) - 2 freq haundin (3) - 18 freq haunit (3) - 2 freq facebuik (3) - 7 freq haunlin (3) - 5 freq haunfu (3) - 8 freq haanbraik (3) - 2 freq haunful (3) - 1 freq sangbuik (3) - 1 freq sauntlik (3) - 1 freq dounluik (3) - 1 freq haunfus (3) - 2 freq haunnlin (3) - 1 freq haunbag (3) - 9 freq haundie (3) - 1 freq haunnil (3) - 1 freq haundbook (3) - 1 freq haunnit (3) - 2 freq haunnin (3) - 1 freq haunlit (3) - 1 freq haunmaid (3) - 1 freq haunbrake (3) - 1 freq haunin (3) - 7 freq haundlin (3) - 10 freq haunbell (3) - 1 freq |
haunbuik (0) - 2 freq haunbrake (4) - 1 freq haanbraik (4) - 2 freq haundbook (4) - 1 freq haunbag (4) - 9 freq hanbug (4) - 11 freq hauntin (5) - 4 freq haundit (5) - 62 freq haunin (5) - 7 freq haunbell (5) - 1 freq hauntit (5) - 15 freq hanbag (5) - 1 freq handbook (5) - 1 freq hank (5) - 7 freq hankie (5) - 15 freq hunkie (5) - 20 freq hanbrake (5) - 2 freq haunmaid (5) - 1 freq handkie (5) - 1 freq hornbook (5) - 2 freq haunil (5) - 1 freq haunful (5) - 1 freq haunlit (5) - 1 freq hunk (5) - 5 freq haunfu (5) - 8 freq |
SoundEx code - H512 haunbag - 9 freq humps - 3 freq haunfast - 2 freq hembist - 1 freq hanfoos - 1 freq humphs - 2 freq henna-busks - 1 freq hanbug - 11 freq hame-bakes - 1 freq humbug - 5 freq haunfus - 2 freq hanfaes - 1 freq hame-bakin - 1 freq home-baked - 1 freq hinny-bees - 1 freq hampstead - 1 freq han-pickit - 1 freq hinny-piece - 1 freq hymn-books - 1 freq hempies- - 1 freq haunbuik - 2 freq hampshire - 1 freq hempies - 2 freq humfished - 1 freq hanbags - 1 freq hanbag - 1 freq humbugs - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HNBK haunbag - 9 freq hanbug - 11 freq haunbuik - 2 freq hanbag - 1 freq |
HAUNBUIK |
| Time to execute Levenshtein function - 0.430904 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.579388 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.027438 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.068256 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.000873 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. |