Grammar Specification Research Articles

ShapeGraMM: On the fly procedural generation of massive models for real-time visualization

In this study, we propose ShapeGraMM (Shape Grammar for massive models), an expandable grammar that procedurally generates geometries in real-time to create 3D scenes of massive models. Procedural modeling has attracted attention for its ability to quickly create 3D scenes using a compact representation, which stores generation rules rather than an explicit representation of the scene. Our work is an extension of the Computer Generated Architecture (CGA) shape grammar specification. We introduce rules that will take the visibility of the camera into account and decide whether or not it should continue to generate. ShapeGraMM explores the repetitions and patterns present in massive models, helping it render scenes, reduce its memory footprint, and procedurally process the scene efficiently. We propose an engine implementation that generates scenes on the fly using ShapeGraMM, followed by its evaluation using massive real-world models. We conducted a case study testing our solution with large-scale CAD models of the oil & gas industry in the web context, which is a more limited platform than the desktop. In contrast to random models commonly generated by procedural generation methodologies, the original models of our study were modeled in a non-random method. Our results show that the solution has high performance and maintains a compact representation of the models offline and in runtime. The procedural engine renders a massive scene containing over 11 million objects at interactive frame rates.

Understanding models understanding language

Landgrebe and Smith (Synthese 198(March):2061–2081, 2021) present an unflattering diagnosis of recent advances in what they call language-centric artificial intelligence—perhaps more widely known as natural language processing: The models that are currently employed do not have sufficient expressivity, will not generalize, and are fundamentally unable to induce linguistic semantics, they say. The diagnosis is mainly derived from an analysis of the widely used Transformer architecture. Here I address a number of misunderstandings in their analysis, and present what I take to be a more adequate analysis of the ability of Transformer models to learn natural language semantics. To avoid confusion, I distinguish between inferential and referential semantics. Landgrebe and Smith (2021)’s analysis of the Transformer architecture’s expressivity and generalization concerns inferential semantics. This part of their diagnosis is shown to rely on misunderstandings of technical properties of Transformers. Landgrebe and Smith (2021) also claim that referential semantics is unobtainable for Transformer models. In response, I present a non-technical discussion of techniques for grounding Transformer models, giving them referential semantics, even in the absence of supervision. I also present a simple thought experiment to highlight the mechanisms that would lead to referential semantics, and discuss in what sense models that are grounded in this way, can be said to understand language. Finally, I discuss the approach Landgrebe and Smith (2021) advocate for, namely manual specification of formal grammars that associate linguistic expressions with logical form.

Evidence, interests and argumentation: an environmental policy controversy in a small New Zealand town

This article examines interactions between different forms of authoritative knowledge and evidence in a public dispute over an environmental problem. It draws on a case set in a small coastal town in New Zealand where the local community had expressed concern over the degradation of a river-mouth estuary caused by catchment management works built in the 1950s to support the farming sector. The estuary historically had been an important economic and cultural treasure for Indigenous Māori, and by the mid-20th century had become a valued recreational and fishing resource for the broader community. This article analyses a moment of dispute in the 1980s between those who called for the restoration of the estuary and those who wished to maintain the status quo. Drawing on an analysis of official reports, media coverage and other public documents, the article shows how the competing parties and their constructions of the collective good accorded authority and weight to specific histories, forms of evidence and kinds of people. The article understands the case not as a dispute between “the people” and “the experts” but rather as a moment where competing blocs drew on specific grammars of justification in their attempts to align their claims with the collective good.

Research on Metadata Specification of Service Data Resources Under the Background of Data Transaction

This paper designs the service data resource metadata standard system and catalog vocabulary by investigating the status of service data resource descriptions of mainstream data trading platforms at home and abroad, and referring to W3C's official recommendation standard DCAT and Dublin core metadata. The service data resource metadata interaction model is designed by referring to the RDF/XML framework. The service data resource metadata standard applying RDF/XML grammar specification will effectively support the registration and authentication of data products, transaction process management, data demanders' understanding and use of purchased data, and market supervision.

Fuzzing With Optimized Grammar-Aware Mutation Strategies

