Sciweavers

Share
IJCAI
2007

Simple Training of Dependency Parsers via Structured Boosting

8 years 11 months ago
Simple Training of Dependency Parsers via Structured Boosting
Recently, significant progress has been made on learning structured predictors via coordinated training algorithms such as conditional random fields and maximum margin Markov networks. Unfortunately, these techniques are based on specialized training algorithms, are complex to implement, and expensive to run. We present a much simpler approach to training structured predictors by applying a boosting-like procedure to standard supervised training methods. The idea is to learn a local predictor using standard methods, such as logistic regression or support vector machines, but then achieve improved structured classification by ”boosting” the influence of misclassified components after structured prediction, re-training the local predictor, and repeating. Further improvement in structured prediction accuracy can be achieved by incorporating ”dynamic” features—i.e. an extension whereby the features for one predicted component can depend on the predictions already made for s...
Qin Iris Wang, Dekang Lin, Dale Schuurmans
Added 29 Oct 2010
Updated 29 Oct 2010
Type Conference
Year 2007
Where IJCAI
Authors Qin Iris Wang, Dekang Lin, Dale Schuurmans
Comments (0)
books