| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harpoon (0) - 8 freq harpoons (1) - 3 freq cartoon (2) - 13 freq harpooned (2) - 1 freq harpooner (2) - 5 freq cardoon (2) - 1 freq maroon (2) - 9 freq earspoon (2) - 1 freq haroan (2) - 1 freq hardon (2) - 2 freq aroon (2) - 564 freq hard-on (2) - 1 freq kartoon (2) - 1 freq capon (3) - 1 freq spoon (3) - 55 freq happan (3) - 2 freq hirplin (3) - 28 freq yaroo (3) - 1 freq aaron (3) - 5 freq karoona (3) - 1 freq halcyon (3) - 2 freq baron (3) - 4 freq awroon (3) - 1 freq sharon (3) - 10 freq harrot (3) - 3 freq |
harpoon (0) - 8 freq harpoons (2) - 3 freq hairpin (3) - 3 freq hardon (3) - 2 freq haroan (3) - 1 freq harpooner (3) - 5 freq harpooned (3) - 1 freq warpin (4) - 2 freq happin (4) - 16 freq harps (4) - 1 freq heron (4) - 13 freq horizon (4) - 50 freq harmony (4) - 15 freq harden (4) - 21 freq harman (4) - 1 freq harkan (4) - 2 freq sharpen (4) - 4 freq hermon (4) - 1 freq harp (4) - 9 freq hureson (4) - 1 freq harin (4) - 2 freq happen (4) - 383 freq haepin (4) - 1 freq harlin (4) - 3 freq carpin (4) - 2 freq |
SoundEx code - H615 horfinn - 1 freq hairpins - 1 freq harbinger - 2 freq harpoon - 8 freq harpooner - 5 freq harpoons - 3 freq harbingers - 2 freq hairpin - 3 freq harpooned - 1 freq hairband - 1 freq hrvmam - 1 freq |
MetaPhone code - HRPN harpoon - 8 freq hairpin - 3 freq |
HARPOON |
| Time to execute Levenshtein function - 0.235073 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.386003 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.029258 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.040336 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.000979 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. |