首页> 外文会议>International Symposium on Fundamentals of Computation Theory >Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars
【24h】

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars

机译:多个无背景树语法和多组分树相邻语法

获取原文

摘要

Strong lexicalization is the process of turning a grammar generating trees into an equivalent one, in which all rules contain a terminal leaf. It is known that tree adjoining grammars cannot be strongly lexicalized, whereas the more powerful simple context-free tree grammars can. It is demonstrated that multiple simple context-free tree grammars are as expressive as multi-component tree adjoining grammars and that both allow strong lexicalization.
机译:强大的词汇化是将语法生成树木转换成相同的过程,其中所有规则都包含终端叶。众所周知,邻接语法不能强烈的语法,而更强大的简单无规背景语法可以。据证明,多个简单的无背景树语法与多组分树相邻语法一样表达,这两者都允许强大的lexical化。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号