| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yearly (0) - 10 freq yeirly (1) - 2 freq nearly (1) - 287 freq dearly (1) - 13 freq early (1) - 358 freq pearly (1) - 5 freq neatly (2) - 26 freq harly (2) - 13 freq beardy (2) - 2 freq feary (2) - 1 freq years (2) - 1141 freq earls (2) - 12 freq neerly (2) - 1 freq wearily (2) - 1 freq clearly (2) - 140 freq weary (2) - 60 freq eardly (2) - 1 freq yelly (2) - 12 freq ferly (2) - 20 freq ferrly (2) - 28 freq seerly (2) - 13 freq measly (2) - 1 freq year' (2) - 1 freq weakly (2) - 4 freq deary (2) - 4 freq |
yearly (0) - 10 freq yeirly (1) - 2 freq early (1) - 358 freq yarl (2) - 18 freq earl (2) - 31 freq erly (2) - 3 freq realy (2) - 2 freq yerl (2) - 1 freq aerly (2) - 19 freq dearly (2) - 13 freq nearly (2) - 287 freq pearly (2) - 5 freq real (3) - 565 freq parly (3) - 2 freq really (3) - 1212 freq year (3) - 2026 freq healy (3) - 4 freq yeirlie (3) - 1 freq yearn (3) - 1 freq mealy (3) - 5 freq eraly (3) - 1 freq airly (3) - 20 freq realiy (3) - 1 freq seerly (3) - 13 freq years (3) - 1141 freq |
SoundEx code - Y640 yeir-oul - 2 freq yearly - 10 freq yeirly - 2 freq yarl - 18 freq yerl - 1 freq yeirlie - 1 freq -year-aul - 1 freq yoorwullie - 5 freq |
MetaPhone code - YRL yeir-oul - 2 freq yearly - 10 freq yeirly - 2 freq yarl - 18 freq yerl - 1 freq yeirlie - 1 freq -year-aul - 1 freq |
YEARLY |
| Time to execute Levenshtein function - 0.216024 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.345940 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.027035 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.037466 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. |