| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airly (0) - 20 freq airmy (1) - 92 freq ainly (1) - 231 freq fairly (1) - 233 freq aerly (1) - 19 freq girly (1) - 1 freq airy (1) - 4 freq rairly (1) - 1 freq nairly (1) - 1 freq mirly (1) - 1 freq birly (1) - 10 freq sairly (1) - 28 freq airty (1) - 1 freq viry (2) - 9 freq dilly (2) - 1 freq saifly (2) - 1 freq irlo (2) - 1 freq hiely (2) - 1 freq airds (2) - 15 freq dairkly (2) - 1 freq aznly (2) - 1 freq mairy (2) - 7 freq mainly (2) - 40 freq oily (2) - 7 freq mirlt (2) - 1 freq |
airly (0) - 20 freq aerly (1) - 19 freq airty (2) - 1 freq sairly (2) - 28 freq irlo (2) - 1 freq early (2) - 358 freq erly (2) - 3 freq birly (2) - 10 freq airlie (2) - 47 freq yeirly (2) - 2 freq ainly (2) - 231 freq airmy (2) - 92 freq fairly (2) - 233 freq airy (2) - 4 freq girly (2) - 1 freq rairly (2) - 1 freq nairly (2) - 1 freq mirly (2) - 1 freq aiple (3) - 5 freq curly (3) - 51 freq ably (3) - 1 freq airc (3) - 1 freq mily (3) - 2 freq aprily (3) - 2 freq aigle (3) - 4 freq |
SoundEx code - A640 airlie - 47 freq aerlie - 10 freq airly - 20 freq ariel - 5 freq aerly - 19 freq air'll - 2 freq aeriel - 1 freq aurally - 1 freq aerial - 5 freq aural - 1 freq |
MetaPhone code - ARL airlie - 47 freq airly - 20 freq ariel - 5 freq air'll - 2 freq aurally - 1 freq aural - 1 freq |
AIRLY |
| Time to execute Levenshtein function - 0.199411 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.342282 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.030703 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.037073 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.000801 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. |