CCG chart realization from disjunctive inputs

  • Authors:
  • Michael White

  • Affiliations:
  • The Ohio State University, Columbus, OH

  • Venue:
  • INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper presents a novel algorithm for efficiently generating paraphrases from disjunctive logical forms. The algorithm is couched in the framework of Combinatory Categorial Grammar (CCG) and has been implemented as an extension to the OpenCCG surface realizer. The algorithm makes use of packed representations similar to those initially proposed by Shemtov (1997), generalizing the approach in a more straightforward way than in the algorithm ultimately adopted therein.