Learning of Structurally Unambiguous Probabilistic Grammars [PDF]
The problem of identifying a probabilistic context free grammar has two aspects: the first is determining the grammar's topology (the rules of the grammar) and the second is estimating probabilistic weights for each rule. Given the hardness results for learning context-free grammars in general, and probabilistic grammars in particular, most of the ...
arxiv +1 more source
The rule-based formal language of "stochastic sensitive growth grammars" was designed to describe algorithmically the changing morphology of forest trees during their lifetime under the impact of endogenous and exogenous factors, and to generate 3-D ...
Kurth, Winfried, Sloboda, Branislav
doaj +1 more source
Event-driven grammars: Relating abstract and concrete levels of visual languages [PDF]
The final publication is available at Springer via http://dx.doi.org/10.1007/s10270-007-0051-2In this work we introduce event-driven grammars, a kind of graph grammars that are especially suited for visual modelling environments generated by meta ...
Guerra, Esther, Lara, Juan de
core +2 more sources
Longitudinal effects of task performance and self-concept on preadolescent EFL learners’ causal attributions of grammar success and failure [PDF]
Learners’ academic self-concepts and attributions have been widely evidenced to substantially regulate their educational development. Developmentally, they will not only operate in a mutually reinforcing manner.
Faber, Günter
core +3 more sources
Exploring the Local Grammar of Evaluation: The Case of Adjectival Patterns in American and Italian Judicial Discourse [PDF]
Based on a 2-million word bilingual comparable corpus of American and Italian judgments, this paper tests the applicability of a local grammar to study evaluative phraseology in judicial discourse in English and Italian. In particular, the study compares
Barnbrook+57 more
core +3 more sources
Using Regular Languages to Explore the Representational Capacity of Recurrent Neural Architectures [PDF]
The presence of Long Distance Dependencies (LDDs) in sequential data poses significant challenges for computational models. Various recurrent neural architectures have been designed to mitigate this issue.
AS Reber+13 more
core +3 more sources
Expressive Power of Hypergraph Lambek Grammars [PDF]
Hypergraph Lambek grammars (HL-grammars) is a novel logical approach to generating graph languages based on the hypergraph Lambek calculus. In this paper, we establish a precise relation between HL-grammars and hypergraph grammars based on the double pushout (DPO) approach: we prove that HL-grammars generate the same class of languages as DPO grammars ...
arxiv
The source ambiguity problem: Distinguishing the effects of grammar and processing on acceptability judgments [PDF]
Judgments of linguistic unacceptability may theoretically arise from either grammatical deviance or significant processing difficulty. Acceptability data are thus naturally ambiguous in theories that explicitly distinguish formal and functional ...
Anderson J. R.+58 more
core +1 more source
Arabic language-learning strategy preferences among undergraduate students [PDF]
This study elicited Arabic students’ perceptions regarding their language-learning strategy preferences (LLSPs). A sample of 120 undergraduate Arabic students participated. Data were collected through a questionnaire and interviews.
Brosh, Hezi Y.
core +2 more sources
Reenactment: An embodied cognition approach to meaning and linguistic content [PDF]
A central finding in experimental research identified with Embodied Cognition (EC) is that understanding actions involves their embodied simulation, i.e. executing some processes involved in performing these actions.
Sandler, Dr. Sergeiy
core +1 more source