Two-level phonology, as currently practiced, has two severe limitations. One is that phonological generalizations are generally expressed in terms of transition tables of finite-state automata, and these tables are cumbersome to develop and refine.
Koskenniemi’s two-level morphological analysis system can be improved upon by using a PATR-like unification grammar for handling the morphosyntax instead of continuation classes, and by incorporating the notion of negative rule feature into the phonological rule interpreter.
Computational and theoretical linguists and computer scientists interested in the computer processing of natural language have converged on a class of grammar formalisms for describing the well-formedness conditions of natural languages.
Martin A. Fischler, Yvan G. Leclerc, Pascal V. Fua, Stephen T. Barnard, & Oscar Firschein
This technical report consists of an introductory paper and three technical papers presented at the session, "AI Application of Supercomputers: The Vision Problem."
One of the central issues to be addressed in basing a theory of speech acts on independently motivated accounts of propositional attitudes (belief, knowledge, intentions, etc.) and action is the specification of the effects of communicative acts
The PATR-II grammar formalism has been developed over the last few years at SRI International as a grammar formalism for codifying fragments of natural language.
Stereo matching using a Lisp Machine implementation of the Baker stereo system developed at Stanford University. The processing is one of edge matching in a hierarchy of long to short image contours, finishing with interedge intensity correlation to yield a dense map of scene disparities.
We report on a mechanism for semantic and pragmatic interpretation that has been designed to take advantage of the generally compositional nature of semantic analysis, without unduly constraining the order in which pragmatic decisions are made.
