English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

As one of the basic tasks in natural language processing (NLP), named entityrecognition (NER) is an important basic tool for downstream tasks of NLP, suchas information extraction, syntactic analysis, machine translation and so on.The internal operation logic of current name entity recognition model isblack-box to the user, so the user has no basis to determine which name entitymakes more sense. Therefore, a user-friendly explainable recognition processwould be very useful for many people. In this paper, we propose a novelinterpretable method, BTPK (Binary Talmudic Public Announcement Logic model),to help users understand the internal recognition logic of the name entityrecognition tasks based on Talmudic Public Announcement Logic. BTPK model canalso capture the semantic information in the input sentences, that is, thecontext dependency of the sentence. We observed the public announcement of BTPKpresents the inner decision logic of BRNNs, and the explanations obtained froma BTPK model show us how BRNNs essentially handle NER tasks.

BTPK-based interpretable method for NER tasks based on Talmudic Public Announcement Logic