Please use this identifier to cite or link to this item: http://localhost:8080/xmlui/handle/123456789/3130
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNautial, Ankit-
dc.contributor.authorSristy, Nagesh Bhattu-
dc.contributor.authorSomayajulu, D. V. L. N.-
dc.date.accessioned2025-02-05T10:48:53Z-
dc.date.available2025-02-05T10:48:53Z-
dc.date.issued2014-
dc.identifier.citation10.1145/2675744.2675762en_US
dc.identifier.urihttp://localhost:8080/xmlui/handle/123456789/3130-
dc.descriptionNITWen_US
dc.description.abstractAcronyms are heavily used Out of Vocabulary terms in sms, search-queries, social media postings. The performance of text mining algorithms such as Part of Speech Tagging(POS), Named Entity Recognition, Chunking often suffer when they are applied over the noisy text. Text normalization systems are developed to normalize the noisy text. Acronym mapping and expansion has become an important component of the text normalization process. Since manually collecting acronyms and their corresponding expansions from the documents is difficult, automatically building such a dictionary using supervised learning is the need of the hour. In this work, we focus on the acronym search problem: Given acronyms as queries, finding their corresponding expansions in a document. Recent works formulate the given problem as a tokenlevel sequence labelling task and employ Hidden Markov Model, or Conditional Random Fields, to tackle the problem. However, these models do not utilize the segment level information inherent in the expansion. Hence we propose a Semi-Markov Conditional Random Field based approach for the given problem, that gives us power to write more effective features that work on a group of neighbouring tokens together than the features working on individual tokens. We design and implement Semi-Markov Conditional Random Fields to identify the correct acronym expansions for data extracted from Wikipedia and compare the performance with the Conditional Random fields. The experimental results show that Semi-CRF based approach for the given task performs better than the CRF based approach.en_US
dc.language.isoenen_US
dc.publisher7th ACM India Computing Conference, COMPUTE 2014en_US
dc.subjectText Miningen_US
dc.subjectSequence Labellingen_US
dc.titleFinding acronym expansion using semi-Markov conditional random fieldsen_US
dc.typeOtheren_US
Appears in Collections:Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
2675744.2675762.pdf522.64 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.