{'fraction_non_alphanumeric': 0.021632251720747297, 'fraction_numerical': 0.0, 'mean_word_length': 5.484076433121019, '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 Path Signature Approach for Speech Emotion Recognition

Automatic speech emotion recognition (SER) remains a 
difficult task within human-computer interaction, despite increasing interest in the research community. One key challenge is how to effectively integrate short-term characterisation 
of speech segments with long-term information such as temporal variations. Motivated by the numerical approximation theory of stochastic differential equations (SDEs), we propose the 
novel use of path signatures. The latter provide a pathwise definition to solve SDEs, for the integration of short speech frames. 
Furthermore we propose a hierarchical tree structure of path signatures, to capture both global and local information. A simple tree-based convolutional neural network (TBCNN) is used 
for learning the structural information stemming from dyadic 
path-tree signatures. Our experimental results on a widely 
used benchmark dataset demonstrate comparable performance 
to complex neural network based systems.