(Enter summary)
Abstract: This paper considers approaches which rerank the output of an existing probabilistic
parser. The base parser produces a set of candidate parses for each input sentence, with
associated probabilities that de
ne an initial ranking of these parses. A second model
then attempts to improve upon this initial ranking, using additional features of the tree
as evidence. The strength of our approach is that it allows a tree to be represented as
an arbitrary set of features, without concerns about how... (Update)
Similar documents based on text: More All
0.7: Discriminative Reranking for Natural Language Parsing - Collins, Koo (2003)
(Correct)
0.5: Discriminative Reranking for Machine Translation - Libin Shen Dept (2004)
(Correct)
0.2: Ranking Algorithms for Named-Entity Extraction: Boosting and the.. - Collins (2002)
(Correct)
Related documents from co-citation: More All
20: Building a large annotated corpus of english: The penn treebank
- Marcus, Santorini et al. - 1993
20: A maximum-entropyinspired parser
- Charniak - 1999
17: Head-Driven Statistical Models for Natural Language Parsing
- Collins - 1999
BibTeX entry: (Update)
M. Collins, 2000. Discriminative Reranking for Natural Language Parsing, Proceedings ICML'2000 , Stanford, Ca. http://citeseer.ist.psu.edu/collins00discriminative.html More
@inproceedings{ collins00discriminative,
author = "Michael Collins",
title = "Discriminative Reranking for Natural Language Parsing",
booktitle = "Proc. 17th International Conf. on Machine Learning",
publisher = "Morgan Kaufmann, San Francisco, CA",
pages = "175--182",
year = "2000",
url = "citeseer.ist.psu.edu/collins00discriminative.html" }
Citations (may not include all citations):
760
Probabilistic Reasoning in Intelligent Systems (context) - Judea - 1988
537
A theory of the learnable (context) - Leslie - 1984
509
A decision-theoretic generalization of on-line learning and ..
- Yoav, Schapire - 1997
475
Building a Large Annotated Corpus of English: the Penn Treeb..
- Mitchell, Santorini et al. - 1993
236
Additive Logistic Regression: a Statistical View of Boosting
- Jerome, Trevor et al. - 2000
213
A Maximum Entropy Approach to Natural Language Processing
- Adam, Stephen et al. - 1996
130
Tree adjunct grammar (context) - Aravind, Levy et al. - 1975
123
Toward optimal feature selection
- Koller - 1996
118
Inducing Features of Random Fields
- Pietra, Vincent et al. - 1997
99
A Maximum-Entropy-Inspired Parser
- Eugene - 2000
96
Head-Driven Statistical Models for Natural Language Parsing
- Michael - 1999
83
Statistical parsing with a context-free grammar and word sta..
- Eugene - 1997
78
Boosting the margin: A new explanation for the eectiveness .. (context) - Robert, Yoav et al. - 1998
76
Towards History-Based Grammars: Using Richer Models for Prob..
- Ezra, Jelinek et al. - 1992
60
Three Generative (context) - Michael - 1997
41
Stochastic Attribute-Value Grammars
- Steven - 1997
39
Improved boosting algorithms using con dence-rated predictio.. (context) - Robert, Yoram - 2000
39
Discriminative Reranking for Natural Language Parsing
- Michael - 2000
36
Maximum Entropy Models for Natural Language Ambiguity Resolu..
- Adwait - 1998
32
A Linear Observed Time Statistical Parser Based on Maximum E..
- Adwait - 1997
30
Discriminative Training Methods for Hidden Markov Models: Th..
- Michael - 2002
28
A Gaussian Prior for Smoothing Maximum Entropy Models
- Stanley, Ronald - 1999
21
Discriminative Training and Maximum Entropy Models for Stati..
- Franz, Hermann - 2002
21
Large Margin Classi cation using the Perceptron Algorithm (context) - Yoav, Schapire - 1999
20
A comparison of algorithms for maximum entropy parameter est..
- Robert - 2002
18
A Whole Sentence Maximum Entropy Language Model
- Rosenfeld - 1997
15
Direct Optimization of Margins Improves Generalization in Co..
- Llew, Bartlett et al. - 1999
12
Maximum likelihood and discriminative training of direct tra.. (context) - Kishore, Salim et al. - 1998
11
Conditional random elds: Probabilistic models for segmenting.. (context) - erty, Andrew et al. - 2001
10
New Ranking Algorithms for Parsing and Tagging: Kernels over..
- Michael, Du - 2002
10
Boosting and maximum likelihood for exponential models
- Guy, La - 2002
10
Logistic regression (context) - Michael, Schapire et al. - 2002
9
An ecient boosting algorithm for combining preferences (context) - Yoav, Iyer et al. - 1998
9
Parsing the Wall Street Journal using a Lexical-Functional G..
- Stefan, King et al. - 2002
8
Ranking Algorithms for Named{Entity Extraction: Boosting and..
- Michael - 2002
7
Parameter Estimation for Statistical Parsing Models: Theory ..
- Michael - 2004
5
A Maximum Entropy Model for Parsing
- Adwait, Roukos et al. - 1994
5
Estimators for Stochastic \Uni cation-based (context) - Mark, Geman et al. - 1999
4
Discriminative Learning for Label Sequences via Boosting
- Yasemin, Hofmann et al. - 2003
4
SPoT: a trainable sentence planner
- Marilyn, Rambow et al. - 2001
4
Feature-based language understanding (context) - Kishore, Salim et al. - 1997
3
Inducing History Representations for Broad Coverage Statisti..
- James - 2003
3
Loss Functions and Optimization Methods for Discriminative L.. (context) - Yasemin, Johnson et al. - 2003
2
Using LTAG Based Features in Parse Reranking
- Libin, Sarkar et al. - 2003
2
A Fast Algorithm for Feature Selection in Conditional Maximu.. (context) - Zhou, Fuliang et al. - 2003
2
Eciently Inducing Features of Conditional Random Fields (context) - Andrew - 2003
1
Shallow parsing with conditional random elds (context) - Fei, Pereira - 2003
1
Incremental Feature Selection and l 1 Regularization for Rel.. (context) - Stefan, Vasserman - 2004
1
Additive models (context) - erty - 1999
1
Robust trainability of single neurons (context) - gen, Kevin et al. - 1995
The graph only includes citing articles where the year of publication is known.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC