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

International Workshop on Proof, Structure, and Computation (PSC)

作者： Berger, Ulrich Jones, Alison Seisenberger, Monika Swansea Univ Comp Sci Swansea SA2 8PP W Glam Wales

This article outlines a proof-theoretic approach to developing correct and terminating monadic parsers. Using modified realizability, we extract formally verified and terminating programs from formal proofs. By extracting both primitive parsers and parser combinators, it is ensured that all complex parsers built from these are also correct, complete and terminating for any input. We demonstrate the viability of our approach by means of two case studies: we extract (i) a small arithmetic calculator and (ii) a non-deterministic natural language parser. The work is being carried out in the interactive proof system Minlog.

关键词： Program extraction verification monads parsing algorithms natural language processing termination left recursion

来源：评论

学校读者我要写书评

暂无评论

DIRECT parsing OF ID/LP GRAMMARS

引用

LINGUISTICS AND PHILOSOPHY 1984年第2期7卷 135-154页

作者： SHIEBER, SM 1. Artificial Intelligence Center SRI International 333 Ravenswood Avenue 94025 Menlo Park CA USA

来源：评论

学校读者我要写书评

暂无评论

Context Driven Scene parsing with Attention to Rare Classes 27

Context Driven Scene Parsing with Attention to Rare Classes

引用

27th IEEE Conference on Computer Vision and Pattern Recognition (CVPR)

作者： Yang, Jimei Price, Brian Cohen, Scott Yang, Ming-Hsuan UC Merced Merced CA 95343 USA

ISBN: (纸本)9781479951178

This paper presents a scalable scene parsing algorithm based on image retrieval and superpixel matching. We focus on rare object classes, which play an important role in achieving richer semantic understanding of visual scenes, compared to common background classes. Towards this end, we make two novel contributions: rare class expansion and semantic context description. First, considering the long-tailed nature of the label distribution, we expand the retrieval set by rare class exemplars and thus achieve more balanced superpixel classification results. Second, we incorporate both global and local semantic context information through a feedback based mechanism to refine image retrieval and superpixel matching. Results on the SIFTflow and LMSun datasets show the superior performance of our algorithm, especially on the rare classes, without sacrificing overall labeling accuracy.

关键词： Long-Tailed Distribution Scene parsing Semantic Segmentation Visual Context image retrieval Semantics parsing visual scene object class parsing algorithms Feedback

来源：评论

学校读者我要写书评

暂无评论

Tree adjoining grammars for RNA structure prediction

引用

THEORETICAL COMPUTER SCIENCE 1999年第2期210卷 277-303页

作者： Uemura, Y Hasegawa, A Kobayashi, S Yokomori, T JST ERATO Doi Bioasymmetry Project Mihama Ku Chiba 26171 Japan Univ Electrocommun Dept Comp Sci & Informat Math Chofu Tokyo 182 Japan

In this paper, we are concerned with identifying a subclass of tree adjoining grammars (TAGs) that is suitable for the application to modeling and predicting RNA secondary structures. The goal of this paper is twofold: For the purpose of applying to the RNA secondary structure prediction problem, we first introduce a special subclass of TAGs and develop a fast parsing algorithm for the subclass, together with some of its language theoretic characterizations. Then, based on the algorithm, we develop a prediction system and demonstrate the effectiveness of the system by presenting some experimental results obtained from biological data, where free energy evaluation selection for parse trees is incorporated into the algorithm. (C) 1999-Elsevier Science B.V. All rights reserved.

关键词： tree adjoining grammars RNA secondary structures RNA structure prediction parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on context of implicit context-sensitive graph grammars

引用

JOURNAL OF COMPUTER LANGUAGES 2019年 51卷 241-260页

作者： Zou Yang Lu Jian Tao Xianping Nanjing Univ State Key Lab Novel Software Technol Nanjing 210093 Jiangsu Peoples R China Hohai Univ Comp & Informat Coll Nanjing 210098 Jiangsu Peoples R China

Visual Programming Languages have been widely adopted in design and comprehension of sophisticated systems. Context-sensitive graph grammar formalisms are suitable tools for specifying these languages, since they are intuitive and possess sufficient expressive power and usability. Nevertheless, some of the formalisms whose contexts are implicitly or incompletely represented in productions, called implicit context-sensitive graph grammars, suffer inherent weakness in intuitiveness and limitations in parsing algorithms. To address these issues, this paper formally presents a notion of context on the underlying concepts of partial and total precedence relations, characterizes their fundamental properties, and establishes a connection between contexts and their instances (also called context graphs elsewhere), based on the Reserved Graph Grammar formalism, a representative of implicit graph grammars. Moreover, three typical applications of contexts are illustrated, which show that contexts can both facilitate the comprehension and design of implicit graph grammars so as to enhance their intuitiveness, and make the existent efficient parsing algorithms more widely applicable.

关键词： Visual languages Implicit context-sensitive graph grammars Contexts Graph grammar comprehension parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

A context-sensitive graph grammar formalism for the specification of visual languages

引用

