LOGICAL EMBEDDED PUSH-DOWN AUTOMATA IN TREE-ADJOINING GRAMMAR PARSING

Mark Johnson
1994 Computational intelligence  
This paper extends the "parsing as deduction" approach to tree-adjoining grammars by showing how a TAG recognition problem can be reduced to a Datalog deduction problem, and presents an SLD selection rule that makes the proof search correspond to a top-down parse using the original grammar. Just as in the DCG extension of context-free grammars, this approach permits nodes tn be labeled with first-order terms (rather than only atomic symbols). Finally the paper discusses implementation matters,
more » ... nd describes how the control rule can be efficiently implemented in Prolog.
doi:10.1111/j.1467-8640.1994.tb00012.x fatcat:wgemrpe6ujdc5ihjlprq77c2om