| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yearly (0) - 10 freq pearly (1) - 5 freq nearly (1) - 289 freq early (1) - 366 freq dearly (1) - 13 freq yeirly (1) - 2 freq beardy (2) - 5 freq earls (2) - 12 freq 'nearly (2) - 1 freq year (2) - 2070 freq pearls (2) - 17 freq healy (2) - 4 freq yelly (2) - 12 freq wearily (2) - 1 freq measly (2) - 1 freq ferrly (2) - 28 freq ferly (2) - 20 freq peavly (2) - 4 freq year's (2) - 49 freq seerly (2) - 13 freq deary (2) - 4 freq hearty (2) - 9 freq eardly (2) - 1 freq parly (2) - 2 freq realy (2) - 2 freq |
yearly (0) - 10 freq yeirly (1) - 2 freq early (1) - 366 freq earl (2) - 31 freq erly (2) - 3 freq yerl (2) - 1 freq yarl (2) - 18 freq realy (2) - 2 freq aerly (2) - 19 freq nearly (2) - 289 freq dearly (2) - 13 freq pearly (2) - 5 freq reely (3) - 9 freq year (3) - 2070 freq pearl (3) - 8 freq eerily (3) - 1 freq earls (3) - 12 freq year' (3) - 1 freq eraly (3) - 1 freq harly (3) - 13 freq airly (3) - 20 freq real (3) - 592 freq rely (3) - 16 freq years (3) - 1172 freq really (3) - 1231 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.215702 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.345489 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.027411 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.036885 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.000881 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. |