@InProceedings{ylijyra-gomezrodriguez:2017:Long,
  author    = {Yli-Jyr\"{a}, Anssi  and  G\'{o}mez-Rodr\'{i}guez, Carlos},
  title     = {Generic Axiomatization of Families of Noncrossing Graphs in Dependency Parsing},
  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     = {1745--1755},
  abstract  = {We present a simple encoding for unlabeled noncrossing graphs and show how its
	latent counterpart helps us to represent several families of directed and
	undirected graphs used in syntactic and semantic parsing of natural language as
	context-free languages.  The families are separated purely on the basis of
	forbidden patterns in latent encoding, eliminating the need to differentiate
	the families of non-crossing graphs in inference algorithms: one algorithm
	works for all when the search space can be controlled in parser input.},
  url       = {http://aclweb.org/anthology/P17-1160}
}