UNIVERSITAS BINA DARMA, UNIVERSITAS BINA DARMA (2022) NAZIEF AND ADRIANI’S STEMMING ALGORITHM IMPLEMENTATION ON INDONESIAN SCIENTIFIC WRITING ERROR IDENTIFICATION AND CORRECTION SOFTWARE. NAZIEF AND ADRIANI’S STEMMING ALGORITHM IMPLEMENTATION ON INDONESIAN SCIENTIFIC WRITING ERROR IDENTIFICATION AND CORRECTION SOFTWARE.
![[img]](http://eprints.binadarma.ac.id/style/images/fileicons/text.png) |
Text
sunda-Translated.docx Download (1MB) |
Abstract
Scientific writings in Indonesian language must follow the rules of the Perpected Spelling System (PSS) of Indonesian language especially in terms of writing derivative or affixed words as these kinds of words might contain prefixes, infixes, and suffixes. Therefore, there is a need of a software for identifying and correcting errors in accordance with the Perpected Spelling System of Indonesian language to help the writers when writing scientific papers. In the process of identifying and correcting derivative or affixed words, the first thing to do is identifying the errors of the root words. The root words found will then be verified with a corpus of basic root words. If the root words are in accordance with the corpus, the next step is to check whether or not the writing or affixed words matches the PSS. If the writing of the affixed words does not match the PSS, the software will mark the errors and suggest corrections. The algorithm used for finding root words in affixed words is Nazief and Adriani’s stemming algorithm.
| Item Type: | Article |
|---|---|
| Subjects: | T Technology > T Technology (General) |
| Divisions: | Faculty of Law, Arts and Social Sciences > School of Education |
| Depositing User: | Mr Edi Surya Negara |
| Date Deposited: | 19 Jun 2022 12:45 |
| Last Modified: | 19 Jun 2022 12:45 |
| URI: | http://eprints.binadarma.ac.id/id/eprint/12839 |
Actions (login required)
 |
View Item |
