| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harn-pan (0) - 4 freq hairn-pan (1) - 1 freq harnpan (1) - 6 freq hard-wan (2) - 1 freq hard-oan (2) - 1 freq ran-dan (3) - 2 freq yarnan (3) - 3 freq happan (3) - 2 freq hang-man (3) - 1 freq hangman (3) - 9 freq wan-man (3) - 1 freq far-han (3) - 2 freq haroan (3) - 1 freq harman (3) - 1 freq hapnan (3) - 2 freq han-dan- (3) - 1 freq harpa (3) - 4 freq hauntan (3) - 1 freq hard-on (3) - 1 freq harkan (3) - 2 freq warnan (3) - 1 freq hard-won (3) - 2 freq can-can (3) - 3 freq salt-pan (3) - 1 freq marzipan (3) - 2 freq |
harn-pan (0) - 4 freq hairn-pan (1) - 1 freq harnpan (2) - 6 freq hard-oan (4) - 1 freq hard-wan (4) - 1 freq hard-won (5) - 2 freq fryan-pan (5) - 1 freq horn-spuin (5) - 1 freq hard-on (5) - 1 freq fryin-pan (5) - 2 freq ran-dan (5) - 2 freq half-open (6) - 1 freq grun-an (6) - 1 freq hanuman (6) - 1 freq marzipan (6) - 2 freq drnpn (6) - 1 freq hard-goin (6) - 1 freq hairpin (6) - 3 freq wan-man (6) - 1 freq hauf-apen (6) - 2 freq happan (6) - 2 freq yarnan (6) - 3 freq harpoon (6) - 8 freq salt-pan (6) - 1 freq harpa (6) - 4 freq |
SoundEx code - H651 hornpipes - 2 freq hornblower - 1 freq hornble - 1 freq hairmfu - 5 freq harrumphed - 2 freq hermaphrodite - 2 freq hornpipe' - 1 freq harn-pan - 4 freq hornpipe - 2 freq hrumphed - 1 freq harrumph - 2 freq hairn-pan - 1 freq hermfu - 3 freq hornbook - 2 freq 'hear-nae-evil' - 1 freq €˜hornpipes - 1 freq harnpan - 6 freq harmful - 1 freq harrumphs - 1 freq |
MetaPhone code - HRNPN harn-pan - 4 freq hairn-pan - 1 freq harnpan - 6 freq |
HARN-PAN |
| Time to execute Levenshtein function - 0.255062 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.412093 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.028215 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.037571 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.000906 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. |