Heiko Vogler


2019

pdf bib
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing
Heiko Vogler | Andreas Maletti
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing

pdf
Weighted parsing for grammar-based language models
Richard Mörbitz | Heiko Vogler
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing

We develop a general framework for weighted parsing which is built on top of grammar-based language models and employs flexible weight algebras. It generalizes previous work in that area (semiring parsing, weighted deductive parsing) and also covers applications outside the classical scope of parsing, e.g., algebraic dynamic programming. We show an algorithm which terminates and is correct for a large class of weighted grammar-based language models.

pdf
Regular transductions with MCFG input syntax
Mark-Jan Nederhof | Heiko Vogler
Proceedings of the 14th International Conference on Finite-State Methods and Natural Language Processing

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-free grammars are strictly more powerful than this combination of regular transductions and multiple context-free grammars.

2017

pdf bib
Hybrid Grammars for Parsing of Discontinuous Phrase Structures and Non-Projective Dependency Structures
Kilian Gebhardt | Mark-Jan Nederhof | Heiko Vogler
Computational Linguistics, Volume 43, Issue 3 - September 2017

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-projective dependency structures. Technically, hybrid grammars are related to synchronous grammars, where one grammar component generates linear structures and another generates hierarchical structures. By coupling lexical elements of both components together, discontinuous structures result. Several types of hybrid grammars are characterized. We also discuss grammar induction from treebanks. The main advantage over existing frameworks is the ability of hybrid grammars to separate discontinuity of the desired structures from time complexity of parsing. This permits exploration of a large variety of parsing algorithms for discontinuous structures, with different properties. This is confirmed by the reported experimental results, which show a wide variety of running time, accuracy, and frequency of parse failures.

2016

pdf
EM-Training for Weighted Aligned Hypergraph Bimorphisms
Frank Drewes | Kilian Gebhardt | Heiko Vogler
Proceedings of the SIGFSM Workshop on Statistical NLP and Weighted Automata

2014

pdf
Hybrid Grammars for Discontinuous Parsing
Mark-Jan Nederhof | Heiko Vogler
Proceedings of COLING 2014, the 25th International Conference on Computational Linguistics: Technical Papers

2013

pdf
General binarization for parsing and translation
Matthias Büchse | Alexander Koller | Heiko Vogler
Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)

2012

pdf
Synchronous Context-Free Tree Grammars
Mark-Jan Nederhof | Heiko Vogler
Proceedings of the 11th International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+11)

2011

pdf
Tree Parsing with Synchronous Tree-Adjoining Grammars
Matthias Büchse | Mark-Jan Nederhof | Heiko Vogler
Proceedings of the 12th International Conference on Parsing Technologies

2010

pdf bib
Preservation of Recognizability for Synchronous Tree Substitution Grammars
Zoltán Fülöp | Andreas Maletti | Heiko Vogler
Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing

pdf bib
A Decoder for Probabilistic Synchronous Tree Insertion Grammars
Steve DeNeefe | Kevin Knight | Heiko Vogler
Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing

pdf
n-Best Parsing Revisited
Matthias Büchse | Daniel Geisler | Torsten Stüber | Heiko Vogler
Proceedings of the 2010 Workshop on Applications of Tree Automata in Natural Language Processing

pdf
Efficient Inference through Cascades of Weighted Tree Transducers
Jonathan May | Kevin Knight | Heiko Vogler
Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics