Search Results for author: Andreas Maletti

Found 11 papers, 0 papers with code

Multiple Context-Free Tree Grammars: Lexicalization and Characterization

no code implementations11 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.

Recurrent Neural Networks as Weighted Language Recognizers

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.

Strong Equivalence of TAG and CCG

no code implementations16 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).

TAG

Cannot find the paper you are looking for? You can Submit a new open access paper.