{'fraction_non_alphanumeric': 0.023381294964028777, 'fraction_numerical': 0.0, 'mean_word_length': 5.402298850574713, '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}}
Grammar inference algorithms and applications in software engineering

Many problems exist whose solutions take the form of patterns that may be expressed using grammars (e.g., speech recognition, text processing, genetic sequencing). Construction of these grammars is usually carried out by computer scientists working with domain experts. In the case when there is a lack of domain experts, grammar inference can be applied. In this paper, two grammar inference algorithms are briefly described and their application to software engineering is presented.