{'fraction_non_alphanumeric': 0.014950166112956811, 'fraction_numerical': 0.0, 'mean_word_length': 5.554347826086956, '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 MOESP Type Subspace Identification Algorithm

In this paper two recursive algorithms, based on MOESP type subspace identification, are presented in two versions. The main idea was to show that we can represent subspace identification methods as sequences of least squares problems and implement them through sequences of modified Householder algorithms. Therefore, it is possible to develop iterative algorithms with most of the advantages of this kind of methods, and still improve the numerical efficiency, in order to deal with real-time applications and minimize the computational burden.