Pith. sign in

REVIEW

Optimizing for Measure of Performance in Max-Margin Parsing

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 1709.01562 v2 pith:QXSC73YM submitted 2017-09-05 cs.CL

classification cs.CL
keywords parsinglearningmax-marginoptimizationperformancesequenceabilityaccuracy
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many statistical learning problems in the area of natural language processing including sequence tagging, sequence segmentation and syntactic parsing has been successfully approached by means of structured prediction methods. An appealing property of the corresponding discriminative learning algorithms is their ability to integrate the loss function of interest directly into the optimization process, which potentially can increase the resulting performance accuracy. Here, we demonstrate on the example of constituency parsing how to optimize for F1-score in the max-margin framework of structural SVM. In particular, the optimization is with respect to the original (not binarized) trees.

Discussion (0). Sign in to comment.

Pith tools