A new approach to analyse Coupled-Context-Free languages

  • Günter Hotz
  • Gisela Pitsch
Contributed Papers Formal Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 969)


Coupled-Context-Free Grammars are a natural generalization of context-free ones obtained by combining nonterminals to corresponding parentheses which can only be substituted simultaneously. Refering to their generative capacity we obtain an infinite hierarchy of languages that comprises the context-free ones as the first and all those generated by Tree Adjoining Grammars (TAGs) as the second element. Here, we present a completely new approach to analyse this language hierarchy. It solves the word problem for the class of languages generated by TAGs in time O(n6), n length of the input, by reducing it to the analysis of sequences of parentheses.


Word Problem Representation Theorem Congruence Relation Derivation Tree Input Word 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Abbeillé: Parsing French with Tree Adjoining Grammars: Some Linguistic Accounts. In Proc. of the 12th Conf. on Comput. Linguistics 1988, pp. 7–12Google Scholar
  2. [2]
    J. Bresnan, R. Kaplan, P. Peters, A. Zaenen: Cross-serial Dependencies in Dutch. Linguistic Inquiry 13 (1982), pp. 613–635Google Scholar
  3. [3]
    N. Chomsky, N. Schützenberger: The Algebraic Theory of Context-Free Languages. In “Computer Programming and Formal Systems” Amsterdam, North Holland 1963Google Scholar
  4. [4]
    J. Dassow, G. PĂun: Regulated Rewriting in Formal Language Theory. Springer 1989Google Scholar
  5. [5]
    Y. Guan, G. Hotz, A. Reichert: Tree Grammars with multilinear Interpretation. Technical Report, Univ. of Saarbrücken 1992Google Scholar
  6. [6]
    Y. Guan: Klammergrammatiken, Netzgrammatiken und Interpretationen von Netzen. PhD thesis, Univ. of Saarbrücken 1992Google Scholar
  7. [7]
    G. Hotz, T. Kretschmer: The Power of the Greibach Normal Form. EIK 25 (1989), pp. 507–512Google Scholar
  8. [8]
    G. Hotz, G. Pitsch: Fast Uniform Analysis of Coupled-Context-Free Grammars. In Proc. of ICALP 1994, pp. 412–423Google Scholar
  9. [9]
    G. Hotz, G. Pitsch: A Representation Theorem for Coupled-Context-Free Grammars. In Proc. of Conf. on Semigroups, Automata, and Languages, Porto 1994, pp. 88–91Google Scholar
  10. [10]
    A.K. Joshi, L.S. Levy, M. Takahashi: Tree Adjunct Grammars. J. Comput. Syst. Sci. 10 (1975), pp. 136–163Google Scholar
  11. [11]
    T. Kroch, A.K. Joshi. The Linguistic Relevance of Tree Adjoining Grammars. Technical Report MS-CIS-85-16, Univ. of Pennsylvania, Philadelphia 1985Google Scholar
  12. [12]
    G. Pitsch: Analyse von Klammergrammatiken. PhD thesis, Univ. of Saarbrücken 1993. also Technical Report 10/1994, Univ. of Saarbrücken, 1994.Google Scholar
  13. [13]
    G. Pitsch: LL(k)-Parsing of Coupled-Context-Free Grammars. Comput. Intelligence 10, pp. 563–578Google Scholar
  14. [14]
    D.J. Rosenkrantz. Matrix Equations and Normal Forms for Context-Free Grammars. J. ACM 14 (1967), pp. 501–507Google Scholar
  15. [15]
    E. Shamir. A Representation Theorem for Algebraic and Context-Free Power Series in Noncommuting Variables. Information and Control 11 (1967), pp. 239–254CrossRefGoogle Scholar
  16. [16]
    S. Shieber: Evidence against Context-Freeness of Natural Language. Linguistics and Philosophy 8 (1986), pp. 333–343Google Scholar
  17. [17]
    Y. Schabes, A.K. Joshi. An Early-Type Parsing Algorithm for Tree Adjoining Grammars. In Proc. of the 26th Meeting of the Assoc. for Comput. Linguistics 1988Google Scholar
  18. [18]
    K. Vijay-Shanker, A.K. Joshi. Some Computational Properties of Tree Adjoining Grammars. In Proc. of the 23th Meeting of the Assoc. for Comput. Linguistics 1985, pp. 82–93Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Günter Hotz
    • 1
  • Gisela Pitsch
    • 1
  1. 1.FB 14 - InformatikUniversität des SaarlandesSaarbrückenGermany

Personalised recommendations