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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Feature-based Korean grammar utilizing learned constraint rules

引用

COMPUTATIONAL INTELLIGENCE 2005年第1期21卷 69-89页

作者： Park, SY Kwak, YJ Rim, HC Lim, HS Korea Univ Dept CSE NLP Lab Seoul South Korea Hanshin Univ Dept Software NLP Lab Ohsan South Korea

In this paper, we propose a feature-based Korean grammar utilizing the learned constraint rules in order to improve parsing efficiency. The proposed grammar consists of feature structures, feature operations, and constraint rules;and it has the following characteristics. First, a feature structure includes several features to express useful linguistic information for Korean parsing. Second, a feature operation generating a new feature structure is restricted to the binary-branching form which can deal with Korean properties such as variable word order and constituent ellipsis. Third, constraint rules improve efficiency by preventing feature operations from generating spurious feature structures. Moreover, these rules are learned from a Korean treebank by a decision tree learning algorithm. The experimental results show that the feature-based Korean grammar can reduce the number of candidates by a third of candidates at most and it runs 1.5 similar to 2 times faster than a CFG on a statistical parser.

关键词： natural language processing parsing algorithm Korean grammar constraint rules

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Efficient known ncRNA search including pseudoknots

引用

BMC BIOINFORMATICS 2013年第2-sup期14卷 1-12页

作者： Yuan, Cheng Sun, Yanni Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA

Background: Searching for members of characterized ncRNA families containing pseudoknots is an important component of genome-scale ncRNA annotation. However, the state-of-the-art known ncRNA search is based on context-free grammar (CFG), which cannot effectively model pseudoknots. Thus, existing CFG-based ncRNA identification tools usually ignore pseudoknots during search. As a result, dozens of sequences that do not contain the native pseudoknots are reported by these tools. When pseudoknot structures are vital to the functions of the ncRNAs, these sequences may not be true members. Results: In this work, we design a pseudoknot search tool using multiple simple sub-structures, which are derived from knot-free and bifurcation-free structural motifs in the underlying family. We test our tool on a contiguous 22-Mb region of the Maize Genome. The experimental results show that our work competes favorably with other pseudoknot search methods. Conclusions: Our sub-structure based tool can conduct genome-scale pseudoknot-containing ncRNA search effectively and efficiently. It provides a complementary pseudoknot search tool to Infernal. The source codes are available at http://***/similar to chengy/knotsearch.

关键词： False Positive Rate Maize Genome Seed Sequence Pseudoknot Structure parsing algorithm

来源：评论

学校读者我要写书评

暂无评论

A PRACTICAL METHOD FOR REDUCING WEAK PRECEDENCE PARSERS

引用

IEEE TRANSACTIONS ON SOFTWARE ENGINEERING 1983年第1期9卷 25-30页

作者： AOE, J YAMAMOTO, Y SHIMADA, R Department of Information Science and Systems Engineering Faculty of Engineering University of Tokushima

This study proposes a practical method for the construction of a more compact matrix structure of the precedence information used in a new weak precedence parsing. The parsing algorithm is different from the conventional weak precedence algorithm. It is possible to use the method for any weak precedence grammars without degrading the good error detection capability of the traditional weak precedence parsers. The empirical results serve to demonstrate that the obtained matrices are the very reasonable size and that the presented parsing algorithm is quite efficient.

关键词： Weak Precedence Parser Parser Optimization parsing algorithm Programming Languages Space Saving Time Efficiency

来源：评论

学校读者我要写书评

暂无评论

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 EFFICIENT parsing MODEL FOR UNIFICATION CATEGORIAL GRAMMAR WITH OBJECT-ORIENTED KNOWLEDGE REPRESENTATION AND SELECTION SETS

引用

International Journal on Artificial Intelligence Tools 1998年第2期7卷 143-162页

作者： LI LI BARRETT R. BRYANT Unisys Corporation MS F140-7 2476 Swedesford Road Paoli PA 19301 USA Department of Computer Information and Sciences University of Alabama at Birmingham Birmingham AL 35294-1170 USA

This paper describes an object-oriented lexical representation language based on Unification Categorial Grammar (UCG) that encodes linguistic and semantic information uniformly as classes and objects and an efficient bottom-up parsing method for UCG using selection sets technique. The lexical representation language, implemented in the logic and object-oriented programming language LIFE, introduces several new information sharing mechanisms to enable natural, declarative, modular and economial construction of large and complex computational lexicons. The selection sets are deduced from a transformation between UCG and Context-Free Grammar (CFG) and used to reduce search space for the table-driven algorithm. The experimental tests on a spoken English corpus show that the hierarchical lexicon achieves a dramatic reduction on redundant information and that selection sets significantly improve parsing UCG with a polynomial time complexity.

关键词： natural language understanding inheritance network parsing algorithm categorial grammar

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Applying link grammar formalism in the development of english-Indonesian machine translation system

Applying link grammar formalism in the development of englis...

引用

9th International Conference on Artificial Intelligence and Symbolic Computation/15th Symposium on Integration of Symbolic Computation and Mechanized Research/7th International Conference on Mathematical Knowledge Management

作者： Adji, Teguh Bharata Baharudin, Baharum Zamin, Norshuhani Department of Computer and Information Science Universiti Teknologi PETRONAS Malaysia Department of Electrical Engineering Gadjah Mada University

ISBN: (纸本)9783540851097

In this paper, we present a Machine Translation (MT) system from English to Indonesian by applying Link Grammar (LG) formalism. The Annotated Disjunct (ADJ) technique available in the LG formalism is utilized to map English sentences into equivalent Indonesian sentences. The ADJ is a promising technique to deal with target languages that do not have grammar formalism, parser, and corpus available like Indonesian language. An experimental evaluation shows that the applicability of LG for Indonesian language worked as expected. We have also discussed some significant issues to be considered in future development.

关键词： annotated disjunct link grammar parsing algorithm natural language processing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：