| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hicher (0) - 1 freq sicher (1) - 1 freq heicher (1) - 30 freq higher (1) - 79 freq nicher (1) - 5 freq richer (1) - 15 freq ticher (1) - 3 freq picher (1) - 4 freq ficher (1) - 4 freq hither (1) - 6 freq gither (2) - 69 freq michel (2) - 3 freq laicher (2) - 5 freq thicker (2) - 11 freq tiche (2) - 1 freq bicker (2) - 12 freq piche (2) - 1 freq lichter (2) - 8 freq acher (2) - 1 freq niches (2) - 1 freq siched (2) - 9 freq hitches (2) - 2 freq huchter (2) - 1 freq vincher (2) - 1 freq richert (2) - 2 freq |
hicher (0) - 1 freq heicher (1) - 30 freq picher (2) - 4 freq hither (2) - 6 freq heecher (2) - 1 freq ticher (2) - 3 freq ficher (2) - 4 freq higher (2) - 79 freq richer (2) - 15 freq sicher (2) - 1 freq nicher (2) - 5 freq ncher (3) - 1 freq heigher (3) - 1 freq hasher (3) - 1 freq archer (3) - 9 freq hicht (3) - 47 freq rocher (3) - 5 freq heched (3) - 1 freq tocher (3) - 25 freq lecher (3) - 1 freq cher (3) - 6 freq taicher (3) - 3 freq hich (3) - 7 freq ichor (3) - 1 freq aircher (3) - 1 freq |
SoundEx code - H260 hjckrrh - 5 freq heicher - 30 freq higher - 79 freq hawker - 1 freq heecher - 1 freq hooker - 4 freq hasher - 1 freq hicher - 1 freq hozier - 1 freq hickory - 3 freq howker - 2 freq hosiery - 2 freq heigher - 1 freq hussar - 2 freq hegri - 1 freq hoker - 1 freq hcr - 2 freq haegri - 1 freq hzr - 1 freq hawickrau - 6 freq hagar - 1 freq |
MetaPhone code - HXR heicher - 30 freq heecher - 1 freq hasher - 1 freq hicher - 1 freq hatchery - 2 freq |
HICHER |
| Time to execute Levenshtein function - 0.210157 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.352213 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.030260 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.037567 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.000920 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. |