Results 51 to 60 of about 2,255,682 (232)
This research is to implement and analyze the search of Al-Quran verse from phonetic similarity using Soundex and Damerau Levenshtein Distance algorithm.
Puruhita Ananda Arsaningtyas +2 more
doaj +1 more source
Linear programming bounds for codes in Grassmannian spaces
We introduce a linear programming method to obtain bounds on the cardinality of codes in Grassmannian spaces for the chordal distance. We obtain explicit bounds, and an asymptotic bound that improves on the Hamming bound.
Bachoc, Christine
core +4 more sources
Dengan bertambahnya skripsi dari tahun ke tahun, meningkat pula judul skripsi dan penelitian. Bila tidak dideteksi, menyebabkan penelitian yang sebenarnya sudah ada akhirnya diteliti kembali tanpa mengembangkan penelitian sebelumnya.
Bei Harira Irawan +2 more
semanticscholar +1 more source
Nowadays internet technology provide more convenience for searching information on a daily. Users are allowed to find and publish their resources on the internet using search engine.
Muhamad Maulana Yulianto +2 more
doaj +1 more source
An efficient rank based approach for closest string and closest substring. [PDF]
This paper aims to present a new genetic approach that uses rank distance for solving two known NP-hard problems, and to compare rank distance with other distance measures for strings.
Liviu P Dinu, Radu Ionescu
doaj +1 more source
OCR HURUF JAWA DENGAN FITUR KODE RANTAI DAN LEVENSHTEIN DISTANCE
Aplikasi sederhana untuk pengenalan aksara jawa diperlukan pada saat massive nya penggunaan aksara nasional. Aplikasi diperlukan untuk mengenali dan membaca karakter-karakter dari aksara jawa pada pesan-pesan yang diterima.
Teady Matius Surya Mulyana +2 more
semanticscholar +1 more source
Objectives To assess the match quality of a linkage strategy based on the combined use of a statistical linkage key and the Levenshtein distance to link birth to death records in Brazil.
Luis Carlos Guillen +4 more
doaj +1 more source
Lexical evolution rates by automated stability measure
Phylogenetic trees can be reconstructed from the matrix which contains the distances between all pairs of languages in a family. Recently, we proposed a new method which uses normalized Levenshtein distances among words with same meaning and averages on ...
Bakker D +13 more
core +1 more source
Serial Computations of Levenshtein Distances [PDF]
In the previous chapters, we discussed problems involving an exact match of string patterns. We now turn to problems involving similar but not necessarily exact pattern matches. There are a number of similarity or distance measures, and many of them are special cases or generalizations of the Levenshtein metric. The problem of evaluating the measure of
openaire +1 more source
Autocorrect pada Modul Pencarian Drugs e-Dictionary Menggunakan Algoritma Levenshtein Distance
The Dictionary of Medicine in the form of a physical book has many drawbacks, one of them is its thickness makes it impractical to be carried. This becomes a motivation to develop drug dictionary applications in the form of a Drugs e-Dictionary.
Halimah Tus Sadiah +2 more
doaj +1 more source

