STEMMING BAHASA JAWA MENGGUNAKAN DAMERAU LEVENSHTEIN DISTANCE (DLD)

Autor:	Muhammad Nu’man Hakim, Aji Prasetya Wibawa
Rok vydání:	2021
Předmět:	Root (linguistics) Computer science business.industry Value (computer science) String searching algorithm computer.software_genre Prefix Damerau–Levenshtein distance Word repetition Artificial intelligence Suffix business computer Natural language processing Word (computer architecture)
Zdroj:	JURNAL TEKNIK INFORMATIKA. 14:22-27
ISSN:	2549-7901 1979-9160
DOI:	10.15408/jti.v14i1.15010
Popis:	Stemming is one of the essential stages of text mining. This process removes prefixes and suffixes to produce root words in a text. This study uses a string matching algorithm, namely Damerau Levenshtein Distance (DLD), to find the basic word forms of Javanese. Test data of 300 words that have a prefix, insertion, suffix, a combination of prefix and suffix, and word repetition. The results of this study indicate that the Damerau Levenshtein Distance (DLD) algorithm can be used for Stemming Javanese text with an accuracy value of 49.6%.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::0480f8adf4c3a3b03de22d3d37fb5713 https://doi.org/10.15408/jti.v14i1.15010 Zobrazit plný text záznamu