1269 search results - page 43 / 254 » Learning Correction Grammars |
105
Voted
EMNLP
2006
15 years 2 months ago
2006
In this work we learn clusters of contextual annotations for non-terminals in the Penn Treebank. Perhaps the best way to think about this problem is to contrast our work with that...
108
Voted
ICGI
2010
Springer
15 years 1 months ago
2010
Springer
Angluin showed that the class of regular languages could be learned from a Minimally Adequate Teacher (mat) providing membership and equivalence queries. Clark and Eyraud (2007) sh...
118
Voted
EMNLP
2010
14 years 10 months ago
2010
We introduce a novel training algorithm for unsupervised grammar induction, called Zoomed Learning. Given a training set T and a test set S, the goal of our algorithm is to identi...
133
Voted
IEAAIE
2010
Springer
14 years 10 months ago
2010
Springer
An innovative technique based on multi-objective grammar guided genetic programming (MOG3P-MI) is proposed to detect the most relevant activities that a student needs to pass a cou...
107
Voted
ESANN
2007
15 years 2 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...