首页> 外文会议>Conference of the Association for Machine Translation in the Americas >Twisted Pair Grammar: Support for Rapid Development of Machine Translation for Low Density Languages
【24h】

Twisted Pair Grammar: Support for Rapid Development of Machine Translation for Low Density Languages

机译:双绞线语法:支持对低密度语言的机器翻译快速发展

获取原文

摘要

We describe a streamlined knowledge acquisition method for semi-automatically constructing knowledge bases for a Knowledge Based Machine Translation (KBMT) system. This method forms the basis of a very simple Java-based user interface that enables a language expert to build lexical and syntactic transfer knowledge bases without extensive specialized training as an MT system builder. Following [Wu 1997], we assume that the permutation of binary-branching structures is a sufficient reordering mechanism for MT. Our syntactic knowledge is based on a novel, highly constrained grammar construction environment in which the only re-ordering mechanism is the permutation of binary-branching structures (Twisted Pair Grammar). We describe preliminary results for several fully implemented components of a Hindi/Urdu to English MT prototype being built with this interface.
机译:我们描述了一种用于半自动构建知识库基于机器翻译(KBMT)系统的知识库的简化知识获取方法。此方法构成了一个非常简单的基于Java的用户界面的基础,使语言专家能够构建词汇和句法转移知识库,而无需广泛的专门培训作为MT系统构建器。在[Wu 1997]之后,我们假设二进制支化结构的置换是MT的足够重新排序机构。我们的句法知识基于一种新颖的高度约束的语法施工环境,其中唯一的重新订购机制是二进制分支结构(双绞线语法)的置换。我们描述了使用此接口构建的若干完全实现的Hindi / Urdu的组件的初步结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号