Papers by Andreas Maletti
Strong Equivalence of TAG and CCG (2021.tacl-1)
Copied to clipboard
| Challenge: | Tree-adjoining grammar and combinatory categorial grammar have the same expressive power on trees. |
| Approach: | Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are well-established grammars with the same expressive power on strings. |
| Outcome: | The proposed grammars have the same expressive power on trees as classical grammars and can express a limited amount of cross-serial dependencies and have the constant growth property. |
Recurrent Neural Networks as Weighted Language Recognizers (N18-1)
Copied to clipboard
| Challenge: | Recent experiments show that RNNs outperform other methods in assigning high probability to held-out English text. |
| Approach: | They focus on the single-layer, ReLU-activation, rational-weight RNNs with softmax . they show that most problems for such RNN are undecidable . |
| Outcome: | The proposed model outperforms other methods in assigning high probability to held-out English text. |