UCSY's Research Repository

Identifying Abbreviation and Its Definition From Text String By Using LCS Algorithm

Show simple item record

dc.contributor.author Han, Khin Myo
dc.contributor.author Thein, Tin Tin
dc.date.accessioned 2019-07-31T11:29:47Z
dc.date.available 2019-07-31T11:29:47Z
dc.date.issued 2009-12-30
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1504
dc.description.abstract The understanding of abbreviations, widely used in writing is an important role for natural language processing (NLP) applications. Many abbreviations are followed a predictable pattern in which the first letter of each word in the definition corresponds to one letter in the abbreviation. Abbreviations detection is an important task of the dictionary building with their definitions. In this system, abbreviation and their definitions are implemented by using Longest Common Subsequence (LCS) algorithm. Additionally, this system is provided a method, pattern based rule together with the LCS algorithm. Thus, the simplicity of how abbreviations are formed from their definition is also described in this system. As a result, the extracted abbreviations are created into a large update database, a dictionary about computer literature. This system is implemented by C# programming language. en_US
dc.language.iso en en_US
dc.publisher Fourth Local Conference on Parallel and Soft Computing en_US
dc.title Identifying Abbreviation and Its Definition From Text String By Using LCS Algorithm en_US
dc.type Article en_US


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository



Browse

My Account

Statistics