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
-
ON THE CREATION OF THE AUTOMATION SYSTEM RELATED TO SOCIAL-ECONOMIC MOVEMENTS OF PEOPLE
by: L. V. Rudikova, et al.
Published: (2018-08-01) -
A Novel Gravity Optimization Algorithm for Extractive Arabic Text Summarization
by: Mustafa J. Hadi, et al.
Published: (2024-02-01) -
Dependency-Aware Entity–Attribute Relationship Learning for Text-Based Person Search
by: Wei Xia, et al.
Published: (2025-07-01) -
Word-embedding Based Text Vectorization Using Clustering
by: Vitaly I. Yuferev, et al.
Published: (2021-10-01) -
Nature of physicians' mistakes
by: F. F. Tetenev
Published: (2006-03-01)