More Web Proxy on the site http://driver.im/

Article

Free access

An attribute-grammar implementation of Government-binding theory

Author:

Nelson CorreaAuthors Info & Claims

ACL '87: Proceedings of the 25th annual meeting on Association for Computational Linguistics

Pages 45 - 51

https://doi.org/10.3115/981175.981182

Published: 06 July 1987 Publication History

Abstract

The syntactic analysis of languages with respect to Government-binding (GB) grammar is a problem that has received relatively little attention until recently. This paper describes an attribute grammar specification of the Government-binding theory. The paper focuses on the description of the attribution rules responsible for determining antecedent-trace relations in phrase-structure trees, and on some theoretical implications of those rules for the GB model. The specification relies on a transformation-less variant of Government-binding theory, briefly discussed by Chomsky (1981), in which the rule move-α is replaced by an interpretive rule. Here the interpretive rule is specified by means of attribution rules. The attribute grammar is currently being used to write an English parser which embodies the principles of GB theory. The parsing strategy and attribute evaluation scheme are cursorily described at the end of the paper.

References

[1]

Aho, A. V., and J. D. Ullman. 1972. The Theory of Parsing, Translation and Compiling. Prentice-Hall, Englewood Cliffs, NJ

Digital Library

[2]

Arbab, Bijan. 1986. "Compiling Circular Attribute Grammars into Prolog." IBM Journal of Research and Development, Vol. 30, No. 3, May 1986

Digital Library

[3]

Berwick, Robert and Amy Weinberg. 1984. The Grammatical Basis of Linguistic Performance. The MIT Press. Cambridge, MA

Digital Library

[4]

Chomsky, Noam. 1981. Lectures on Government and Binding. Foris Publications. Dordrecht

[5]

Chomsky, Noam. 1982. Some Concepts and Consequences of the Theory of Government and Binding. The MIT Press. Cambridge, MA

[6]

Chomsky, NOam. 1986. Barriers. The MIT Press. Cambridge, MA

[7]

Correa, Nelson. In preparation. Syntactic Analysis of English with respect to Government-binding Grammar. Ph.D. Dissertation, Syracuse University

Digital Library

[8]

Gazdar, Gerald, Ewin Klein, Geoffrey Pullum, and Ivan Sag. 1985. Generalized Phrase Structure Grammar. Harvard University Press. Cambridge, MA

[9]

Jackendoff, Ray. 1977. X Syntax: A Study of Phrase Structure. The MIT Press. Cambridge, MA

[10]

Kashket, Michael. 1986. "Parsing a Free-word Order Language: Walpiri." Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, p. 60--66.

Digital Library

[11]

Knuth, Donald E. 1968. "Semantics of Context-free Languages." In Mathematical Systems Theory, Vol. 2, No. 2, 1968

[12]

Koster, Jan. 1978. "Conditions, Empty Nodes, and Markedness." Linguistic Inquiry, Vol. 9, No. 4.

[13]

Kuhns, Robert. 1986. "A PROLOG Implementation of Government-binding Theory." Proceedings of the Annual Conference of the European Chapter of the Association for Computational Linguistics, p. 546--550.

Digital Library

[14]

Marcus, Mitchell. 1980. A Theory of Syntactic Recognition for Natural Language. The MIT Press. Cambridge, MA

Digital Library

[15]

Pesetsky, D. 1982. Paths and Categories. Ph.D. Dissertation, MIT

[16]

Pullum, Geoffrey. 1985. "Assuming Some Version of the X-bar Theory." Syntax Research Center, University of California, Santa Cruz

[17]

Rizzi, Luigi. 1978. "Violations of the Wh-Island Constraint in Italian and the Subjacency Condition." Montreal Working Papers in Linguistics 11

[18]

Sells, Peter. 1985. Lectures on Contemporary Syntactic Theories. Chicago University Press. Chicago, Illinois

[19]

Sharp, Randall M. 1985. A Model of Grammar Based on Principles of Government and Binding. M.Sc Thesis, Department of Computer Science, University of British Columbia. October, 1985

[20]

Van Riemsdijk, Henk and Edwin Williams. 1986. An Introduction to the Theory of Grammar. The MIT Press. Cambridge, MA

[21]

Waite, William M. and Gerhard Goos. 1984. Compiler Construction. Springer-Verlag. New York

Digital Library

[22]

Wehrli, Eric. 1984. "A Government-binding Parser for French." Institut pour les Etudes Semantiques et Cognitives, Universite de Geneve. Working Paper No. 48

Cited By

Correa NKunze jReimann D(1991)An extension of earley's algorithm for S-attributed grammarsProceedings of the fifth conference on European chapter of the Association for Computational Linguistics10.3115/977180.977232(299-302)Online publication date: 9-Apr-1991
https://dl.acm.org/doi/10.3115/977180.977232
Kuhns R(1990)A PARLOG implementation of Government-Binding TheoryProceedings of the 13th conference on Computational linguistics - Volume 310.3115/991146.991230(394-396)Online publication date: 20-Aug-1990
https://dl.acm.org/doi/10.3115/991146.991230
Correa NHajičová E(1988)A binding rule for Government-binding parsingProceedings of the 12th conference on Computational linguistics - Volume 110.3115/991635.991661(123-129)Online publication date: 22-Aug-1988
https://dl.acm.org/doi/10.3115/991635.991661

An attribute-grammar implementation of Government-binding theory
1. Hardware
  1. Power and energy
    1. Power estimation and optimization
2. Theory of computation
  1. Formal languages and automata theory

Recommendations

Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...
A binding rule for Government-binding parsing
COLING '88: Proceedings of the 12th conference on Computational linguistics - Volume 1

In this paper I propose a Binding rule for the identification of pronoun and anaphor referents in phrase-structure tress, assuming the general framework of the Government-binding theory outlined by Chomsky (1981). The Binding rule, specified by means of ...
Tree insertion grammar: a cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced

Tree insertion grammar (TIG) is a tree-based formalism that makes use of tree substitution and tree adjunction. TIG is related to tree adjoining grammar. However, the adjunction permitted in TIG is sufficiently restricted that TIGs only derive context-...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

ACL '87: Proceedings of the 25th annual meeting on Association for Computational Linguistics

July 1987

260 pages

Program Chair:
Candy Sidner
BBN Laboratories

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 06 July 1987

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
389
Total Downloads

Downloads (Last 12 months)41
Downloads (Last 6 weeks)5

Reflects downloads up to 23 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Correa NKunze jReimann D(1991)An extension of earley's algorithm for S-attributed grammarsProceedings of the fifth conference on European chapter of the Association for Computational Linguistics10.3115/977180.977232(299-302)Online publication date: 9-Apr-1991
https://dl.acm.org/doi/10.3115/977180.977232
Kuhns R(1990)A PARLOG implementation of Government-Binding TheoryProceedings of the 13th conference on Computational linguistics - Volume 310.3115/991146.991230(394-396)Online publication date: 20-Aug-1990
https://dl.acm.org/doi/10.3115/991146.991230
Correa NHajičová E(1988)A binding rule for Government-binding parsingProceedings of the 12th conference on Computational linguistics - Volume 110.3115/991635.991661(123-129)Online publication date: 22-Aug-1988
https://dl.acm.org/doi/10.3115/991635.991661

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Media

Figures

Other

Tables

View Table of Contents