|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910260653303321 |
|
|
Autore |
Shieber Stuart M. |
|
|
Titolo |
Constraint-based grammar formalisms : parsing and type inference for natural and computer languages / / Stuart M. Shieber |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cambridge, Massachusetts : , : MIT Press, , c1992 |
|
[Piscataqay, New Jersey] : , : IEEE Xplore, , [2003] |
|
|
|
|
|
|
|
|
|
ISBN |
|
0-262-29311-0 |
0-262-28351-4 |
|
|
|
|
|
|
|
|
Descrizione fisica |
|
1 PDF (xi, 183 pages) : illustrations |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Computational linguistics |
Grammar, Comparative and general - Data processing |
Programming languages (Electronic computers) - Syntax |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di bibliografia |
|
Includes bibliographical references (p. [171]-176) and index. |
|
|
|
|
|
|
Sommario/riassunto |
|
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 |
|
|
|
|