SOTAVerified

Chunking

Chunking, also known as shallow parsing, identifies continuous spans of tokens that form syntactic units such as noun phrases or verb phrases.

Example:

| Vinken | , | 61 | years | old | | --- | ---| --- | --- | --- | | B-NLP| I-NP | I-NP | I-NP | I-NP |

Papers

Showing 176–200 of 447 papers

TitleStatusHype
Learning Structure from the Ground up---Hierarchical Representation Learning by Chunking—0
Paradigm Shift in Natural Language ProcessingCode1
Evaluating Relaxations of Logic for Neural Networks: A Comprehensive StudyCode0
Large-scale image segmentation based on distributed clustering algorithmsCode0
Neural Supervised Domain Adaptation by Augmenting Pre-trained Models with Random Units—0
Weighted Training for Cross-Task LearningCode0
Improving Named Entity Recognition by External Context Retrieving and Cooperative LearningCode1
Chunking Historical GermanCode0
Neural Sequence Segmentation as Determining the Leftmost SegmentsCode0
On the Hidden Negative Transfer in Sequential Transfer Learning for Domain Adaptation from News to Tweets—0
Locally-Contextual Nonlinear CRFs for Sequence Labeling—0
Evaluation of Morphological Embeddings for the Russian Language—0
Introducing the Hidden Neural Markov Chain framework—0
Highly Fast Text Segmentation With Pairwise Markov Chains—0
Unsupervised Technical Domain Terms Extraction using Term ExtractorCode1
Segmenting Natural Language Sentences via Lexical Unit Analysis—0
A Survey on Recent Advances in Sequence Labeling from Deep Learning Models—0
Enhance Robustness of Sequence Labelling with Masked Adversarial Training—0
Does Chinese BERT Encode Word Structure?Code0
Automated Concatenation of Embeddings for Structured PredictionCode1
Dissecting Span Identification Tasks with Performance Prediction—0
More Embeddings, Better Sequence Labelers?—0
AIN: Fast and Accurate Sequence Labeling with Approximate Inference NetworkCode1
Transparency and granularity in the SP Theory of Intelligence and its realisation in the SP Computer Model—0
To compress or not to compress? A Finite-State approach to Nen verbal morphology—0
Show:102550
← PrevPage 8 of 18Next →

Benchmark Results

#ModelMetricClaimedVerifiedStatus
1ACEExact Span F197.3—Unverified
2BERT-CRF (Replicated in AdaSeq)Exact Span F197.18—Unverified
3ELMo + MAT + Multi-TaskExact Span F197.04—Unverified
4CVT+Multi-Task+LargeExact Span F196.98—Unverified
5ELMo + Multi-TaskExact Span F196.83—Unverified
6FlairExact Span F196.72—Unverified
7SeqVATExact Span F195.45—Unverified
8Adversarial TrainingExact Span F195.25—Unverified
9BiLSTM-CRFExact Span F195.18—Unverified
#ModelMetricClaimedVerifiedStatus
1ACEF1 score97.3—Unverified
2Flair embeddingsF1 score96.72—Unverified
3JMTF1 score95.77—Unverified
4Low supervisionF1 score95.57—Unverified
5IntNet + BiLSTM-CRFF1 score95.29—Unverified
6Suzuki and IsozakiF1 score95.15—Unverified
7NCRF++F1 score95.06—Unverified
8BI-LSTM-CRF (Senna) (ours)F1 score94.46—Unverified
#ModelMetricClaimedVerifiedStatus
1ACEF195—Unverified
2Wang et al., 2020F194.4—Unverified
3AINF194.04—Unverified
#ModelMetricClaimedVerifiedStatus
1Wang et al., 2020F192—Unverified
2AINF191.71—Unverified
#ModelMetricClaimedVerifiedStatus
1Def2VecAUC93.07—Unverified