Modular Context-Free Grammars

Given two context-free grammars (CFGs), G1 and G2, the language generated by the union of the grammars is not the union of the languages generated by each grammar: L(G1∪ G2)≠ L(G1∪ L(G2). In order to account for modularity of grammars, another way of defining the meaning of grammars is needed. This paper adapts results from the semantics of logic programming languages to CFGs. We discuss alternative approaches for defining the denotation of a grammar, culminating in one which we show to be both compositional and fully-abstract. We then show how grammar modules can be defined such that their semantics retains these desirable properties. This gives a clear, mathematically sound way for composing parts of grammars.

[1]  Roberto Basili,et al.  Customizable Modular Lexicalized Parsing , 2000, IWPT.

[2]  Thierry Declerck,et al.  Linguistic engineering using ALEP , 2000 .

[3]  David H. D. Warren,et al.  Parsing as Deduction , 1983, ACL.

[4]  Michael J. Maher,et al.  Closures and Fairness in the Semantics of Programming Logic , 1984, Theor. Comput. Sci..

[5]  Robert D. Tennent,et al.  Semantics of programming languages , 1991, Prentice Hall International Series in Computer Science.

[6]  Gordon V. Cormack,et al.  Modular Attribute Grammars , 1990, Comput. J..

[7]  Evelina Lamma,et al.  Modularity in Logic Programming , 1994, J. Log. Program..

[8]  Hans Uszkoreit,et al.  GRAMMAR ENGINEERING: PROBLEMS AND PROSPECTS Report on the Saarbrcken Grammar Engineering Workshop , 1990 .

[9]  Ulrich Callmeier,et al.  PET – a platform for experimentation with efficient HPSG processing techniques , 2000, Natural Language Engineering.

[10]  N. Francez,et al.  Eecient Implementation of Uniication-based Grammars , 1999 .

[11]  Carlo Ghezzi,et al.  Programming language concepts , 1982 .

[12]  Robert A. Kowalski,et al.  The Semantics of Predicate Logic as a Programming Language , 1976, JACM.

[13]  Shuly Wintner.  Modularized Context-free Grammars , 1999 .

[14]  W. Wahlster.  VERBMOBIL : Erkennung, Analyse, Transfer, Generierung und Synthese von Spontansprache , 1997 .

[15]  Fernando Pereira,et al.  The Semantics of Grammar Formalisms Seen as Computer Languages , 1984, ACL.

[16]  Christopher Strachey,et al.  Toward a mathematical semantics for computer languages , 1971 .

[17]  Fei Xia,et al.  Some Experiments on Indicators of Parsing Complexity for Lexicalized Grammars , 2000, ELSPS.

[18]  Robin Milner,et al.  Processes: A Mathematical Model of Computing Agents , 1975 .

[19]  CallmeierUlrich.  PET a platform for experimentation with efficient HPSG processing techniques , 2000 .

[20]  Shuly Wintner.  Compositional Semantics for Linguistic Formalisms , 1999, ACL.

[21]  Stephan Oepen,et al.  The (new) LKB system , 1999 .

[22]  Paolo Mancarella,et al.  An Algebra of Logic Programs , 1988, ICLP/SLP.

[23]  Michael J. Maher.  Equivalences of Logic Programs , 1988, Foundations of Deductive Databases and Logic Programming..

[24]  S. Wintner.  Compositional Semantics for Uni cation-based Linguistic Formalisms , 1999 .

[25]  Rob Malouf,et al.  Efficient feature structure operations without compilation , 2000, Natural Language Engineering.

[26]  Haim Gaifman,et al.  Fully abstract compositional semantics for logic programs , 1989, POPL '89.

[27]  Stuart M. Shieber,et al.  Principles and Implementation of Deductive Parsing , 1994, J. Log. Program..

[28]  Anne Abeillé,et al.  A Lexicalized Tree Adjoining Grammar for English , 1990 .

[29]  James E. Donahue,et al.  Complementary Definitions of Programming Language Semantics , 1976, Lecture Notes in Computer Science.

[30]  Hans Uszkoreit,et al.  Introduction to this Special Issue , 2000, Natural Language Engineering.

[31]  Alon Lavie,et al.  A modular approach to spoken language translation for large domains , 1998, AMTA.

[32]  Vlado Ke Selj.  MODULAR HPSG ⋆ , 2001 .

[33]  Bob Carpenter,et al.  ALE : the attribute logic engine user's guide, version 2.0.1 , 1992 .

[34]  Rémi Zajac,et al.  Modular Unification-based Parsers , 2000, IWPT.

[35]  Dan Flickinger,et al.  An Open Source Grammar Development Environment and Broad-coverage English Grammar Using HPSG , 2000, LREC.

[36]  Hans-Ulrich Krieger,et al.  Modularizing Codescriptive Grammars for Efficient Parsing , 1996, COLING.