| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| vapin (0) - 1 freq gapin (1) - 10 freq rapin (1) - 2 freq apin (1) - 13 freq vain (1) - 30 freq lapin (1) - 1 freq vapid (1) - 1 freq papin (1) - 2 freq saain (2) - 7 freq easin (2) - 11 freq raspin (2) - 5 freq vyin (2) - 1 freq vannin (2) - 1 freq raxin (2) - 61 freq datin (2) - 11 freq uppin (2) - 1 freq parin (2) - 4 freq gopin (2) - 1 freq votin (2) - 45 freq leapin (2) - 6 freq camin (2) - 4 freq yasin (2) - 15 freq gain (2) - 53 freq bain (2) - 77 freq lopin (2) - 1 freq |
vapin (0) - 1 freq vapid (2) - 1 freq papin (2) - 2 freq vpon (2) - 1 freq lapin (2) - 1 freq vpn (2) - 1 freq vain (2) - 30 freq rapin (2) - 2 freq gapin (2) - 10 freq apin (2) - 13 freq aapen (3) - 1 freq dupin (3) - 1 freq appin (3) - 2 freq gaapin (3) - 1 freq avin (3) - 2 freq payin (3) - 30 freq haepin (3) - 1 freq 'apen (3) - 2 freq gypin (3) - 3 freq japan (3) - 10 freq heapin (3) - 2 freq copin (3) - 4 freq vann (3) - 3 freq vexin (3) - 5 freq hoapin (3) - 2 freq |
SoundEx code - V150 vapin - 1 freq viviane - 4 freq vhfm - 1 freq vwevnyu - 1 freq vhvnm - 1 freq |
MetaPhone code - FPN vapin - 1 freq vpoun - 1 freq vpon - 1 freq vpn - 1 freq |
VAPIN |
| Time to execute Levenshtein function - 0.506051 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.602537 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.027531 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.072532 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.001096 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. |