{'fraction_non_alphanumeric': 0.019080659150043366, 'fraction_numerical': 0.0, 'mean_word_length': 5.411111111111111, '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}}
Recursive computation of the score and observed information matrix in hidden markov models

Hidden Markov models (henceforth abbreviated to HMMs), taken in their most general acception, that is, including models in which the state space of the hidden chain is continuous, have become a widely used class of statistical models with applications in diverse areas such as communications, engineering, bioinformatics, econometrics and many more. This contribution focus on the computation of derivatives of the log-likelihood and proposes a (comparatively!) simple and general framework, based on the use of Fisher and Louis identities, to obtain recursive equations for computing the score and observed information matrix. This approach is thought to be simpler than (although equivalent to) the solution provided by the so-called sensitivity equations. It is based on the original remark that recursive smoothers for HMMs are also available for some functional of the hidden states which do not reduce to sum functionals. This view of the problem also suggests ways in which these exact equations could be approximated using sequential Monte Carlo methods