Exploring Higher Order Dependency Parsers
v Title: Exploring Higher Order Dependency Parsers Author: Pranava Swaroop Madhyastha Department: Institute of Formal and Applied Linguistics Department of Human Language Science and Technology Supervisor: Professor Michael Rosner& RNDr. Daniel Zeman Supervisor's e mail address:mike.rosner@um.edu.mt zeman@ufal.mff.cuni.cz Abstract: 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, [Carreras2007] and third order [Koo and Collins2010] 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 [Eisner2000] 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, [Carreras2007] and third order [Koo and Collins2010] 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 [Eisner2000]