New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron (2002)
Cached
Download Links
- [www.research.att.com]
- [oucsace.cs.ohiou.edu]
- [oucsace.cs.ohiou.edu]
- [acl.ldc.upenn.edu]
- [www.aclweb.org]
- [www.ai.mit.edu]
- DBLP
Other Repositories/Bibliography
by
Michael Collins
,
Nigel Duffy
,
Florham Park
| Citations: | 164 - 5 self |
BibTeX
@MISC{Collins02newranking,
author = {Michael Collins and Nigel Duffy and Florham Park},
title = {New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 98), 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.
