Learn More
This paper outlines a high-level language FUNDPL for expressing functional structures for parsing dependency constraints. The goal of the language is to allow a grammar writer to pinn down his or her grammar with minimal commitment to control. FUNDPL interpreter has been implemented on top of a lower-level language DPL which we have earl ier implemented, In(More)
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(More)
  • 1