{'fraction_non_alphanumeric': 0.015300546448087432, 'fraction_numerical': 0.0, 'mean_word_length': 5.273972602739726, '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}}
Efficient Inference of a Subclass of Even Linear Languages

Importance of grammatical inference field is growing as it is finding wider acceptance in many practical fields. Since it is established that the family of even-linear languages is not inferable from positive data alone, researchers have proposed several approximation algorithms to infer by the way of defining new subfamilies of even-linear languages. In this work a polynomial time method is proposed to infer a subclass of even linear languages, Terminal Distinguishable Even Linear Languages(TDELL), using positive samples only. The inference method for TDELL is based on UNION-FIND algorithm. We make some considerations about the performance of the proposed method in identifying TDELL in the limit and we provide the complexity analysis of the proposed method. Suitability of the proposed algorithm to the practical applications is also discussed.