Fuzzing is a widely used technique to discover vulnerabilities in software. However, for programs requiring highly structured inputs, the byte-based mutation strategies in existing fuzzers have difficulties in generating valid inputs. To resolve this challenge, Grammar-Based Fuzzing (GBF) utilizes existing grammar specifications to generate new inputs. Some GBFs perform mutation based on Abstract Syntax Trees (ASTs), which can generate inputs conforming to grammars. However, the existing GBFs neglect using feedback to optimize mutation strategies, and blindly generate inputs without considering the effectiveness of those inputs. In this paper, we use the power schedule and the subtree pool to optimize mutation strategies. Specifically, we first translate input files into ASTs, and extract subtrees from ASTs into a subtree pool. Then, we optimize the power schedule on AST nodes based on a probabilistic model. That is, we adaptively determine the time budget for mutating an AST node. Finally, we replace AST nodes along with their subtrees using the ones we select from the subtree pool. We implement a fuzzing tool to demonstrate our strategies. The experiment results show that our method outperforms the state-of-the-art methods in fuzzing efficiency.

Visual programming environment based on data visualization grammar specification

Abstract This paper presents a web-based platform for construction and execution of data visualization workflow. The environment enables construction of data visualization workflow with the visual programming interface and provides the ability of previewing the visualisation workflow result in real-time. The use of visual programming makes the workflow composition faster and it’s also lowers entry threshold for the process of data visualization. In this paper we discuss the architecture and main building blocks of the data visualization workflow.

A universal and scalable CNC interpreter for CNC systems

The CNC interpreter is an important part of CNC systems. It detects errors in NC programs and translates NC programs into internal commands for the followed CNC tasks. There are many vendor-specific NC programming languages. For each language, a corresponding CNC interpreter must be encapsulated in the CNC system. Thus, a universal CNC interpreter is desired. Besides, the CNC interpreter is desired to be scalable that allows users to define new instructions. In this paper, therefore, a universal and scalable CNC interpreter is presented. The interpretation process contains the grammar analysis part and the synthesis part. The grammar analysis is implemented depending on the grammar specification. Thus, as long as the grammar specification for vendor-specific commands or user-defined commands is constructed and configured, the CNC interpreter can interpret them. The synthesis part maps the output of the grammar analysis to machining functions. Specific operations contained in NC programs are implemented by an integrated operation postprocessor to guarantee positions in machining functions are practical cutter location positions. Moreover, the CNC interpreter is error tolerant for specific errors. There is a simulation module encapsulated in the prototype CNC interpreter so that this interpreter can run independently to pre-test NC programs in addition to implementing the interpretation task for a CNC system.

Exploiting lattice structures in shape grammar implementations

AbstractThe ability to work with ambiguity and compute new designs based on both defined and emergent shapes are unique advantages of shape grammars. Realizing these benefits in design practice requires the implementation of general purpose shape grammar interpreters that support: (a) the detection of arbitrary subshapes in arbitrary shapes and (b) the application of shape rules that use these subshapes to create new shapes. The complexity of currently available interpreters results from their combination of shape computation (for subshape detection and the application of rules) with computational geometry (for the geometric operations need to generate new shapes). This paper proposes a shape grammar implementation method for three-dimensional circular arcs represented as rational quadratic Bézier curves based on lattice theory that reduces this complexity by separating steps in a shape computation process from the geometrical operations associated with specific grammars and shapes. The method is demonstrated through application to two well-known shape grammars: Stiny's triangles grammar and Jowers and Earl's trefoil grammar. A prototype computer implementation of an interpreter kernel has been built and its application to both grammars is presented. The use of Bézier curves in three dimensions opens the possibility to extend shape grammar implementations to cover the wider range of applications that are needed before practical implementations for use in real life product design and development processes become feasible.

Generic grammars for design domains

AbstractShape grammars have been developed to codify a specific type of artifact – Queen Anne houses, Buffalo bungalows – or the style of a particular designer – Andrea Palladio, Frank Lloyd Wright, or Álvaro Siza Vieira. However, these specific grammars fail to encode recurrent design moves or features that are above the particularities of a specific design style or the idiosyncrasies of a specific designer and, therefore, are common to a larger category of designs and maybe reutilized and incorporated in the definition of new, specific design languages. To overcome these limitations, the notion of generic grammars for defining design domains is introduced. Its application to the urban design domain is illustrated by showing a generic grammar implementation resulting in a City Information Modeling platform composed of a parametric design interface connected to a geographic database.

THEORETICAL FOUNDATIONS FOR CREATION OF A SHELL FOR INTERACTIVE SYSTEMS OF INTUITIVE MATHEMATICAL PROOFS’ VERIFICATION

