Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
airport (0) - 20 freq airports (1) - 3 freq fairport (1) - 1 freq airpot (1) - 1 freq airport's (2) - 1 freq airmor (2) - 1 freq import (2) - 6 freq ignort (3) - 3 freq imports (3) - 2 freq export (3) - 10 freq hirpelt (3) - 2 freq wiprt (3) - 1 freq firlot (3) - 2 freq airlock (3) - 4 freq aiorts (3) - 1 freq pasport (3) - 5 freq aircht (3) - 1 freq caiort (3) - 1 freq tinpot (3) - 3 freq support (3) - 339 freq airmpit (3) - 1 freq sport (3) - 155 freq airon (3) - 1 freq dispert (3) - 2 freq newport (3) - 3 freq |
airport (0) - 20 freq airports (2) - 3 freq airpot (2) - 1 freq fairport (2) - 1 freq report (3) - 224 freq import (3) - 6 freq raport (3) - 1 freq aeroports (4) - 1 freq tayport (4) - 2 freq impart (4) - 2 freq sport (4) - 155 freq apert (4) - 12 freq apart (4) - 114 freq rupert (4) - 17 freq impert (4) - 1 freq aroart (4) - 1 freq reporte (4) - 1 freq appert (4) - 1 freq repoort (4) - 1 freq airmor (4) - 1 freq airport's (4) - 1 freq export (4) - 10 freq port (4) - 70 freq wiprt (4) - 1 freq expert (5) - 43 freq |
SoundEx code - A616 airborne - 4 freq airport - 20 freq arbroath - 16 freq airforce - 2 freq airy-fairy - 2 freq airports - 3 freq airport's - 1 freq arbor-vitae - 1 freq arverie-like - 1 freq arbroath' - 2 freq airforss - 1 freq aeroports - 1 freq arbrahamic - 1 freq airbornesappers - 1 freq airbrush - 3 freq arbroathhigh - 1 freq arabforlife - 1 freq arborist - 1 freq |
MetaPhone code - ARPRT airport - 20 freq |
AIRPORT |
Time to execute Levenshtein function - 0.175476 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.329748 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.027541 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.046602 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.004205 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. |