Sciweavers

264 search results - page 20 / 53
» Learning Linearly Separable Languages
Sort
View
NAACL
2007
13 years 10 months ago
Tree Revision Learning for Dependency Parsing
We present a revision learning model for improving the accuracy of a dependency parser. The revision stage corrects the output of the base parser by means of revision rules learne...
Giuseppe Attardi, Massimiliano Ciaramita
EMNLP
2010
13 years 6 months ago
A Fast Decoder for Joint Word Segmentation and POS-Tagging Using a Single Discriminative Model
We show that the standard beam-search algorithm can be used as an efficient decoder for the global linear model of Zhang and Clark (2008) for joint word segmentation and POS-taggi...
Yue Zhang 0004, Stephen Clark
COLT
1998
Springer
14 years 25 days ago
Large Margin Classification Using the Perceptron Algorithm
We introduce and analyze a new algorithm for linear classification which combines Rosenblatt's perceptron algorithm with Helmbold and Warmuth's leave-one-out method. Like...
Yoav Freund, Robert E. Schapire
ECTEL
2007
Springer
14 years 16 days ago
Curriculum Model Checking: Declarative Representation and Verification of Properties
When a curriculum is proposed, it is important to verify at least three aspects: that the curriculum allows the achievement of the user's learning goals, that the curriculum i...
Matteo Baldoni, Elisa Marengo
HASKELL
2006
ACM
14 years 2 months ago
Statically typed linear algebra in Haskell
Many numerical algorithms are specified in terms of operations on vectors and matrices. Matrix operations can be executed extremely efficiently using specialized linear algebra k...
Frederik Eaton