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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of physics. Conference series Ročník 1854; číslo 1; s. 12042
Hlavní autoři: Pandey, R K, Taruna, S
Médium: Journal Article
Jazyk:angličtina
Vydáno: Bristol IOP Publishing 01.04.2021
Témata:
Algorithms
Bioinformatics
Data mining
Fraud
Natural language processing
Pattern recognition
Physics
Recommender systems
Searching
String matching
ISSN:1742-6588, 1742-6596
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 prevalent algorithms of exact matching category in terms of their functionality and complexity along with critical opinions for a better understanding of the differences among them. The application of string matching is used in various fields like for intrusion detection in the networks, DNA matching in the field of bioinformatics, plagiarism checking for fraud detection, in the field of information security, pattern recognition, text mining, web searching, recommendation system, the document comprising, authentication system and web scraping. The uses are not only restricted to the fields termed above but also the notion has copious advantages for ongoing and forthcoming research work.
Bibliografie:ObjectType-Conference Proceeding-1
SourceType-Scholarly Journals-1
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1854/1/012042