越南语组句到确定浅结构的映射方法

T. Tran, Dang Tuan Nguyen
{"title":"越南语组句到确定浅结构的映射方法","authors":"T. Tran, Dang Tuan Nguyen","doi":"10.1109/ACOMP.2016.020","DOIUrl":null,"url":null,"abstract":"In many natural language processing based intelligent systems, parsing is the first task to perform. However, in the next stages, many systems often have the capacity of processing a limited number of parsed structures. The problem is to determine what parsed sentences can be recognized by a system. The decision of syntactic structures which can be processed by a system is consider as the task of \"classification\" of a parsed sentence into one of given classes of recognizable parses. In this paper we deal with this issue by proposing a method for mapping Vietnamese chunked sentences to a set of pre-defined shallow structures. Also, we tag lexicons and chunk phrases of the original sentences using our Functional Part-of-Speech (FPOS) tagset with Apache OpenNLP tools (Tokenizer, POS Tagger, Chunker). Based on the foundation of Functional Grammar, we define new lexical tags and combine with Penn-Treebank tagset to build our FPOS tagset. Due to our set of shallow structures is finite, instead of using a parser, we propose a rule-based algorithm for the mapping process. We establish conversion rules according to the reality experiences when using Vietnamese in common communication. The experiment shows that we converse successfully for the major of testing sentences and the algorithm can be applied for different languages.","PeriodicalId":133451,"journal":{"name":"2016 International Conference on Advanced Computing and Applications (ACOMP)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Method of Mapping Vietnamese Chunked Sentences to Definite Shallow Structures\",\"authors\":\"T. Tran, Dang Tuan Nguyen\",\"doi\":\"10.1109/ACOMP.2016.020\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In many natural language processing based intelligent systems, parsing is the first task to perform. However, in the next stages, many systems often have the capacity of processing a limited number of parsed structures. The problem is to determine what parsed sentences can be recognized by a system. The decision of syntactic structures which can be processed by a system is consider as the task of \\\"classification\\\" of a parsed sentence into one of given classes of recognizable parses. In this paper we deal with this issue by proposing a method for mapping Vietnamese chunked sentences to a set of pre-defined shallow structures. Also, we tag lexicons and chunk phrases of the original sentences using our Functional Part-of-Speech (FPOS) tagset with Apache OpenNLP tools (Tokenizer, POS Tagger, Chunker). Based on the foundation of Functional Grammar, we define new lexical tags and combine with Penn-Treebank tagset to build our FPOS tagset. Due to our set of shallow structures is finite, instead of using a parser, we propose a rule-based algorithm for the mapping process. We establish conversion rules according to the reality experiences when using Vietnamese in common communication. The experiment shows that we converse successfully for the major of testing sentences and the algorithm can be applied for different languages.\",\"PeriodicalId\":133451,\"journal\":{\"name\":\"2016 International Conference on Advanced Computing and Applications (ACOMP)\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Advanced Computing and Applications (ACOMP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACOMP.2016.020\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Advanced Computing and Applications (ACOMP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACOMP.2016.020","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在许多基于自然语言处理的智能系统中,解析是首先要执行的任务。然而,在接下来的阶段中,许多系统通常只能处理有限数量的已解析结构。问题是确定系统可以识别哪些已解析的句子。系统可以处理的句法结构的决定被认为是将已解析的句子“分类”到给定的可识别语法类之一的任务。在本文中,我们通过提出一种将越南语分块句映射到一组预定义的浅结构的方法来处理这个问题。此外,我们使用Apache OpenNLP工具(Tokenizer, POS Tagger, Chunker)使用功能性词性(FPOS)标记集标记原始句子的词汇和块短语。在功能语法的基础上,我们定义了新的词法标签,并结合Penn-Treebank标签集构建了FPOS标签集。由于我们的浅层结构集是有限的,我们提出了一种基于规则的映射过程算法,而不是使用解析器。我们根据日常交际中使用越南语的实际经验,建立了转换规则。实验表明,我们成功地对大部分测试句子进行了对话,该算法可以应用于不同的语言。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Method of Mapping Vietnamese Chunked Sentences to Definite Shallow Structures
In many natural language processing based intelligent systems, parsing is the first task to perform. However, in the next stages, many systems often have the capacity of processing a limited number of parsed structures. The problem is to determine what parsed sentences can be recognized by a system. The decision of syntactic structures which can be processed by a system is consider as the task of "classification" of a parsed sentence into one of given classes of recognizable parses. In this paper we deal with this issue by proposing a method for mapping Vietnamese chunked sentences to a set of pre-defined shallow structures. Also, we tag lexicons and chunk phrases of the original sentences using our Functional Part-of-Speech (FPOS) tagset with Apache OpenNLP tools (Tokenizer, POS Tagger, Chunker). Based on the foundation of Functional Grammar, we define new lexical tags and combine with Penn-Treebank tagset to build our FPOS tagset. Due to our set of shallow structures is finite, instead of using a parser, we propose a rule-based algorithm for the mapping process. We establish conversion rules according to the reality experiences when using Vietnamese in common communication. The experiment shows that we converse successfully for the major of testing sentences and the algorithm can be applied for different languages.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信