| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airliest (0) - 6 freq aerliest (1) - 4 freq airlie (2) - 47 freq airmies (2) - 16 freq erliest (2) - 1 freq silliest (2) - 1 freq earliest (2) - 19 freq mirkiest (2) - 1 freq airlines (2) - 1 freq airtist (2) - 15 freq airnest (2) - 2 freq airlier (2) - 16 freq aisyiest (2) - 1 freq airlift (2) - 1 freq airies (2) - 1 freq airless (2) - 1 freq ailment (3) - 2 freq pirlie (3) - 1 freq ailins (3) - 1 freq airier (3) - 1 freq birkies (3) - 1 freq arles (3) - 5 freq cairnies (3) - 1 freq pairties (3) - 94 freq lillies (3) - 1 freq |
airliest (0) - 6 freq aerliest (1) - 4 freq earliest (2) - 19 freq erliest (2) - 1 freq airnest (3) - 2 freq airlift (3) - 1 freq airtist (3) - 15 freq airless (3) - 1 freq aalest (4) - 4 freq ugliest (4) - 1 freq arles (4) - 5 freq aulest (4) - 7 freq holiest (4) - 2 freq arabest (4) - 3 freq arrest (4) - 9 freq arreist (4) - 3 freq airlie (4) - 47 freq airlines (4) - 1 freq alist (4) - 2 freq aisyiest (4) - 1 freq airmies (4) - 16 freq airlier (4) - 16 freq silliest (4) - 1 freq mirkiest (4) - 1 freq artist (4) - 27 freq |
SoundEx code - A642 aerliest - 4 freq airliest - 6 freq arles - 5 freq airlock - 4 freq arrol's - 1 freq airless - 1 freq auralsex - 1 freq arillas - 1 freq |
MetaPhone code - ARLST airliest - 6 freq |
AIRLIEST |
| Time to execute Levenshtein function - 0.285167 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.432530 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.030007 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.045626 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.001128 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. |