Proc. of the first international conference on Rewriting techniques and applications
An efficient context-free parsing algorithm
Communications of the ACM
Computational Complexity and Natural Language
Computational Complexity and Natural Language
Transfer in Machine Translation by Non-Confluent Term-Rewrite Systems
GWAI '89 Proceedings of the 13th German Workshop on Artificial Intelligence
Views of the Syntax/Semantics Interface Proceedings of the Workshop ``GPSG and Semantics'''', organized by the project KIT-FAST, TU Berlin, Feb. 22-24, 1989
A Model of Multi-Level Transfer for Machine Translation and Its Partial Realization
A Model of Multi-Level Transfer for Machine Translation and Its Partial Realization
Category cooccurrence restrictions and the elimination of metarules
COLING '86 Proceedings of the 11th coference on Computational linguistics
A constructive view of GPSG or how to make it work
COLING '88 Proceedings of the 12th conference on Computational linguistics - Volume 1
Term-rewriting as a basis for a uniform architecture in machine translation
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Recycling terms into a partial parser
ANLC '94 Proceedings of the fourth conference on Applied natural language processing
| Hi-index | 0.00 |
In this paper we argue for the direct application of metarules in the parsing process and introduce a slight restriction on metarules. This restriction relies on theoretical results about the termination of term-rewrite systems and does not reduce the expressive power of metarules as much as previous restrictions. We prove the termination for a set of metarules used in our German grammar and show how metarules can be integrated into the parser.