CLG: A Grammar Formalism Based on Constraint Reslution
EPIA 89 Proceedings of the 4th Portuguese Conference on Artificial Intelligence
Computational Linguistics
The formal and processing models of CLG
EACL '91 Proceedings of the fifth conference on European chapter of the Association for Computational Linguistics
A unification method for disjunctive feature descriptions
ACL '87 Proceedings of the 25th 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
CLG(n): constraint logic grammars
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
| Hi-index | 0.00 |
The main problem arising from the use of complex constraints in Computational Linguists is due to the NP-hardness of checking whether a given set of constraints is satisfiable and, in the affirmative case, of generating the set of minimal models which satisfy the constraints. In this paper we show how the CLG approach to rewriting constraints while constructing a partial model can greatly reduce the size of the original constraints and thus contribute to reduce the computational problem.