Parsing and Generation with Tabulation and Compilation

The standard tabulation techniques for logic programming presuppose fixed order of computation. Some data-driven control should be introduced in order to deal with diverse contexts. The present paper describes a data-driven method of constraint transformation with a sort of compilation which subsumes accessibility check and last-call optimization, which characterize standard natural-language parsing techniques, semantic-head-driven generation, etc.Comment: 8 pages, 5 figures, Proceedings of TAPD'98, pp.26-3

Emergent Parsing and Generation with Generalized Chart

A new, flexible inference method for Horn logic in'o - gram is proposed. It is also a drastic gencndization of chart I)aing, partial instantiation of clauses in a program roughly corresponding to arcs in a chart. Chartlike paming and semantic-head-driven generation emerge from this method. With a parsimonious instantiation scheme for ambiguity packing, the parsing complexity reduces to that of standard chart-based algorithms. I IntroductiOn Language llSe involves very complex interactions among very diveme types of information, not only syntactic one but also semantic, pragmatic, and so fi)rth. It is hence inappropriate to msume any specific algoritlnn for syntactic parsing or generation, which prescribes particular processing directions (such m left-to-right, top-down and bottoln-up) and is bimqcd fi)r sl)ecific types of domain knowledge (such as a context-free grammar). To accrarot for the whole language use, we will have to put many such algorithms together, ending up with an intractably comllicated model