The article presents a concept of a shell for interactive systems of intuitive mathematical proofs. The means of specifying formal systems that can be used as theoretical foundations for this shell are considered: the languages for description of generative graph and text grammars, as well as the language for context conditions description. These languages allow defining context-dependent graph grammars with a specific syntax. With the use of these means, the kernel of a formal logical system that is connected to the mathematical practice of proofs’ constructing is specified. The model of ontology for representation of the bases of formalized mathematical knowledge and methods of reasoning is described. This model includes the specification of the network structure of various sections of mathematics, as well as the specification of generative graph grammars describing the abstract syntax of the languages for mathematical statements (knowledge) and methods of reasoning representation. The context conditions of these languages are also defined. The common syntactic structure of proofs and the model of ontology of proofs, developed on its basis, are considered. We apply the approach based on context-dependent grammars and ontologies. It consists in the development of an explicitly presented declarative specification of the language for mathematical knowledge and methods of reasoning (the language of a mathematical dialect) representation, as well as a model of proof. The key feature of the language is its extensibility, which is provided by the extensibility of a set of definitions that allow us to introduce new terms to denote the defined concepts and the extensibility of its grammar. The extensibility of grammar is achieved thanks to the means that allow one to describe the syntax of each new construction of the language for mathematical statements’ representation, as well as the context conditions.

Discovery of cell-type specific DNA motif grammar in cis-regulatory elements using random Forest

BackgroundIt has been observed that many transcription factors (TFs) can bind to different genomic loci depending on the cell type in which a TF is expressed in, even though the individual TF usually binds to the same core motif in different cell types. How a TF can bind to the genome in such a highly cell-type specific manner, is a critical research question. One hypothesis is that a TF requires co-binding of different TFs in different cell types. If this is the case, it may be possible to observe different combinations of TF motifs – a motif grammar – located at the TF binding sites in different cell types. In this study, we develop a bioinformatics method to systematically identify DNA motifs in TF binding sites across multiple cell types based on published ChIP-seq data, and address two questions: (1) can we build a machine learning classifier to predict cell-type specificity based on motif combinations alone, and (2) can we extract meaningful cell-type specific motif grammars from this classifier model.ResultsWe present a Random Forest (RF) based approach to build a multi-class classifier to predict the cell-type specificity of a TF binding site given its motif content. We applied this RF classifier to two published ChIP-seq datasets of TF (TCF7L2 and MAX) across multiple cell types. Using cross-validation, we show that motif combinations alone are indeed predictive of cell types. Furthermore, we present a rule mining approach to extract the most discriminatory rules in the RF classifier, thus allowing us to discover the underlying cell-type specific motif grammar.ConclusionsOur bioinformatics analysis supports the hypothesis that combinatorial TF motif patterns are cell-type specific.

Grammatical Evolution for Neural Network Optimization in the Control System Synthesis Problem

Grammatical evolution is a perspective branch of the genetic programming. It uses evolutionary algorithm based search engine and Backus – Naur form of domain-specific language grammar specifications to find symbolic expressions. This paper describes an application of this method to the control function synthesis problem. Feed-forward neural network was used as an approximation of the control function, that depends on the object state variables. Two-stage algorithm is presented: grammatical evolution optimizes neural network structure and genetic algorithm tunes weights. Computational experiments were performed on the simple kinematic model of a two-wheel driving mobile robot. Training was performed on a set of initial conditions. Results show that the proposed algorithm is able to successfully synthesize a control function.

Exploring the implications of integrated reporting on organisational reporting practice

