{'fraction_non_alphanumeric': 0.01793103448275862, 'fraction_numerical': 0.0, 'mean_word_length': 5.482142857142857, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Maximum entropy discrimination (MED) feature subset selection for speech recognition

In this paper, we investigate the application of maximum entropy discrimination (MED) feature selection in speech recognition problems. We compare the MED algorithm with a classical wrapper feature selection algorithm and we propose a hybrid wrapper/MED algorithm. We experiment with the three approaches on a phoneme recognition task on the TIMIT database. Results show that the MED algorithm achieves error rates comparable with the wrapper algorithm, requiring a reduced computational charge. Furthermore, the use of a probabilistic framework shows that the MED algorithm gives very good results even with a very limited amount of data.