| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| arrival (0) - 23 freq arrivals (1) - 3 freq arrivit (2) - 7 freq carnival (2) - 4 freq arrivd (2) - 1 freq arrivin (2) - 8 freq rival (2) - 14 freq arrived (2) - 136 freq arrive (2) - 51 freq arrives (2) - 16 freq aerial (2) - 5 freq rivals (3) - 3 freq carnivals (3) - 1 freq raivel (3) - 3 freq african (3) - 20 freq adrian (3) - 4 freq april (3) - 117 freq africay (3) - 1 freq burial (3) - 12 freq revival (3) - 56 freq serial (3) - 3 freq afrika (3) - 5 freq ariel (3) - 5 freq appruval (3) - 1 freq arisan (3) - 1 freq |
arrival (0) - 23 freq arrivals (2) - 3 freq arrive (3) - 51 freq rival (3) - 14 freq arrives (3) - 16 freq arrived (3) - 136 freq arrivin (3) - 8 freq arrivit (3) - 7 freq arrivd (3) - 1 freq revival (4) - 56 freq derval (4) - 17 freq traivel (4) - 66 freq trivial (4) - 3 freq drivel (4) - 3 freq graivel (4) - 5 freq raivel (4) - 3 freq aerial (4) - 5 freq carnival (4) - 4 freq arreevals (4) - 1 freq orral (4) - 6 freq traivil (4) - 1 freq marital (5) - 5 freq bridal (5) - 4 freq articoal (5) - 1 freq arrit (5) - 1 freq |
SoundEx code - A614 airieplane - 1 freq aeroplanes - 3 freq aeroplane - 14 freq arrival - 23 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 - 23 freq airflow - 3 freq |
ARRIVAL |
| Time to execute Levenshtein function - 0.318122 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.588791 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.076686 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.084286 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.001150 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. |