Abstract
We propose a new Maximum Subgraph algorithm for first-order parsing to 1-endpoint-crossing, pagenumber-2 graphs. Our algorithm has two characteristics: (1) it separates the construction for noncrossing edges and crossing edges; (2) in a single construction step, whether to create a new arc is deterministic. These two characteristics make our algorithm relatively easy to be extended to incorporiate crossing-sensitive second-order features. We then introduce a new algorithm for quasi-second-order parsing. Experiments demonstrate that second-order features are helpful for Maximum Subgraph parsing.- Anthology ID:
- D17-1003
- Volume:
- Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing
- Month:
- September
- Year:
- 2017
- Address:
- Copenhagen, Denmark
- Venue:
- EMNLP
- SIG:
- SIGDAT
- Publisher:
- Association for Computational Linguistics
- Note:
- Pages:
- 24–34
- Language:
- URL:
- https://aclanthology.org/D17-1003
- DOI:
- 10.18653/v1/D17-1003
- Cite (ACL):
- Junjie Cao, Sheng Huang, Weiwei Sun, and Xiaojun Wan. 2017. Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, pages 24–34, Copenhagen, Denmark. Association for Computational Linguistics.
- Cite (Informal):
- Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs (Cao et al., EMNLP 2017)
- PDF:
- https://preview.aclanthology.org/ingestion-script-update/D17-1003.pdf