Research Catalog
Constraint-based grammar formalisms : parsing and type inference for natural and computer languages
- Title
- Constraint-based grammar formalisms : parsing and type inference for natural and computer languages / Stuart M. Shieber.
- Author
- Shieber, Stuart M.
- Publication
- Cambridge, Mass. : MIT Press, ©1992.
Items in the Library & Off-site
Filter by
1 Item
| Status | Format | Access | Call Number | Item Location |
|---|---|---|---|---|
| Text | Use in library | P98 .S54 1992 | Off-site |
Details
- Description
- xi, 183 pages : illustrations; 24 cm
- Subject
- Computational linguistics
- Grammar, Comparative and general > Data processing
- Programming languages (Electronic computers) > Syntax
- Parsing (Computer grammar)
- Linguistique informatique
- Grammaire comparée et générale > Informatique
- Langages de programmation > Syntaxe
- Analyse automatique (Linguistique)
- computational linguistics
- Grammatica
- Formalisering
- Constraints (taalkunde)
- Programming languages
- Grammar
- Note
- "A Bradford book."
- Bibliography (note)
- Includes bibliographical references (p. [171]-176) and index.
- Contents
- 1. Introduction -- 2. Constraint Logics for Linguistic Information -- 2.1. The Structure of Grammatical Information -- 2.2. The PATR Formalism -- 2.3. Idealizations of the Constraint-Based View -- 2.4. Constraint-Based Computer Language Description -- 2.5. History of Constraint-Based Formalisms -- 2.6. The Structure of Constraint-Based Formalisms -- 2.7. Appropriate Logics for Constraint-Based Formalisms -- 2.8. Properties of Appropriate Constraint-Logic Models -- 2.9. Operations on Models -- 2.10. Existence of Appropriate Models for [actual symbol not reproducible] -- 3. Grammars and Parsing -- 3.1. Defining Constraint-Based Formalisms -- 3.2. Grammar Interpretation -- 3.3. The Abstract Parsing Algorithm -- 3.4. Auxiliary Notions for Item Semantics -- 3.5. A Correctness Proof for the Algorithm -- 3.6. Instances of the Abstract Algorithm -- 4. A Compendium of Model Classes -- 4.1. Finite-Tree Models -- 4.2. Infinite-Tree Models -- 4.3. Eqtree Models -- 4.4. Graph Models -- 5. Parsing as Type Inference -- 5.1. Natural and Computer Languages -- 5.2. A Difference in Semantics -- 5.3. Constraint-Based Computer-Language Formalisms -- 5.4. Extending [actual symbol not reproducible] with Subsumption Constraints -- 5.5. Models for [actual symbol not reproducible]. 6. Conclusion -- Appendix: Proofs of Properties of [actual symbol not reproducible].
- ISBN
- 0262193248
- 9780262193245
- 9780262283519
- 0262283514
- LCCN
- 92007820
- OCLC
- ocm25369157
- 25369157
- SCSB-1968240
- Owning Institutions
- Princeton University Library