| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heecher (0) - 1 freq heicher (1) - 30 freq teecher (1) - 1 freq wheecher (1) - 2 freq eether (2) - 12 freq teucher (2) - 4 freq heeder (2) - 1 freq leeches (2) - 4 freq reechet (2) - 2 freq neether (2) - 7 freq heather (2) - 106 freq weether (2) - 1 freq heigher (2) - 1 freq wheeched (2) - 47 freq hicher (2) - 1 freq seeched (2) - 1 freq heeter (2) - 9 freq blecher (2) - 2 freq heech (2) - 7 freq teacher (2) - 370 freq lecher (2) - 1 freq heetched (2) - 1 freq heefer (2) - 1 freq keeched (2) - 4 freq beeches (2) - 1 freq |
heecher (0) - 1 freq heicher (1) - 30 freq wheecher (2) - 2 freq teecher (2) - 1 freq hicher (2) - 1 freq heigher (3) - 1 freq lecher (3) - 1 freq teacher (3) - 370 freq heech (3) - 7 freq heather (3) - 106 freq teucher (3) - 4 freq heched (3) - 1 freq heuched (3) - 1 freq hechle (4) - 1 freq roucher (4) - 2 freq anocher (4) - 1 freq nicher (4) - 5 freq taicher (4) - 3 freq choocher (4) - 1 freq voucher (4) - 8 freq teachar (4) - 1 freq hasher (4) - 1 freq hoochter (4) - 1 freq acher (4) - 1 freq heichs (4) - 2 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 |
HEECHER |
| Time to execute Levenshtein function - 0.294004 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.694507 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.035006 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.091646 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.000865 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. |