| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harp (0) - 9 freq harpa (1) - 4 freq hark (1) - 15 freq warp (1) - 9 freq harps (1) - 1 freq harr (1) - 2 freq hart (1) - 28 freq harl (1) - 5 freq hare (1) - 199 freq hrp (1) - 1 freq harm (1) - 21 freq hlrp (1) - 1 freq hard (1) - 782 freq har (1) - 8 freq harz (1) - 1 freq tarp (1) - 1 freq happ (1) - 4 freq hap (1) - 53 freq hasp (1) - 2 freq sharp (1) - 85 freq halp (1) - 54 freq carp (1) - 1 freq harn (1) - 3 freq hairp (1) - 5 freq hari (1) - 1 freq |
harp (0) - 9 freq harpa (1) - 4 freq hairp (1) - 5 freq hrp (1) - 1 freq hari (2) - 1 freq carp (2) - 1 freq sharp (2) - 85 freq hasp (2) - 2 freq halp (2) - 54 freq haap (2) - 1 freq hairpy (2) - 1 freq hraip (2) - 1 freq arp (2) - 1 freq haip (2) - 7 freq hap (2) - 53 freq haep (2) - 13 freq harn (2) - 3 freq hart (2) - 28 freq harl (2) - 5 freq harr (2) - 2 freq happ (2) - 4 freq hark (2) - 15 freq warp (2) - 9 freq hare (2) - 199 freq harps (2) - 1 freq |
SoundEx code - H610 harp - 9 freq hairp - 5 freq hereby - 3 freq herb - 2 freq hairb - 1 freq harvey - 5 freq hrv - 1 freq her've - 1 freq harpa - 4 freq hairfaa - 1 freq hairpy - 1 freq herbie - 11 freq harvie - 3 freq hrf - 1 freq hraip - 1 freq hrp - 1 freq |
MetaPhone code - HRP harp - 9 freq hairp - 5 freq harpa - 4 freq hairpy - 1 freq |
HARP |
| Time to execute Levenshtein function - 0.177464 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.336194 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.027070 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.036792 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.000842 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. |