| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| disadvantages (0) - 1 freq disadvantaged (1) - 1 freq disadvantage (1) - 8 freq disadvantageous (2) - 1 freq advantages (3) - 12 freq avantages (4) - 1 freq advuntages (4) - 1 freq advantage (4) - 47 freq avantage (5) - 1 freq advauntage (5) - 1 freq advuntage (5) - 2 freq misadventure (5) - 1 freq misaventurs (6) - 1 freq vantage (6) - 9 freq dismantled (6) - 2 freq saasages (6) - 2 freq disparaged (6) - 4 freq distante (6) - 2 freq disabilities (6) - 5 freq dismantle (6) - 1 freq disorientated (6) - 1 freq diamante (6) - 2 freq dilettantes (6) - 1 freq disapinted (6) - 1 freq savages (6) - 8 freq |
disadvantages (0) - 1 freq disadvantageous (2) - 1 freq disadvantaged (2) - 1 freq disadvantage (2) - 8 freq advantages (5) - 12 freq advuntages (6) - 1 freq avantages (7) - 1 freq advantage (7) - 47 freq advuntage (8) - 2 freq misadventure (8) - 1 freq advauntage (8) - 1 freq disadvise (9) - 1 freq avantage (9) - 1 freq misaventurs (9) - 1 freq adventures (9) - 21 freq sarvint's (10) - 1 freq siventies (10) - 1 freq servants (10) - 45 freq seiventies (10) - 1 freq dissenters (10) - 2 freq dishaunts (10) - 1 freq seyvinties (10) - 1 freq dissidents (10) - 2 freq sivventies (10) - 1 freq sairvants (10) - 4 freq |
SoundEx code - D231 dustpan - 3 freq disadvantage - 8 freq dustbins - 1 freq dystopian - 4 freq disadvantaged - 1 freq disadvise - 1 freq dustbunny - 1 freq disadvantageous - 1 freq disadvantages - 1 freq dazedpuckbunny - 1 freq dzxctb - 1 freq dkqdvr - 1 freq |
MetaPhone code - TSTFNTJS disadvantageous - 1 freq disadvantages - 1 freq |
DISADVANTAGES |
| Time to execute Levenshtein function - 0.319263 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.589206 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.027944 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.071798 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.000954 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. |