The complexity of recognition of linguistically adequate dependency grammars

Proceedings of the Annual Meeting of the Association for Computational Linguistics

Volumn 1997-July, Issue , 1997, Pages 337-343

  Neuhaus, Peter ^a   Briiker, Norbert ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DEPENDENCY GRAMMAR; GRAMMAR FORMALISMS; PHRASE STRUCTURE; STRUCTURE-BASED;

EID: 85149138387     PISSN: 0736587X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Barton, Jr., G. E. (1985). On the complexity of ID/LP parsing. ComputationalLinguistics, 11(4):205-218.
2. Br6ker, N. (1997). Eine Dependenzgrammatik zur Kopplung heterogener Wissenssysteme auf modaUogischer Basis, (Dissertation). Freiburg, DE: Philosophische Fakult~it, Albert-Ludwigs-Universit~it.
3. Earley, J. (1970). An efficient context-free parsing algorithm. Communicationsof the ACM, 13(2):94-102.
4. Gaifman, H. (1965). Dependency systems and phrase-structure systems. Information & Control, 8:304-337.
5. Garey, M. R. & D. S. Johnson (1983). Computers and Intractability: A Guide to the Theory of NP-completeness (2. ed.). New York, NY: Freeman.
6. Haegeman, L. (1994). Introduction to Governmentand Binding. Oxford, UK: Basil Blackwell.
7. Hellwig, E (1988). Chart parsing according to the slot and filler principle. In Proc. of the 12th Int. Conf. on Computational Linguistics. Budapest, HU, 22-27Aug 1988, Vol. 1, pp. 242-244.
8. Hepple, M. (1990). Word order and obliqueness in categorial grammar. In G. Barry & G. Morill (Eds.), Studies in categorial grammar, pp. 47-64. Edinburgh, UK: Edinburgh University Press.
9. Huck, G. (1988). Phrasal verbs and the categories of postponement. In R. Oehrle, E. Bach & D. Wheeler (Eds.), Categorial Grammars and Natural Language Structures, pp. 249-263. Studies in Linguistics and Philosophy 32. Dordrecht, NL: D. Reidel.
10. Hudson, R. (1990). EnglishWordGrammar. Oxford, UK: Basil Blackwell.
11. Lombardo, V. & L. Lesmo (1996). An earley-type recognizer for dependency grammar. In Proc. of the 16 th Int. Conf. on Computational Linguistics. Copenhagen, DK, 5-9 Aug 1996, Vol. 2, pp. 723-728.
12. McCord, M. (1990). Slot grammar: A system for simpler construction of practical natural language grammars. In R. Studer (Ed.), Natural Language and Logic, pp. 118-145. Berlin, Heidelberg: Springer.
13. Mer ~uk, I. (1988). DependencySyntax: Theoryand Practice. New York, NY: SUNY State University Press of New York.
14. Mel' 6uk, I. & N. Pertsov (1987). Surface Syntax of English: A FormalModel within the MTT Framework. Amsterdam, NL: John Benjamins.
15. Neuhaus, R & U. Hahn (1996). Restricted parallelism in object-oriented lexical parsing. In Proc. of the 16th Int. Conf. on Computational Linguistics. Copenhagen, DK, 5-9 Aug 1996, pp. 502-507.
16. Pollard, C. & I. Sag (1994). Head-Driven Phrase Structure Grammar. Chicago, IL: University of Chicago Press.
17. Rambow, O. & A. Joshi (1994). A formal look at DGs and PSGs, with consideration of word-order phenomena. In L. Wanner (Ed.), CurrentIssues in Meaning-Text-Theory. London: Pinter.
18. Reape, M. (I 989). A logical treatment of semi-free word order and discontinuous constituents. In Proc. ofthe 27thAnnual Meeting oftheAssociationfor ComputationalLinguistics. Vancouver,BC, 1989, pp. 103-110.
19. Starosta, S. (1988). The Casefor Lexicase. London: Pinter.
20. Starosta, S. (1992). Lexicaserevisited. Department of Linguistics, University of Hawaii.
21. Tesni~re, L. ((1969) 1959). Elements de Syntaxe Structurale (2. ed.). Paris, FR: Klincksieck.