New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron

Abstract

This paper introduces new learning algorithms for natural language processing based on the perceptron algorithm. We show how the algorithms can be efficiently applied to exponential sized representations of parse trees, such as the “all subtrees” (DOP) representation described by (Bod 1998), or a representation tracking all sub-fragments of a tagged sentence. We give experimental results showing significant improvements on two tasks: parsing Wall Street Journal text, and namedentity extraction from web data.

Extracted Key Phrases

5 Figures and Tables

0204060'01'03'05'07'09'11'13'15'17
Citations per Year

642 Citations

Semantic Scholar estimates that this publication has 642 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Collins2002NewRA, title={New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron}, author={Michael Collins and Nigel Duffy}, booktitle={ACL}, year={2002} }