Data-Defined Kernels for Parse Reranking Derived from Probabilistic Models

James Henderson, Ivan Titov

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Previous research applying kernel methods to natural language parsing have focussed on proposing kernels over parse trees, which are hand-crafted based on domain knowledge and computational considerations. In this paper we propose a method for defining kernels in terms of a probabilistic model of parsing. This model is then trained, so that the parameters of the probabilistic model reflect the generalizations in the training data. The method we propose then uses these trained parameters to define a kernel for reranking parse trees. In experiments, we use a neural network based statistical parser as the probabilistic model, and use the resulting kernel with the Voted Perceptron algorithm to rerank the top 20 parses from the probabilistic model. This method
achieves a significant improvement over the accuracy of the probabilistic model.
Original languageEnglish
Title of host publicationACL 2005, 43rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, 25-30 June 2005, University of Michigan, USA
PublisherAssociation for Computational Linguistics
Pages181-188
Number of pages8
Publication statusPublished - 2005

Fingerprint Dive into the research topics of 'Data-Defined Kernels for Parse Reranking Derived from Probabilistic Models'. Together they form a unique fingerprint.

Cite this