A SEARCHING ALGORITHM FOR TEXT WITH MISTAKES
The paper contains a new text searching method representing modification of the Boyer-Moore algorithm and enabling a user to find the places in the text where the given substring occurs maybe with possible errors, that is the string in text and a query may not coincide but nevertheless are identical...
Saved in:
| Main Authors: | S. Nasr, O. V. German |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2020-03-01
|
| Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Subjects: | |
| Online Access: | https://doklady.bsuir.by/jour/article/view/2589 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Boyer-Moore String Matching Algorithm and SHA512 Implementation for Jpeg/exif File Fingerprint Compilation in DSA
by: Rachmad Fitriyanto, et al.
Published: (2020-06-01) -
Redefining text-to-SQL metrics by incorporating semantic and structural similarity
by: Giovanni Pinna, et al.
Published: (2025-07-01) -
ON THE CREATION OF THE AUTOMATION SYSTEM RELATED TO SOCIAL-ECONOMIC MOVEMENTS OF PEOPLE
by: L. V. Rudikova, et al.
Published: (2018-08-01) -
Text Alignment in the Service of Text Reuse Detection
by: Hadar Miller, et al.
Published: (2025-03-01) -
Cascaded Dual-Inpainting Network for Scene Text
by: Chunmei Liu
Published: (2025-07-01)