Declarative model for dependency parsing
K. Valkonen, Harri Jäppinen, Aarno Lehtola, Matti Ylilammi · 1987
This paper presents a declarative, dependency constraint model for parsing an inflectional free word order language, like Finnish. The structure of Finnish 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 also ambiguities and long-distance dependencies. Parsing is controlled by a blackboard system. A working parser for Finnish has been implemented based on the model.