检索结果-内蒙古大学图书馆

IMPROVING SEMANTIC ANALYSIS IN VISUALIZATION WITH META NETWORK REPRESENTATION AND parsing algorithm

SCALABLE COMPUTING-PRACTICE AND EXPERIENCE 2024年第1期25卷 75-84页

作者： Ji, Chunmei Liu, Ning Wang, Zansen Zhen, Yaping Yancheng Polytech Coll Sch Informat & Secur Yancheng 224005 Jiangsu Peoples R China

This article aims to advance semantic analysis models, particularly in visualization, by proposing a novel semantic representation method utilizing the semantic Meta Network (MNet). MNet is a complex framework comprising semantic elements, internal and external relationships, and feature attributes, defined hierarchically through recursive processes, aiming to depict the comprehensive semantic space from phrase-level components to complete texts. The methodology involves the development of a general construction algorithm for MNet, encompassing meta relationships, tree structures, and network structures, and a parsing method for specific semantic analysis problems, including a bottom-up specification-based MNet semantic dependency tree construction algorithm and a network construction algorithm tailored for natural language interface parsing. Empirical experiments confirm the effectiveness of these algorithms, particularly in parsing natural language control interface instructions in Supervisory Control and Data Acquisition (SCADA) systems, bridging specific semantic analysis problems with the general construction and parsing processes of MNet, accounting for internal semantics concerning language unit structures and foreign language meanings in the linguistic context, thereby contributing significantly to the field of natural language semantic analysis.

关键词： Natural language processing SCADA Natural language interface MNet parsing algorithm

来源：评论

学校读者我要写书评

暂无评论

Y A general parsing algorithm with context matching for context-sensitive graph grammars

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2022年第1期81卷 273-297页

作者： Zou, Yang Zeng, Xiaoqin Zhu, Yun Hohai Univ Sch Comp & Informat Inst Intelligence Sci & Technol Nanjing Peoples R China

Context-sensitive graph grammars have been intuitive and rigorous formalisms for specifying visual programming languages, as they are sufficient expressive and equipped with parsing mechanisms. parsing has been a fundamental issue in the research of context-sensitive graph grammars. However, the existent parsing algorithms are either inefficient or confined to a minority of graph grammars. This paper proposes a general parsing algorithm with two embedded strategies, context matching and production-set partitioning. The two strategies can greatly narrow down the search space of redexes and thus significantly improve parsing efficiency, even though the worst-case time complexity is not theoretically reduced. Moreover, a detailed case study and an experiment are provided accordingly to demonstrate the paring process and performance of the proposed algorithm.

关键词： Visual languages Context-sensitive graph grammar parsing algorithm Context matching Production-set partitioning

来源：评论

学校读者我要写书评

暂无评论

UML diagram-driven test scenarios generation based on the temporal graph grammar

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2021年第7期15卷 2476-2495页

作者： Shi, Zhan Zeng, Xiaoqin Zhang, Tingting Han, Lei Qian, Ying NanJing Inst Technol Inst Comp Engn Nanjing Peoples R China Hohai Univ Inst Intelligence Sci & Technol Nanjing Peoples R China PLA Army Engn Univ Nanjing Peoples R China Southeast Univ Nanjing Peoples R China

Model-based software architecture verification and test scenarios generation are becoming more and more important in the software industry. Based on the existing temporal graph grammar, this paper proposes a new formalization method of the context-sensitive graph grammar for aiming at UML activity diagrams, which is called the UML Activity Graph Grammar, or UAGG. In the UAGG, there are new definitions and parsing algorithms. The proposed mechanisms are able to not only check the structural correctness of the UML activity diagram but also automatically generate the test scenario according to user constraints. Finally, a case study is discussed to illustrate how the UAGG and its algorithms work.

关键词： Graph grammar parsing algorithm TEGG UML

来源：评论

学校读者我要写书评

暂无评论

PAVT: a tool to visualize and teach parsing algorithms

引用

EDUCATION AND INFORMATION TECHNOLOGIES 2018年第6期23卷 2737-2764页

