Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
ariel (0) - 5 freq aries (1) - 3 freq riel (1) - 1 freq kriel (1) - 1 freq aeriel (1) - 1 freq maries (2) - 60 freq ajie (2) - 3 freq 'diel (2) - 1 freq tried (2) - 687 freq brill (2) - 12 freq cries (2) - 101 freq alien (2) - 41 freq varies (2) - 2 freq ael (2) - 1 freq ahied (2) - 1 freq dries (2) - 8 freq frier (2) - 1 freq arise (2) - 10 freq ari (2) - 3 freq trill (2) - 3 freq niel (2) - 1 freq brel (2) - 2 freq fardel (2) - 1 freq urie (2) - 1 freq armed (2) - 18 freq |
ariel (0) - 5 freq aeriel (1) - 1 freq riel (1) - 1 freq rel (2) - 1 freq rael (2) - 110 freq aerial (2) - 5 freq ril (2) - 1 freq reel (2) - 44 freq aries (2) - 3 freq kriel (2) - 1 freq rie (3) - 1 freq airly (3) - 20 freq are' (3) - 1 freq area (3) - 166 freq diel (3) - 5 freq are- (3) - 1 freq yiel (3) - 1 freq yarl (3) - 18 freq argie (3) - 17 freq ahil (3) - 1 freq arite (3) - 7 freq creel (3) - 37 freq farel (3) - 1 freq arles (3) - 5 freq arne (3) - 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 |
ARIEL |
Time to execute Levenshtein function - 0.192545 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.380230 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.034789 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.040727 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.000944 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. |