Levenshtein | Double Levenshtein | SoundEx | MetaPhone | Manually curated |
---|---|---|---|---|
advancin (0) - 3 freq advancit (1) - 1 freq advancin' (1) - 1 freq advanced (2) - 23 freq advance (2) - 30 freq dancin (2) - 138 freq advances (2) - 6 freq dangin (3) - 1 freq glancin (3) - 13 freq a-wantin (3) - 1 freq romancin (3) - 1 freq aanin (3) - 2 freq aduncan (3) - 42 freq dauncin (3) - 28 freq dancis (3) - 2 freq advisin (3) - 3 freq 'dancing (3) - 1 freq duncin (3) - 23 freq vannin (3) - 1 freq dancin' (3) - 4 freq adance (3) - 1 freq chancin (3) - 4 freq prancin (3) - 3 freq dancing (3) - 31 freq adaptin (3) - 1 freq |
advancin (0) - 3 freq advancin' (2) - 1 freq advancit (2) - 1 freq advances (3) - 6 freq dancin (3) - 138 freq advance (3) - 30 freq advanced (3) - 23 freq aduncan (4) - 42 freq dauncin (4) - 28 freq duncin (4) - 23 freq dancan (4) - 8 freq adornin (5) - 1 freq balancin (5) - 9 freq dansin (5) - 14 freq avengin (5) - 1 freq divinin (5) - 1 freq danceen (5) - 4 freq dauncan (5) - 1 freq duncan (5) - 99 freq dancing (5) - 31 freq dancean (5) - 3 freq dacin (5) - 15 freq scancin (5) - 6 freq glancin (5) - 13 freq prancin (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 - ATFNSN advancin - 3 freq advancin' - 1 freq |
ADVANCIN |
Time to execute Levenshtein function - 0.224238 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.360885 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.027534 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.037135 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.004133 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. |