Kernels on Linguistic Structures for Answer Extraction

Natural Language Processing (NLP) for Information Retrieval has always been an interesting and challenging research area. Despite the high expectations, most of the results indicate that successfully using NLP is very complex. In this paper, we show how Support Vector Machines along with kernel functions can effectively represent syntax and semantics. Our experiments on question/answer classification show that the above models highly improve on bag-of-words on a TREC dataset.

• Type: Conference
• Year: 2008
• Where: ACL
• Authors: Alessandro Moschitti, Silvia Quarteroni
• Keywords: ACL 2008, Challenging Research Area, Computational Linguistics, Natural Language Processing, Support Vector Machines