Computational complexity and lexical-functional grammar
Computational Linguistics
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing)
Language As a Cognitive Process: Syntax
Language As a Cognitive Process: Syntax
Unification: a multidisciplinary survey
ACM Computing Surveys (CSUR)
EACL '89 Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics
Defaults in unification grammar
ACL '90 Proceedings of the 28th annual meeting on Association for Computational Linguistics
Unification of disjunctive feature descriptions
ACL '88 Proceedings of the 26th annual meeting on Association for Computational Linguistics
QPATR and constraint threading
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Simple parser for an HPSG-style grammar implemented in prolog
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
Getting things out of order: an LFG-proposal for the treatment of German word order
COLING '86 Proceedings of the 11th coference on Computational linguistics
Generation as structure driven derivation
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 2
Term-rewriting as a basis for a uniform architecture in machine translation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Top-down predictive linking and complex-feature-based formalisms
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Wide-coverage deep statistical parsing using automatic dependency structure annotation
Computational Linguistics
Hi-index | 0.00 |
This paper describes a system in PROLOG for the automatic transformation of a grammar, written in LFG formalism, into a DCG-based parser. It demonstrates the main principles of the transformation, the representation of f-structures and constraints, the treatment of long-distance dependencies, and left recursion.Finally some problem areas of the system and possibilities for overcoming them are discussed.