Results 81 to 90 of about 143,606 (204)

Bonding Grammars [PDF]

open access: yes
We introduce bonding grammars, a graph grammar formalism developed to model DNA computation by means of graph transformations. It is a modification of fusion grammars introduced by Kreowski, Kuske and Lye in 2017. Bonding is a graph transformation that consists of merging two hyperedges into a single larger one.
arxiv   +1 more source

Putting an End to the Handcuffs of the Periodic Table: Using Atomic Features for Predicting Detonation Velocity

open access: yesPropellants, Explosives, Pyrotechnics, EarlyView.
The graphical abstract depicts a brown dachshund with a pink mohawk and a pink lab coat, spray painting “Down with the Periodic Table RoseAtoms” on a brick wall featuring the periodic table. ABSTRACT In this study, a Gaussian process regressor is used to predict the detonation velocity.
Sabrina Wahler
wiley   +1 more source

Elementos de descrición dos adverbios fixos do catalán no dominio culinario [PDF]

open access: yesCadernos de Fraseoloxía Galega, 2009
Adoito, a descrición de linguas específicas está limitada á terminoloxía nominal e a importancia que acadan os adverbios é, ás veces, rexeitada por irrelevante, se non ignorada de vez. Presentamos o dicionario de expresións adverbiais fixas do catalán,
Dolors Català Guitart
doaj  

A Lexico-syntactic Analysis of Usages in Nigerian English: A Validation of its culturally Determined Context of Situation

open access: yesInterdisciplinary Journal of Education Research, 2020
This study aimed at validating Nigerian English as a language borne out of the culturally determined context of the situation of the Nigerian English speaker.
Ayodeji Olumide Ogunjobi   +1 more
doaj  

Guided Grammar Convergence [PDF]

open access: yesarXiv, 2015
Relating formal grammars is a hard problem that balances between language equivalence (which is known to be undecidable) and grammar identity (which is trivial). In this paper, we investigate several milestones between those two extremes and propose a methodology for inconsistency management in grammar engineering.
arxiv  

“It's Just a Hot Mess”: Supporting Teacher Praxis to Challenge Barriers for Multilingual Learners

open access: yesScience Education, EarlyView.
ABSTRACT This paper examines a professional learning (PL) program for upper elementary teachers focused on developing instructional practices to support multilingual learners (MLLs) in science. The PL sought to support teachers' praxis, which we describe as their sense of agency to critically analyze and take action against barriers to MLLs ...
Emily V. Reigh   +3 more
wiley   +1 more source

Reduction, fusion and raising in English and Spanish

open access: yesRevista Alicantina de Estudios Ingleses, 1991
The reduction of clauses, together with the fusion of structures, is a source of syntactic problems especially isomorphism and structural ambiguity both in English and Spanish. Raising and Equi-NP Deletion are the processes responsible for them.
Garrudo Carabias, Francisco
doaj   +1 more source

Exploiting auxiliary distributions in stochastic unification-based grammars [PDF]

open access: yesProc 1st NAACL, 2000, pages 154-161, 2000
This paper describes a method for estimating conditional probability distributions over the parses of ``unification-based'' grammars which can utilize auxiliary distributions that are estimated by other means. We show how this can be used to incorporate information about lexical selectional preferences gathered from other sources into Stochastic ...
arxiv  

Designing “Korean” Kimchi: Speculative Configuration of Distance and Commodity Value in the Chinese Kimchi Industry

open access: yesEconomic Anthropology, EarlyView.
ABSTRACT In the Chinese kimchi industry, manufacturers employ product names, photographs, and logistical strategies to promote their kimchi's “Koreanness.” So, what makes their kimchi “Korean,” and how does its Koreanness formulate kimchi's commodity value?
Heangjin Park
wiley   +1 more source

Multiple Context-Free Tree Grammars: Lexicalization and Characterization [PDF]

open access: yesarXiv, 2017
Multiple (simple) context-free tree grammars are investigated, where "simple" means "linear and nondeleting". Every multiple context-free tree grammar that is finitely ambiguous can be lexicalized; i.e., it can be transformed into an equivalent one (generating the same tree language) in which each rule of the grammar contains a lexical symbol.
arxiv  

Home - About - Disclaimer - Privacy