| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| airflow (0) - 3 freq fairfaw (3) - 1 freq airpot (3) - 1 freq abilow (3) - 7 freq a-low (3) - 2 freq pillow (3) - 11 freq girlw (3) - 1 freq ablow (3) - 336 freq allow (3) - 36 freq air'll (3) - 2 freq airon (3) - 1 freq airmor (3) - 1 freq barlow (3) - 1 freq aimfor (3) - 2 freq arrow (3) - 9 freq irlo (3) - 1 freq willow (3) - 15 freq aglow (3) - 1 freq inlow (3) - 1 freq airlock (3) - 4 freq airlie (3) - 47 freq ab'low (3) - 1 freq nairrow (3) - 1 freq aflot (3) - 2 freq alow (3) - 46 freq |
airflow (0) - 3 freq overflow (4) - 2 freq flow (4) - 32 freq a'blow (5) - 1 freq airfix (5) - 1 freq airly (5) - 20 freq aflot (5) - 2 freq alow (5) - 46 freq rifles (5) - 13 freq airlan (5) - 174 freq flew (5) - 103 freq flouw (5) - 1 freq rifled (5) - 1 freq owerflowe (5) - 1 freq flaw (5) - 8 freq flaow (5) - 1 freq rzlw (5) - 1 freq riflin (5) - 1 freq flowe (5) - 10 freq rifle (5) - 24 freq ab'low (5) - 1 freq rifle' (5) - 2 freq ablow (5) - 336 freq a-low (5) - 2 freq barlow (5) - 1 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 |
AIRFLOW |
| Time to execute Levenshtein function - 0.301493 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.522791 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.058795 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.037633 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.000895 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. |