@InProceedings{schwenger-EtAl:2016:COLING,
  author    = {Schwenger, Maximilian  and  Torralba, Alvaro  and  Hoffmann, Joerg  and  Howcroft, David M.  and  Demberg, Vera},
  title     = {From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation},
  booktitle = {Proceedings of COLING 2016, the 26th International Conference on Computational Linguistics: Technical Papers},
  month     = {December},
  year      = {2016},
  address   = {Osaka, Japan},
  publisher = {The COLING 2016 Organizing Committee},
  pages     = {1524--1534},
  abstract  = {The search space in grammar-based natural language generation tasks
	can get very large, which is particularly problematic when generating
	long utterances or paragraphs. Using surface realization with OpenCCG
	as an example, we show that we can effectively detect partial
	solutions (edges) which cannot ultimately be part of a complete
	sentence because of their syntactic category. Formulating the
	completion of an edge into a sentence as finding a solution path in a
	large state-transition system, we demonstrate a connection to AI
	Planning which is concerned with this kind of problem. We design a
	compilation from OpenCCG into AI Planning allowing the detection of
	infeasible edges via AI Planning dead-end detection methods (proving
	the absence of a solution to the compilation). Our experiments show
	that this can filter out large fractions of infeasible edges in, and
	thus benefit the performance of, complex realization processes.},
  url       = {http://aclweb.org/anthology/C16-1144}
}