首页> 外文会议>International conference on artificial intelligence >A Rule-Based Approach to Free Word Order Languages
【24h】

A Rule-Based Approach to Free Word Order Languages

机译:基于规则的免费单词顺序语言方法

获取原文

摘要

This paper is addressed the problems of modeling a rule-based approach to free word order languages. Grammar-based parsing for free word languages is problematic. Functionalist models of free word order are based on context-sensitive rules which cannot be parsed automatically. Generative models based on Chomskyan and Stablerian minimalist grammars undergenerate word orders licensed by natural free order languages. I argue that word order alternations in Russian can be predicted by Linear-Accent Transformations (LAT) linking together pairs of sentences with the same numeration but different information structure. LAT theory is compatible with the postulate on basic word order. Each LAT rule amounts to a pair of operations , which makes it possible to reset LAT rules as mildly context-sensitive. Deaccenting of sentence categories in Russian can be analyzed as remnant movement.
机译:本文讨论了将基于规则的方法建模到免费单词阶语言的问题。基于语法的免费解析语言是有问题的。自由单词顺序的功能主义模型基于无法自动解析的上下文相关规则。基于Chomskyan和Stablerian的基于Granders的生成模型,由自然无订单语言许可的单词订单。我争辩说,俄语中的单词订单可以通过线性重音转换(LAT)来预测,将句子对与相同的数量相同但不同的信息结构相同。 LAT理论与基本字订单上的假设兼容。每个LAT规则都能到一对操作<主动运动;剩余的运动>,这使得可以将Lat规则重置为轻度上下文敏感。可以分析俄罗斯句子类别的Deacnenting作为残余运动。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号