Constraint Based Grammar Formalisms
MIT Press (Verlag)
978-0-262-19324-5 (ISBN)
- Titel ist leider vergriffen;
keine Neuauflage - Artikel merken
Constraint-based theories of grammar and grammar formalisms are an area of research in computational linguistics. "Constraint-Based Grammar Formalisms" provides a 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 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.
Part 1 Constraint logics for linguistic information: the structure of grammatical information; the PATR formalism; idealizations of the constraint-based view; constraint-based computer language description; history of constraint-based formalisms; the structure of constraint-based formalisms; appropriate logics for constraint-based formalisms; properties of appropriate constraint-logic models; operations on models. Part 2 Grammars and parsing: defining constraint-based formalisms; grammar interpretation; the abstract parsing algorithm; auxiliary notions for item semantics; a correctness proof for the algorithm; instances of the abstract algorithm. Part 3 A compendium of model classes: finite-tree models; infinite-tree models; eqtree models; graph models. Part 4 Parsing as type inference: natural and computer languages; a difference in semantics; constraint-based computer-language formalisms.
| Erscheint lt. Verlag | 3.12.1992 |
|---|---|
| Zusatzinfo | 21 illustrations |
| Verlagsort | Cambridge, Mass. |
| Sprache | englisch |
| Maße | 178 x 229 mm |
| Gewicht | 431 g |
| Themenwelt | Geisteswissenschaften ► Sprach- / Literaturwissenschaft ► Anglistik / Amerikanistik |
| Geisteswissenschaften ► Sprach- / Literaturwissenschaft ► Sprachwissenschaft | |
| Mathematik / Informatik ► Informatik ► Theorie / Studium | |
| ISBN-10 | 0-262-19324-8 / 0262193248 |
| ISBN-13 | 978-0-262-19324-5 / 9780262193245 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