作者： Sangal, Somya Kataria, Shreya Tyagi, Twishi Gupta, Nidhi Kirtani, Yukti Agrawal, Shivli Chakraborty, Pinaki Netaji Subhas Inst Technol Div Comp Engn New Delhi 110078 India Hansraj Coll Dept Comp Sci Delhi 110007 India

A parsing algorithm visualizer is a tool that visualizes the construction of a parser for a given context-free grammar and then illustrates the use of that parser to parse a given string. parsing algorithm visualizers are used to teach the course on compiler construction which in invariably included in all undergraduate computer science curricula. This paper presents a new parsing algorithm visualizer that can visualize six parsing algorithms, viz. predictive parsing, simple LR parsing, canonical LR parsing, look-ahead LR parsing, Earley parsing and CYK parsing. The tool logically explains the process of parsing showing the calculations involved in each step. The output of the tool has been structured to maximize the learning outcomes and contains important constructs like FIRST and FOLLOW sets, item sets, parsing table, parse tree and leftmost or rightmost derivation depending on the algorithm being visualized. The tool has been used to teach the course on compiler construction at both undergraduate and graduate levels. An overall positive feedback was received from the students with 89% of them saying that the tool helped them in understanding the parsing algorithms. The tool is capable of visualizing multiple parsing algorithms and 88% students used it to compare the algorithms.

关键词： Compiler construction parsing algorithm algorithm visualization Instructional aid

来源：评论

学校读者我要写书评

暂无评论

parsing Strategies for Context-Sensitive Graph Grammars 19

Parsing Strategies for Context-Sensitive Graph Grammars

引用

12th International Symposium on Visual Information Communication and Interaction (VINCI)

作者： Zou, Yang Zeng, Xiaoqin Liu, Yufeng Hohai Univ Inst Intelligence Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781450376266

Context-sensitive graph grammars have been suitable formalisms for specifying visual programming languages, as they are intuitive, sufficient expressive and equipped with parsing mechanisms. parsing has been a fundamental issue in the research of context-sensitive graph grammars. However, the existent parsing algorithms are either inefficient or confined to a minority of graph grammars. This paper presents two strategies for general parsing algorithms, one is context matching, and the other is partitioning of productions. Through narrowing down the searching space of potential redexex, the two strategies can considerably improve the parsing performance.

关键词： Visual languages Context-sensitive graph grammars Strategy parsing algorithm Context matching Partitioning of productions

来源：评论

学校读者我要写书评

暂无评论

A temporal graph grammar formalism

引用

JOURNAL OF VISUAL LANGUAGES AND COMPUTING 2018年 47卷 62-76页

作者： Shi Zhan Zeng Xiaoqin Zou Yang Huang Song Li Hui Hu Bin Yao Yi Hohai Univ Inst Intelligence Sci & Technol Nanjing 211100 Jiangsu Peoples R China PLA Univ Sci & Technol Coll Command Informat Syst Nanjing 210007 Jiangsu Peoples R China

As a useful formalism tool, graph grammars provide a rigorous but intuitive way to specify visual languages. This paper, based on the existing Edge-based Graph Grammar (EGG), proposes a new context-sensitive graph grammar formalism called the Temporal Edge-based Graph Grammar, or TEGG. TEGG introduces some temporal mechanisms to grammatical specifications, productions, operations and so on in order to tackle time-related issues. In the paper, formal definitions of TEGG are provided first. Then, a new parsing algorithm with a decidability proof is proposed to check the correctness of a given graph's structure, to analyze operations' timing when needed, and to make the computer simulation of the temporal sequence in the graph available. Next, the complexity of the parsing algorithm is analyzed. Finally, a case study on an application with temporal requirements is provided to show how the parsing algorithm of TEGG works.

关键词： Graphical language Graph grammar Temporal specification parsing algorithm Simulation

来源：评论

学校读者我要写书评

暂无评论

An Extension of Temporal Mechanism for Graph Grammar 3

An Extension of Temporal Mechanism for Graph Grammar

引用

3rd IEEE International Conference on Image, Vision and Computing (ICIVC)

