Anton Nijholt


2006

pdf bib
Addressee Identification in Face-to-Face Meetings
Natasa Jovanovic | Rieks op den Akker | Anton Nijholt
11th Conference of the European Chapter of the Association for Computational Linguistics

2005

pdf bib
A Corpus for Studying Addressing Behavior in Multi-Party Dialogues
Natasa Jovanovic | Rieks op den Akker | Anton Nijholt
Proceedings of the 6th SIGdial Workshop on Discourse and Dialogue

2002

pdf bib
Dialogue Act Recognition with Bayesian Networks for Dutch Dialogues
Simon Keizer | Rieks op den Akker | Anton Nijholt
Proceedings of the Third SIGdial Workshop on Discourse and Dialogue

1997

pdf bib
Language Analysis in SCHISMA
Danny Lie | Joris Hulstijn | Hugo ter Doest | Anton Nijholt
Proceedings of the Fifth International Workshop on Parsing Technologies

1995

pdf bib
Parsing in Dialogue Systems Using Typed Feature Structures
Rieks op den Akker | Hugo ter Doest | Mark Moll | Anton Nijholt
Proceedings of the Fourth International Workshop on Parsing Technologies

The analysis of natural language in the context of keyboard-driven dialogue systems is the central issue addressed in this paper. A module that corrects typing errors, performs domain-specific morphological analysis is developed. A parser for typed unification grammars is designed and implemented in C++; for description of the lexicon and the grammer a specialised specification language is developed. It is argued that typed unification grammars and especially the newly developed specification language are convenient formalisms for describing natural language use in dialogue systems. Research on these issues is carried out in the context of the SCHISMA project, a research project in linguistic engineering; participants in SCHISMA are KPN Research and the University of Twente.

1991

pdf bib
An Efficient Connectionist Context-Free Parser
Klaas Sikkel | Anton Nijholt
Proceedings of the Second International Workshop on Parsing Technologies

A connectionist network is defined that parses a grammar in Chomsky Normal Form in logarithmic time, based on a modification of Rytter’s recognition algorithm. A similar parsing network can be defined for an arbitrary context-free grammar. Such networks can be integrated into a connectionist parsing environment for interactive distributed processing of syntactic, semantic and pragmatic information.

1989

pdf bib
Parallel Parsing Strategies in Natural Language Processing
Anton Nijholt
Proceedings of the First International Workshop on Parsing Technologies

We present a concise survey of approaches to the context-free parsing problem of natural languages in parallel environments. The discussion includes parsing schemes which use more than one traditional parser, schemes where separate processes are assigned to the ‘non-deterministic’ choices during parsing, schemes where the number of processes depends on the length of the sentence being parsed, and schemes where the number of processes depends on the grammar size rather than on the input length. In addition we discuss a connectionist approach to the parsing problem.