@InProceedings{cao-EtAl:2017:EMNLP2017,
  author    = {Cao, Junjie  and  Huang, Sheng  and  Sun, Weiwei  and  Wan, Xiaojun},
  title     = {Quasi-Second-Order Parsing for 1-Endpoint-Crossing, Pagenumber-2 Graphs},
  booktitle = {Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing},
  month     = {September},
  year      = {2017},
  address   = {Copenhagen, Denmark},
  publisher = {Association for Computational Linguistics},
  pages     = {24--34},
  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.},
  url       = {https://www.aclweb.org/anthology/D17-1003}
}