COMPUTER JOURNAL 2001年第3期44卷 186-200页

作者： Zhang, DQ Zhang, K Cao, JN Univ Texas Dept Comp Sci Richardson TX 75083 USA Coral Corp Ottawa ON Canada Hong Kong Polytech Univ Dept Comp Kowloon Hong Kong Peoples R China

Graph grammars may be used as natural and powerful syntax-definition formalisms for visual programming languages. Yet most graph-grammar parsing algorithms presented so far are either unable to recognize interesting visual languages or tend to be inefficient (with exponential time complexity) when applied to graphs with a large number of nodes and edges. This paper presents a context-sensitive graph grammar called reserved graph grammar, which can explicitly and completely describe the syntax of a wide range of diagrams using labeled graphs. The parsing algorithm of a reserved graph grammar uses a marking mechanism to avoid ambiguity in parsing and has polynomial time complexity in most cases. The paper defines a constraint condition under which a graph defined in a reserved graph grammar can be parsed in polynomial time. An algorithm for checking the condition is also provided.

关键词： complexity classes visual languages Specifications Ganglia syntax Visual programming languages formalism parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

The language intersection problem for non-recursive context-free grammars

引用

INFORMATION AND COMPUTATION 2004年第2期192卷 172-184页

作者： Nederhof, MJ Satta, G Univ Padua Dept Informat Engn I-35131 Padua Italy Univ Groningen Fac Arts NL-9700 AS Groningen Netherlands

We prove that, given as input two context-free grammars, deciding non-emptiness of intersection of the two generated languages is PSPACE-complete if at least one grammar is non-recursive. The problem remains PSPACE-complete when both grammars are non-recursive and deterministic. Also investigated are generalizations of the problem to several context-free grammars, of which a certain number are non-recursive. (C) 2004 Elsevier Inc. All rights reserved.

关键词： formal languages context-free grammars computational complexity parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

TIME-BOUNDED CONTROLLED BIDIRECTIONAL GRAMMARS

引用

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS 1990年第1-4期35卷 93-115页

作者： HOGENDORP, JA Department of Computer Science University of Twente Enschede P.O. Box 217 7500 AE Netherlands

We study regularly controlled bidirectional (RCB) grammars from the viewpoint of time-bounded grammars. RCB-grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this kind of grammar. A time bound on such a grammar is a measure of its derivational complexity. For some families of time bounds and for some modes of derivation we establish closure properties and a normal form theorem. In addition parsing algorithms are given for some modes of derivation. We conclude with considering generalizations with respect to the family of control languages and the family of bounding functions..

关键词： Controlled time-bounded grammar productive and reductive grammar(bidirection- ality) derivational complexity parsing algorithms closure properties F.4.2 F.4.3

来源：评论

学校读者我要写书评

暂无评论

Hybrid Interpreting Framework of the Unified Scheduling Language

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2017年第3期14卷 175-183页

作者： Xing, Jinjiang Zhu, Hua Zou, Xuemei Beijing Aerosp Command & Control Ctr POB 5130-104 Beijing 100094 Peoples R China

The unified scheduling language is a Chinese domain-specific language with both programming and natural language features for space mission scheduling. To create a functional and yet simple language for all space-mission-related staff, a hybrid framework for language defining and interpreting is proposed. This framework combines script programming languages and natural language processing technologies, and it creates a language that is easy to learn yet still powerful to fulfill the automating and extending requirements of mission scheduling. A coordinated natural language processing approach is designed to parse human-oriented languages, and a general-purpose script engine is integrated for processing the script aspect of the unified scheduling language. The translating mechanism maintains logic consistency between the two parsers. Related logic models and algorithms are introduced to illustrate the parsing mechanism. This framework achieves sound practical results in the unified scheduling language, considering a valid domain-specific language system is built and parsed correctly. The framework can be generalized to other Chinese domain-specific languages in various application fields.

关键词： Space Missions Natural Language Processing Python parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

A template-based English-Chinese translation system using FOPA and UAMRT

A template-based English-Chinese translation system using FO...

引用

6th International Conference on Advanced Language Processing and Web Information Technology

作者： Li Yujian Beijing Univ Technol Coll Comp Sci & Technol Beijing 100022 Peoples R China

ISBN: (纸本)9780769529301

This paper presents a template-based English-Chinese translation system characterized by two important features: Fast Optimal parsing Algorithm (FOPA) and Universal Algorithm of Matching and Replacing Templates (UAAMT). First, the FOPA parses an English sentence into an optimal parse tree or template structure quickly. Second, the UAMRT matches each source template with the optimal structure and replaces it with the corresponding target template. The basic idea of the template-based system is to represent all translation knowledge in uniform templates which can be shown as context-free grammar rules. It then translates an English sentence into Chinese with FOPA and UAMRT System evaluation shows encouraging and promising results for quality and speed, and the system may perform better by adding more templates without any other changes.

关键词： jigs(templates) Translation systems parsing tree context-free grammars Translations Translation Translation Process generalized algorithm parsing algorithms English English language system evaluation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：