article

Free access

Restricting logic grammars with government-binding theory

Author:

Edward P. StablerAuthors Info & Claims

Computational Linguistics, Volume 13, Issue 1-2

Pages 1 - 10

Published: 01 January 1987 Publication History

Abstract

A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a programmer) or automatically (by a grammar induction system). A restrictive grammar formalism for logic programming languages is presented that imposes some of the constraints suggested by recent Chomskian linguistic theory. In spite of these restrictions, this formalism allows for relatively elegant characterizations of natural languages that can be translated into efficient prolog parsers.

References

[1]

Akmajian, A.; Steele, S.; and Wasow, T. 1979 The Category AUX in Universal Grammar. Linguistic Inquiry 10: 1--64.

[2]

Baltin, M.R. 1981 Strict Bounding. In Baker, C.L. and McCarthy, J.J., Eds., The Logical Problem of Language Acquisition. MIT Press, Cambridge, Massachusetts.

[3]

Barton, E. 1984 Toward a Principle-Based Parser. A.I. Memo 788, Artificial Intelligence Laboratory, Massachusetts Institute of Technology, Cambridge, Massachusetts.

Digital Library

[4]

Barton, E. and Berwick, R.C. 1985 Parsing with Assertion Sets and Information Monotonicity. Proceedings of the 9th 1JCAI. Los Angeles, California.

[5]

Berwick, R.C. 1982 Locality Principles and the Acquisition of Syntactic Knowledge. Ph.D. dissertation, Massachusetts Institute of Technology, Cambridge, Massachusetts.

[6]

Berwick, R.C. 1983 A Deterministic Parser with Broad Coverage. Proceedings of the 8th IJCAI. Karlsruhle, Germany.

[7]

Berwick, R.C. and Weinberg, A.S. 1985 Deterministic Parsing and Linguistic Explanation. MS, forthcoming in Language and Cognitive Processes.

[8]

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

[9]

Colmerauer, A. 1978 Metamorphosis Grammars. In Bolc, L., Ed., Natural Language Communication with Computers. Springer-Verlag.

Digital Library

[10]

Dahl, V. 1984 More on Gapping Grammars. Proceedings of the International Conference on Fifth Generation Computer Systems.

[11]

Fodor, J.D. 1983 Phrase Structure Parsing and the Island Constraints. Linguistics and Philosophy 6: 163--223.

[12]

Gazdar, G.; Klein, E.; Pullum, G.; and Sag, I. 1985 Generalized Phrase Structure Grammar. Harvard University Press, Cambridge, Massachusetts.

[13]

Manzini, M.R. 1983 On Control and Control Theory. Linguistic Inquiry 14(3): 421--446.

[14]

Marcus, M. 1980 A Theory of Syntactic Recognition for Natural Language. MIT Press, Cambridge, Massachusetts.

Digital Library

[15]

Pereira, F. 1981 Extraposition Grammars. American Journal of Computational Linguistics 7:243--256.

Digital Library

[16]

Pereira, F. 1983 Logic for Natural Language Analysis. Technical Note 275, SRI International, Menlo Park, California.

[17]

Pereira, F. 1985 Note on "DCGs and Parsing Strategy". Prolog Digest 3(41).

[18]

Pereira, F. and Warren, D.H.D. 1980 Definite Clause Grammars for Natural Language Analysis. Artificial Intelligence 13: 231--278.

[19]

Pollard, C. }984 Generalized Phrase Structure Grammars, Head Grammars, and Natural Language. Ph.D. dissertation, Stanford University, Palo Alto, California.

[20]

Rizzi, L. 1982 Issues in Italian Syntax. Foris Publications, Dordrecht, Holland.

[21]

Stabler, E.P. Jr. 1983 Deterministic and Bottom-Up Parsing in Prolog. Proceedings of the National Conference on Artificial Intelligence, AAAI--83.

[22]

Wasow, T. 1985 Postscript. In Sells, P., Ed., Lectures on Contemporary Syntactic Theories. Center for the Study of Language and Information, Stanford University.

[23]

