1997 ANonProjectiveDependencyParser

From GM-RKB
Jump to navigation Jump to search

Subject Headings: Dependency Grammar

Notes

Cited By

Quotes

Abstract

We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links according to their syntactic functions. We first describe the older Constraint Grammar parser where many of the ideas come from. Then we proceed to describe the central ideas of our new parser. Finally, the parser is evaluated.


References

  • 1. Arto Anttila. (1995). How to recognise subjects in English. In Karlsson et al., chapt. 9, pp. 315--358.
  • 2. Dekang Lin. (1996). Evaluation of Principar with the Susanne corpus. In John Carroll, editor, Workshop on Robust Parsing, pages 54--69, Prague.
  • 3. Jason M. Eisner, Three new probabilistic models for dependency parsing: an exploration, Proceedings of the 16th conference on Computational linguistics, August 05-09, 1996, Copenhagen, Denmark doi:10.3115/992628.992688
  • 4. David G. Hays. 1964. Dependency theory: A formalism and some observations. Language, 40(4):511--525.
  • 5. Hans Jürgen Heringer. (1993). Dependency syntax - basic ideas and the classical model. In Joachim Jacobs, Arnim von Stechow, Wolfgang Sternefeld, and Theo Venneman, editors, Syntax - An International Handbook of Contemporary Research, volume 1, chapter 12, pages 298--316. Walter de Gruyter, Berlin - New York.
  • 6. Richard Hudson. (1991). English Word Grammar. Basil Blackwell, Cambridge, MA.
  • 7. Arvi Hurskainen, Disambiguation of morphological analysis in Bantu languages, Proceedings of the 16th conference on Computational linguistics, August 05-09, 1996, Copenhagen, Denmark doi:10.3115/992628.992726
  • 8. Timo Järvinen, Annotating 200 million words: the Bank of English project, Proceedings of the 15th conference on Computational linguistics, August 05-09, 1994, Kyoto, Japan doi:10.3115/991886.991985
  • 9. Fred Karlsson, Atro Voutilainen, Juha Heikkila, Arto Anttila, Constraint Grammar: A Language-Independent System for Parsing Unrestricted Text, Mouton de Gruyter, 1995
  • 10. Fred Karlsson, Constraint grammar as a framework for parsing running text, Proceedings of the 13th conference on Computational linguistics, p.168-173, August 20-25, 1990, Helsinki, Finland doi:10.3115/991146.991176
  • 11. Michael C. McCord, Slot Grammar: A System for Simpler Construction of Practical Natural Language Grammars, Proceedings of the International Symposium on Natural Language and Logic, p.118-145, May 09-11, 1989
  • 12. Igor A. Mel'cuk. 1987. Dependency Syntax: Theory and Practice. State University of New York Press, Albany.
  • 13. Christer Samuelsson, Pasi Tapanainen, Atro Voutilainen, Inducing constraint grammars, Proceedings of the 3rd International Colloquium on Grammatical Inference: Learning Syntax from Sentences, p.146-155, September 25-27, 1996
  • 14. Daniel Sleator and Davy Temperley. (1991). Parsing English with a link grammar. Technical Report CMU-CS-91--196, Carnegie Mellon University.
  • 15. Pasi Tapanainen, Timo Järvinen, Syntactic analysis of natural language using linguistic rules and corpus-based patterns, Proceedings of the 15th conference on Computational linguistics, August 05-09, 1994, Kyoto, Japan doi:10.3115/991886.991997
  • 16. Pasi Tapanainen. (1996). The Constraint Grammar Parser CG-2. Number 27 in Publications of the Department of General Linguistics, University of Helsinki.
  • 17. Lucien Tesnière. 1959. Éléments de syntaxe structurale. Éditions Klincksieck, Paris.
  • 18. Atro Voutilainen. (1995). Morphological disambiguation. In Karlsson et al., chapter 6, pages 165--284.

,

 AuthorvolumeDate ValuetitletypejournaltitleUrldoinoteyear
1997 ANonProjectiveDependencyParserPasi Tapanainen
Timo Järvinen
Non-Projective Dependency ParserProceedings of the 5th Conference on Applied Natural Language Processinghttp://www.aclweb.org/anthology-new/A/A97/A97-1011.pdf?CFID=27448193&CFTOKEN=4255230010.3115/974557.9745681997