Danilo Croce
ABSTRACT
In recent years, natural language processing techniques have been used more and more in IR. Among other syntactic and semantic parsing are effective methods for the design of complex applications like for example question answering and sentiment analysis. Unfortunately, extracting feature representations suitable for machine learning algorithms from linguistic structures is typically difficult. In this paper, we describe one of the most advanced piece of technology for automatic engineering of syntactic and semantic patterns. This method merges together convolution dependency tree kernels with lexical similarities. It can efficiently and effectively measure the similarity between dependency structures, whose lexical nodes are in part or completely different. Its use in powerful algorithm such as Support Vector Machines (SVMs) allows for fast design of accurate automatic systems.
We report some experiments on question classification, which show an unprecedented result, e.g. 41% of error reduction of the former state-of-the-art, along with the analysis of the nice properties of the approach.
- M. Baroni, S. Bernardini, A. Ferraresi, and E. Zanchetta. The wacky wide web: a collection of very large linguistically processed web-crawled corpora. Language Resources and Evaluation, 43(3):209--226, 2009.Google Scholar
Cross Ref
- M. W. Bilotti, J. L. Elsas, J. Carbonell, and E. Nyberg. Rank learning for factoid question answering with linguistic and semantic constraints. In Proceedings of ACM CIKM, 2010. Google ScholarDigital Library
- S. Bloehdorn and A. Moschitti. Combined syntactic and semantic kernels for text classification. In Proceedings of ECIR 2007, Rome, Italy, 2007. Google ScholarDigital Library
- S. Bloehdorn and A. Moschitti. Structure and semantics for expressive text kernels. In Proceedings of CIKM, 2007. Google ScholarDigital Library
- E. Charniak. A maximum-entropy-inspired parser. In Proceedings of NAACL'00, 2000. Google ScholarDigital Library
- M. Collins and N. Duffy. New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron. In Proceedings of ACL'02, 2002. Google ScholarDigital Library
- D. Croce, A. Moschitti, and R. Basili. Structured lexical similarity via convolution kernels on dependency trees. In Proceedings of EMNLP, Edinburgh, Scotland, UK., 2011. Google ScholarDigital Library
- T. Joachims. Estimating the generalization performance of a SVM efficiently. In Proceedings of ICML'00, 2000. Google ScholarDigital Library
- R. Johansson and A. Moschitti. Reranking models in fine-grained opinion analysis. In Proceedings of Coling 2010, pages 519--527, Beijing, China, 2010. Google ScholarDigital Library
- R. Johansson and A. Moschitti. Syntactic and semantic structure for opinion expression detection. In Proceedings of CoNLL, pages 67--76, Uppsala, Sweden, 2010. Google ScholarDigital Library
- R. Johansson and A. Moschitti. Extracting opinion expressions and their polarities -- exploration of pipelines and joint models. In Proceedings of ACL-HLT, Portland, Oregon, USA, 2011. Google ScholarDigital Library
- R. Johansson and P. Nugues. Dependency-based syntactic--semantic analysis with PropBank and NomBank. In Proceedings of CoNLL, Manchester, United Kingdom, 2008. Google ScholarDigital Library
- X. Li and D. Roth. Learning question classifiers. In Proceedings of ACL'02, 2002. Google ScholarDigital Library
- A. Moschitti. Efficient convolution kernels for dependency and constituent syntactic trees. In Proceedings of ECML'06, pages 318--329, 2006. Google ScholarDigital Library
- A. Moschitti. Kernel methods, syntax and semantics for relational text categorization. In Proceeding of CIKM '08, NY, USA, 2008. Google ScholarDigital Library
- A. Moschitti, J. Chu-carroll, S. Patwardhan, J. Fan, and G. Riccardi. Using syntactic and semantic structural kernels for classifying definition questions in jeopardy! In Proceedings of EMNLP, Edinburgh, Scotland, UK., 2011. Google ScholarDigital Library
- A. Moschitti, S. Quarteroni, R. Basili, and S. Manandhar. Exploiting syntactic and shallow semantic kernels for question/answer classification. In Proceedings of ACL'07, 2007.Google Scholar
- D. Zhang and W. S. Lee. Question classification using support vector machines. In Proceedings of ACM SIGIR. ACM Press, 2003.Google ScholarDigital Library
Index Terms
- Semantic convolution kernels over dependency trees: smoothed partial tree kernel
Recommendations
AMRITA_CEN@FIRE-2014: Morpheme Extraction and Lemmatization for Tamil using Machine Learning
FIRE '14: Proceedings of the 6th Annual Meeting of the Forum for Information Retrieval EvaluationThis paper presents the method of Morpheme Extraction and lemmatization for Tamil language in Morpheme Extraction Task (MET) of FIRE-2014. Tamil is a morphologically rich and agglutinative language. Such a language needs deeper analysis at the word ...
Kernel-based learning to rank with syntactic and semantic structures
SIGIR '13: Proceedings of the 36th international ACM SIGIR conference on Research and development in information retrievalKernel Methods (KMs) are powerful machine learning techniques that can alleviate the data representation problem as they substitute scalar product between feature vectors with similarity functions (kernels) directly defined between data instances, e.g., ...
Semantic Compositionality in Tree Kernels
CIKM '14: Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge ManagementKernel-based learning has been largely applied to semantic textual inference tasks. In particular, Tree Kernels (TKs) are crucial in the modeling of syntactic similarity between linguistic instances in Question Answering or Information Extraction tasks. ...
Comments