| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harpoon (0) - 8 freq harpoons (1) - 3 freq hardon (2) - 2 freq harpooner (2) - 5 freq maroon (2) - 9 freq hard-on (2) - 1 freq kartoon (2) - 1 freq harpooned (2) - 1 freq aroon (2) - 576 freq cardoon (2) - 1 freq earspoon (2) - 1 freq haroan (2) - 1 freq cartoon (2) - 13 freq hairboor (3) - 1 freq harper (3) - 3 freq garron (3) - 6 freq roon (3) - 1633 freq wappon (3) - 4 freq harrow (3) - 2 freq tapdoon (3) - 1 freq shampooin (3) - 1 freq carryon (3) - 1 freq haldon (3) - 1 freq parton (3) - 4 freq charlton (3) - 2 freq |
harpoon (0) - 8 freq harpoons (2) - 3 freq harpooned (3) - 1 freq hairpin (3) - 3 freq haroan (3) - 1 freq hardon (3) - 2 freq harpooner (3) - 5 freq heron (4) - 13 freq harman (4) - 1 freq hermon (4) - 1 freq harin (4) - 2 freq harp (4) - 9 freq harden (4) - 21 freq harps (4) - 1 freq heroin (4) - 5 freq harnpan (4) - 6 freq warpin (4) - 2 freq halpin (4) - 5 freq horizon (4) - 52 freq haepin (4) - 1 freq happen (4) - 386 freq harken (4) - 7 freq harlin (4) - 3 freq hureson (4) - 1 freq harpa (4) - 4 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.186773 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.399551 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.038169 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.053306 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.001128 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. |