Results 41 to 50 of about 18,471 (230)
Optical High-Speed Rolling Mark Detection Using Object Detection and Levenshtein Distance
Applied Sciences, 2023 This paper presents an automated high-speed rolling mark recognition system for railroad rails utilizing image processing techniques. Rolling marks, which consist of numbers, letters, and special characters, were engraved into the rail web as 3D ...
Manuel Krammer +3 more
doaj +1 more source
Jurnal Linguistik Komputasional, 2018 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
, 2006 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
Scientific Journal of Informatics, 2018 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]
PLoS ONE, 2012 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
Lexical evolution rates by automated stability measure
, 2009 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
Levenshtein Distances Fail to Identify Language Relationships Accurately [PDF]
Computational Linguistics, 2011 The Levenshtein distance is a simple distance metric derived from the number of edit operations needed to transform one string into another. This metric has received recent attention as a means of automatically classifying languages into genealogical subgroups.
openaire +3 more sources
International Journal of Population Data Science, 2017 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
Autocorrect pada Modul Pencarian Drugs e-Dictionary Menggunakan Algoritma Levenshtein Distance
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 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
A Convolutional Neural Network for Search Term Detection
, 2017 Pathfinding in hospitals is challenging for patients, visitors, and even employees. Many people have experienced getting lost due to lack of clear guidance, large footprint of hospitals, and confusing array of hospital wings.
Aarabi, Parham +6 more
core +1 more source