APPLYING A Q-GRAM BASED MULTIPLE STRING MATCHING ALGORITHM FOR APPROXIMATE MATCHING
We consider the application of multiple pattern matching (Multi AOSO on q-Grams) algorithm for approximate pattern matching. We propose the on-line approach which translates the problem from approximate pattern matching into a multiple pattern one (called partitioning into exact search). Presented s...
Main Author: | Robert Susik |
---|---|
Format: | Article |
Language: | English |
Published: |
Lublin University of Technology
2017-09-01
|
Series: | Informatyka, Automatyka, Pomiary w Gospodarce i Ochronie Środowiska |
Subjects: | |
Online Access: | https://ph.pollub.pl/index.php/iapgos/article/view/1366 |
Similar Items
-
Intuitionistic Fuzzy Automaton for Approximate String Matching
by: K.M. Ravi, et al.
Published: (2014-03-01) -
Similarity Identification Based on Word Trigrams Using Exact String Matching Algorithms
by: Abdul Fadlil, et al.
Published: (2022-08-01) -
Aplikasi Penentuan Jenis Part Of Speech Menggunakan Metode N-Gram dan String Matching
by: Nurzaenab Nurzaenab, et al.
Published: (2016-08-01) -
Weighted approximate parameterized string matching
by: Shibsankar Das, et al.
Published: (2017-04-01) -
Efficient and effectiveness retrieval of information using some of the approximate string matching algorithms
by: Anhar Mohammed, et al.
Published: (2008-09-01)