{"package":"r-ahocorasicktrie","ecosystem":"conda","exists":true,"latest_version":"0.1.3","repository":"","license":"Apache-2.0","description":"Aho-Corasick is an optimal algorithm for finding many keywords in a text. It can locate all matches in a text in O(N+M) time; i.e., the time needed scales linearly with the number of keywords (N) and the size of the text (M). Compare this to the naive approach which takes O(N*M) time to loop through each pattern and scan for it in the text. This implementation builds the trie (the generic name of the data structure) and runs the search in a single function call. If you want to search multiple te","downloads_weekly":476,"deprecated":false,"health":{"score":52},"_cache":"db_only_bot","_partial":true,"_response_ms":1,"_powered_by":"depscope.dev — bot fast path (DB-only)","recommendation":{"action":"review"}}