@InProceedings{hershcovich-abend-rappoport:2017:Long,
  author    = {Hershcovich, Daniel  and  Abend, Omri  and  Rappoport, Ari},
  title     = {A Transition-Based Directed Acyclic Graph Parser for UCCA},
  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     = {1127--1138},
  abstract  = {We present the first parser for UCCA, a cross-linguistically applicable
	framework for semantic representation, which builds on extensive typological
	work and supports rapid annotation. UCCA poses a challenge for existing parsing
	techniques, as it exhibits reentrancy (resulting in DAG structures),
	discontinuous structures and non-terminal nodes corresponding to complex
	semantic units. To our knowledge, the conjunction of these formal properties is
	not supported by any existing parser. Our transition-based parser, which uses a
	novel transition set and features based on bidirectional LSTMs, has value not
	just for UCCA parsing: its ability to handle more general graph structures can
	inform the development of parsers for other semantic DAG structures, and in
	languages that frequently use discontinuous structures.},
  url       = {http://aclweb.org/anthology/P17-1104}
}