An algorithm for functional uncertainty

Ronald M. Kaplan, John T. Maxwell
1988 Proceedings of the 12th conference on Computational linguistics -   unpublished
The formal device of flmetional uncertainty has been introduced into linguistic theory as a means of characterizing long-distance dependencies alternative to conventional phrase-structure based approaches. In this palter we briefly outline the uneertMnty concept, and then present an algorithm for determining the satisfiability of acyclic gramu~atical descriptions containing uncertainty expressions and for synthesizing the grammatically relevant solutions to those descriptions 1. Long-dis~ance
more » ... 1. Long-dis~ance l)ependeneies and Functional Uncertainty In most linguistic theories hmg-distance dependencies such as are found in topiealization and relative clause constructions are characterized in tcrnrs of categoric"; and configurations of phrase-structure nodes. Kaplan and Zaenen (in press) have compared this kind of an analysis with one based on the fimetional organization of sentence:~, and suggest that tile relevant generalizations are instead best stated in functional or predicate-argument terms. ]'hey defined and investigated a new tbrmal device, called "functional uncertainty" that permit~ a functional statement of constraints on unbounded dependeneie:~. In this paper, after reviewing their formal specification of flmctional uncertainty, we present an algorithm for determining the satisfiability of grammatical descriptions that incorporate uncertainty specifications and fro" synthesizing the smallest solutions to such descriptions.
doi:10.3115/991635.991695 fatcat:vhmhtyx2ljhqfdmgktbwni2rva