Implementation Levenshtein Distance Algorithm to Searching Word

Petrastuti, Brigitta (2011) Implementation Levenshtein Distance Algorithm to Searching Word. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.

[img] Text (COVER)
06.02.0020 Brigitta Petrastuti COVER.pdf
Download (194kB)
[img] Text (BAB I)
06.02.0020 Brigitta Petrastuti BAB I.pdf
Restricted to Registered users only
Download (123kB)
[img] Text (BAB II available document only in library of Soegijapranata Catholic University)
06.02.0020 Brigitta Petrastuti BAB II.pdf
Restricted to Repository staff only
Download (211kB)
[img] Text (BAB III available document only in library of Soegijapranata Catholic University)
06.02.0020 Brigitta Petrastuti BAB III.pdf
Restricted to Repository staff only
Download (113kB)
[img] Text (BAB IV available document only in library of Soegijapranata Catholic University)
06.02.0020 Brigitta Petrastuti BAB IV.pdf
Restricted to Repository staff only
Download (250kB)
[img] Text (BAB V available document only in library of Soegijapranata Catholic University)
06.02.0020 Brigitta Petrastuti BAB V.pdf
Restricted to Repository staff only
Download (441kB)
[img] Text (BAB VI)
06.02.0020 Brigitta Petrastuti BAB VI.pdf
Restricted to Registered users only
Download (84kB)
[img] Text (DAFTAR PUSTAKA)
06.02.0020 Brigitta Petrastuti DAFTAR PUSTAKA.pdf
Download (101kB)

Abstract

Levenshtein distance is a measure of the similarity between two strings, which we will refer to as the source string (s) and the target string (t). The distance is the number of deletions, insertions, or substitutions required to transform s into t. The greater the Levenshtein distance, the more different the strings are. Levenshtein distance is named after the Russian scientist, Vladimir Levenshtein, who devised the algorithm in 1965. If you can't spell or pronounce Levenshtein, the metric is also sometimes called edit distance. The Levenshtein distance algorithm has been used in spell checking, speech recognition, DNA analysis, plagiarism detection .

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions: Faculty of Computer Science
Depositing User: Mr Ign. Setya Dwiana
Date Deposited: 16 Mar 2016 08:34
Last Modified: 16 Mar 2016 08:34
URI: http://repository.unika.ac.id/id/eprint/7948

Actions (login required)

View Item View Item
Unika Repository is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.