Constraint-based Grammar Formalisms: Parsing and Type Inference for Natural and Computer LanguagesMIT Press, 1992 - 183 Seiten 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. |
Inhalt
Constraint Logics for Linguistic Information | 5 |
2 | 15 |
3 | 51 |
4 | 87 |
Parsing as Type Inference | 147 |
Conclusion | 153 |
Häufige Begriffe und Wortgruppen
abstract antecedent appropriate arity atomic formulas categorial categorial grammar Chapter class of models Computational Linguistics computer languages computer-language congruence constraint logic constraint-based formalisms constraint-based grammar formalisms construction context-free grammars defined definition of satisfaction denotational derivation disambiguation dom(t Earley's algorithm eqtree models equations equivalence classes equivalence relation expression F type feature graphs feature structures follows function given graph models identical induction hypothesis inference rules infinite trees infinite-tree model informational union labeled Lauri Karttunen Lemma lexical LL,C logical system minimal model mm(Þ natural languages natural-language nodes nonterminals notation operation parsing algorithm partial parse tree path domain PATR formalism Pereira phrase pographs potrees Proof Suppose properties PROPOSITION Proposition 77 proved Reflexivity satisfies Section semantics Shieber singular third string Substitutivity subsumption subsumption ordering syntactic t(pr tree models Triviality type inference type result upward closure well-formedness yield(To
Verweise auf dieses Buch
Handbook of Formal Languages: Volume 2. Linear Modeling: Background and ... Grzegorz Rozenberg,Arto Salomaa Eingeschränkte Leseprobe - 1997 |
Natural Language Computing: An English Generative Grammar in Prolog Ray C. Dougherty Keine Leseprobe verfügbar - 1994 |