Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
disadvantage (0) - 8 freq disadvantaged (1) - 1 freq disadvantages (1) - 1 freq advantage (3) - 47 freq disadvantageous (3) - 1 freq advauntage (4) - 1 freq advantages (4) - 12 freq misadventure (4) - 1 freq avantage (4) - 1 freq advuntage (4) - 2 freq dismantle (5) - 1 freq advuntages (5) - 1 freq disengage (5) - 1 freq disadvise (5) - 1 freq vantage (5) - 9 freq avantages (5) - 1 freq diamante (5) - 2 freq distante (5) - 2 freq dissipate (6) - 7 freq saasage (6) - 8 freq parentage (6) - 2 freq disapyntin (6) - 1 freq badinage (6) - 2 freq distant' (6) - 1 freq disappyntin (6) - 5 freq |
disadvantage (0) - 8 freq disadvantages (2) - 1 freq disadvantaged (2) - 1 freq disadvantageous (4) - 1 freq advantage (5) - 47 freq advuntage (6) - 2 freq misadventure (6) - 1 freq advauntage (6) - 1 freq avantage (7) - 1 freq advantages (7) - 12 freq distante (8) - 2 freq vantage (8) - 9 freq disadvise (8) - 1 freq dismantle (8) - 1 freq disengage (8) - 1 freq advuntages (8) - 1 freq disappynted (9) - 1 freq distantly (9) - 2 freq disapointit (9) - 1 freq disappynt (9) - 5 freq disappyntit (9) - 20 freq disseminate (9) - 2 freq disnaewant (9) - 1 freq vintage (9) - 9 freq adventure (9) - 30 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 - TSTFNTJ disadvantage - 8 freq |
DISADVANTAGE |
Time to execute Levenshtein function - 0.220299 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.421944 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.032181 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.039269 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.000961 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. |