| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advanced (0) - 23 freq advances (1) - 6 freq advance (1) - 28 freq advancin (2) - 3 freq advancit (2) - 1 freq €˜advanced (2) - 1 freq adance (2) - 1 freq danced (2) - 56 freq glanced (3) - 27 freq audiance (3) - 1 freq enhanced (3) - 2 freq daunced (3) - 18 freq dancer (3) - 30 freq dwanged (3) - 1 freq anced (3) - 1 freq dancey (3) - 1 freq stanced (3) - 2 freq aaned (3) - 1 freq €˜advance (3) - 1 freq advice (3) - 133 freq askance (3) - 6 freq wanced (3) - 3 freq advices (3) - 1 freq vaned (3) - 1 freq chanced (3) - 6 freq |
advanced (0) - 23 freq advance (2) - 28 freq advances (2) - 6 freq danced (3) - 56 freq advancin (3) - 3 freq advancit (3) - 1 freq dunced (4) - 10 freq daunced (4) - 18 freq adance (4) - 1 freq €˜advanced (4) - 1 freq cadenced (5) - 1 freq advised (5) - 16 freq advancedref (5) - 12 freq ranced (5) - 1 freq advancin' (5) - 1 freq adorned (5) - 2 freq avenged (5) - 3 freq nuanced (5) - 2 freq vanded (5) - 1 freq lanced (5) - 3 freq deavances (5) - 1 freq divorced (5) - 6 freq devined (5) - 1 freq dances (5) - 43 freq scanced (5) - 10 freq |
SoundEx code - A315 adventure - 30 freq adventirs - 12 freq advantage - 46 freq advance - 28 freq adventirs-stairtin - 1 freq adventures - 21 freq advancement - 6 freq advances - 6 freq advent - 8 freq advanced - 23 freq advantages - 12 freq adventurers - 4 freq advuntages - 1 freq adveenturs - 7 freq adventurous - 1 freq adventureland - 1 freq adventurer - 2 freq adventirs-startin - 1 freq advancin - 3 freq advuntage - 2 freq advancin' - 1 freq adventurs - 2 freq adventures-beginnan - 1 freq adventur - 4 freq 'adventurer - 1 freq advauntage - 1 freq advancit - 1 freq 'adventure' - 1 freq adventursum - 1 freq autobahn - 2 freq €˜advance - 1 freq €˜advanced - 1 freq advancedref - 12 freq adventurerstarotdeck - 1 freq |
MetaPhone code - ATFNST advanced - 23 freq advancit - 1 freq €˜advanced - 1 freq |
ADVANCED |
| Time to execute Levenshtein function - 0.183748 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.342716 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.027782 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.037375 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.005301 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. |