Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review
| dc.contributor.author | Pandey, R K | |
| dc.contributor.author | Taruna, S | |
| dc.date.accessioned | 2021-10-22T10:52:29Z | |
| dc.date.available | 2021-10-22T10:52:29Z | |
| dc.date.issued | 2020 | |
| dc.description.abstract | The string matching is the key to several valuable algorithms used in a tangible situation. Many times string matching and searching algorithms are considered to be the vital base algorithms for high graded research works, and to get its privilege researchers changed it according to their needs | en_US |
| dc.identifier.citation | R K Pandey and S Taruna Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review | en_US |
| dc.identifier.uri | http://hdl.handle.net/123456789/5099 | |
| dc.language.iso | en | en_US |
| dc.publisher | Journal of Physics: Conference Series | en_US |
| dc.subject | String-Matching Algorithms | en_US |
| dc.title | Prevalent Exact String-Matching Algorithms in Natural Language Processing: A Review | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Pandey_2021_J._Phys.__Conf._Ser._1854_012042-pages-deleted.pdf
- Size:
- 229.44 KB
- Format:
- Adobe Portable Document Format
- Description:
License bundle
1 - 1 of 1
Loading...
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: