LOGICAL EMBEDDED PUSH‐DOWN AUTOMATA IN TREE‐ADJOINING GRAMMAR PARSING
LOGICAL EMBEDDED PUSH‐DOWN AUTOMATA IN TREE‐ADJOINING GRAMMAR PARSING
复制标题
树邻接语法分析中的逻辑嵌入式下推自动机
DOI：
10.1111/j.1467-8640.1994.tb00012.x
复制
发表时间：
1994
影响因子：
2.8
通讯作者：
Mark Johnson
中科院分区：
文献类型：
--
作者：
Mark Johnson
本文通过展示如何将TAG识别问题简化为Datasheet演绎问题，将“解析为演绎”方法扩展到树邻接文法，并提出了一个SLD选择规则，该规则使证明搜索对应于使用原始文法的自顶向下解析。就像在上下文无关文法的DCG扩展中一样，这种方法允许用一阶项（而不仅仅是原子符号）标记节点。最后讨论了控制规则的实现问题，并描述了如何在Prolog中有效地实现控制规则。
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 to be labeled with firsl‐order terms (rather than only atomic symbols). Finally the paper discusses implementation matters, and describes how the control rule can be efficiently implemented in Prolog.