| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| naeraboots (0) - 1 freq naeraboot (1) - 4 freq farraboots (2) - 1 freq nearaboots (2) - 1 freq faraboots (2) - 2 freq theraboots (2) - 1 freq eraboots (2) - 1 freq naur-aboot (3) - 1 freq walkaboots (3) - 2 freq hereaboots (3) - 31 freq whaaraboots (3) - 1 freq whauraboots (3) - 5 freq whereaboots (3) - 4 freq haemaboot (3) - 1 freq nearaboot (3) - 3 freq layaboots (3) - 1 freq hiraboots (3) - 2 freq thereaboots (3) - 15 freq carboot (4) - 3 freq nortaboot (4) - 1 freq overshoots (4) - 1 freq hereabouts (4) - 5 freq thereabouts (4) - 1 freq narrator's (4) - 2 freq nanobots (4) - 1 freq |
naeraboots (0) - 1 freq nearaboots (2) - 1 freq naeraboot (2) - 4 freq eraboots (3) - 1 freq faraboots (3) - 2 freq hiraboots (4) - 2 freq hereaboots (4) - 31 freq theraboots (4) - 1 freq nearaboot (4) - 3 freq farraboots (4) - 1 freq thereaboots (5) - 15 freq inaboots (5) - 3 freq in-aboots (5) - 1 freq nanobots (5) - 1 freq hereabouts (5) - 5 freq layaboots (5) - 1 freq naur-aboot (5) - 1 freq whaaraboots (5) - 1 freq whauraboots (5) - 5 freq whereaboots (5) - 4 freq rinaboots (6) - 1 freq hereaboot (6) - 1 freq naebodys (6) - 1 freq here-aboots (6) - 2 freq touraboot (6) - 1 freq |
SoundEx code - N613 nearaboots - 1 freq nearaboot - 3 freq naeraboot - 4 freq naeraboots - 1 freq near-aboot - 1 freq naur-aboot - 1 freq |
MetaPhone code - NRBTS nearaboots - 1 freq naeraboots - 1 freq |
NAERABOOTS |
| Time to execute Levenshtein function - 0.786625 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 - 1.121896 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.083556 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.096379 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.000891 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. |