Open Access
The Simple Language Generator: Encoding Complex Languages With Simple Grammars
Douglas L. T. Rohde
- 01 Sep 1999
TL;DR: The design and use of the Simple Language Generator (SLG) is introduced, which allows the user to construct small but interesting stochastic context free languages with relative ease.
read more
Abstract: : This paper introduces the design and use of the Simple Language Generator (SLG). SLG allows the user to construct small but interesting stochastic context free languages with relative ease. Although context free grammars are convenient for representing natural language syntax, they do not easily support the semantic and pragmatic constraints that make certain combinations of words or structures more likely than others. Context free grammars for languages involving many interacting constraints can become extremely complex and cannot reasonably be written by hand. SLG allows the basic syntax of a grammar to be specified in context free form and constraints to be applied atop this framework in a relatively natural fashion. This combination of grammar and constraints is then converted into a standard stochastic context free grammar for use in generating sentences or in making context dependent likelihood predictions of the sequence of words in a sentence.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Consequences of the Serial Nature of Linguistic Input for Sentenial Complexity
Daniel Grodner,Edward Gibson +1 more
TL;DR: The authors showed that dependency distance is a fundamental determinant of reading complexity in unambiguous constructions in English, and that the difficulty associated with integrating a new input item is heavily determined by the amount of lexical material intervening between the input item and the site of its target dependents.
404
Language input and semantic categories: a relation between cognition and early word learning.
TL;DR: In three computational simulations, improvements in category structure, are tightly correlated with subsequent improvements in word learning ability even when the nature of the input remains the same over time.
Constructing semantic representations from a gradually-changing representation of temporal context.
TL;DR: The predictive temporal context model (pTCM) uses the same definition of temporal context to generate semantic memory representations and may prove to be part of a general model of declarative memory.
62
The Acquisition of Anaphora by Simple Recurrent Networks
TL;DR: This article applies Simple Recurrent Networks to the task of assigning an interpretation to reflexive and pronominal anaphora, a task that demands more refined sensitivity to syntactic structure than has been previously explored.
23
Processing grammatical and ungrammatical center embeddings in English and German: A computational model
Felix Engelmann,Shravan Vasishth,A Howes,D Peebles,R P Cooper +4 more
- 01 Jan 2009
TL;DR: It is argued that the grammaticality illusion emerges as a function of experience with language-specific structures, not working memory constraints as argued for in Gibson and Thomas (1999).
References
•Book
Introduction to Automata Theory, Languages, and Computation
John E. Hopcroft,Rajeev Motwani,Rotwani,Jeffrey D. Ullman +3 more
- 01 Jan 1979
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
14.5K
Toward a connectionist model of recursion in human linguistic performance
TL;DR: This work suggests a novel explanation of people's limited recursive performance, without assuming the existence of a mentally represented competence grammar allowing unbounded recursion.
389