TY  - BOOK
AU  - Shieber,Stuart M.
TI  - Constraint-based grammar formalisms: parsing and type inference for natural and computer languages 
T2  - A Bradford Book Ser
SN  - 9780262283519
AV  - P98 .S54 1992eb
U1  - 410/.285 23/eng/20240214
PY  - 1992///
CY  - Cambridge, Mass.
PB  - MIT Press
KW  - Computational linguistics
KW  - Grammar, Comparative and general
KW  - Data processing
KW  - Programming languages (Electronic computers)
KW  - Syntax
KW  - Parsing (Computer grammar)
KW  - Linguistique informatique
KW  - Grammaire comparée et générale
KW  - Informatique
KW  - Langages de programmation
KW  - Syntaxe
KW  - Analyse automatique (Linguistique)
KW  - computational linguistics
KW  - aat
KW  - LANGUAGE ARTS & DISCIPLINES
KW  - Linguistics
KW  - Historical & Comparative
KW  - bisacsh
KW  - fast
KW  - COGNITIVE SCIENCES/General
N1  - Includes bibliographical references (pages 171-176) and index
N2  - Constraint-Based Grammar Formalisms provides the first rigorous mathematical and computational basis for this important area. 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
UR  - https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=347687
ER  -