| Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
|---|---|---|---|---|
| advance (0) - 30 freq adance (1) - 1 freq advanced (1) - 23 freq advances (1) - 6 freq audiance (2) - 1 freq advancin (2) - 3 freq advice (2) - 137 freq 'dance (2) - 1 freq dwance (2) - 1 freq advancit (2) - 1 freq askance (2) - 6 freq €˜advance (2) - 1 freq vance (2) - 6 freq dance (2) - 380 freq radiance (2) - 1 freq apace (3) - 1 freq avenge (3) - 11 freq €˜advanced (3) - 1 freq nance (3) - 7 freq aince (3) - 459 freq deane (3) - 3 freq prance (3) - 5 freq apaece (3) - 3 freq hance (3) - 2 freq romance (3) - 39 freq |
advance (0) - 30 freq adance (2) - 1 freq advances (2) - 6 freq advanced (2) - 23 freq advancit (3) - 1 freq dance (3) - 380 freq vance (3) - 6 freq dwance (3) - 1 freq audiance (3) - 1 freq advice (3) - 137 freq advancin (3) - 3 freq dvlce (4) - 1 freq aadience (4) - 5 freq daunce (4) - 42 freq dunce (4) - 27 freq dancey (4) - 1 freq audience (4) - 94 freq askance (4) - 6 freq radiance (4) - 1 freq €˜advance (4) - 1 freq advent (4) - 8 freq 'dance (4) - 1 freq daince (4) - 1 freq balance (5) - 53 freq addan (5) - 3 freq |
SoundEx code - A315 adventure - 30 freq adventirs - 12 freq advantage - 47 freq advance - 30 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 - ATFNS advance - 30 freq €˜advance - 1 freq |
ADVANCE |
| Time to execute Levenshtein function - 0.221554 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.353626 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.028046 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.040940 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.001080 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. |