Constraint-based grammar formalisms : parsing and type inference for natural and computer languages

Title
  1. Constraint-based grammar formalisms : parsing and type inference for natural and computer languages / Stuart M. Shieber.
Published by
  1. Cambridge, Mass. : MIT Press, ©1992.
Author
  1. Shieber, Stuart M.

Items in the library and off-site

Filter by

Displaying 1 item

StatusFormatAccessCall numberItem location
StatusFormatTextAccessUse in libraryCall numberP98 .S54 1992Item locationOff-site

Details

Description
  1. xi, 183 pages : illustrations; 24 cm
Subject
  1. Computational linguistics
  2. Grammar, Comparative and general > Data processing
  3. Programming languages (Electronic computers) > Syntax
  4. Parsing (Computer grammar)
  5. Linguistique informatique
  6. Grammaire comparée et générale > Informatique
  7. Langages de programmation > Syntaxe
  8. Analyse automatique (Linguistique)
  9. computational linguistics
  10. Grammatica
  11. Formalisering
  12. Constraints (taalkunde)
  13. Programming languages
  14. Grammar
Contents
  1. 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].
Owning institution
  1. Princeton University Library
Note
  1. "A Bradford book."
Bibliography (note)
  1. Includes bibliographical references (p. [171]-176) and index.