| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airlines (0) - 1 freq airline (1) - 1 freq carlines (2) - 3 freq yirlins (2) - 1 freq hairline (2) - 4 freq airlan's (2) - 10 freq birlins (2) - 1 freq airlier (2) - 16 freq airmies (2) - 16 freq airies (2) - 1 freq ailins (2) - 1 freq airliest (2) - 6 freq airlie (2) - 47 freq erlines (2) - 2 freq irvines (2) - 1 freq airtins (2) - 8 freq aiblins (2) - 282 freq lines (3) - 222 freq declines (3) - 2 freq aniline (3) - 9 freq lipliners (3) - 1 freq airches (3) - 12 freq eilins (3) - 4 freq airned (3) - 1 freq siblins (3) - 10 freq |
airlines (0) - 1 freq airline (2) - 1 freq yirlins (2) - 1 freq erlines (2) - 2 freq aiblins (3) - 282 freq ailins (3) - 1 freq airtins (3) - 8 freq yorlins (3) - 3 freq railins (3) - 22 freq carlines (3) - 3 freq yerlins (3) - 1 freq airlan's (3) - 10 freq birlins (3) - 1 freq irvines (3) - 1 freq yiblins (4) - 1 freq railings (4) - 7 freq airland (4) - 2 freq yorlin's (4) - 2 freq derlins (4) - 1 freq darlins (4) - 4 freq rivlins (4) - 2 freq arlene (4) - 13 freq perlins (4) - 3 freq pailins (4) - 4 freq ootlines (4) - 6 freq |
SoundEx code - A645 airlann's - 1 freq airlan - 174 freq arlene - 13 freq airlan's - 10 freq airland - 2 freq airlann - 20 freq airlannn - 2 freq airline - 1 freq arlenefoster - 1 freq arlinklater - 1 freq airlines - 1 freq |
MetaPhone code - ARLNS airlann's - 1 freq airlan's - 10 freq airlines - 1 freq |
AIRLINES |
| Time to execute Levenshtein function - 0.416649 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.630522 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.049170 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.075192 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.000941 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. |