Advertisement

The Computational Implementation of Principle-Based Parsers

  • Sandiway Fong
Chapter
Part of the Studies in Linguistics and Philosophy book series (SLAP, volume 44)

Abstract

Recently, there has been some interest in the implementation of grammatical theories based on the principles and parameters approach (Correa, this volume; Johnson, this volume; Kolb and Thiersch, 1988; and Stabler, 1991 forthcoming). In this framework, a fixed set of universal principles parameterized according to particular languages interact deductively to account for diverse linguistic phenomena. Much of the work to date has focused on the not inconsiderable task of formalizing such theories. The primary goal of this chapter is to explore the computationally relevant properties of this framework. In particular, we address the hitherto largely unexplored issue of how to organize linguistic principles for efficient processing. More specifically, this chapter examines if, and how, a parser can reorder principles to avoid doing unnecessary work. Many important questions exist. For example: (1) What effect, if any, does principle-ordering have on the amount of work needed to parse a given sentence? (2) If the effect of principle-ordering is significant, then are some orderings much better than others? (3) If so, is it possible to predict (and explain) which ones these are?

Keywords

Noun Phrase Implement ATION Filter Operation Logical Dependency Case Assignment 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chomsky, N.: 1981, Lectures on Government and Binding: The Pisa Lectures, Foris, Dordrecht, Holland.Google Scholar
  2. Chomsky, N.: 1986, Knowledge of Language: Its Nature, Origin, and Use, Praeger Publishers, New York.Google Scholar
  3. Correa, N.: this volume, ‘Empty Categories, Chain Binding, and Parsing’, pp. 83–121.Google Scholar
  4. Johnson, M.: this volume, ‘Parsing as Deduction: the Use of Knowledge of Language’, pp. 39–64.Google Scholar
  5. Kolb, H. and C. Thiersch: 1988, ‘Levels and Empty Categories in a Principles and Parameters Approach to Parsing’, unpublished manuscript, Tilburg University, Tilburg, The Netherlands.Google Scholar
  6. Lasniki H. and J. Uriagereka: 1988, A Course in GB Syntax: Lectures on Binding and Empty Categories, MIT Press, Cambridge, Massachusetts.Google Scholar
  7. Samuel, A.: 1967, ‘Some Studies in Machine Learning Using the Game of Checkers. II—Recent Progress’, IBM Journal 11, pp. 601–617.CrossRefGoogle Scholar
  8. Smith, D. and M. Genesereth: 1985, ‘Ordering Conjunctive Queries’, Artificial Intelligence 26, 171–215.CrossRefGoogle Scholar
  9. Stabler, E.P., Jr: 1991 forthcoming, The Logical Approach to Syntax: Foundations, Specifications and Implementations of Theories of Government and Binding, MIT Press, Cambridge, Massachusetts.Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 1991

Authors and Affiliations

  • Sandiway Fong
    • 1
  1. 1.Artificial Intelligence LaboratoryMITCambridgeUSA

Personalised recommendations