Normal view MARC view ISBD view

Constraint-based grammar formalisms : parsing and type inference for natural and computer languages / Stuart M. Shieber.

By: Shieber, Stuart M [author.].
Contributor(s): IEEE Xplore (Online Service) [distributor.] | MIT Press [publisher.].
Material type: materialTypeLabelBookPublisher: Cambridge, Massachusetts : MIT Press, c1992Distributor: [Piscataqay, New Jersey] : IEEE Xplore, [2003]Description: 1 PDF (xi, 183 pages) : illustrations.Content type: text Media type: electronic Carrier type: online resourceISBN: 9780262283519.Subject(s): Parsing (Computer grammar) | Programming languages (Electronic computers) -- Syntax | Grammar, Comparative and general -- Data processing | Computational linguisticsGenre/Form: Electronic books.Online resources: Abstract with links to resource Also available in print.Summary: 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.Stuart M. Shieber is Assistant Professor of Computer Science at Harvard University.
Tags from this library: No tags from this library for this title. Log in to add tags.
    average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references (p. [171]-176) and index.

Restricted to subscribers or individual electronic text purchasers.

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.Stuart M. Shieber is Assistant Professor of Computer Science at Harvard University.

Also available in print.

Mode of access: World Wide Web

Description based on PDF viewed 12/23/2015.

There are no comments for this item.

Log in to your account to post a comment.

International Institute of Information Technology, Bangalore
26/C, Electronics City, Hosur Road,Bengaluru-560100 Contact Us
Koha & OPAC at IIITB deployed by Bhargav Sridhar & Team.

Powered by Koha