Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
airlier (0) - 16 freq aerlier (1) - 8 freq airlie (1) - 47 freq airier (1) - 1 freq airmie (2) - 15 freq birsier (2) - 1 freq airline (2) - 1 freq ailie (2) - 1 freq airliest (2) - 6 freq airgie (2) - 1 freq girlie (2) - 5 freq mirlie (2) - 1 freq mirkier (2) - 2 freq cairier (2) - 1 freq airgied (2) - 2 freq airlift (2) - 1 freq airmies (2) - 16 freq oilier (2) - 1 freq airdie (2) - 2 freq pairlie (2) - 1 freq airer (2) - 1 freq sairlie (2) - 6 freq airies (2) - 1 freq airlines (2) - 1 freq aerlie (2) - 10 freq |
airlier (0) - 16 freq aerlier (1) - 8 freq earlier (2) - 108 freq airier (2) - 1 freq airlie (2) - 47 freq aerlie (3) - 10 freq oilier (3) - 1 freq dirler (3) - 1 freq airline (3) - 1 freq airer (3) - 1 freq airmor (4) - 1 freq raigler (4) - 4 freq urlar (4) - 1 freq raeler (4) - 1 freq airtery (4) - 1 freq airmour (4) - 7 freq yeirlie (4) - 1 freq aeriel (4) - 1 freq airlan (4) - 174 freq lairie (4) - 2 freq ariel (4) - 5 freq earrier (4) - 1 freq wiler (4) - 1 freq auller (4) - 1 freq siluer (4) - 1 freq |
SoundEx code - A646 airlier - 16 freq aerlier - 8 freq |
MetaPhone code - ARLR airlier - 16 freq |
AIRLIER |
Time to execute Levenshtein function - 0.204477 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.384056 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.027332 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.037729 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.001004 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. |