Parsing and Generation with Tabulation and Compilation

2003/07/11 by Koiti Hasida, Takashi Miyata, Hasida, Koiti +1
Computer Science · #Computation and Language (cs.CL) #D.1.6 #FOS: Computer and information sciences #I.2.7 #cs.CL

paper · pdf · doi:10.48550/arxiv.cs/0307030

8 pages, 5 figures, Proceedings of TAPD'98, pp.26-35

arxiv created 2003/07/11 · arxiv updated 2009/12/01

Abstract

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.

Related

• Constraint Logic Programming for Natural Language Processing
• Memoization in Constraint Logic Programming
• Application of Methods for Syntax Analysis of Context-Free Languages to Query Evaluation of Logic Programs
• Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism
• Selective Magic HPSG Parsing