| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| eardly (0) - 1 freq eardley (1) - 1 freq wardly (1) - 1 freq erdly (1) - 1 freq early (1) - 358 freq hardly (1) - 209 freq lairdly (2) - 2 freq hairdly (2) - 55 freq earthy (2) - 1 freq warily (2) - 3 freq wardle (2) - 11 freq sarely (2) - 1 freq warmly (2) - 4 freq madly (2) - 5 freq wearily (2) - 1 freq eerily (2) - 1 freq tardy (2) - 2 freq eard (2) - 1 freq easily (2) - 59 freq harly (2) - 13 freq nearly (2) - 287 freq darkly (2) - 2 freq mardle (2) - 1 freq easely (2) - 1 freq dearly (2) - 13 freq |
eardly (0) - 1 freq eardley (1) - 1 freq erdly (1) - 1 freq yirdly (2) - 1 freq hardly (2) - 209 freq early (2) - 358 freq wardly (2) - 1 freq deadly (3) - 18 freq weirdly (3) - 5 freq haurdly (3) - 62 freq earl (3) - 31 freq yearly (3) - 10 freq badly (3) - 29 freq sadly (3) - 70 freq herdly (3) - 18 freq rarely (3) - 43 freq waridly (3) - 1 freq haardly (3) - 1 freq eraly (3) - 1 freq erly (3) - 3 freq hordly (3) - 1 freq heardle (3) - 5 freq eandle (3) - 1 freq readily (3) - 7 freq eerily (3) - 1 freq |
SoundEx code - E634 erdly - 1 freq earthly - 10 freq eardley's - 4 freq earth-like - 1 freq eardley - 1 freq eardly - 1 freq €˜erthlie - 1 freq earthylisa - 1 freq |
MetaPhone code - ERTL erdly - 1 freq eardley - 1 freq eardly - 1 freq |
EARDLY |
| Time to execute Levenshtein function - 0.243148 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.351393 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.027932 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.037229 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.000799 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. |