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

Stuart M. Shieber

ISBN 10: 0262193248 / ISBN 13: 9780262193245

Published by A Bradford Book: The MIT Press, Cambridge, MA, 1992

About this Item

Blue cloth covered boards with yellow titles, xi, appendix, glossary, bibliography, index, 195 pages. Denting to front top right board corner. Dust jacket has tearing and creasing to front top right fold corner and light rubbing, scuffing and creasing to extremities. Sound spine, unmarked interior pages.

Seller Inventory # 4849

Bibliographic Details

• Title: Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages
• Publisher: A Bradford Book: The MIT Press, Cambridge, MA
• Publication Date: 1992
• Language: English
• ISBN 10: 0262193248
• ISBN 13: 9780262193245
• Binding: Hardcover
• Edition: First Edition
• Condition: Very Good
• Dust Jacket Condition: Good +
• Seller catalogs:
  • Language

About this title

Synopsis

Constraint-based theories of grammar and grammar formalisms are becoming an increasingly widespread area of research in computational linguistics. Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. It introduces new applications to both natural and computer languages and brings together Stuart Shieber's many contributions that have been at the core of developments ranging from the discovery of improved explanations of linguistic phenomena such as binding and coordination to the detailed mathematical analysis of constraint-solving and parsing in a variety of grammar formalisms.

This thorough examination of the theoretical and computational foundations of constraint-based grammars and applications to natural-language analysis is unique in several respects. Shieber's theoretical framework may be applied to a whole class of formalisms with properties that make it possible to define a general parsing algorithm for all members of the class, with results that provide essential guidance to the implementer of constraint-based language processing systems. Shieber also brings out new connections between grammatical categories and data types, and between constraint-based natural-language analysis and type inference in computer languages. These connections should be of increasing interest both to computational and theoretical linguists and to computer scientists.

About the Author

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.