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 sub-trees " (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 named-entity extraction from web data.

Extracted Key Phrases

5 Figures and Tables

Showing 1-10 of 20 references

Efficient algorithms for parsing the DOP model

  • J Goodman
  • 1996
Highly Influential
5 Excerpts

An introduction to Support Vector Machines and other kernel-based learning methods

  • N Cristianini, J Shawe-Tayor
  • 2000
Showing 1-10 of 394 extracted citations
0204060'01'03'05'07'09'11'13'15'17
Citations per Year

682 Citations

Semantic Scholar estimates that this publication has received between 576 and 810 citations based on the available data.

See our FAQ for additional information.