Text simplification using synchronous dependency grammars: Generalising automatically harvested rules

Hybrid text simplification using synchronous dependency grammars with hand-written and automatically harvested rules

Toward Bayesian Synchronous Tree Substitution Grammars for Sentence Planning

Developing conventional natural language generation systems requires extensive attention from human experts in order to craft complex sets of sentence planning rules. We propose a Bayesian nonparametric approach to learn…

Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures

We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures. Covered are both discontinuous phrase structures and non-proje…

Incremental Monoidal Grammars

In this work we define formal grammars in terms of free monoidal categories, along with a functor from the category of formal grammars to the category of automata. Generalising from the Booleans to arbitrary semirings, w…

Regular transductions with MCFG input syntax

We show that regular transductions for which the input part is generated by some multiple context-free grammar can be simulated by synchronous multiple context-free grammars. We prove that synchronous multiple context-fr…