Results 31 to 40 of about 5,627 (286)
Dynamic programming for reduced NFAs for approximate string and sequence matching [PDF]
, 2002 summary:searching for all occurrences of a pattern (string or sequence) in some text, where the pattern can occur with some limited number of errors given by edit distance.
Holub, Jan
core +1 more source
An improved algorithm for approximate string matching
SIAM Journal on Computing, 1989 Given a text string, a pattern string, and an integer k, a new algorithm for finding all occurrences of the pattern string in the text string with at most k differences is presented. Both its theoretical and practical variants improve the known algorithms.
Galil, Zvi, Park, Kunsoo
openaire +3 more sources
Optical Character Recognition (OCR) enhancement using an approximate string matching technique
Engineering and Applied Science Research, 2018 Many researchershavefocusedon improving optical character recognition (OCR) efficiency by developing new techniques using image processing based methodologies.
Kraisak Kesorn +1 more
doaj +1 more source
A Technique for Discovering Similarities between Texts Based on Extracting Features from the Text [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2019 The discovery of the similarity between two texts is very important and useful in many applications. The similarity between texts is the core research area of dataset, data warehouse, and data mining.
Alaa Abdalqahar Jihad, Mortadha M. Hamad
doaj +1 more source
A Metric Index for Approximate String Matching
Theoretical Computer Science, 2002 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gonzalo Navarro 0001, Edgar Chávez
openaire +4 more sources
Applied System Innovation, 2019 Companies are relying more on artificial intelligence and machine learning in order to enhance and automate existing business processes. While the power of OCR (Optical Character Recognition) technologies can be harnessed for the digitization of image ...
Coenrad de Jager, Marinda Nel
doaj +1 more source
Linear time algorithms for finding and representing all the tandem repeats in a string
, 2004 Gusfield D, Stoye J. Linear time algorithms for finding and representing all the tandem repeats in a string. Journal of computer and system sciences. 2004;69(4):525-546.A tandem repeat (or square) is a string [alpha][alpha], where [alpha] is a non-empty ...
Stoye, Jens +2 more
core +1 more source
Applied Sciences, 2023 In the subject recognition (SR) task under Knowledge Base Question Answering (KBQA), a common method is by training and employing a general flat Named-Entity Recognition (NER) model.
Ziming Wang +5 more
doaj +1 more source
Algorithms for approximate string matching
Information and Control, 1985 This is a revised and expanded version of the author's paper in Lect. Notes Comput. Sci. 158, 487-495 (1983; Zbl 0532.68088).
openaire +2 more sources
FEBS Open Bio, EarlyView.The dFoCC pipeline starts with observed DED and resting‐state coordinates, which are then used to generate a library of triggered states. Correlation analysis of the calculated DED features of each candidate vs observed DED permits quantitative evaluation of candidate structural quality.
Meng Iao Fong +3 more
wiley +1 more source