Constituency Parsing as an Instance of the M-monoid Parsing Problem

被引:0
|
作者
Morbitz, Richard [1 ]
机构
[1] Tech Univ Dresden, Fac Comp Sci, D-01062 Dresden, Germany
关键词
D O I
10.4204/EPTCS.388.9
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We consider the constituent parsing problem which states: given a final state normalized constituent tree automaton (CTA) and a string, compute the set of all constituent trees that are inductively recognized by the CTA and yield the string. We show that this problem is an instance of the M-monoid parsing problem. Moreover, we show that we can employ the generic M-monoid parsing algorithm to solve the constituency parsing problem for a meaningful class of CTA.
引用
收藏
页码:79 / 94
页数:16
相关论文
共 50 条
  • [21] Constituency Parsing by Cross-Lingual Delexicalization
    Kaing, Hour
    Ding, Chenchen
    Utiyama, Masao
    Sumita, Eiichiro
    Sudoh, Katsuhito
    Nakamura, Satoshi
    [J]. IEEE ACCESS, 2021, 9 : 141571 - 141578
  • [22] Strongly Incremental Constituency Parsing with Graph Neural Networks
    Yang, Kaiyu
    Deng, Jia
    [J]. ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 33, NEURIPS 2020, 2020, 33
  • [23] Assessing the Use of Prosody in Constituency Parsing of Imperfect Transcripts
    Tran, Trang
    Ostendorf, Mari
    [J]. INTERSPEECH 2021, 2021, : 2626 - 2630
  • [24] Unsupervised Discourse Constituency Parsing Using Viterbi EM
    Nishida, Noriki
    Nakayama, Hideki
    [J]. TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2020, 8 (08) : 215 - 230
  • [25] An Empirical Study of Building a Strong Baseline for Constituency Parsing
    Suzuki, Jun
    Takase, Sho
    Kamigaito, Hidetaka
    Morishita, Makoto
    Nagata, Masaaki
    [J]. PROCEEDINGS OF THE 56TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 2, 2018, : 612 - 618
  • [26] Unlexicalized Transition-based Discontinuous Constituency Parsing
    Coavoux, Maximin
    Crabbe, Benoit
    Cohen, Shay B.
    [J]. TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2019, 7 : 73 - 89
  • [27] Policy Gradient as a Proxy for Dynamic Oracles in Constituency Parsing
    Fried, Daniel
    Klein, Dan
    [J]. PROCEEDINGS OF THE 56TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, VOL 2, 2018, : 469 - 476
  • [28] Straight to the Tree: Constituency Parsing with Neural Syntactic Distance
    Shen, Yikang
    Lin, Zhouhan
    Jacob, Athul Paul
    Sordoni, Alessandro
    Courville, Aaron
    Bengio, Yoshua
    [J]. PROCEEDINGS OF THE 56TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL), VOL 1, 2018, : 1171 - 1180
  • [29] MORPHOLOGY AS A PARSING PROBLEM
    ANDERSON, SR
    [J]. LINGUISTICS, 1988, 26 (04) : 521 - 544
  • [30] Instance-Based Neural Dependency Parsing
    Ouchi, Hiroki
    Suzuki, Jun
    Kobayashi, Sosuke
    Yokoi, Sho
    Kuribayashi, Tatsuki
    Yoshikawa, Masashi
    Inui, Kentaro
    [J]. TRANSACTIONS OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, 2021, 9 : 1493 - 1507