Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages

Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area.

Booknews

In this revised version of his Ph.D. dissertation (Stanford U., 1989), Sheiber examines the theoretical and computational foundations of constraint-based grammars and applications to natural language analysis. Annotation c. Book News, Inc., Portland, OR (booknews.com)

Stuart M. Shieber is Harvard College Professor and James O. Welch, Jr. and Virginia B. Welch Professor of Computer Science, Division of Engineering and Applied Sciences, at Harvard University.