Paper: Declarative Nodel For Dependency Parsing - A View Into Blackboard Methodology

ACL ID E87-1036
Title Declarative Nodel For Dependency Parsing - A View Into Blackboard Methodology
Venue Annual Meeting of The European Chapter of The Association of Computational Linguistics
Session Main Conference
Year 1987
Authors

This paper presents a declarative, dependency constraint model for parsing an infLectionaL free word order Language, t|ke Finnish. The structure of Finnish sentences is described as partial dependency trees of depth one. Parsing becomes a nondeterministtc search problem in the forest of partial parse trees. The search process is able to solve also ambiguities and tong-distance dependencies. Parsing is controLLed by a blackboard system. A ~orking parser for Finnish has been implemented based on the modeL. 1 |RTROOUCT|OB The development of our computational model for dependency parsing has progressed in three parallel and interrelated phases: (1) The development of a perspicuous high Level grammar specification Language which grasps well regularities and idiosyncracies of inflectional free w...