Library Catalog
End Session My Library Card Preferences Databases New Titles Feedback
Browse Search Results List Previous Searches My e-Shelf Help
  Add to My e-Shelf  |  Booking  |  Locate  |  Save/Mail  |  Save on Server  | 
 |  ILL Request  

Full View of Record

Choose format: Standard Card catalog Citation Name tags MARC tags
Record Number   000093261
Record Format   Computer file
Main Entry   LinkSuhartono, Derwin.
Title   LinkLemmatization technique in bahasa : Indonesia language / Derwin Suharttono, David Christiandy, Rolando Kai
Sysno Computer File   000093261
Imprint   2014
Descr.   website
Contents   Contents: many researches and inventions have been made in the field of linguistics and technology. Even so, the integration between linguistics and technology is not always reliable to all language. Every language is unique in its linguistic nature and rules. In this paper, a lemmatization technique in Bahasa (Indonesian language) is presented. It has achieved good precision by using The Indonesian Dictionary and a set of rules to remove affixes. The lemmatization technique is developed based on the previous algorithm, Indonesian stemmer. Both Indonesian stemming and lemmatization method have the same characteristics but a little bit different in its implementation. The way to reach its own goal/purpose is defined as a core difference and therefore possible to modify. The result shows that the algorithm achieved roughly 98% precision on a collection consisting 57,261 valid words with 7,839 unique valid words gathered from, an Indonesian online news article
Corp.Sub.   LinkASEAN.
Subject - Lib.Cong.   LinkAlgorithms.
  LinkInformation technology.
  LinkE-Doc ASEAN.
Add.Entry   LinkChristiandy, David.
  LinkKai, Rolando.
Electronic Location    { http://lib-server/mm/edoc/indonesia/indonesia14.pdf } 

Choose format: Standard Card catalog Citation Name tags MARC tags
About this book at Google Book Search

End Session - Preferences - Feedback - Help - Ex Libris - Browse - Search - Results List - Previous Searches - Databases

ALEPH supports and , or, and not Boolean operators. and is assumed if no operator is present. Operators can be typed in English or expressed by using any of the following conventions:

AND = + (plus sign)
AND = & (ampersand)
OR = | (pipe sign)
NOT = ~ (tilde)

All searches can be further limited by collection, language, format and years. You can define these limits at the bottom of each Search screen.