Optimizing for Measure of Performance in Max-Margin Parsing
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
To be Continuous, or to be Discrete, Those are Bits of Questions
Bottom-Up Constituency Parsing and Nested Named Entity Recognition with Pointer Networks
Automatic Extraction of Clausal Embedding Based on Large-Scale English Text Data
Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning
Meaning Typed Prompting: A Technique for Efficient, Reliable Structured Output Generation
Conformal Structured Prediction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.