检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:段之宓[1]
机构地区:[1]中国电子科技集团公司第十研究所,四川成都610036
出 处:《中央民族大学学报(自然科学版)》2013年第3期47-55,共9页Journal of Minzu University of China(Natural Sciences Edition)
摘 要:自然语言协议的自动形式化是通信协议自动测试的前提,从而也是数据链协议自动测试的重要研究方向。此问题出现已久,但尚无可靠解决方案。隐词形理论和格语法是排岐能力很强的自然语言处理方法。运用此套方法。通过分析协议文本,确定隐词形特征,可编写出隐词形词典、隐词形语法规则以及自动机生成规则。根据这些词典、规则,可生成自然语言协议文本对应的自动机。本方案有助于解决自然语言协议文本自动形式化,实现通信协议测试的全面自动化。The study of formalization of natural language text of communication protocol is the premise of protocol automatic testing. Therefore, it is an important field of Data Link Protocol Automatic Testing. There is not any effective solution though this problem has been presented for a long time. Potential Wordform Theory of Case Grammar is an effective grammar in disambiguation. After Potential Wordform characters of the words in an protocol text are given, a Potential Wordform dictionary ,a group of Potential Wordform grammar rules and a group of FSM generation rules can be created. On this basis, an automat, corresponding to the protocol text, can be created too. Above-mentioned technique helps automatically formalizing the protocol text,and thus helps comprehensive automation of communication protocol testing.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.117