Pith. sign in

REVIEW 1 cited by

A Practical Chinese Dependency Parser Based on A Large-scale Dataset

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2009.00901 v2 pith:4H5T6TDI submitted 2020-09-02 cs.CL cs.AI

classification cs.CLcs.AI
keywords dependencychineseparserddparserbaidudatasetlabeledtest
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Dependency parsing is a longstanding natural language processing task, with its outputs crucial to various downstream tasks. Recently, neural network based (NN-based) dependency parsing has achieved significant progress and obtained the state-of-the-art results. As we all know, NN-based approaches require massive amounts of labeled training data, which is very expensive because it requires human annotation by experts. Thus few industrial-oriented dependency parser tools are publicly available. In this report, we present Baidu Dependency Parser (DDParser), a new Chinese dependency parser trained on a large-scale manually labeled dataset called Baidu Chinese Treebank (DuCTB). DuCTB consists of about one million annotated sentences from multiple sources including search logs, Chinese newswire, various forum discourses, and conversation programs. DDParser is extended on the graph-based biaffine parser to accommodate to the characteristics of Chinese dataset. We conduct experiments on two test sets: the standard test set with the same distribution as the training set and the random test set sampled from other sources, and the labeled attachment scores (LAS) of them are 92.9% and 86.9% respectively. DDParser achieves the state-of-the-art results, and is released at https://github.com/baidu/DDParser.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Contrastive Multi-graph Learning with Neighbor Hierarchical Sifting for Semi-supervised Text Classification

    cs.CL 2024-11 conditional novelty 4.0 of 10

    ConNHS, a multi-graph contrastive learning method with neighbor hierarchical sifting, reports accuracy 95.86%, 97.52%, 87.43%, and 70.65% on ThuCNews, SogouNews, 20NG, and Ohsumed.

Pith tools