| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| aurally (0) - 1 freq dually (2) - 3 freq akwally (2) - 1 freq ahbally (2) - 1 freq morally (2) - 3 freq acwally (2) - 4 freq aural (2) - 1 freq brally (2) - 4 freq qually (2) - 1 freq acutally (2) - 1 freq naturally (2) - 42 freq rally (2) - 10 freq orally (2) - 2 freq hurly (3) - 4 freq swaally (3) - 1 freq sully (3) - 2 freq aprill (3) - 1 freq dursley (3) - 48 freq mally (3) - 1 freq faskally (3) - 1 freq verbally (3) - 1 freq €˜really (3) - 3 freq fauraway (3) - 1 freq gully (3) - 16 freq finally (3) - 296 freq |
aurally (0) - 1 freq orally (2) - 2 freq rally (2) - 10 freq ralley (3) - 2 freq railly (3) - 1 freq really (3) - 1212 freq royally (3) - 2 freq qually (3) - 1 freq raelly (3) - 67 freq ralely (3) - 5 freq aural (3) - 1 freq brally (3) - 4 freq dually (3) - 3 freq morally (3) - 3 freq brolly (4) - 15 freq wally (4) - 47 freq hally (4) - 1 freq tally (4) - 3 freq pully (4) - 2 freq reilly (4) - 3 freq irll (4) - 1 freq frilly (4) - 8 freq fally (4) - 1 freq equally (4) - 35 freq fuully (4) - 1 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 |
AURALLY |
| Time to execute Levenshtein function - 0.551781 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.701557 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.031947 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.096744 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.001088 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. |