Till sidans topp

Sidansvarig: Webbredaktion
Sidan uppdaterades: 2012-09-11 15:12

Tipsa en vän
Utskriftsversion

Automatic Acronym Recogni… - Göteborgs universitet Till startsida
Webbkarta
Till innehåll Läs mer om hur kakor används på gu.se

Automatic Acronym Recognition

Paper i proceeding
Författare Dana Dannélls
Publicerad i Proceedings of the 11th conference on European chapter of the Association for Computational Linguistics (EACL)
ISBN 1-932432-59-0
Publiceringsår 2006
Publicerad vid Institutionen för svenska språket
Språk en
Länkar www.cling.gu.se/~cl2ddoyt/pub/autom...
Ämneskategorier Språkteknologi (språkvetenskaplig databehandling)

Sammanfattning

This paper deals with the problem of recognizing and extracting acronym- definition pairs in Swedish medical texts. This project applies a rule-based method to solve the acronym recognition task and compares and evaluates the results of different machine learning algorithms on the same task. The method proposed is based on the approach that acronym-definition pairs follow a set of patterns and other regularities that can be usefully applied for the acronym identification task. Supervised machine learning was applied to monitor the performance of the rule-based method, using Memory Based Learning (MBL). The rule-based algorithm was evaluated on a hand tagged acronym corpus and performance was measured using standard measures recall, precision and f-score. The results show that performance could further improve by increasing the training set and modifying the input settings for the machine learning algorithms. An analysis of the errors produced indicates that further improvement of the rule-based method requires the use of syntactic information and textual pre-processing.

Sidansvarig: Webbredaktion|Sidan uppdaterades: 2012-09-11
Dela:

På Göteborgs universitet använder vi kakor (cookies) för att webbplatsen ska fungera på ett bra sätt för dig. Genom att surfa vidare godkänner du att vi använder kakor.  Vad är kakor?