| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hefner (0) - 1 freq heffer (1) - 2 freq henner (1) - 3 freq hender (2) - 1 freq efter (2) - 3150 freq hedder (2) - 11 freq helter (2) - 3 freq horner (2) - 2 freq seener (2) - 14 freq menner (2) - 4 freq efer (2) - 1 freq heeter (2) - 9 freq hemmer (2) - 21 freq tenner (2) - 25 freq einer (2) - 1 freq hefted (2) - 24 freq werner (2) - 1 freq hinner (2) - 46 freq henery (2) - 1 freq heifer (2) - 5 freq efier (2) - 1 freq gener (2) - 1 freq refer (2) - 37 freq heine (2) - 3 freq herer (2) - 1 freq |
hefner (0) - 1 freq henner (2) - 3 freq heffer (2) - 2 freq hinner (3) - 46 freq heifer (3) - 5 freq hunner (3) - 442 freq dufner (3) - 1 freq heefer (3) - 1 freq henery (3) - 1 freq horner (3) - 2 freq keener (4) - 6 freq helper (4) - 5 freq heater (4) - 13 freq denner (4) - 273 freq header (4) - 2 freq ahunner (4) - 1 freq hearer (4) - 1 freq herber (4) - 5 freq heer (4) - 19 freq henry (4) - 44 freq heider (4) - 12 freq heiter (4) - 1 freq seffer (4) - 1 freq sheener (4) - 1 freq heffers (4) - 1 freq |
SoundEx code - H156 hauf-an-hour - 2 freq heavenwards - 1 freq heavenward - 1 freq hauf-an-oor - 4 freq hauf-mirk - 1 freq hauf-murderin - 1 freq hieven-wairds - 1 freq hivnae-hurders - 1 freq hefner - 1 freq |
MetaPhone code - HFNR hauf-an-oor - 4 freq hefner - 1 freq |
HEFNER |
| Time to execute Levenshtein function - 0.181254 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.404138 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.032124 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.043913 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.000858 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. |