Constraint-Based Grammar Formalisms: Parsing and Type Inference for Natural and Computer Languages Book

	Preface
1	Introduction	1
2	Constraint Logics for Linguistic Information	5
2.1	The Structure of Grammatical Information	5
2.2	The PATR Formalism	8
2.3	Idealizations of the Constraint-Based View	15
2.4	Constraint-Based Computer Language Description	16
2.5	History of Constraint-Based Formalisms	18
2.6	The Structure of Constraint-Based Formalisms	23
2.7	Appropriate Logics for Constraint-Based Formalisms	25
2.8	Properties of Appropriate Constraint-Logic Models	31
2.9	Operations on Models	37
2.10	Existence of Appropriate Models for [actual symbol not reproducible]	48
3	Grammars and Parsing	51
3.1	Defining Constraint-Based Formalisms	51
3.2	Grammar Interpretation	53
3.3	The Abstract Parsing Algorithm	57
3.4	Auxiliary Notions for Item Semantics	62
3.5	A Correctness Proof for the Algorithm	66
3.6	Instances of the Abstract Algorithm	78
4	A Compendium of Model Classes	87
4.1	Finite-Tree Models	88
4.2	Infinite-Tree Models	92
4.3	Eqtree Models	96
4.4	Graph Models	104
5	Parsing as Type Inference	117
5.1	Natural and Computer Languages	118
5.2	A Difference in Semantics	122
5.3	Constraint-Based Computer-Language Formalisms	125
5.4	Extending [actual symbol not reproducible] with Subsumption Constraints	133
5.5	Models for [actual symbol not reproducible]	137
6	Conclusion	153
	Appendix: Proofs of Properties of [actual symbol not reproducible]	157
	Glossary	169
	Bibliography	171
	Index	177