Purpose The purpose of this paper is to examine “how” the adoption of integrated reporting (IR), and the embedded multiple capitals framework, has influenced organisational reporting practice. In particular, the paper examines how companies report and integrate multiple capitals in various organisational reporting channels following the introduction of an “apply or explain” IR requirement in South Africa. Design/methodology/approach Using a qualitative case study approach based on discourse analysis, this paper examines various organisational reports including integrated reports, standalone sustainability reports, websites and other online materials of highly regarded, award-winning, integrated reporters in South Africa over a four-year period (2011-2014), following the introduction of IR requirement. The authors draw five impression management techniques, namely, rhetorical manipulation, thematic manipulation, selectivity, emphasis in visual presentation and performance comparisons to explain disclosure and integration of multiple capitals. Findings The authors find that companies are increasingly conforming to reporting language espoused in existing IR guidelines and multiple capital frameworks over time. For instance, it is found that the research cases have increasingly used specific grammars in existing IR guidelines such as “capitals” and “material” issues, with companies acknowledging the “interdependencies” and “trade-offs” between multiple capitals. Companies have also started to recognise that the capitals are subject to “increases, decreases, and transformations” over time. However, the disclosures are generic, rather than company-specific, and lack substance, often framed in synthetic charming aimed to showcase adoption of IR practice. In addition, the current discourse on multiple capital disclosures is one of the defending, even promoting, organisational reputation, rather than recognising how organisational actions, or inactions, impact multiple capitals. The paper concludes that the emerging IR practice, and the embedded multiple capital framework, has not really improved the substance of organisational reports. Practical implications The results of this study have a number of implications for regulatory authorities, public and private sector organisations as well as academic researchers. For regulatory authorities, the results inform relevant regulatory authorities how IR practice is taking shape over time, particularly within the context of a regulatory setting. Second, the empirical analyses, which focused on highly regarded, award-wining, integrated reporters, draw the attention of regulatory bodies as well as users of corporate reports to concerns related to a growing number of rating agencies of organisational reports. Finally, for academic researchers, the theoretical implications of this study is that, given the pervasive use of multiple impression management techniques in various organisational reports, the authors support the notion that corporate disclosure practices should be examined through the lens of multiple theoretical perspectives to enhance our understanding of the nature of organisational reporting practice. Originality/value This study provides a more focused preliminary empirical account of the implications of IR practice, and the embedded multiple capital frameworks, on the quality of organisational reporting practice following the adoption of mandatory IR requirement in South Africa.

Vehicle detection grammars with partial occlusion handling for traffic surveillance

Traffic surveillance is an important topic in intelligent transportation systems (ITS). Robust vehicle detection is one challenging problem for complex traffic surveillance. In this paper, we propose an efficient vehicle detection method by designing vehicle detection grammars and handling partial occlusion. The grammar model is implemented by novel detection grammars, including structure, deformation and pairwise SVM grammars. First, the vehicle is divided into its constitute parts, called semantic parts, which can represent the vehicle effectively. To increase the robustness of part detection, the semantic parts are represented by their detection score maps. The semantic parts are further divided into sub-parts automatically. The two-layer division of the vehicle is modeled into a grammar model. Then, the grammar model is trained by a designed training procedure to get ideal grammar parameters, including appearance models and grammar productions. After that, vehicle detection is executed by a designed detection procedure with respect to the grammar model. Finally, the issue of vehicle occlusion is handled by designing and training specific grammars. The strategy adopted by our method is first to divide the vehicle into the semantic parts and sub-parts, then to train the grammar productions for semantic parts and sub-parts by introducing novel pairwise SVM grammars and finally to detect the vehicle by applying the trained grammars. Experiments in practical urban scenarios are carried out for complex traffic surveillance. It can be shown that our method adapts to partial occlusion and various challenging cases.

Metacognizione linguistica e insegnamento universitario delle lingue

This paper presents three aspects of the foreign language curriculum: (i) the need for a scientifically grounded reflection on the language faculty as well as the language specific grammars of the mother tongue(s) and the foreign language(s), (ii) the important role played by “less spoken/less taught languages” in higher education curricula, (iii) the support of new technologies to implement the two previous aspects. Starting from the results of recent neurolinguistic experiments suggesting that the language faculty is activated also by explicit instruction, and from the well-established fact that metacognition supports learning, I propose that explicit instruction based on recent advances in theoretical linguistics should replace “traditional” grammars. In this perspective, I address the question of multilingualism and suggest that despite appearances, less spoken/less taught languages, often called “minor languages”, play a crucial role in the foreign language curriculum. Finally, I illustrate certain technical and operative problems in teaching languages with the new technologies. In this context, I review some of the lessons learned in the COVCELL project (Cohort Oriented Virtual Campus for Effective Language Learning) run in 2005-2007.

Staged parser combinators for efficient data processing

Parsers are ubiquitous in computing, and many applications depend on their performance for decoding data efficiently. Parser combinators are an intuitive tool for writing parsers: tight integration with the host language enables grammar specifications to be interleaved with processing of parse results. Unfortunately, parser combinators are typically slow due to the high overhead of the host language abstraction mechanisms that enable composition. We present a technique for eliminating such overhead. We use staging, a form of runtime code generation, to dissociate input parsing from parser composition, and eliminate intermediate data structures and computations associated with parser composition at staging time. A key challenge is to maintain support for input dependent grammars, which have no clear stage distinction. Our approach applies to top-down recursive-descent parsers as well as bottom-up non-deterministic parsers with key applications in dynamic programming on sequences, where we auto-generate code for parallel hardware. We achieve performance comparable to specialized, hand-written parsers.

