arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1709.01562cs.CL

Optimizing for Measure of Performance in Max-Margin Parsing

Berlin Big Data Center(柏林大数据中心);Technische Universität Berlin(柏林工业大学);Max Planck Institute for Informatics(马克斯·普朗克信息学研究所);Korea University(高丽大学)

Alexander Bauer, Shinichi Nakajima, Nico Görnitz, Klaus-Robert Müller

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