Makoto Kanazawa & Ryo Yoshinaka
Link to the paper: here
Abstract: We consider a generalization of the “dual” approach to distributional learning of context-free grammars, where each nonterminal A is associated with a string set XA characterized by a finite set C of contexts. Rather than letting XA be the set of all strings accepted by all contexts in C as in previous works, we allow more flexible uses of the contexts in C, using some of them positively (contexts that accept the strings in XA) and others negatively (contexts that do not accept any strings in XA). The resulting more general algorithm works in essentially the same way as before, but on a larger class of context-free languages.
Any question or comment can be made using the comment section of the page below.