| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| nearly (0) - 287 freq early (1) - 358 freq yearly (1) - 10 freq nearby (1) - 50 freq neatly (1) - 26 freq pearly (1) - 5 freq dearly (1) - 13 freq neerly (1) - 1 freq 'nearly (1) - 1 freq aerly (2) - 19 freq earls (2) - 12 freq neale (2) - 1 freq neirby (2) - 4 freq earl (2) - 31 freq nervy (2) - 5 freq nelly (2) - 8 freq weary (2) - 60 freq teary (2) - 3 freq needly (2) - 4 freq deadly (2) - 18 freq mearry (2) - 1 freq newly (2) - 27 freq weakly (2) - 4 freq measly (2) - 1 freq nearer (2) - 72 freq |
nearly (0) - 287 freq neerly (1) - 1 freq nairly (2) - 1 freq anerly (2) - 7 freq early (2) - 358 freq yearly (2) - 10 freq 'nearly (2) - 1 freq nearby (2) - 50 freq neatly (2) - 26 freq dearly (2) - 13 freq pearly (2) - 5 freq pearl (3) - 8 freq narky (3) - 1 freq neal (3) - 1 freq seerly (3) - 13 freq yeirly (3) - 2 freq erly (3) - 3 freq nrl (3) - 1 freq near (3) - 1153 freq neilly (3) - 12 freq nary (3) - 2 freq neared (3) - 3 freq nearg (3) - 1 freq nirl (3) - 1 freq nearin (3) - 6 freq |
SoundEx code - N640 nearly - 287 freq narrowly - 1 freq near-low - 1 freq 'nearly - 1 freq nirl - 1 freq narraly - 1 freq nairly - 1 freq nrl - 1 freq neerly - 1 freq |
MetaPhone code - NRL nearly - 287 freq knurl - 2 freq narrowly - 1 freq near-low - 1 freq 'nearly - 1 freq knurlie - 1 freq nirl - 1 freq knurly - 1 freq narraly - 1 freq nairly - 1 freq nrl - 1 freq neerly - 1 freq |
NEARLY |
| Time to execute Levenshtein function - 0.191150 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.344514 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.027930 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.037899 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.000818 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. |