Generating Noun Declension-case markers for English to Indian Languages in Declension Rule based MT Systems

Jayashree Nair
{"title":"Generating Noun Declension-case markers for English to Indian Languages in Declension Rule based MT Systems","authors":"Jayashree Nair","doi":"10.1109/IADCC.2018.8692136","DOIUrl":null,"url":null,"abstract":"Machine Translation is a branch of re- search under Computational Linguistics that deais with the automatic/semi-automatic translation of a natu- ral/human language into another. The language that is being translated is termed as Source Language(SL) and the language into which translation is done, is termed Target Language(TL). This paper presents an English to Indian Languages Machine Translation technique that is based on the rules of grammar, namely word deelensions or inflections, and sentence formation rules of the target languages, i.e. Indian Languages. Declensions are variations or inflections of words in language and Indian languages are richly declensional or inflectional languages. This study is on generating Noun Declension-case markers for English to Indian languages in Declension Rule based Machine Translation. This paper also describes about the various approaches to machine translation along with their system architectures. The proposed Declension based RBMT is explained with its architecture and each of the modules and their functionalities are elaborated in detail. The input and output, to and from the System are also described with an example. The research works that are similar with the proposed system, such as ANUSAARAKA and ANGLABHARATI are also explored.","PeriodicalId":365713,"journal":{"name":"2018 IEEE 8th International Advance Computing Conference (IACC)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 8th International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IADCC.2018.8692136","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

Abstract

Machine Translation is a branch of re- search under Computational Linguistics that deais with the automatic/semi-automatic translation of a natu- ral/human language into another. The language that is being translated is termed as Source Language(SL) and the language into which translation is done, is termed Target Language(TL). This paper presents an English to Indian Languages Machine Translation technique that is based on the rules of grammar, namely word deelensions or inflections, and sentence formation rules of the target languages, i.e. Indian Languages. Declensions are variations or inflections of words in language and Indian languages are richly declensional or inflectional languages. This study is on generating Noun Declension-case markers for English to Indian languages in Declension Rule based Machine Translation. This paper also describes about the various approaches to machine translation along with their system architectures. The proposed Declension based RBMT is explained with its architecture and each of the modules and their functionalities are elaborated in detail. The input and output, to and from the System are also described with an example. The research works that are similar with the proposed system, such as ANUSAARAKA and ANGLABHARATI are also explored.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于词形变化规则的机器翻译系统中英印名词词形变化标记的生成
机器翻译是计算语言学研究的一个分支,研究将一种自然语言/人类语言自动/半自动地翻译成另一种语言。被翻译的语言称为源语言(SL),被翻译成的语言称为目标语言(TL)。本文提出了一种基于目的语即印度语的语法规则(即单词的变音或屈折变化)和造句规则的英印机器翻译技术。变化是语言中单词的变化或屈折变化,印度语言是富有变化或屈折变化的语言。本文研究了基于变格规则的机器翻译中英印名词变格标记的生成。本文还介绍了机器翻译的各种方法及其系统架构。介绍了基于衰落的RBMT的体系结构,并详细阐述了每个模块及其功能。并以实例说明了系统的输入和输出。并对ANUSAARAKA和ANGLABHARATI等与该系统相似的研究成果进行了探讨。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Discovering Motifs in DNA Sequences: A Suffix Tree Based Approach Prediction Model for Automated Leaf Disease Detection & Analysis Blind navigation using ambient crowd analysis HUPM: Efficient High Utility Pattern Mining Algorithm for E-Business Algorithm to Quantify the Low and High Resolution HLA Matching in Renal Transplantation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1