Tilman Becker


2009

pdf bib
Well-formed Default Unification in Non-deterministic Multiple Inheritance Hierarchies (short paper)
Christian Schulz | Jan Alexandersson | Tilman Becker
Proceedings of the Eight International Conference on Computational Semantics

2007

pdf bib
Combining Multiple Information Layers for the Automatic Generation of Indicative Meeting Abstracts
Thomas Kleinbauer | Stephanie Becker | Tilman Becker
Proceedings of the Eleventh European Workshop on Natural Language Generation (ENLG 07)

2006

pdf bib
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms
Tilman Becker | Laura Kallmeyer
Proceedings of the Eighth International Workshop on Tree Adjoining Grammar and Related Formalisms

pdf bib
The SAMMIE Multimodal Dialogue Corpus Meets the Nite XML Toolkit
Ivana Kruijff-Korbayová | Verena Rieser | Ciprian Gerstenberger | Jan Schehl | Tilman Becker
Proceedings of the 5th Workshop on NLP and XML (NLPXML-2006): Multi-Dimensional Markup in Natural Language Processing

pdf bib
The SAMMIE Corpus of Multimodal Dialogues with an MP3 Player
Ivana Kruijff-Korbayová | Tilman Becker | Nate Blaylock | Ciprian Gerstenberger | Michael Kaißer | Peter Poller | Verena Rieser | Jan Schehl
Proceedings of the Fifth International Conference on Language Resources and Evaluation (LREC’06)

We describe a corpus of multimodal dialogues with an MP3player collected in Wizard-of-Oz experiments and annotated with a richfeature set at several layers. We are using the Nite XML Toolkit (NXT) to represent and further process the data. We designed an NXTdata model, converted experiment log file data and manualtranscriptions into NXT, and are building tools for additionalannotation using NXT libraries. The annotated corpus will be used to (i) investigate various aspects of multimodal presentation andinteraction strategies both within and across annotation layers; (ii) design an initial policy for reinforcement learning of multimodalclarification requests.

pdf bib
The SAMMIE System: Multimodal In-Car Dialogue
Tilman Becker | Peter Poller | Jan Schehl | Nate Blaylock | Ciprian Gerstenberger | Ivana Kruijff-Korbayová
Proceedings of the COLING/ACL 2006 Interactive Presentation Sessions

2005

pdf bib
An Experiment Setup for Collecting Data for Adaptive Output Planning in a Multimodal Dialogue System
Ivana Kruijff-Korbayová | Nate Blaylock | Ciprian Gerstenberger | Verena Rieser | Tilman Becker | Michael Kaisser | Peter Poller | Jan Schehl
Proceedings of the Tenth European Workshop on Natural Language Generation (ENLG-05)

2004

pdf bib
Ends-based Dialogue Processing
Jan Alexandersson | Tilman Becker | Ralf Engel | Markus Löckelt | Elsa Pecourt | Peter Poller | Norbert Pfleger | Norbert Reithinger
Proceedings of the 2nd International Workshop on Scalable Natural Language Understanding (ScaNaLU 2004) at HLT-NAACL 2004

2002

pdf bib
Practical, Template–Based Natural Language Generation with TAG
Tilman Becker
Proceedings of the Sixth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+6)

2000

pdf bib
An extended architecture for robust generation
Tilman Becker | Anne Kilger | Patrice Lopez | Peter Poller
INLG’2000 Proceedings of the First International Conference on Natural Language Generation

pdf bib
Adapting HPSG-to-TAG compilation to wide-coverage grammars
Tilman Becker | Patrice Lopez
Proceedings of the Fifth International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+5)

pdf bib
Parsing Mildly Context-sensitive RMS
Tilman Becker | Dominik Heckmann
Proceedings of the Sixth International Workshop on Parsing Technologies

We introduce Recursive Matrix Systems (RMS) which encompass mildly context-sensitive formalisms and present efficient parsing algorithms for linear and context-free variants of RMS. The time complexities are 𝒪(n2h + 1), and 𝒪(n3h) respectively, where h is the height of the matrix. It is possible to represent Tree Adjoining Grammars (TAG [1], MC-TAG [2], and R-TAG [3]) as RMS uniformly.

1998

pdf bib
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)
Anne Abeillé | Tilman Becker | Giorgio Satta | K. Vijay-Shanker
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)

pdf bib
Recursive Matrix Systems (RMS) and TAG
Tilman Becker | Dominik Heckmann
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)

pdf bib
Two-step TAG parsing revisited
Peter Poller | Tilman Becker
Proceedings of the Fourth International Workshop on Tree Adjoining Grammars and Related Frameworks (TAG+4)

pdf bib
Fully Lexicalized Head-Driven Syntactic Generation
Tilman Becker
Natural Language Generation

pdf bib
An Efficient Kernel for Multilingual Generation in Speech-to-Speech Dialogue Translation
Tilman Becker | Wolfgang Finkler | Anne Kilger | Peter Poller
36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, Volume 1

pdf bib
An Efficient Kernel for Multilingual Generation in Speech-to-Speech Dialogue Translation
Tilman Becker | Wolfgang Finkler | Anne Kilger | Peter Poller
COLING 1998 Volume 1: The 17th International Conference on Computational Linguistics

1995

pdf bib
Parsing Non-Immediate Dominance Relations
Tilman Becker | Owen Rambow
Proceedings of the Fourth International Workshop on Parsing Technologies

We present a new technique for parsing grammar formalisms that express non-immediate dominance relations by ‘dominance-links’. Dominance links have been introduced in various formalisms such as extensions to CFG and TAG in order to capture long-distance dependencies in free-word order languages (Becker et al., 1991; Rambow, 1994). We show how the addition of ‘link counters’ to standard parsing algorithms such as CKY- and Earley-based methods for TAG results in a polynomial time complexity algorithm for parsing lexicalized V-TAG, a multi-component version of TAGs defined in (Rambow, 1994). A variant of this method has previously been applied to context-free grammar based formalisms such as UVG-DL.

1991

pdf bib
Long-Distance Scrambling and Tree Adjoining Grammars
Tilman Becker | Aravind K. Joshi | Owen Rambow
Fifth Conference of the European Chapter of the Association for Computational Linguistics

1990

pdf bib
Metarules in Tree Adjoining Grammars
Tilman Becker
Proceedings of the First International Workshop on Tree Adjoining Grammar and Related Frameworks (TAG+1)