Departmental Papers (CIS)
Date of this Version
March 2004
Document Type
Conference Paper
Recommended Citation
Libin Shen and Aravind K. Joshi, "Flexible Margin Selection for Reranking with Full Pairwise Samples", . March 2004.
Abstract
Perceptron like large margin algorithms are introduced for the experiments with various margin selections. Compared to the previous perceptron reranking algorithms, the new algorithms use full pairwise samples and allow us to search for margins in a larger space. Our experimental results on the data set of [1] show that a perceptron like ordinal regression algorithm with uneven margins can achieve Recall/Precision of 89.5/90.0 on section 23 of Penn Treebank. Our result on margin selection can be employed in other large margin machine learning algorithms as well as in other NLP tasks.
Date Posted: 24 March 2006
Comments
Postprint version. Published in Lecture Notes in Computer Science, Volume 3248, Natural Language Processing - IJCNLP 2004: First International Joint Conference, 2005, pages 446-455.
Publisher URL: http://dx.doi.org/10.1007/b105612