| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| heftin (0) - 41 freq heftins (1) - 1 freq heftit (1) - 5 freq heatin (1) - 16 freq hentin (1) - 4 freq hrftin (1) - 1 freq eltin (2) - 1 freq restin (2) - 29 freq eftir (2) - 499 freq eatin (2) - 154 freq heazin (2) - 1 freq liftin (2) - 75 freq hechtin (2) - 1 freq geffin (2) - 1 freq meetin (2) - 147 freq certin (2) - 1 freq coftin (2) - 1 freq pettin (2) - 3 freq sheetin (2) - 6 freq hengin (2) - 3 freq herten (2) - 3 freq heelin (2) - 1 freq heivin (2) - 12 freq heevin (2) - 9 freq hostin (2) - 16 freq |
heftin (0) - 41 freq heftins (2) - 1 freq hrftin (2) - 1 freq hentin (2) - 4 freq heatin (2) - 16 freq heftit (2) - 5 freq hurtin (3) - 17 freq huffin (3) - 7 freq haitin (3) - 6 freq hintin (3) - 4 freq heistin (3) - 1 freq heefin (3) - 1 freq heeten (3) - 1 freq hefts (3) - 39 freq oaftin (3) - 1 freq luftin (3) - 2 freq heft (3) - 111 freq hefted (3) - 24 freq hittin (3) - 35 freq huntin (3) - 66 freq heston (3) - 1 freq hitin (3) - 1 freq hatin (3) - 2 freq riftin (3) - 6 freq giftin (3) - 2 freq |
SoundEx code - H135 hauf-hidden - 3 freq haufdwam - 1 freq hauf-tuimt - 1 freq hauf-tuim - 1 freq heftin - 41 freq haufdementit - 1 freq hauf-etten - 2 freq heftins - 1 freq hauf-tume - 1 freq hfetime - 1 freq hauf-time - 1 freq hvehdn - 1 freq hobbitoncentral - 3 freq |
MetaPhone code - HFTN heftin - 41 freq hauf-etten - 2 freq |
HEFTIN |
| Time to execute Levenshtein function - 0.387329 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.624526 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.080615 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.042204 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.050005 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. |