Regularized Least-Squares for parse ranking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3646 LNCS, Issue , 2005, Pages 464-474

  Tsivtsivadze, Evgeni ^a   Pahikkala, Tapio ^a   Pyysalo, Sampo ^a   Boberg, Jorma ^a   Myllari, Aleksandr ^a   Salakoski, Tapio ^a  

^a UNIVERSITY OF TURKU   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMEDICAL ENGINEERING; COMPUTATIONAL GRAMMARS; FEATURE EXTRACTION; LEARNING SYSTEMS; LEAST SQUARES APPROXIMATIONS; PROBLEM SOLVING;

BUILT-IN RANKING; GOODNESS FUNCTION; LINK GRAMMAR (LG); REGULARIZED LEAST-SQUARES ALGORITHM;

ALGORITHMS;

EID: 33745202856     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11552253_42     Document Type: Conference Paper

References (13)

1. Collins, M.: Discriminative reranking for natural language parsing. In Langley, P., ed.: Proceedings of the Seventeenth International Conference on Machine Learning, San Francisco, CA, Morgan Kaufmann (2000) 175-182
2. Sleator, D.D., Temperley, D.: Parsing english with a link grammar. Technical Report CMU-CS-91-196, Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1991)
3. Pyysalo, S., Ginter, F., Pahikkala, T., Boberg, J., Järvinen, J., Salakoski, T., Koivula, J.: Analysis of link grammar on biomedical dependency corpus targeted at protein-protein interactions. In Collier, N., Ruch, P., Nazarenko, A., eds.: Proceedings of the JNLPBA workshop at COLING'04, Geneva, (2004) 15-21
4. Poggio, T., Smale, S.: The mathematics of learning: Dealing with data. Amer. Math. Soc. Notice 50 (2003) 537-544
5. Vapnik, V.N.: The nature of statistical learning theory. Springer-Verlag New York, Inc. (1995)
6. Herbrich, R., Graepel, T., Obermayer, K.: Support vector learning for ordinal regression. In: Proceedings of the Ninth International Conference on Artificial Neural Networks, London, UK, IEE (1999) 97-102
7. Joachims, T.: Optimizing search engines using clickthrough data, In: Proceedings of the ACM Conference on Knowledge Discovery and Data Mining, New York, NY, USA, ACM Press (2002) 133-142
8. Shen, L., Joshi, A.K.: An svm-based voting algorithm with application to parse reranking. In Daelemans, W., Osborne, M., eds.: Proceedings of CoNLL-2003. (2003) 9-16
9. Collins, M., Koo, T.: Discriminative reranking for natural language parsing (2004) To appear in Computational Linguistics, available at http://people.csail.mit.edu/people/mcollins/papers/collinskoo.ps.
10. Kendall, M.G.: Rank Correlation Methods. 4. edn. Griffin, London (1970)
11. Lafferty, J., Sleator, D., Temperley, D.: Grammatical trigrams: A probabilistic model of link grammar. In: Proceedings of the AAAI Conference on Probabilistic Approaches to Natural Language, Menlo Park, CA, AAAI Press (1992) 89-97
12. Schölkopf, B., Herbrich, R., Smola, A.J.: A generalized representer theorem. In Helmbold, D., Williamson, R., eds.: Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory, Berlin, Germany, Springer-Verlag (2001) 416-426
13. Alpaydin, E.: Combined 5 × 2 cv F-test for comparing supervised classification learning algorithms. Neural Computation 11 (1999) 1885-1892