Cover not available

In:Mathematics of Language: Proceedings of a conference held at the University of Michigan, Ann Arbor, October 1984
Edited by Alexis Manaster-Ramer
[Not in series 35] 1987
► pp. v–vi

Get fulltext
PDF logo with download linkDownload Chapter PDF


This article is available free of charge.

Published online: 1 January 1987
DOI logo with link
https://doi.org/10.1075/z.35.toc

Table of contents

Names and Addresses of Contributorsvii
Introductionx
Computational Complexity, Mathematical Linguistics, and Linguistic Theory1
Exceptions to Generic Generalizations19
The Structure Underlying a Semantic Domain33
Binary Rules and Non-Binary Trees: Breaking Down the Concept of Phrase Structure65
An Introduction to Tree Adjoining Grammar87
The Notion ‘Rule of Grammar’ Reconsidered115
Unbounded Dependencies and Subjacency in a Tree Adjoining Grammar143
A Topological Approach to Structural Equivalence of Formal Languages173
On the Design of Finite Transducers for Parsing Phrase-Structure Languages191
Graphs and Grammars237
Discontinuity and Phrase Structure Grammar257
Sources of Intractability in GPSG Theory277
Formal Properties of Head Grammars293
Finding Natural Languages a Home in Formal Language Theory349
Theories of Language Learnability361
Remarks on Linguistic Semantics373
On the Progression from Context-Free to Tree Adjoining Languages389
Mobile Menu Logo with link to supplementary files background Layer 1 prag Twitter_Logo_Blue