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

6th International Conference on Computing, Communication and Networking Technologies (ICCCNT)

作者： Shi, Zhan Zeng, Xiaoqin Huang, Song Qi, Zekun Li, Hui Hu, Bin Zhang, Sainan Liu, Yanyun Wang, Cailing PLA Univ Sci & Technol Coll Command Informat Syst Nanjing Jiangsu Peoples R China Hohai Univ Inst Intelligence Sci & Technol Nanjing Jiangsu Peoples R China China Mobile Commun Corp Guangdong Co Ltd GuangZhou Branch Beijing Peoples R China

ISBN: (纸本)9781479979837

A graph grammar is a formal tool for providing rigorous but intuitive ways to define visual languages. However, the description and implementation difficulties of graph grammars hinder their wide applications. This paper, first of all introduces a description mechanism for specifying the existing Edge-based Graph Grammar (EGG) by using the XML techniques. Then, based on the mechanism, a new parsing algorithm is proposed, which is easily designed and implemented by using the XML technique.

关键词： graph grammar EGG parsing algorithm XML

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Software Tools for Some Natural Language Texts Computer Processing

引用

Computer Technology and Application 2012年第3期3卷 219-225页

作者： Jemal Antidze Nana Gulua Vekua Scientific Institute of Applied Mathematics Tbilisi State University Tbilisi 0186 Georgia Faculty of Mathematics and Computer Science Sukhumi State University Tbilisi 0186 Georgia

Software tools are developed for computer realization of syntactic, semantic, and morphological models of natural language texts, using rule based programming. The tools are efficient for a language, which has free order of words and developed morphological structure like Georgian. For instance, a Georgian verb has several thousand verb-forms. It is very difficult to express rules of morphological analysis by finite automaton and it will be inefficient as well. Resolution of some problems of full morphological analysis of Georgian words is impossible by finite automaton. Splitting of some Georgian verb-forms into morphemes requires non-deterministic search algorithm, which needs many backtrackings. To minimize backtrackings, it is necessary to put constraints, which exist among morphemes and verify them as soon as possible to avoid false directions of search. Software tool for syntactic analysis has means to reduce rules, which have the same members in different order. The authors used the tool for semantic analysis as well. Thus, proposed software tools have many means to construct efficient parser, test and correct it. The authors realized morphological and syntactic analysis of Georgian texts by these tools. In the presented paper, the authors describe the software tools and its application for Georgian language.

关键词： Software tools parsing algorithm backtracking syntactic analyzer constraints.

来源：评论

学校读者我要写书评

暂无评论

Errors in CGAP xProfiler and cDNA DGED: the importance of library parsing and gene selection algorithms

引用

BMC BIOINFORMATICS 2011年第1期12卷 1-15页

作者： Milnthorpe, Andrew T. Soloviev, Mikhail Univ London Sch Biol Sci Egham TW20 0EX Surrey England

Background: The Cancer Genome Anatomy Project (CGAP) xProfiler and cDNA Digital Gene Expression Displayer (DGED) have been made available to the scientific community over a decade ago and since then were used widely to find genes which are differentially expressed between cancer and normal tissues. The tissue types are usually chosen according to the ontology hierarchy developed by NCBI. The xProfiler uses an internally available flat file database to determine the presence or absence of genes in the chosen libraries, while cDNA DGED uses the publicly available UniGene Expression and Gene relational databases to count the sequences found for each gene in the presented libraries. Results: We discovered that the CGAP approach often includes libraries from dependent or irrelevant tissues (one third of libraries were incorrect on average, with some tissue searches no correct libraries being selected at all). We also discovered that the CGAP approach reported genes from outside the selected libraries and may omit genes found within the libraries. Other errors include the incorrect estimation of the significance values and inaccurate settings for the library size cut-off values. We advocated a revised approach to finding libraries associated with tissues. In doing so, libraries from dependent or irrelevant tissues do not get included in the final library pool. We also revised the method for determining the presence or absence of a gene by searching the UniGene relational database, revised calculation of statistical significance and sorted the library cut-off filter. Conclusion: Our results justify re-evaluation of all previously reported results where NCBI CGAP expression data and tools were used.

关键词： Unique Tissue Library Database UniGene Cluster Library Pool parsing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improved chart parser based on active edges sharing leftmost elements

引用

Harbin Gongye Daxue Xuebao/Journal of Harbin Institute of Technology 2008年第7期40卷 1107-1110页

作者： Qi, Hao-Liang Li, Sheng Yang, Mu-Yun Zhao, Tie-Jun School of Computer Science and Technology Harbin Institute of Technology Harbin 150001 China

An improved chart parser based on active edges sharing the leftmost common elements is presented. After analyzing the mechanism of avoiding redundant work in the traditional chart parsing algorithm, the inefficient treatment on active edges possessing the same leftmost common elements was discovered. Then a new presentation of the active edge was proposed to share the same leftmost elements, and thus an improved chart parser was realized with great decrease of generated active edges. The experimental results on Chinese Treebank show that the improved chart parser significantly outperforms the packed chart parser in terms of both speed (about 10 times faster) and space consumption.

关键词： Active edge Chart parsing parsing algorithm Shared leftmost elements

来源：评论

学校读者我要写书评

暂无评论

Fuzzy context-free languages - Part 2: Recognition and parsing algorithms

引用

THEORETICAL COMPUTER SCIENCE 2005年第1-2期347卷 191-213页

作者： Asveld, PRJ Twente Univ Technol Dept Comp Sci NL-7500 AE Enschede Netherlands

In a companion paper [P.R.J. Asveld, Fuzzy context-free languages-Part 1: Generalized fuzzy context-free grammars, Theoret. Comput. Sci. (2005)] we used fuzzy context-free grammars in order to model grammatical errors resulting in erroneous inputs for robust recognizing and parsing algorithms for fuzzy context-free languages. In particular, this approach enables us to distinguish between small errors ("tiny mistakes") and big errors ("capital blunders"). In this paper, we present some algorithms to recognize fuzzy context-free languages: particularly, a modification of Cocke-Younger-Kasami's algorithm and some recursive descent algorithms. Then we extend these recognition algorithms to corresponding parsing algorithms for fuzzy context-free languages. These parsing algorithms happen to be robust in some very elementary sense. (c) 2005 Elsevier B.V. All rights reserved.

关键词： formal language fuzzy context-free grammar grammatical error recognition algorithm parsing algorithm robust parsing

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

parsing of two-dimensional images represented by quadtree adjoining grammars

引用

PATTERN RECOGNITION 1999年第2期32卷 277-294页

作者： Aizawa, K Nakamura, A Hiroshima Univ Dept Appl Math Higashihiroshima 739 Japan Meiji Univ Dept Comp Sci Kawasaki Kanagawa 214 Japan

In this paper, we will investigate parsing algorithms for QTAGs and their extension called multifoot QTAGs (MFQTAGs). QTAG is a kind of tree adjoining grammars which generates the set of quadtrees. The complexity of our parsing algorithms are O(N-2) by making use of good properties of quadtrees. In this case, the variable N is the diameter of the input image instead of the number of pixels. In other words, parsing for the languages of QTAGs has the linear time complexity. (C) 1999 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

关键词： quadtree tree adjoining grammar indexed grammar image representation parsing algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：