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

Teaching language processing with the PAMOJA framework

SCIENCE OF COMPUTER PROGRAMMING 2023年第1期229卷

作者： Ssanyu, Jackline Bainomugisha, Engineer Kanagwa, Benjamin Makerere Univ Dept Comp Sci POB 7062 Kampala Uganda Kyambogo Univ Dept Comp Sci POB 1 Kampala Uganda

Existing educational tools for language processors have varying capabilities. There is no single tool that covers every aspect of language processors. As a result, there is a possibility that the educator and students will need multiple tools, switching between different specification notations, organization and interpretation of outputs, which could result in a steep learning curve. PAMOJA is a Java-based component framework with a broader scope - it supports construction of grammar-aware applications using the rapid application development style found in modern IDEs such as NetBeans. This paper investigated the possibility of using PAMOJA to develop educational tools for language processing courses. We conducted two major studies. The first study, summarized six design considerations, identified in the literature, for language processor educational tools. Then, we identified three example applications and demonstrated how to construct tools for them using PAMOJA. These include building and visualizing lexical scanners and parsers, as well as constructing a front-end for a software language, using a subset of Java language as an example. The second study evaluated the PAMOJA approach in relation to the identified design considerations, and by analyzing student and educator perceptions. The results seem to demonstrate a positive reception and acceptance, concluding that its application would facilitate the design of language processor teaching tools and learning language processors. (c) 2023 Elsevier B.V. All rights reserved.

关键词： Educational tools Component-based software development Language processing parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

Program extraction applied to monadic parsing

引用

JOURNAL OF LOGIC AND COMPUTATION 2019年第4期29卷 487-518页

作者： 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

来源：评论

学校读者我要写书评

暂无评论

Program extraction applied to monadic parsing

Program extraction applied to monadic parsing

引用

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

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

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

来源：评论

学校读者我要写书评

暂无评论

CYK parsing over Distributed Representations

引用

algorithms 2020年第10期13卷 262页

作者： Zanzotto, Fabio Massimo Satta, Giorgio Cristini, Giordano Univ Roma Tor Vergata Dept Enterprise Engn Viale Politecn 1 I-00133 Rome Italy Univ Padua Dept Informat Engn Via Gradenigo 6-A I-35131 Padua Italy Exprivia SpA Viale Tintoretto 432 I-00142 Rome Italy

parsing is a key task in computer science, with applications in compilers, natural language processing, syntactic pattern matching, and formal language theory. With the recent development of deep learning techniques, several artificial intelligence applications, especially in natural language processing, have combined traditional parsing methods with neural networks to drive the search in the parsing space, resulting in hybrid architectures using both symbolic and distributed representations. In this article, we show that existing symbolic parsing algorithms for context-free languages can cross the border and be entirely formulated over distributed representations. To this end, we introduce a version of the traditional Cocke-Younger-Kasami (CYK) algorithm, called distributed (D)-CYK, which is entirely defined over distributed representations. D-CYK uses matrix multiplication on real number matrices of a size independent of the length of the input string. These operations are compatible with recurrent neural networks. Preliminary experiments show that D-CYK approximates the original CYK algorithm. By showing that CYK can be entirely performed on distributed representations, we open the way to the definition of recurrent layer neural networks that can process general context-free languages.

关键词： parsing algorithms neural networks distributed representations formal languages

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Watson-Crick Context-Free Grammars: Grammar Simplifications and a parsing Algorithm

引用

COMPUTER JOURNAL 2018年第9期61卷 1361-1373页

作者： Zulkufli, Nurul Liyana Mohamad Turaev, Sherzod Tamrin, Mohd Izzuddin Mohd Messikh, Azeddine Int Islamic Univ Malaysia Dept Comp Sci Kulliyyah Informat & Commun Technol Kuala Lumpur Malaysia

