| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hanfoos (0) - 1 freq handfoo (2) - 1 freq canfoo (2) - 1 freq hanfaes (2) - 1 freq handoot (2) - 1 freq manto's (3) - 1 freq hadrons (3) - 1 freq nando's (3) - 1 freq yahoos (3) - 1 freq phantons (3) - 1 freq hannies (3) - 3 freq eanoo (3) - 3 freq cannons (3) - 7 freq fantoosh (3) - 67 freq hantles (3) - 1 freq annoys (3) - 4 freq han-tools (3) - 1 freq hands (3) - 175 freq hanfu (3) - 1 freq halo's (3) - 1 freq hafolk (3) - 1 freq afoot (3) - 1 freq acroos (3) - 1 freq hansom (3) - 3 freq henhoose (3) - 7 freq |
hanfoos (0) - 1 freq hanfaes (2) - 1 freq haunfus (3) - 2 freq henhoose (4) - 7 freq hans (4) - 206 freq hands (4) - 175 freq haufs (4) - 5 freq hanles (4) - 1 freq han's (4) - 14 freq hankies (4) - 3 freq handis (4) - 1 freq hanks (4) - 2 freq henoose (4) - 1 freq hanfae (4) - 3 freq hanfu (4) - 10 freq hanf (4) - 2 freq hannies (4) - 3 freq handoot (4) - 1 freq hangs (4) - 3 freq hanns (4) - 23 freq canfoo (4) - 1 freq hants (4) - 1 freq handfoo (4) - 1 freq honours (5) - 11 freq hanbags (5) - 1 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 humfishin - 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 humbugs - 5 freq hanbags - 1 freq hanbag - 1 freq henpeckit - 1 freq homepage - 1 freq hmfigpsmv - 1 freq humpbacks - 1 freq |
MetaPhone code - HNFS hanfoos - 1 freq haunfus - 2 freq hanfaes - 1 freq |
HANFOOS |
| Time to execute Levenshtein function - 0.246483 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.462993 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.031418 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.044545 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.001242 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. |