2021
DOI: 10.15408/jti.v14i1.15010
|View full text |Cite
|
Sign up to set email alerts
|

Stemming Bahasa Jawa Menggunakan Damerau Levenshtein Distance (Dld)

Abstract: 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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 10 publications
(12 reference statements)
0
1
0
Order By: Relevance
“…The results of the document-stemming process will become a dataset that will be calculated using TF-IDF [42], [43]. TF-IDF is used to analyze how important a word is in a document.…”
Section: Calculating the Weight With The Tf-idf Methodsmentioning
confidence: 99%
“…The results of the document-stemming process will become a dataset that will be calculated using TF-IDF [42], [43]. TF-IDF is used to analyze how important a word is in a document.…”
Section: Calculating the Weight With The Tf-idf Methodsmentioning
confidence: 99%