@InProceedings{gebhardt:2018:C18-1,
  author    = {Gebhardt, Kilian},
  title     = {Generic refinement of expressive grammar formalisms with an application to discontinuous constituent parsing},
  booktitle = {Proceedings of the 27th International Conference on Computational Linguistics},
  month     = {August},
  year      = {2018},
  address   = {Santa Fe, New Mexico, USA},
  publisher = {Association for Computational Linguistics},
  pages     = {3049--3063},
  abstract  = {We formulate a generalization of Petrov et al. (2006)’s split/merge algorithm for interpreted regular tree grammars (Koller and Kuhlmann, 2011), which capture a large class of grammar formalisms. We evaluate its effectiveness empirically on the task of discontinuous constituent parsing with two mildly context-sensitive grammar formalisms: linear context-free rewriting systems (Vijay-Shanker et al., 1987) as well as hybrid grammars (Nederhof and Vogler, 2014).},
  url       = {http://www.aclweb.org/anthology/C18-1258}
}