Results 1 to 10 of about 3,338 (175)
Adapting Off-the-Shelf Speech Recognition Systems for Novel Words
Information, 2023 Current speech recognition systems with fixed vocabularies have difficulties recognizing Out-of-Vocabulary words (OOVs) such as proper nouns and new words. This leads to misunderstandings or even failures in dialog systems.
Wiam Fadel +3 more
doaj +1 more source
A New String Edit Distance and Applications
Algorithms, 2022 String edit distances have been used for decades in applications ranging from spelling correction and web search suggestions to DNA analysis. Most string edit distances are variations of the Levenshtein distance and consider only single-character edits ...
Taylor Petty +3 more
doaj +1 more source
Surprises in approximating Levenshtein distances [PDF]
Journal of Theoretical Biology, 2006 The Levenshtein distance is an important tool for the comparison of symbolic sequences, with many appearances in genome research, linguistics and other areas. For efficient applications, an approximation by a distance of smaller computational complexity is highly desirable.
Baake, Michael +2 more
openaire +3 more sources
A Levenshtein distance-based method for word segmentation in corpus augmentation of geoscience texts
Annals of GIS, 2023 For geoscience text, rich domain corpora have become the basis of improving the model performance in word segmentation. However, the lack of domain-specific corpus with annotation labelled has become a major obstacle to professional information mining in
Jinqu Zhang +6 more
doaj +1 more source
Scientific reference style using rule-based machine learning
IJAIN (International Journal of Advances in Intelligent Informatics), 2023 Regular Expressions (RegEx) can be employed as a technique for supervised learning to define and search for specific patterns inside text. This work devised a method that utilizes regular expressions to convert the reference style of academic papers into
Afrida Helen +2 more
doaj +1 more source
Learning to Ask Conversational Questions by Optimizing Levenshtein Distance [PDF]
Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), 2021 13 pages, 4 figures, Published in ACL ...
Zhongkun Liu +5 more
openaire +4 more sources
Similarity Hashing Based on Levenshtein Distances [PDF]
, 2014 It is increasingly common in forensic investigations to use automated pre-processing techniques to reduce the massive volumes of data that are encountered. This is typically accomplished by comparing fingerprints (typically cryptographic hashes) of files against existing databases.
Frank Breitinger +3 more
openaire +2 more sources
An Algorithmic Bridge Between Hamming and Levenshtein Distances
CoRR, 2022 The full version of a paper accepted to ITCS 2023; abstract shortened to meet arXiv ...
Goldenberg, Elazar +3 more
openaire +5 more sources
Distance Measure for Controlled Random Tests
Доклады Белорусского государственного университета информатики и радиоэлектроники, 2022 The problem of constructing characteristics of the difference between test sequences is investigated. Its relevance for generating controlled random tests and the complexity of finding difference measures for symbolic tests are substantiated.
V. N. Yarmolik +2 more
doaj +1 more source
Damerau Levenshtein Distance for Indonesian Spelling Correction
Jurnal Informatika, 2019 Word correction used to find an incorrect word in writing. Levenshtein distance is one of algorithm to correcting typing error. It is an algorithm that calculates a difference between two strings.
Puji Santoso +3 more
doaj +1 more source