Readings in natural language processing
Readings in natural language processing
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Deterministic Techniques for Efficient Non-Deterministic Parsers
Proceedings of the 2nd Colloquium on Automata, Languages and Programming
Context-free error analysis by evaluation of algebraic power series
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Spoken Language Translator: First-Year Report
Spoken Language Translator: First-Year Report
ACL '83 Proceedings of the 21st annual meeting on Association for Computational Linguistics
The structure of shared forests in ambiguous parsing
ACL '89 Proceedings of the 27th annual meeting on Association for Computational Linguistics
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
An efficient implementation of the head-corner parser
Computational Linguistics
Context-sensitive spoken dialogue processing with the DOP model
Natural Language Engineering
Robust grammatical analysis for spoken dialogue systems
Natural Language Engineering
Representing constraints with automata
ACL '98 Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics
Spoken dialogue interpretation with the DOP model
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 1
Robust data oriented spoken language understanding
New developments in parsing technology
Journal of Artificial Intelligence Research
Two monolingual parses are better than one (synchronous parse)
HLT '10 Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics
An overview of probabilistic tree transducers for natural language processing
CICLing'05 Proceedings of the 6th international conference on Computational Linguistics and Intelligent Text Processing
Hi-index | 0.00 |
Bernard Lang defines parsing as the calculation of the intersection of a FSA (the input) and a CFG. Viewing the input for parsing as a FSA rather than as a string combines well with some approaches in speech understanding systems, in which parsing takes a word lattice as input (rather than a word string). Furthermore, certain techniques for robust parsing can be modelled as finite state transducers.In this paper we investigate how we can generalize this approach for unification grammars. In particular we will concentrate on how we might the calculation of the intersection of a FSA and a DCG. It is shown that existing parsing algorithms can be easily extended for FSA inputs. However, we also show that the termination properties change drastically: we show that it is undecidable whether the intersection of a FSA and a DCG is empty (even if the DCG is off-line parsable).Furthermore we discuss approaches to cope with the problem.