XMG: eXtensible MetaGrammar

In this article, we introduce eXtensible MetaGrammar (XMG), a framework for specifying tree-based grammars such as Feature-Based Lexicalized Tree-Adjoining Grammars (FB-LTAG) and Interaction Grammars (IG). We argue that XMG displays three features that facilitate both grammar writing and a fast prototyping of tree-based grammars. Firstly, XMG is fully declarative. For instance, it permits a declarative treatment of diathesis that markedly departs from the procedural lexical rules often used to specify tree-based grammars. Secondly, the XMG language has a high notational expressivity in that it supports multiple linguistic dimensions, inheritance, and a sophisticated treatment of identifiers. Thirdly, XMG is extensible in that its computational architecture facilitates the extension to other linguistic formalisms. We explain how this architecture naturally supports the design of three linguistic formalisms, namely, FB-LTAG, IG, and Multi-Component Tree-Adjoining Grammar (MC-TAG). We further show how it permits a straightforward integration of additional mechanisms such as linguistic and formal principles. To further illustrate the declarativity, notational expressivity, and extensibility of XMG, we describe the methodology used to specify an FB-LTAG for French augmented with a unification-based compositional semantics. This illustrates both how XMG facilitates the modeling of the tree fragment hierarchies required to specify tree-based grammars and of a syntax/semantics interface between semantic representations and syntactic trees. Finally, we briefly report on several grammars for French, English, and German that were implemented using XMG and compare XMG with other existing grammar specification frameworks for tree-based grammars.

Vowel Harmony and Universality in Hebrew Acquisition

Te role of universals versus language specific grammars during acquisition is at the focal point of this study. A corpus-based investigation of two children’s harmony patterns during acquisition is carried out. It is shown that although Hebrew does not have a productive harmony grammar, there is nevertheless a considerable amount of vowel harmony in the children’s productions, suggesting speakers have a universal predisposition for such patterns. Te children start out at roughly the same point, the ultimate goal being determined by the ambient language. Te developmental paths, however, are individual. One child shows a preference for segmental considerations in determining harmony patterns, while the other shows a preference for prosodic considerations. Both children, however, gradually modify their grammars, presented herein within an Optimality Teoretic framework, ultimately reaching the same goal, an adult grammar without active vowel harmony.

Building Sequence Span Attribute Model and Example Analysis

∗ Corresponding Author: shisungu@126.com Abstract-Parallel parsing is one of the key technologies of parallel system. Grammatical character affects the efficiency of parallel parsing and degree of difficulty of implement. Existing methods have problems as follows: Parallelism of grammar that adapt different data object is difference, if there is a large difference between considering attribute and analysis object structure, then affect efficiency. Specific grammar parallel parsing is systematically studied. Scanning parallel parsing methods from the new angle of sequence span after word lattice distortion. Considering sequence span attribute between some specific grammars makes parsing without changing structure and data of CYK table based on the structure of word lattice CYK initialization table; In passing item of the form [i , j , B η·] in parallel parsing item table memory structure in circle structure is adopted chain breaking technology; When indexed optimize analysis, the key algorithms of increasing the feasibility and validity of sequence span attribute、reusing parsing tree、calculating of d space function and node separating are further studied, then unification and optimize effect between analysis table middle structure and data object structure is reached. New algorithm and implement strategy of parallel parsing of specific grammar is proposed.

Creating Specific Grammars with Generic Grammars: Towards Flexible Urban Design

The aim of the City Induction project is to develop an urban design tool consisting of 3 parts: an urban programme formulation module, a generation module and an evaluation module. The generation module relies on a very generic Urban Grammar composed of several generic grammars called Urban Induction Patterns (UIPs) corresponding to typical urban design moves. Specific grammars, such as the analytical grammars inferred from our case studies, can be obtained by defining specific arrangements of Urban Induction Patterns and specific constraints on the rule parameters. We show that variations on the UIP arrangements or rule parameters can provide design variations and specific grammars to be synthesised through design exploration. It is therefore seen as a process for synthesizing a specific design grammar within the field of urban design and has two main features: (1) it allows for the synthesis of specific grammars during the design process and (2) it allows for the customization of a personal design language within the broad scope of the generic grammar. A formal definition of Urban Grammars is presented and its application in the production of customized urban designs is demonstrated by customizing design languages using a specific compound grammar defined by a specific arrangement of generic grammars.