Results 31 to 40 of about 3,338 (175)

Autocomplete and Spell Checking Levenshtein Distance Algorithm To Getting Text Suggest Error Data Searching In Library

open access: yesScientific 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]

open access: yesPLoS 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

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.

open access: yesInternational 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

open access: yesJurnal 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

Prediction of Sensor Ability Based on Chemical Formula: Possible Approaches and Pitfalls

open access: yesInorganics, 2023
This review presents an analysis of different algorithms for predicting the sensory ability of organic compounds towards metal ions based on their chemical formula.
Daniil N. Yarullin   +6 more
doaj   +1 more source

Levenshtein Distances Fail to Identify Language Relationships Accurately [PDF]

open access: yesComputational 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

Blurring the Boundaries: An Investigation of Eating Disorder Recovery Content on TikTok

open access: yesInternational Journal of Eating Disorders, EarlyView.
ABSTRACT Objective Eating disorder recovery content is widely circulated on TikTok. We thematically analyzed recovery content on TikTok, examined its associations with symptom severity among individuals with eating disorders, and assessed its co‐occurrence with pro‐eating disorder material within their TikTok feeds.
Scott Griffiths   +12 more
wiley   +1 more source

PENERAPAN ALGORITMA LEVENSHTEIN DISTANCE UNTUK PENCARIAN PADA SISTEM INFORMASI PERPUSTAKAAN FAKULTAS KEDOKTERAN UNIVERSITAS PALANGKA RAYA

open access: yesJurnal Saintekom, 2019
The library of Faculty of Medicine of University of Palangka Raya is one of the libraries that regulates its management conventionally, and has not utilized computer technology optimally.
Widiatry Widiatry   +3 more
doaj   +1 more source

Cyclic signals classification by codegrams characterizing the dynamics of cycles shape changing

open access: yesМіжнародний науково-технічний журнал "Проблеми керування та інформатики", 2022
Research in engineering, biology, economics and other areas is often associatedwith the analysis of observed processes that are repetitive in time. One of thepromising approaches to solving the problem of analyzing and interpreting suchsignals is based ...
Леонід Соломонович Файнзільберг
doaj   +1 more source

Serial Computations of Levenshtein Distances [PDF]

open access: yes, 1997
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

Home - About - Disclaimer - Privacy