SuperSense tagging with a maximum entropy Markov model

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We tackled the task of SuperSense tagging by means of the Tanl Tagger, a generic, flexible and customizable sequence labeler, developed as part of the Tanl linguistic pipeline. The tagger can be configured to use different classifiers and to extract features according to feature templates expressed through patterns, so that it can be adapted to different tagging tasks, including PoS and Named Entity tagging. The tagger operates in a Markov chain, using a statistical classifier to infer state transitions and dynamic programming to select the best overall sequence of tags. We exploited the extensive customization capabilities of the tagger in order to tune it for the task of SuperSense tagging, by performing an extensive process of feature selection. The resulting configuration achieved the best scores in the closed subtask. © Springer-Verlag Berlin Heidelberg 2013.

Cite

CITATION STYLE

APA

Attardi, G., Baronti, L., Dei Rossi, S., & Simi, M. (2013). SuperSense tagging with a maximum entropy Markov model. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7689 LNAI, pp. 186–194). https://doi.org/10.1007/978-3-642-35828-9_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free