A Watson-Crick (WK) context-free grammar, a context-free grammar with productions whose right-hand sides contain nonterminals and double-stranded terminal strings, generates complete double-stranded strings under Watson-Crick complementarity. In this paper, we investigate the simplification processes of Watson-Crick context-free grammars, which lead to defining Chomskylike normal form for Watson-Crick context-free grammars. The main result of the paper is a modified CYK (Cocke-Younger-Kasami) algorithm for Watson-Crick context-free grammars in WK-Chomsky normal form, allowing to parse double-stranded strings in O (n(6)) time.

关键词： DNA Computing formal languages parsing algorithms Watson-Crick grammars Watson-Crick automata grammar simplifications context-free grammars

来源：评论

学校读者我要写书评

暂无评论

On optimal parsing for LZ78-like compressors

引用

THEORETICAL COMPUTER SCIENCE 2018年 710卷 19-28页

作者： Aronica, Salvatore Langiu, Alessio Marzi, Francesca Mazzola, Salvatore Mignosi, Filippo CNR IAMC Natl Res Council Unit Capo Granitola Trapani Italy CNR ICAR Natl Res Council Unit Palermo Palermo Italy Kings Coll London Dept Informat London England Univ LAquila DISIM Dept Laquila Italy

Flexible parsing algorithm, a two-steps-greedy parsing algorithm for text factorisation, has been proved to be an optimal parsing for LZ78-like compressors in the case of constant cost phrases [1,2]. Whilst in early implementations of LZ78-like compressors the phrases have constant cost, in common modern implementations the cost of the k-th phrase is [log(2) k + C] where C is a real constant [3,4]. Indeed we show examples where Flexible parsing is not optimal under the above more realistic setting. In this paper we prove that, under the assumption that the cost of a phrase is block-wise constant and non-decreasing, the Flexible parsing is almost optimal. For almost optimal we mean that, for any text T, the difference between the sizes of the compressed text obtained by using a Flexible parsing and an optimal parsing is bounded by the maximal cost of a phrase in T, i.e. it is logarithmic in practical cases. Furthermore we investigate how an optimal parsing, and hence an almost optimal parsing, affects the rate of convergence to the entropy of LZ78-like compressors. We discuss some experimental results considering the ratio between the speed of convergence to the entropy of compressors with and without an optimal parsing. This ratio presents a kind of wave effect that increases as the entropy of a memoryless source decreases but it seems always to slowly converge to one. According to the theory, this wave can be a tsunami for some families of highly compressible strings and, although the optimal (and the almost optimal) parsing does not improve the asymptotical speed of convergence to the entropy, it can improve compression ratio, and hence the decoding speed, in many practical cases. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Lempel-Ziv compression algorithms parsing algorithms Text factorisation Text compression Text entropy String algorithms

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Creating collaboration instruments in the parametric design context

Creating collaboration instruments in the parametric design ...

引用

IABSE Conference, Bath 2017: Creativity and Collaboration - Instilling Imagination and Innovation in Structural Design

作者： Demin, Dimitry Dietrich, Sebastian Swiss Federal Institute of Technology Zürich Switzerland Bauhaus University Weimar Germany

This paper outlines the development of a new open-source plugin for collaboration workflow within the parametric design paradigm. Processes of informational exchange support the integration approaching workflows for p... 详细信息

关键词： Collaboration Finite element Parametric engineering parsing algorithms

来源：评论

学校读者我要写书评

暂无评论

NASA Technical Reports Server (Ntrs) 20070027745: Blurring the Inputs: a Natural Language Approach to Sensitivity Analysis

引用

2017年

NASA Technical Reports Server (Ntrs) 20070027745: Blurring the Inputs: a Natural Language Approach to Sensitivity Analysis by NASA Technical Reports Server (Ntrs); published by

关键词： (ntrs) 20070027745: analysis approach automation blurring central processing units computational fluid dynamics direct numerical simulation johnston, christopher o. kleb, william l. mathematical models monte carlo method nasa technical reports server (ntrs) natural language (computers) parsing algorithms reynolds averaging sensitivity analysis stagnation point thompson, richard a.

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：