@InProceedings{sun-cao-wan:2017:Long,
  author    = {Sun, Weiwei  and  Cao, Junjie  and  Wan, Xiaojun},
  title     = {Semantic Dependency Parsing via Book Embedding},
  booktitle = {Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers)},
  month     = {July},
  year      = {2017},
  address   = {Vancouver, Canada},
  publisher = {Association for Computational Linguistics},
  pages     = {828--838},
  abstract  = {We model a dependency graph as a book, a particular kind of topological space,
	for
	semantic dependency parsing. The spine of the book is made up of a sequence of
	words, and each page contains a subset of noncrossing arcs. To build a semantic
	graph for a given sentence, we design new Maximum Subgraph algorithms to
	generate noncrossing graphs on each page, and a Lagrangian Relaxation-based
	algorithm tocombine pages into a book. Experiments demonstrate the
	effectiveness of the bookembedding framework across a wide range of conditions.
	Our parser obtains
	comparable results with a state-of-the-art
	transition-based parser.},
  url       = {http://aclweb.org/anthology/P17-1077}
}