| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| haundbook (0) - 1 freq handbook (1) - 1 freq haundbuik (2) - 1 freq handfoo (3) - 1 freq haundsome (3) - 1 freq handcock (3) - 1 freq haandfoo (3) - 1 freq hornbook (3) - 2 freq hand-oot (3) - 1 freq haundbag (3) - 4 freq haundiwork (3) - 1 freq handoot (3) - 1 freq haunbuik (3) - 2 freq haund (4) - 384 freq songbook (4) - 1 freq haundsel (4) - 3 freq haundie (4) - 1 freq hauf-oor (4) - 8 freq bakebook (4) - 2 freq handbag (4) - 21 freq whauraboot (4) - 1 freq hundog (4) - 1 freq haundit (4) - 63 freq hymn-books (4) - 1 freq haundrail (4) - 1 freq |
haundbook (0) - 1 freq handbook (1) - 1 freq haundbuik (2) - 1 freq haunbuik (4) - 2 freq haundbag (4) - 4 freq handbrake (5) - 3 freq handbeg (5) - 1 freq haandbag (5) - 1 freq handbag (5) - 21 freq haundiwork (5) - 1 freq handoot (5) - 1 freq haundsome (5) - 1 freq handfoo (5) - 1 freq handcock (5) - 1 freq haandfoo (5) - 1 freq hand-oot (5) - 1 freq hornbook (5) - 2 freq haundin (6) - 18 freq huddock (6) - 6 freq handiwork (6) - 4 freq haundel (6) - 1 freq haundles (6) - 2 freq haundywurk (6) - 1 freq haundled (6) - 1 freq handsome (6) - 41 freq |
SoundEx code - H531 haund-fest - 1 freq handbag - 21 freq haund-for-haund - 2 freq haundbag - 4 freq haematopus - 1 freq handbeg - 1 freq haundbuik - 1 freq haundfus - 3 freq haundfu - 13 freq handful - 3 freq handfu - 10 freq handwoven - 1 freq haund-wuiven - 1 freq haundbook - 1 freq handbrake - 3 freq haandfoo - 1 freq haandbag - 1 freq handfastin - 1 freq haundfast - 1 freq handfae - 2 freq haund-for-nieve - 1 freq handbags - 2 freq haundful - 1 freq handfoo - 1 freq handbook - 1 freq hannothehibbie - 1 freq handpicked - 1 freq |
MetaPhone code - HNTBK handbag - 21 freq haundbag - 4 freq handbeg - 1 freq haundbuik - 1 freq haundbook - 1 freq haandbag - 1 freq handbook - 1 freq |
HAUNDBOOK |
| Time to execute Levenshtein function - 0.396891 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.708426 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.028176 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.073221 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.001172 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. |