Associative model of morphological analysis: an empirical inquiry
Computational Linguistics
The blackboard model of problem solving
AI Magazine
Declarative model for dependency parsing: a view into blackboard methodology
EACL '87 Proceedings of the third conference on European chapter of the Association for Computational Linguistics
Language-based environment for natural language parsing
EACL '85 Proceedings of the second conference on European chapter of the Association for Computational Linguistics
Functional structures for parsing dependency constraints
COLING '86 Proceedings of the 11th coference on Computational linguistics
| Hi-index | 0.00 |
This paper presents blackboard-based computational modal for parting an Inflectional free word order language, like Finnish. The structure of sentences is described as partial dependency trees of depth one. Parsing becomes a nondeterministic search problem in the forest of partial parse trees. The search process is able to solve ambiguities and long-distance dependencies as well. Parsing is controlled by a blackboard system. A working parser for Finnish has been implemented based on the model.