| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| yeirly (0) - 2 freq yearly (1) - 10 freq birly (2) - 10 freq deidly (2) - 19 freq nearly (2) - 289 freq neirby (2) - 4 freq yerl (2) - 1 freq peerly (2) - 1 freq yelly (2) - 12 freq seerly (2) - 13 freq reilly (2) - 3 freq ferrly (2) - 28 freq puirly (2) - 3 freq ferly (2) - 20 freq yeirs (2) - 45 freq yeir's (2) - 1 freq nairly (2) - 1 freq erly (2) - 3 freq keily (2) - 1 freq pearly (2) - 5 freq aerly (2) - 19 freq skirly (2) - 19 freq beinly (2) - 1 freq sairly (2) - 28 freq weirdly (2) - 5 freq |
yeirly (0) - 2 freq yearly (1) - 10 freq erly (2) - 3 freq airly (2) - 20 freq yeirlie (2) - 1 freq aerly (2) - 19 freq early (2) - 366 freq yerl (2) - 1 freq rely (3) - 16 freq mirly (3) - 1 freq yeil (3) - 1 freq irlo (3) - 1 freq fairly (3) - 235 freq yirdy (3) - 6 freq rairly (3) - 1 freq yirdly (3) - 1 freq yarl (3) - 18 freq dearly (3) - 13 freq eerily (3) - 1 freq earl (3) - 31 freq reely (3) - 9 freq eraly (3) - 1 freq girly (3) - 1 freq yeiris (3) - 1 freq yeir (3) - 253 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 |
YEIRLY |
| Time to execute Levenshtein function - 0.196518 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.368624 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.031623 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.042745 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.001144 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. |