论文标题
TAG和CCG的强度
Strong Equivalence of TAG and CCG
论文作者
论文摘要
树立化语法（TAG）和组合类别语法（CCG）是两个完善的温和上下文敏感的语法形式主义，已知在字符串上具有相同的表达能力（即生成相同的类弦乐语言）。证明它们在树木上的表现力也基本上是一致的。实际上，没有词典的CCG用于空字符串，最多只有2个学位规则就足以满足其完整的表现力。
Tree-adjoining grammar (TAG) and combinatory categorial grammar (CCG) are two well-established mildly context-sensitive grammar formalisms that are known to have the same expressive power on strings (i.e., generate the same class of string languages). It is demonstrated that their expressive power on trees also essentially coincides. In fact, CCG without lexicon entries for the empty string and only first-order rules of degree at most 2 are sufficient for its full expressive power.
