| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heicher (0) - 30 freq heecher (1) - 1 freq heigher (1) - 1 freq hicher (1) - 1 freq lecher (2) - 1 freq eirher (2) - 1 freq heicht (2) - 53 freq teacher (2) - 340 freq teucher (2) - 4 freq heider (2) - 12 freq teichar (2) - 2 freq heirder (2) - 1 freq heather (2) - 104 freq sicher (2) - 1 freq hither (2) - 6 freq neither (2) - 166 freq keichen (2) - 3 freq wheecher (2) - 2 freq seiched (2) - 1 freq picher (2) - 4 freq heich (2) - 260 freq either (2) - 445 freq laicher (2) - 5 freq wheither (2) - 1 freq higher (2) - 76 freq |
heicher (0) - 30 freq hicher (1) - 1 freq heecher (1) - 1 freq heigher (2) - 1 freq richer (3) - 15 freq nicher (3) - 5 freq higher (3) - 76 freq picher (3) - 4 freq ficher (3) - 4 freq heich (3) - 260 freq heichs (3) - 2 freq taicher (3) - 3 freq ticher (3) - 3 freq heuched (3) - 1 freq wheecher (3) - 2 freq teecher (3) - 1 freq heched (3) - 1 freq laicher (3) - 5 freq hither (3) - 6 freq teichar (3) - 2 freq sicher (3) - 1 freq heather (3) - 104 freq heicht (3) - 53 freq lecher (3) - 1 freq teacher (3) - 340 freq |
SoundEx code - H260 hjckrrh - 5 freq heicher - 30 freq higher - 76 freq hawker - 1 freq hazer - 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 |
HEICHER |
| Time to execute Levenshtein function - 0.200967 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.357027 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.027066 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.036582 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.000856 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. |