Mostra el registre d'ítem simple

dc.contributor.authorPoveda Poveda, Jordi
dc.contributor.authorSurdeanu, Mihai
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.date.accessioned2016-04-26T08:23:56Z
dc.date.available2016-04-26T08:23:56Z
dc.date.issued2006-11
dc.identifier.citationPoveda, J., Surdeanu, M. "SVMs for the temporal expression chunking problem". 2006.
dc.identifier.urihttp://hdl.handle.net/2117/86172
dc.description.abstractThis technical report provides a description of the Temporal Expression Chunking problem, which consists in finding the mentions of temporal expressions in free text documents, and reports on the results obtained using SVM classifiers to tackle this task. We first define the task in detail, then present a brief survey of relevant literature, state our approach and finally present the results of several experiments. These include a comparison of the correct recognition rate achieved using different polynomial kernel degrees, sets of features, and sizes of the context window. We use 5-fold cross-validation on the ACE 2005 corpus for training and for testing.
dc.format.extent14 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-06-37-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Intel·ligència artificial
dc.subject.otherSVM
dc.subject.otherInformation extraction
dc.subject.otherNLP
dc.subject.otherIE
dc.subject.otherTemporal expressions
dc.subject.otherMachine learning
dc.titleSVMs for the temporal expression chunking problem
dc.typeExternal research report
dc.contributor.groupUniversitat Politècnica de Catalunya. GPLN - Grup de Processament del Llenguatge Natural
dc.rights.accessOpen Access
local.identifier.drac1910740
dc.description.versionPostprint (published version)
local.citation.authorPoveda, J.; Surdeanu, M.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple