| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hereafter (0) - 1 freq hereefter (1) - 3 freq hereaifter (1) - 3 freq thereafter (1) - 1 freq thereaifter (2) - 1 freq here-efter (2) - 3 freq crafter (3) - 1 freq heefer (3) - 1 freq grafter (3) - 1 freq heelster (3) - 2 freq heeter (3) - 9 freq greater (3) - 20 freq noreaster (3) - 1 freq heater (3) - 13 freq rafter (3) - 1 freq grafters (4) - 3 freq heritor (4) - 1 freq heavier (4) - 10 freq deesaster (4) - 1 freq crafters (4) - 1 freq wheelter (4) - 16 freq bereft- (4) - 2 freq treated (4) - 44 freq herted (4) - 6 freq eraiters (4) - 2 freq |
hereafter (0) - 1 freq hereaifter (1) - 3 freq hereefter (1) - 3 freq thereafter (2) - 1 freq here-efter (3) - 3 freq thereaifter (3) - 1 freq grafter (4) - 1 freq rafter (4) - 1 freq crafter (4) - 1 freq drifter (5) - 2 freq hereditary (5) - 4 freq craftier (5) - 1 freq heritor (5) - 1 freq horter (5) - 1 freq herefore (5) - 1 freq noreaster (5) - 1 freq heelster (5) - 2 freq heefer (5) - 1 freq crofter (5) - 4 freq heeter (5) - 9 freq greater (5) - 20 freq heater (5) - 13 freq crater (6) - 13 freq hatter (6) - 279 freq havester (6) - 1 freq |
SoundEx code - H613 hereaifter - 3 freq horrified - 7 freq here-aboots - 2 freq hereaboots - 31 freq hereabouts - 5 freq hereaboots' - 1 freq hereefter - 3 freq hiraboots - 2 freq hairy-oobits - 7 freq hereafter - 1 freq here-efter - 3 freq hrftin - 1 freq hrvatska - 1 freq hrvatski - 1 freq here-but - 1 freq horrifeed - 3 freq hereaboot - 1 freq hereabout - 1 freq harveythomson - 1 freq |
MetaPhone code - HRFTR hereaifter - 3 freq hereefter - 3 freq hereafter - 1 freq here-efter - 3 freq |
HEREAFTER |
| Time to execute Levenshtein function - 0.222558 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.436260 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.031750 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.038874 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.000930 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. |