no code implementations • 16 May 2022 • Andreas Maletti, Lena Katharina Schiffer
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i. e., generate the same class of string languages).
no code implementations • NAACL 2018 • Yining Chen, Sorcha Gilroy, Andreas Maletti, Jonathan May, Kevin Knight
We investigate the computational complexity of various problems for simple recurrent neural networks (RNNs) as formal models for recognizing weighted languages.
no code implementations • 11 Jul 2017 • Joost Engelfriet, Andreas Maletti, Sebastian Maneth
Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i. e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol.