Crossed serial dependencies: a low-power parseable extension to GPSG
Pages 16 - 21
Abstract
An extension to the GPSG grammatical formalism is proposed, allowing non-terminals to consist of finite sequences of category labels, and allowing schematic variables to range over such sequences. The extension is shown to be sufficient to provide a strongly adequate grammar for crossed serial dependencies, as found in e.g. Dutch subordinate clauses. The structures induced for such constructions are argued to be more appropriate to data involving conjunction than some previous proposals have been. The extension is shown to be parseable by a simple extension to an existing parsing method for GPSG.
References
[1]
Ades, A. and Steedman, M. 1982. On the order of words. Linguistics and Philosophy. to appear.
[2]
Bresnan, J.W., Kaplan, R., Peters, S. and Zaenen, A. 1982. Cross-serial dependencies in Dutch. Linguistic Inquiry 13.
[3]
Gazdar, G. 1981c. Phrase structure grammar. In P. Jacobson and G. Pullum, editors, The nature of syntactic representation. D. Reidel, Dordrecht.
[4]
Joshi, A. 1983. How much context-sensitivity is required to provide reasonable structural descriptions: Tree adjoining grammars. version submitted to this conference.
[5]
Joshi, A.K., Levy, L.S. and Yueh, K. 1975. Tree adjunct grammars. Journal of Computer and System Sciences.
[6]
Kaplan, R.M. and Bresnan, J. 1982. Lexical-functional grammar: A formal system of grammatical representation. In J. Bresnan, editor, The mental representation of grammatical relations. MIT Press, Cambridge, MA.
[7]
Seuren, P. 1972. Predicate Raising in French and Sundry Languages. ms., Nijmegen.
[8]
Steedman, M. 1983. On the Generality of the Nested Dependency Constraint and the reason for an Exception in Dutch. In Butterworth, B., Comrie, E. and Dahl, O., editors, Explanations of Language Universals. Mouton.
[9]
Thompson, H.S. 1981b. Chart Parsing and Rule Schemata in GPSG. In Proceedings of the Nineteenth Annual Meeting of the Association for Computational Linguistics. ACL, Stanford, CA. Also DAI Research Paper 165, Dept. of Artificial Intelligence, Univ. of Edinburgh.
- Crossed serial dependencies: a low-power parseable extension to GPSG
Recommendations
Cross-serial dependencies are not hard to process
COLING '96: Proceedings of the 16th conference on Computational linguistics - Volume 1Cross-serial dependencies in Dutch and Swiss-German are the only known extracontext free natural language syntactic phenomena. Psycholinguistic evidence suggests cross-serial orderings tend to be easier to process than nested constructions. We argue ...
Preserving semantic dependencies in synchronous Tree Adjoining Grammar
ACL '99: Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational LinguisticsRambow, Wier and Vijay-Shanker (Rambow et al., 1995) point out the differences between TAG derivation structures and semantic or predicate-argument dependencies, and Joshi and Vijay-Shanker (Joshi and Vijay-Shanker, 1999) describe a monotonic ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computational Linguistics
United States
Publication History
Published: 15 June 1983
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 85 of 443 submissions, 19%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 225Total Downloads
- Downloads (Last 12 months)72
- Downloads (Last 6 weeks)10
Reflects downloads up to 23 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in