| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| harpooned (0) - 1 freq harpooner (1) - 5 freq marooned (2) - 2 freq harpoon (2) - 8 freq harpoons (2) - 3 freq happened (3) - 445 freq spooned (3) - 1 freq marroond (3) - 1 freq drooned (3) - 31 freq earphones (3) - 2 freq harboured (3) - 1 freq hallooed (3) - 1 freq crooned (3) - 15 freq hardened (3) - 6 freq saroonded (3) - 1 freq frooned (3) - 8 freq harkened (3) - 2 freq ballooned (3) - 1 freq sharpened (3) - 3 freq harned (3) - 3 freq aroond (3) - 511 freq pardoned (3) - 4 freq appened (4) - 5 freq stooned (4) - 2 freq hairdened (4) - 1 freq |
harpooned (0) - 1 freq harpooner (2) - 5 freq harpoons (3) - 3 freq harpoon (3) - 8 freq harkened (4) - 2 freq sharpened (4) - 3 freq hardened (4) - 6 freq harned (4) - 3 freq happened (4) - 445 freq marooned (4) - 2 freq hirpled (5) - 20 freq hairdened (5) - 1 freq drooned (5) - 31 freq heartened (5) - 1 freq hearkened (5) - 1 freq happend (5) - 1 freq hertened (5) - 1 freq sherpened (5) - 1 freq hippened (5) - 1 freq shairpened (5) - 1 freq reponed (5) - 60 freq horned (5) - 2 freq marroond (5) - 1 freq pardoned (5) - 4 freq harboured (5) - 1 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 - HRPNT harpooned - 1 freq |
HARPOONED |
| Time to execute Levenshtein function - 0.209929 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.378279 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.027467 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.036708 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.000822 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. |