作者： Shi, Zhan Zhang, Jiande Zhang, Tingting Zeng, Xiaoqin Li, Dawei Nanjing Inst Technol Sch Comp Engn Nanjing Jiangsu Peoples R China Nanjing Univ Sci & Technol Sch Econ & Management Nanjing Jiangsu Peoples R China PLA Army Engn Univ Coll Command Informat Syst Nanjing Jiangsu Peoples R China Hohai Univ Inst Intelligence Sci & Technol Nanjing Jiangsu Peoples R China

ISBN: (纸本)9781538649916

Graph grammars are a rigorous but intuitive way to define and handle graph languages. To tackle time-related issues, this paper proposes a new extension of temporal mechanism based on the existing Edge-based Graph Grammar (EGG), which includes grammatical specifications, productions, operations and so on. In the paper, formal definitions of temporal mechanism are provided first. Then, a new parsing algorithm is presented to check the correctness of a given graph's structure, and to analyze operations' timing when needed.

关键词： graph grammar temporal mechanism parsing algorithm simulation

来源：评论

学校读者我要写书评

暂无评论

Speedup of parsing for Recognition of Online Handwritten Mathematical Expressions 14

Speedup of Parsing for Recognition of Online Handwritten Mat...

引用

14th IAPR International Conference on Document Analysis and Recognition (ICDAR)

作者： Anh Duc Le Nakagawa, Masaki Tokyo Univ Agr & Technol Dept Comp Informat Fuchu Tokyo Japan

ISBN: (纸本)9781538635865

This paper proposes a method for speeding up parsing process for recognizing online handwritten mathematical expressions (OHME). We prune infeasible partitions in the parsing table to reduce the time for the parsing process. Low score partitions are candidates for pruning. Our method can be applied for any parsing algorithms that use score functions. In this paper, we use a stroke order free system as a baseline system. The method is as follows. First, we analyze the scores of partitions in each row of the parsing table. Then, we determine a threshold for each row to prune low score partitions. Finally, we employ these thresholds to prune low score partitions on the baseline recognition system. The results of evaluations of our method on the CROHME 2014 database show that the recognition process is speeded up by 3.46 times and 4.97 times while recognition rate is reduced only 0.31 point and 0.71 point, respectively.

关键词： online handwritten mathematical expressions handwriting recognition parsing algorithm speedup

来源：评论

学校读者我要写书评

暂无评论

Bidirectional transformation between BPMN and BPEL with graph grammar

引用

COMPUTERS & ELECTRICAL ENGINEERING 2016年 51卷 304-319页

作者： Shi, Zhan Zeng, Xiaoqin Zhang, Tingting Huang, Song Qi, Zekun Li, Hui Hu, Bin Yao, Yi Zhong, Shuiming Hohai Univ Inst Intelligence Sci & Technol Nanjing 211100 Jiangsu Peoples R China PLA Univ Sci & Technol Coll Command Informat Syst Nanjing 210007 Jiangsu Peoples R China China Mobile Commun Corp GuangZhou Branch Guangzhou 510000 Guangdong Peoples R China Nanjing Univ Informat Sci & Technol Sch Comp & Software Nanjing 210044 Jiangsu Peoples R China

A graph grammar is a formal tool for providing rigorous but intuitive ways to define visual languages. Based on an existing graph grammar, this paper proposes new context-sensitive graph grammar formalism called the Extension of Edge-based Graph Grammar, or E-EGG. The E-EGG introduces new mechanisms into grammatical specifications, productions, operations and so on in order to conveniently treat the bidirectional transformation between the Business Process Modeling Notation (BPMN) and the Business Process Execution Language (BPEL). Besides formal definitions of the E-EGG are provided, steps and algorithms to achieve the bidirectional transformation and to check the correctness of BPMN models' structure are presented. Finally, a case study on transformation from BPMN models to BPEL codes is provided to show how the parsing algorithm of the E-EGG works. (C) 2016 Elsevier Ltd. All rights reserved.

关键词： Graph grammar EGG BPMN BPEL parsing algorithm

来源：评论

学校读者我要写书评

暂无评论

Mit :: Ai :: Aim :: Aitr-704

引用

2016年

Mit :: Ai :: Aim :: Aitr-704 by published by

关键词： aitr-704 algorithm flow flow grammars flow graph flow graphs graph graph parser input item node operation takes parser parsing algorithm predictor return return pointers return set scanner operation string string parser

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：