| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hezron (0) - 7 freq heron (1) - 13 freq herons (2) - 3 freq hearin (2) - 174 freq heroin (2) - 5 freq hero (2) - 81 freq eiron (2) - 1 freq hermon (2) - 1 freq heaton (2) - 1 freq herin (2) - 2 freq heros (2) - 1 freq hearan (2) - 14 freq heirin (2) - 2 freq heero (2) - 1 freq heeren (2) - 2 freq heerin (2) - 3 freq herod (2) - 49 freq heston (2) - 1 freq hendron (2) - 2 freq herrin (2) - 23 freq byron (3) - 9 freq devon (3) - 4 freq heelan (3) - 7 freq tynron (3) - 1 freq renton (3) - 4 freq |
hezron (0) - 7 freq heron (2) - 13 freq hearan (3) - 14 freq heirin (3) - 2 freq herrin (3) - 23 freq herin (3) - 2 freq heerin (3) - 3 freq heeren (3) - 2 freq hearin (3) - 174 freq heroin (3) - 5 freq hurin (4) - 1 freq heezin (4) - 32 freq heizin (4) - 15 freq herein (4) - 7 freq hurrin (4) - 1 freq hairin (4) - 3 freq ahern (4) - 1 freq herrien (4) - 1 freq hizin (4) - 7 freq hzr (4) - 1 freq hirin (4) - 3 freq harn (4) - 3 freq hoarn (4) - 1 freq heazin (4) - 1 freq heroine (4) - 6 freq |
SoundEx code - H265 huggerin - 1 freq huggery-muggery - 1 freq hezron - 7 freq haycorns - 13 freq haycorn - 2 freq hie-groond - 1 freq hugger-mugger - 1 freq houseroom - 1 freq hawickremember - 9 freq hcurmi - 1 freq hhkrymesap - 1 freq hoosiermama - 1 freq |
MetaPhone code - HSRN hezron - 7 freq |
HEZRON |
| Time to execute Levenshtein function - 0.473874 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.914336 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.027461 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.095312 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.000754 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. |