2020
DOI: 10.5120/ijca2020920091
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of Document Management System using Levenshtein Distance Algorithm

Abstract: The document archiving in PT SIU is still manually so it takes a long time in the process of storing and searching an archive document. Document Management System is a process or activity that starts from the making, receiving, collecting, organizing, controlling, maintaining, maintaining and storing which can be used as a solution in order to solve the problems that occur. With this research, previously manual storage and search became computerized so that the process of storing and searching for information … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 5 publications
0
1
0
Order By: Relevance
“…Levenshtein distance, also known as edit distance, is used to calculate the minimum number of operations (with the number of operations also known as edit distance) required to convert the raw string (str1) to the target string (str2). The operations include inserting, deleting, and replacing [5][6][7][8][9] .…”
Section: Basic Theory 21 Levenshtein Distancementioning
confidence: 99%
“…Levenshtein distance, also known as edit distance, is used to calculate the minimum number of operations (with the number of operations also known as edit distance) required to convert the raw string (str1) to the target string (str2). The operations include inserting, deleting, and replacing [5][6][7][8][9] .…”
Section: Basic Theory 21 Levenshtein Distancementioning
confidence: 99%