Kernel methods, syntax and semantics for relational text categorization

Research output: Chapter in Book/Report/Conference proceedingConference contribution

67 Citations (Scopus)

Abstract

Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categorization. The main reason is the high reliability and effectiveness of language models, which are sufficient to accurately solve such retrieval tasks. However, when the latter involve the computation of relational semantics between text fragments simple statistical models may result ineffective. In this paper, we show that syntactic and semantic structures can be used to greatly improve complex categorization tasks such as determining if an answer correctly responds to a question. Given the high complexity of representing semantic/syntactic structures in learning algorithms, we applied kernel methods along with Support Vector Machines to better exploit the needed relational information. Our experiments on answer classification on Web and TREC data show that our models greatly improve on bagof-words.

Original languageEnglish
Title of host publicationInternational Conference on Information and Knowledge Management, Proceedings
Pages253-262
Number of pages10
DOIs
Publication statusPublished - 1 Dec 2008
Externally publishedYes
Event17th ACM Conference on Information and Knowledge Management, CIKM'08 - Napa Valley, CA, United States
Duration: 26 Oct 200830 Oct 2008

Other

Other17th ACM Conference on Information and Knowledge Management, CIKM'08
CountryUnited States
CityNapa Valley, CA
Period26/10/0830/10/08

Fingerprint

Text categorization
Kernel methods
Natural language processing
Support vector machine
Statistical model
Information retrieval
Experiment
World Wide Web
Learning algorithm
Language model

Keywords

  • Kernel methods
  • Natural language processing
  • Question answering
  • Support vector machines
  • Text categorization

ASJC Scopus subject areas

  • Business, Management and Accounting(all)
  • Decision Sciences(all)

Cite this

Moschitti, A. (2008). Kernel methods, syntax and semantics for relational text categorization. In International Conference on Information and Knowledge Management, Proceedings (pp. 253-262) https://doi.org/10.1145/1458082.1458118

Kernel methods, syntax and semantics for relational text categorization. / Moschitti, Alessandro.

International Conference on Information and Knowledge Management, Proceedings. 2008. p. 253-262.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Moschitti, A 2008, Kernel methods, syntax and semantics for relational text categorization. in International Conference on Information and Knowledge Management, Proceedings. pp. 253-262, 17th ACM Conference on Information and Knowledge Management, CIKM'08, Napa Valley, CA, United States, 26/10/08. https://doi.org/10.1145/1458082.1458118
Moschitti A. Kernel methods, syntax and semantics for relational text categorization. In International Conference on Information and Knowledge Management, Proceedings. 2008. p. 253-262 https://doi.org/10.1145/1458082.1458118
Moschitti, Alessandro. / Kernel methods, syntax and semantics for relational text categorization. International Conference on Information and Knowledge Management, Proceedings. 2008. pp. 253-262
@inproceedings{3333f12aa30142f3aef108673c39dd61,
title = "Kernel methods, syntax and semantics for relational text categorization",
abstract = "Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categorization. The main reason is the high reliability and effectiveness of language models, which are sufficient to accurately solve such retrieval tasks. However, when the latter involve the computation of relational semantics between text fragments simple statistical models may result ineffective. In this paper, we show that syntactic and semantic structures can be used to greatly improve complex categorization tasks such as determining if an answer correctly responds to a question. Given the high complexity of representing semantic/syntactic structures in learning algorithms, we applied kernel methods along with Support Vector Machines to better exploit the needed relational information. Our experiments on answer classification on Web and TREC data show that our models greatly improve on bagof-words.",
keywords = "Kernel methods, Natural language processing, Question answering, Support vector machines, Text categorization",
author = "Alessandro Moschitti",
year = "2008",
month = "12",
day = "1",
doi = "10.1145/1458082.1458118",
language = "English",
isbn = "9781595939913",
pages = "253--262",
booktitle = "International Conference on Information and Knowledge Management, Proceedings",

}

TY - GEN

T1 - Kernel methods, syntax and semantics for relational text categorization

AU - Moschitti, Alessandro

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categorization. The main reason is the high reliability and effectiveness of language models, which are sufficient to accurately solve such retrieval tasks. However, when the latter involve the computation of relational semantics between text fragments simple statistical models may result ineffective. In this paper, we show that syntactic and semantic structures can be used to greatly improve complex categorization tasks such as determining if an answer correctly responds to a question. Given the high complexity of representing semantic/syntactic structures in learning algorithms, we applied kernel methods along with Support Vector Machines to better exploit the needed relational information. Our experiments on answer classification on Web and TREC data show that our models greatly improve on bagof-words.

AB - Previous work on Natural Language Processing for Information Retrieval has shown the inadequateness of semantic and syntactic structures for both document retrieval and categorization. The main reason is the high reliability and effectiveness of language models, which are sufficient to accurately solve such retrieval tasks. However, when the latter involve the computation of relational semantics between text fragments simple statistical models may result ineffective. In this paper, we show that syntactic and semantic structures can be used to greatly improve complex categorization tasks such as determining if an answer correctly responds to a question. Given the high complexity of representing semantic/syntactic structures in learning algorithms, we applied kernel methods along with Support Vector Machines to better exploit the needed relational information. Our experiments on answer classification on Web and TREC data show that our models greatly improve on bagof-words.

KW - Kernel methods

KW - Natural language processing

KW - Question answering

KW - Support vector machines

KW - Text categorization

UR - http://www.scopus.com/inward/record.url?scp=70349257998&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349257998&partnerID=8YFLogxK

U2 - 10.1145/1458082.1458118

DO - 10.1145/1458082.1458118

M3 - Conference contribution

SN - 9781595939913

SP - 253

EP - 262

BT - International Conference on Information and Knowledge Management, Proceedings

ER -