On parsing coupled-context-free languages

Theoretical Computer Science

Volumn 161, Issue 1-2, 1996, Pages 205-233

  Hotz, Günter ^a   Pitsch, Gisela ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; CONTEXT FREE GRAMMARS; CONTEXT SENSITIVE GRAMMARS; FORMAL LOGIC; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; NATURAL LANGUAGE PROCESSING SYSTEMS; POLYNOMIALS; PROBLEM SOLVING; PROGRAMMING THEORY;

COUPLED CONTEXT FREE GRAMMARS; COUPLED CONTEXT FREE LANGUAGES; INFINITE HIERARCHY OF LANGUAGES; NATURAL GENERALIZATION; NATURAL LANGUAGES; PARSING; TREE ADJOINING GRAMMARS;

CONTEXT FREE LANGUAGES;

EID: 0030181732     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00114-X     Document Type: Article

References (26)

1. A. Abbeillé, Parsing French with tree adjoining grammars: Some linguistic accounts, in: Proc. 12th Internat. Conf. on Computational Linguistics (1988) 7-12.
2. J. Bresnan, R. Kaplan, P. Peters and A. Zaenen, Cross-serial dependencies in Dutch, Linguistic Inquiry 13 (1982) 613-635.
3. N. Chomsky, On Certain Formal Properties of Grammars, Inform. and Control 2 (1959) 137-167.
4. N. Chomsky and N. Schützenberger, The algebraic theory of context-free languages, in: Computer Programming and Formal Systems (North Holland, Amsterdam, 1963) 118-161.
5. J. Dassow and G. Pǎun, Regulated Rewriting in Formal Language Theory (Springer, Berlin 1989).
6. S.A. Greibach and J.E. Hopcroft, Scattered Context Grammars, J. Comput. System Sci. 3 (1969) 232-247.
7. Y. Guan, Klammergrammatiken, Netzgrammatiken und Interpretationen von Netzen., Ph.D. Thesis, University of Saarbrücken, 1992.
8. Y. Guan and G. Hotz, TAGs as a semantic of trees, in: Proc. 1th Internnat. Workshop on Tree Adjoining Grammars (1990) 34-37.
9. Y. Guan, G. Hotz and A. Reichert, Tree grammars with multilinear interpretation, Technical Report, University of Saarbrücken, 1992.
10. K. Harbusch, An efficient parsing algorithm for tree adjoining grammars, in: Proc. 28th Ann. Meeting of the Ass. for Computational Linguistics (1990).
11. J. Higginbotham, English is not a Context-Free Language, Linguistic Inquiry 15 (1984) 225-235.
12. G. Hotz, Erzeugung formaler Sprachen durch gekoppelte Ersetzungen, 4. Colloquium Automatentheorie, München (1967) 62-73.
13. A.K. Joshi, Tree adjoining grammars: how much context-sensitivity is required to provide reasonable structural descriptions, in: D. Dowty, L. Karttunen, and A. Zwicky, eds., Natural Language Parsing - Psycholinguistic, Computational, and Theoretical Perspectives (Cambridge University Press, Cambridge, 1985) 206-250.
14. A.K. Joshi, An introduction to tree adjoining grammars, in: A. Manaster-Ramer, ed., Mathematics of Language (Benjamin, New York, 1987).
15. A.K. Joshi, L.S. Levy and M. Takahashi, Tree Adjunct Grammars, J. Comput. System Sci. 10 (1975) 136-163.
16. T. Kroch, Unbounded Dependencies and Subjacency in a Tree Adjoining Grammar, in: A. Manaster-Ramer, ed., Mathematics of Language (Benjamins, New York, 1987) 143-172.
17. T. Kroch and A.K. Joshi, The linguistic relevance of tree adjoining grammars, Technical Report MS-CIS-85-16, University of Pennsylvania, Philadelphia, 1985.
18. G. Pitsen, Analyse von Klammergrammatiken, Ph.D. Thesis, University of Saarbrücken, 1993.
19. G. Pitsch, LR(k)-parsing of coupled-context-free grammars, in: Proc. 15th Internat. Conf. on Computational Linguistics (1994) 401-405.
20. G. Pitsch, LL(k)-parsing of coupled-context-free grammars, Comput. Intell. 10 (1994) 563-578.
21. D. Radzinski, Chinese Number-Names, Tree adjoining grammars and mild context-sensitivity, Computational Linguistics 17 (1991) 277-299
22. Y. Schabes and A.K. Joshi, An early-type parsing algorithm for tree adjoining grammars, in: Proc. 26th Annual Meeting of the Ass. for Computational Linguistics (1988).
23. E. Shamir, Some inherently ambiguous context-free languages, Inform. and Control 18 (1971) 355-363.
24. S. Shieber, Evidence against context-freeness of natural language, Linguistics and Philosophy 8 (1986) 333-343.
25. K. Vijay-Shanker and A. Joshi, Some computational properties of tree adjoining grammars, in: Proc. 23th Annual Meeting of the Ass. for Computational Linguistics (1985) 82-93.
26. 3, Inform. and Control 10 (1967) 189-208.