| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nearer (0) - 72 freq dearer (1) - 8 freq neurer (1) - 1 freq neared (1) - 3 freq hearer (1) - 1 freq nerrer (1) - 2 freq bearer (1) - 7 freq nearder (1) - 1 freq farer (2) - 1 freq leared (2) - 1 freq reared (2) - 24 freq ferrer (2) - 8 freq teared (2) - 1 freq nearin (2) - 6 freq neave (2) - 3 freq heared (2) - 14 freq nether (2) - 26 freq naurer (2) - 1 freq neiper (2) - 6 freq header (2) - 2 freq beater (2) - 11 freq neeper (2) - 5 freq eader (2) - 1 freq neider (2) - 1 freq weaker (2) - 4 freq |
nearer (0) - 72 freq neurer (1) - 1 freq nerr (2) - 9 freq naurer (2) - 1 freq nearder (2) - 1 freq bearer (2) - 7 freq dearer (2) - 8 freq neared (2) - 3 freq hearer (2) - 1 freq nerrer (2) - 2 freq nearly (3) - 289 freq nearg (3) - 1 freq narrer (3) - 2 freq nearan (3) - 1 freq ne're (3) - 1 freq nare (3) - 1 freq neiger (3) - 1 freq nerra (3) - 33 freq carer (3) - 10 freq ne'er (3) - 173 freq herer (3) - 1 freq neuter (3) - 2 freq neeber (3) - 2 freq neiver (3) - 1 freq faarer (3) - 6 freq |
SoundEx code - N660 nearer - 72 freq neurer - 1 freq narrer - 2 freq narraer - 1 freq narrower - 2 freq nerrer - 2 freq naurer - 1 freq |
MetaPhone code - NRR nearer - 72 freq neurer - 1 freq narrer - 2 freq narraer - 1 freq nerrer - 2 freq naurer - 1 freq |
NEARER near - 1175 freq nearer - 72 freq nearest - 64 freq |
| Time to execute Levenshtein function - 0.258653 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.355086 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.034767 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.036634 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.000900 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. |