| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| variautiouns (0) - 1 freq variations (2) - 16 freq variation (3) - 18 freq narrautioun (3) - 1 freq vaticinautiouns (4) - 1 freq vairsiouns (4) - 5 freq reactiouns (4) - 1 freq carnations (4) - 1 freq imaginautiouns (4) - 1 freq carnaptious (4) - 44 freq naitiouns (4) - 9 freq habitautioun (4) - 2 freq narration (5) - 1 freq various (5) - 61 freq staitiouns (5) - 2 freq creaution (5) - 2 freq formations (5) - 7 freq reactioun (5) - 1 freq sitivautioun (5) - 6 freq cautions (5) - 1 freq creatioun (5) - 1 freq editiouns (5) - 1 freq quastiouns (5) - 4 freq institutiouns (5) - 1 freq productiouns (5) - 1 freq |
variautiouns (0) - 1 freq variations (2) - 16 freq variation (4) - 18 freq vairsiouns (5) - 5 freq vairsions (6) - 10 freq vibrations (6) - 4 freq rations (6) - 8 freq raitions (6) - 1 freq creations (6) - 3 freq naitiouns (6) - 9 freq narrautioun (6) - 1 freq varieties (6) - 43 freq carnations (6) - 1 freq versiouns (6) - 1 freq vreetins (6) - 1 freq reactiouns (6) - 1 freq marathons (7) - 4 freq airtins (7) - 8 freq reactions (7) - 7 freq vairsioun (7) - 17 freq abortions (7) - 1 freq precautions (7) - 2 freq edeitiouns (7) - 1 freq variants (7) - 14 freq quaistiouns (7) - 2 freq |
SoundEx code - V635 variations - 16 freq variation - 18 freq verdean - 3 freq verdant - 7 freq vreetin' - 1 freq vreetin - 2 freq vritten - 3 freq variautiouns - 1 freq vvreitin - 1 freq vreitin - 1 freq vreiten - 1 freq vrutten - 5 freq vrythin - 1 freq vreetins - 1 freq virtanen - 1 freq |
MetaPhone code - FRXNS variations - 16 freq freshness - 7 freq versions - 36 freq fresians - 1 freq versiouns - 1 freq variautiouns - 1 freq frisians - 3 freq vairsions - 10 freq vairsiouns - 5 freq €˜versions - 1 freq |
VARIAUTIOUNS |
| Time to execute Levenshtein function - 0.595685 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.677253 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.029870 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.079782 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.000875 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. |