{'fraction_non_alphanumeric': 0.01614142966948501, 'fraction_numerical': 0.0, 'mean_word_length': 5.320388349514563, '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}}
A method to integrate additional knowledge sources into HMM based on junction tree decomposition

Most current automatic speech recognition (ASR) systems use statistical data-driven methods based on hidden Markov models (HMMs). Although such approaches have proved to be efficient choices, ASR systems often still perform much worse than human listeners, especially in the presence of unexpected acoustic variability. Only a limited level of success can be achieved, by relying only on statistical models and mostly ignoring the additional knowledge available. We propose a new method of integrating various kinds of additional knowledge sources into an HMM-based statistical acoustic model in this paper. We utilized the junction tree algorithm to achieve efficient integration due to increased model complexity. This is since it facilitates the decomposition of the joint probability density function (PDF) into a linked set of local conditional PDFs. This way, a simplified form of the model could be constructed and reliably estimated using limited training data. We evaluated how efficient the proposed method was on an LVCSR task using two different types of accented English speech data. The experimental results revealed that our method improved word accuracy with respect to the standard HMM.