| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| hereaboots (0) - 31 freq whereaboots (1) - 4 freq hereabouts (1) - 5 freq here-aboots (1) - 2 freq thereaboots (1) - 14 freq hereaboot (1) - 1 freq hereaboots' (1) - 1 freq hiraboots (2) - 2 freq thareaboots (2) - 1 freq eraboots (2) - 1 freq thereabouts (2) - 1 freq thereaboot (2) - 5 freq hereabout (2) - 1 freq theraboots (2) - 1 freq naeraboots (3) - 1 freq farraboots (3) - 1 freq hereablo (3) - 1 freq hameaboot (3) - 1 freq faraboots (3) - 2 freq whereabout (3) - 1 freq nearaboots (3) - 1 freq whaaraboots (4) - 1 freq near-aboot (4) - 1 freq nortaboot (4) - 1 freq layaboots (4) - 1 freq |
hereaboots (0) - 31 freq hereabouts (1) - 5 freq hereaboots' (2) - 1 freq hiraboots (2) - 2 freq hereaboot (2) - 1 freq thereaboots (2) - 14 freq whereaboots (2) - 4 freq here-aboots (2) - 2 freq theraboots (3) - 1 freq hereabout (3) - 1 freq thereabouts (3) - 1 freq thareaboots (3) - 1 freq eraboots (3) - 1 freq nearaboots (4) - 1 freq thereaboot (4) - 5 freq naeraboots (4) - 1 freq faraboots (4) - 2 freq herbours (5) - 1 freq hertbeats (5) - 1 freq herbaceous (5) - 5 freq whauraboots (5) - 5 freq whereabout (5) - 1 freq hameaboot (5) - 1 freq whaaraboots (5) - 1 freq hereablo (5) - 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 - HRBTS here-aboots - 2 freq hereaboots - 31 freq hereabouts - 5 freq hereaboots' - 1 freq hiraboots - 2 freq hairy-oobits - 7 freq |
HEREABOOTS |
| Time to execute Levenshtein function - 0.196118 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.344116 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.028088 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.039019 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.000859 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. |