| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hirpelt (0) - 2 freq hirselt (1) - 1 freq hirpilt (1) - 4 freq hirplt (1) - 1 freq birselt (2) - 4 freq hurrelt (2) - 1 freq warpelt (2) - 1 freq hirsel (2) - 119 freq hirplet (2) - 1 freq hirsels (2) - 3 freq hirple (2) - 12 freq hirpil (2) - 4 freq hiddelt (2) - 3 freq rimpelt (2) - 1 freq hirsell (2) - 13 freq virrelt (2) - 1 freq hirplit (2) - 5 freq shippet (3) - 1 freq hurlt (3) - 3 freq fickelt (3) - 4 freq firget (3) - 19 freq hurself (3) - 1 freq hired (3) - 27 freq hirple's (3) - 1 freq shairpent (3) - 1 freq |
hirpelt (0) - 2 freq hirpilt (1) - 4 freq hirplt (1) - 1 freq hirplit (2) - 5 freq hirplet (2) - 1 freq hirselt (2) - 1 freq hirpil (3) - 4 freq hurrelt (3) - 1 freq hirple (3) - 12 freq warpelt (3) - 1 freq hirpled (4) - 20 freq hurkilt (4) - 1 freq hirples (4) - 7 freq harlt (4) - 5 freq harpreet (4) - 141 freq hirplin (4) - 28 freq hurple (4) - 1 freq hurlt (4) - 3 freq hiddelt (4) - 3 freq hirsel (4) - 119 freq hirsels (4) - 3 freq hirsell (4) - 13 freq rimpelt (4) - 1 freq birselt (4) - 4 freq virrelt (4) - 1 freq |
SoundEx code - H614 hirpled - 20 freq hirplin - 28 freq horrible - 59 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 |
HIRPELT |
| Time to execute Levenshtein function - 0.572617 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.827365 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.031762 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.077101 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.001070 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. |