Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review
String matching and searching problems are one of the classical hitches to the domain of computer engineering. There exist numerous variants of such algorithms, which can be categorized into dual classes; i.e. an approximate match and exact match algorithms. This paper engrossed on comparing prevale...
Saved in:
| Published in: | Journal of physics. Conference series Vol. 1854; no. 1; p. 12042 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Bristol
IOP Publishing
01.04.2021
|
| Subjects: | |
| ISSN: | 1742-6588, 1742-6596 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!