| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hirpled (0) - 20 freq hirples (1) - 7 freq hirplet (1) - 1 freq chirpled (1) - 1 freq sirpled (1) - 1 freq hirple (1) - 12 freq thirled (2) - 20 freq hirsle (2) - 3 freq hirplin (2) - 28 freq hirseled (2) - 1 freq birples (2) - 1 freq birled (2) - 69 freq hirplit (2) - 5 freq sirple (2) - 2 freq hirple's (2) - 1 freq harled (2) - 6 freq hickled (2) - 1 freq mirled (2) - 2 freq dirled (2) - 10 freq birsled (2) - 3 freq hurkled (2) - 1 freq rippled (2) - 1 freq hired (2) - 27 freq hurtled (2) - 3 freq hiddled (2) - 6 freq |
hirpled (0) - 20 freq sirpled (2) - 1 freq chirpled (2) - 1 freq hirple (2) - 12 freq hirplet (2) - 1 freq hirples (2) - 7 freq harled (3) - 6 freq hirplit (3) - 5 freq hurple (3) - 1 freq hurled (3) - 20 freq hurtled (3) - 3 freq hirseled (3) - 1 freq hirplt (3) - 1 freq hirplin (3) - 28 freq hurkled (3) - 1 freq pimpled (4) - 1 freq chirped (4) - 3 freq tirled (4) - 6 freq wippled (4) - 2 freq irped (4) - 1 freq harld (4) - 1 freq harald (4) - 17 freq tripled (4) - 1 freq riplyed (4) - 1 freq hirpilt (4) - 4 freq |
SoundEx code - H614 hirpled - 20 freq hirplin - 28 freq horrible - 58 freq hirpelt - 2 freq hoarrible - 1 freq hirples - 7 freq hirple - 12 freq hirplit - 5 freq hirpilt - 4 freq hirple's - 1 freq harebells - 2 freq herbal - 5 freq hirpil - 4 freq hirplt - 1 freq herbie'll - 1 freq harebell - 3 freq horribly - 2 freq herbalist - 1 freq hirplet - 1 freq hereablo - 1 freq herobelfast - 1 freq hurple - 1 freq hirplinyowe - 1 freq |
MetaPhone code - HRPLT hirpled - 20 freq hirpelt - 2 freq hirplit - 5 freq hirpilt - 4 freq hirplt - 1 freq hirplet - 1 freq |
HIRPLED |
| Time to execute Levenshtein function - 0.207656 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.380312 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.027361 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.038342 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.000787 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. |