| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arrival (0) - 24 freq arrivals (1) - 3 freq arrives (2) - 16 freq carnival (2) - 4 freq arrivin (2) - 8 freq arrivd (2) - 1 freq rival (2) - 14 freq arrived (2) - 139 freq aerial (2) - 5 freq arrive (2) - 52 freq arrivit (2) - 7 freq harrigals (3) - 2 freq raivel (3) - 3 freq arreevals (3) - 1 freq groinal (3) - 1 freq arisan (3) - 1 freq graivel (3) - 5 freq arriddy (3) - 1 freq africay (3) - 1 freq bruital (3) - 3 freq drivas (3) - 1 freq orral (3) - 6 freq arran (3) - 15 freq arras (3) - 24 freq derval (3) - 17 freq |
arrival (0) - 24 freq arrivals (2) - 3 freq arrive (3) - 52 freq arrivit (3) - 7 freq arrived (3) - 139 freq rival (3) - 14 freq arrivin (3) - 8 freq arrivd (3) - 1 freq arrives (3) - 16 freq traivil (4) - 1 freq drivel (4) - 4 freq orral (4) - 6 freq traivel (4) - 66 freq derval (4) - 17 freq graivel (4) - 5 freq revival (4) - 56 freq arreevals (4) - 1 freq carnival (4) - 4 freq aerial (4) - 5 freq raivel (4) - 3 freq trivial (4) - 3 freq bridal (5) - 4 freq arsenal (5) - 3 freq travel (5) - 57 freq revel (5) - 2 freq |
SoundEx code - A614 airieplane - 1 freq aeroplanes - 3 freq aeroplane - 14 freq arrival - 24 freq airaplane - 2 freq arable - 8 freq airplane - 4 freq air-a-planes - 1 freq arbalests - 1 freq airfields - 1 freq arrivals - 3 freq airflow - 3 freq arreevals - 1 freq aeraplanes - 1 freq airieplanes - 1 freq |
MetaPhone code - ARFL arrival - 24 freq airflow - 3 freq |
ARRIVAL |
| Time to execute Levenshtein function - 0.196179 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.335689 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.028119 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.037274 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.000933 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. |