Paper: Common Heuristics For Parsing Generation And Whatever...

ACL ID W91-0111
Title Common Heuristics For Parsing Generation And Whatever...
Venue Workshop On Reversible Grammar In Natural Language Processing
Session
Year 1991
Authors
  • Koiti Hasida (Institute for New Generation Computer Technology, Tokyo Japan)

This paper discussers general hem'istics to control computation on symbolic constraints represented in terms of first-order logic programs. These heuristics are totally independen! of specific domains and tasks. Efficient computation for sentence parsing and genera- tion naturally emerge fi'om these heuristics, capturing the essence of standar d parsing procedures and seman- tic head-driven generat:ion. Thus. the same representa- tion of knowledge, inclfiding grammar and lexicon, can be exploited in a multi-directional manner in various aspects of language use.