Search Results for author: Kilian Gebhardt

Found 7 papers, 0 papers with code

$O_n$ is an $n$-MCFL

no code implementations22 Dec 2020 Kilian Gebhardt, Frédéric Meunier, Sylvain Salvati

A prominent problem of this kind is the position of the language $O_n$, the language that contains the same number of letters $a_i$ and $\bar a_i$ with $1\leq i\leq n$, in the known classes of formal languages.

Formal Languages and Automata Theory 68Q45, 20K15 F.4.3

Advances in Using Grammars with Latent Annotations for Discontinuous Parsing

no code implementations WS 2020 Kilian Gebhardt

We present new experiments that transfer techniques from Probabilistic Context-free Grammars with Latent Annotations (PCFG-LA) to two grammar formalisms for discontinuous parsing: linear context-free rewriting systems and hybrid grammars.

Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing

no code implementations COLING 2018 Kilian Gebhardt

We formulate a generalization of Petrov et al. (2006){'}s split/merge algorithm for interpreted regular tree grammars (Koller and Kuhlmann, 2011), which capture a large class of grammar formalisms.

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

no code implementations CL 2017 Kilian Gebhardt, Mark-Jan Nederhof, Heiko Vogler

We explore the concept of hybrid grammars, which formalize and generalize a range of existing frameworks for dealing with discontinuous syntactic structures.

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