{'fraction_non_alphanumeric': 0.018779342723004695, 'fraction_numerical': 0.0, 'mean_word_length': 5.2745098039215685, '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}}
On rigid NL Lambek grammars inference from generalized functor-argument data

This paper is concerned with the inference of categorial grammars, a context-free grammar formalism in the field of computational linguistics. A recent result has shown that whereas they are not learnable from strings in the model of Gold, rigid and k-valued non-associative Lambek grammars are still learnable from generalized functor-argument structured sentences. We focus here on the algorithmic part of this result and provide an algorithm that can be seen as an extension of Buszkowski, Penn and Kanazawa’s contributions for classical categorial grammars.