Wehrli, E. 1984 A Government-Binding Parser for French. Working Paper No. 48, Institut pour les Etudes Semantiques et Cognitives, Université de Geneve, Geneva, Switzerland.

[24]

Woods, W.A. 1970 Transition Network Grammars for Natural Language Analysis. Communications of the ACM 13: 591--606.

Digital Library

Cited By

Güngördü ZOflazer KNagao MWilks Y(1994)Parsing Turkish using the lexical functional grammar formalismProceedings of the 15th conference on Computational linguistics - Volume 110.3115/991886.991972(494-500)Online publication date: 5-Aug-1994
https://dl.acm.org/doi/10.3115/991886.991972
Staudacher PKrauwer SMoortgat Mdes Tombe LKlein E(1993)New frontiers beyond context-freenessProceedings of the sixth conference on European chapter of the Association for Computational Linguistics10.3115/976744.976786(358-367)Online publication date: 21-Apr-1993
https://dl.acm.org/doi/10.3115/976744.976786
Chen H(1990)A logic-based Government-Binding parser for Mandarin ChineseProceedings of the 13th conference on Computational linguistics - Volume 210.3115/997939.997948(48-53)Online publication date: 20-Aug-1990
https://dl.acm.org/doi/10.3115/997939.997948
Show More Cited By

Index Terms

Restricting logic grammars with government-binding theory
1. Computing methodologies
  1. Artificial intelligence
    1. Natural language processing
2. Hardware
  1. Power and energy
    1. Power estimation and optimization
      1. Platform power issues

Recommendations

Restricting logic grammars
AAAI'86: Proceedings of the Fifth AAAI National Conference on Artificial Intelligence

A parser formalism for natural languages that is so restricted as to rule out the definition of linguistic structures that do not occur in any natural language can make the task of grammar construction easier, whether it is done manually (by a ...
Preference logic grammars

Preference logic grammars (PLGs) are introduced in this paper as a concise, declarative, modular, and efficient means of resolving ambiguity in logic grammars. Preference logic grammars can be thought as extensions of definite clause grammars (DCGs) and ...
Modular Logic Grammars
ACL '85: Proceedings of the 23rd annual meeting on Association for Computational Linguistics

This report describes a logic grammar formalism, Modular Logic Grammars, exhibiting a high degree of modularity between syntax and semantics. There is a syntax rule compiler (compiling into Prolog) which takes care of the building of analysis structures ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Computational Linguistics

Computational Linguistics Volume 13, Issue 1-2

January-June 1987

149 pages

ISSN:0891-2017

EISSN:1530-9312

Issue’s Table of Contents

Publisher

MIT Press

Cambridge, MA, United States

Publication History

Published: 01 January 1987

Published in COLI Volume 13, Issue 1-2

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
192
Total Downloads

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

Reflects downloads up to 14 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Güngördü ZOflazer KNagao MWilks Y(1994)Parsing Turkish using the lexical functional grammar formalismProceedings of the 15th conference on Computational linguistics - Volume 110.3115/991886.991972(494-500)Online publication date: 5-Aug-1994
https://dl.acm.org/doi/10.3115/991886.991972
Staudacher PKrauwer SMoortgat Mdes Tombe LKlein E(1993)New frontiers beyond context-freenessProceedings of the sixth conference on European chapter of the Association for Computational Linguistics10.3115/976744.976786(358-367)Online publication date: 21-Apr-1993
https://dl.acm.org/doi/10.3115/976744.976786
Chen H(1990)A logic-based Government-Binding parser for Mandarin ChineseProceedings of the 13th conference on Computational linguistics - Volume 210.3115/997939.997948(48-53)Online publication date: 20-Aug-1990
https://dl.acm.org/doi/10.3115/997939.997948
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
Chen HLin IWu CHajičová E(1988)A new design of prolog-based bottom-up parsing system with Government-Binding theoryProceedings of the 12th conference on Computational linguistics - Volume 110.3115/991635.991659(112-116)Online publication date: 22-Aug-1988
https://dl.acm.org/doi/10.3115/991635.991659

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Get Access

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 Article

Media

Figures

Other

Tables

View Issue’s Table of Contents