Exploring Higher Order Dependency Parsers
| Název práce v češtině: | |
|---|---|
| Název v anglickém jazyce: | Exploring Higher Order Dependency Parsers |
| Klíčová slova: | higher order, dependency parsing, non-projectivity |
| Klíčová slova anglicky: | higher order, dependency parsing, non-projectivity |
| Akademický rok vypsání: | 2010/2011 |
| Typ práce: | diplomová práce |
| Jazyk práce: | angličtina |
| Ústav: | Ústav formální a aplikované lingvistiky (32-UFAL) |
| Vedoucí / školitel: | RNDr. Daniel Zeman, Ph.D. |
| Řešitel: | skrytý - zadáno a potvrzeno stud. odd. |
| Datum přihlášení: | 12.11.2010 |
| Datum zadání: | 12.11.2010 |
| Datum a čas obhajoby: | 30.01.2012 00:00 |
| Datum odevzdání elektronické podoby: | 14.12.2011 |
| Datum odevzdání tištěné podoby: | 09.12.2011 |
| Datum proběhlé obhajoby: | 30.01.2012 |
| Oponenti: | Loganathan Ramasamy |
| Zásady pro vypracování |
| Most of the recent efficient algorithms for dependency parsing work by factoring the dependency trees. In most of these approaches, the parser loses much of the contextual information during the process of factorization. There have been approaches to build higher order dependency parsers - second order, Carreras 2007 and third order - Koo and Collins 2010. In the thesis, the approach by Koo and Collins should be further exploited in one or more ways. Possible directions of further exploitation include but are not limited to: investigating possibilities of extension of the approach to non-projective parsing; integrating labeled parsing; joining word-senses during the parsing phase (Eisner 2000). |
| Seznam odborné literatury |
| Xavier Carreras. 2007. Experiments with a Higher- Order Projective Dependency Parser. In Proceedings of the CoNLL Shared Task Session of EMNLP- CoNLL, pages 957-961. Association for Computational Linguistics.
Terry Koo and Michael Collins 2010, EFFICIENT THIRD-ORDER DEPENDENCY PARSERS. Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics, Uppsala, Sweden. Jason Eisner. 2000. Bilexical Grammars and Their Cubic-Time Parsing Algorithms. In Harry Bunt and Anton Nijholt, editors, Advances in Probabilistic and Other Parsing Technologies, pages 29-62. Kluwer Academic Publishers. |