Structure-Driven Lexicalist Generation

We present a novel algorithm for surface realisation with lexicalist grammars. In this algorithm, the structure of the input is used both top-down to constrain the selection of applicable rules and bottom-up to filter the initial search space associated with local input trees. In addition, parallelism is used to recursively pursue the realisation of each daught er node in the input tree. We evaluate the algorithm on the input data provided by the Generation Challenge Surface Realisation Task and show that it drastically reduce processing time when compared with a simpler, top-down driven, lexicalist approach. Title and Abstract in Hindi

[1]  Amanda Stent.  ATT-0: Submission to Generation Challenges 2011 Surface Realization Shared Task , 2011, ENLG.

[2]  Stephan Oepen,et al.  High Efficiency Realization for a Wide-Coverage Unification Grammar , 2005, IJCNLP.

[3]  Michael White,et al.  Efficient Realization of Coordinate Structures in Combinatory Categorial Grammar , 2006 .

[4]  M ShieberStuart,et al.  The problem of logical-form equivalence , 1993 .

[5]  Claire Gardent,et al.  A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar , 2007, ACL.

[6]  Anja Belz,et al.  The First Surface Realisation Shared Task: Overview and Evaluation Results , 2011, ENLG.

[7]  Joseph Le Roux,et al.  Feature Unification in TAG Derivation Trees , 2008, TAG.

[8]  Michael White,et al.  Further Meta-Evaluation of Broad-Coverage Surface Realization , 2010, EMNLP.

[9]  Michael White,et al.  Hypertagging: Supertagging for Surface Realization with CCG , 2008, ACL.

[10]  Bruno Guillaume,et al.  Polarization and abstraction of grammatical formalisms as methods for lexical disambiguation , 2004, COLING.

[11]  Benoit Favre,et al.  from deep representation to surface , 2011 .

[12]  Michael White,et al.  Reining in CCG Chart Realization , 2004, INLG.

[13]  Claire Gardent,et al.  Generating and Selecting Grammatical Paraphrases , 2005, ENLG.

[14]  Aravind K. Joshi,et al.  Feature Structures Based Tree Adjoining Grammars , 1988, COLING.

[15]  John Carroll,et al.  An Efficient Chart Generator for (Semi-)Lexicalist Grammars , 2001 .

[16]  XTAG Research Group,et al.  A Lexicalized Tree Adjoining Grammar for English , 1998, ArXiv.

[17]  Gertjan van Noord,et al.  Semantic-Head-Driven Generation , 1990, Comput. Linguistics.

[18]  Alexander Koller,et al.  Generation as Dependency Parsing , 2002, ACL.

[19]  Srinivas Bangalore,et al.  Using TAGs, a Tree Model, and a Language Model for Generation , 2000, TAG+.

[20]  Josef van Genabith,et al.  DCU at Generation Challenges 2011 Surface Realisation Track , 2011, ENLG.

[21]  Benoît Favre,et al.  StuMaBa : From Deep Representation to Surface , 2011, ENLG.

[22]  Aravind K. Joshi,et al.  Tree-Adjoining Grammars , 1997, Handbook of Formal Languages.

[23]  Aravind K. Joshi,et al.  Coordination in Tree Adjoining Grammars: Formalization and Implementation , 1996, COLING.

[24]  Srinivas Bangalore,et al.  Supertagging: An Approach to Almost Parsing , 1999, CL.

[25]  Alex Lascarides,et al.  An Algebra for Semantic Construction in Constraint-based Grammars , 2001, ACL.

[26]  Claire Gardent,et al.  RTG based surface realisation for TAG , 2010, COLING.