A Descriptive Approach to Language: Theoretic Complexity

A Descriptive Approach to Language: Theoretic Complexity

by James Rogers


View All Available Formats & Editions
Eligible for FREE SHIPPING
  • Want it by Thursday, October 25?   Order by 12:00 PM Eastern and choose Expedited Shipping at checkout.


A Descriptive Approach to Language: Theoretic Complexity by James Rogers

Early formal specifications of natural language syntax were quite closely connected to the notion of abstract machines for computing them. This provided a very natural means of gauging the relative difficulty of processing various constructions, as well as offering some insight into the abstract properties of the human language faculty. More recently, this approach has been superseded by one in which languages are specified in terms of systems of constraints on the structure of their sentences. This has made complexity results difficult to obtain. This book introduces a way of obtaining such results. It presents a natural and quite general means of expressing constraints on the structure of trees and shows that the languages that can be specified by systems of such constraints are exactly those computable by a particular standard class of abstract machines. Thus the difficulty of processing a construction can be reduced to the difficulty of expressing the constraints that specify it. The technique is demonstrated by applying it to a fairly complete treatment of English within the framework of Government and Binding theory, with the result of showing that its complexity is much less than has heretofore been assumed.

Product Details

ISBN-13: 9781575861364
Publisher: Center for the Study of Language and Inf
Publication date: 06/01/1998
Series: Center for the Study of Language and Information - Lecture Notes Series
Pages: 205
Product dimensions: 6.00(w) x 9.00(h) x 0.50(d)

About the Author

James Rogers is Assistant Professor, School of Computer Science, University of Central Florida.

Table of Contents


1    Language-Theoretic Complexity in Generative Grammar 
Part I   The Descriptive Complexity of Strongly Context-Free Languages
2    Introduction to Part I
3    Trees as Elementary Structures
4      L²K,P   and SnS 
5    Definability and Non-Definability in K,P
6    Conclusion of Part I
Part II   The Generative Capacity of GB Theories 
7    Introduction to Part II
8    The Fundamental Structures of GB Theories
9    GB and Non-definability in L²K,P
10   Formalizing X-Bar Theory
11   The Lexicon, Theta Theory and Case Theory
12   Binding and Control
13   Chains
14   Reconstruction
15   Limitations of the Interpretation
16   Conclusion of Part II

Index of Symbols
Index of Definitions
Subject Index
Name Index  

Customer Reviews

Most Helpful Customer Reviews

See All Customer Reviews