Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report
Lierler, Yuliya
2011-01-01
Combinatory categorial grammar (CCG) is a grammar formalism used for natural language parsing. CCG assigns structured lexical categories to words and uses a small set of combinatory rules to combine these categories to parse a sentence. In this work we propose and implement a new approach to CCG parsing that relies on a prominent knowledge representation formalism, answer set programming (ASP) - a declarative programming paradigm. We formulate the task of CCG parsing as a planning problem and use an ASP computational tool to compute solutions that correspond to valid parses. Compared to other approaches, there is no need to implement a specific parsing algorithm using such a declarative method. Our approach aims at producing all semantically distinct parse trees for a given sentence. From this goal, normalization and efficiency issues arise, and we deal with them by combining and extending existing strategies. We have implemented a CCG parsing tool kit - AspCcgTk - that uses ASP as its main computational mean...
Amblard, Maxime; Retoré, Christian
2010-01-01
We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called categorial minimalist grammars. Thereafter we briefly present \\lambda\\mu-DRT (Discourse Representation Theory) an extension of \\lambda-DRT (compositional DRT) in the framework of \\lambda\\mu calculus: it avoids type raising and derives different readings from a single semantic representation, in a setting which follows discourse structure. We run a complete example which illustrates the various structures and rules that are needed to derive a semantic representation from the categorial view of a transformational syntactic analysis.
Constraint-Based Categorial Grammar
Bouma, G; Bouma, Gosse; Noord, Gertjan van
1994-01-01
We propose a generalization of Categorial Grammar in which lexical categories are defined by means of recursive constraints. In particular, the introduction of relational constraints allows one to capture the effects of (recursive) lexical rules in a computationally attractive manner. We illustrate the linguistic merits of the new approach by showing how it accounts for the syntax of Dutch cross-serial dependencies and the position and scope of adjuncts in such constructions. Delayed evaluation is used to process grammars containing recursive constraints.
Parsing with Structure-Preserving Categorial Grammars
Capelletti, M.
2007-01-01
This book is a study of the logical and computational properties of structure-preserving categorial grammars. The first part of the book presents chart-parsers for non-associative categorial grammars in the style of Ajdukiewicz and Bar-Hillel. These are proposed in Chapter 3 as deductive parsers, th
LexGram - a practical categorial grammar formalism -
1995-01-01
We present the LexGram system, an amalgam of (Lambek) categorial grammar and Head Driven Phrase Structure Grammar (HPSG), and show that the grammar formalism it implements is a well-structured and useful tool for actual grammar development.
Ontological semantics in modified categorial grammar
DEFF Research Database (Denmark)
Szymczak, Bartlomiej Antoni
2009-01-01
Categorial Grammar is a well established tool for describing natural language semantics. In the current paper we discuss some of its drawbacks and how it could be extended to overcome them. We use the extended version for deriving ontological semantics from text. A proof-of-concept implementation...
On Anaphora and the Binding Principles in Categorial Grammar
Morrill, Glyn; Valentín, Oriol
In type logical categorial grammar the analysis of an expression is a resource-conscious proof. Anaphora represents a particular challenge to this approach in that the antecedent resource is multiplied in the semantics. This duplication, which corresponds logically to the structural rule of contraction, may be treated lexically or syntactically. Furthermore, anaphora is subject to constraints, which Chomsky (1981) formulated as Binding Principles A, B, and C. In this paper we consider English anaphora in categorial grammar including reference to the binding principles. We invoke displacement calculus, modal categorial calculus, categorial calculus with limited contraction, and entertain addition of negation as failure.
A Compositional Treatment of Polysemous Arguments in Categorial Grammar
Mineur, A M; Mineur, Anne-Marie; Buitelaar, Paul
1995-01-01
We discuss an extension of the standard logical rules (functional application and abstraction) in Categorial Grammar (CG), in order to deal with some specific cases of polysemy. We borrow from Generative Lexicon theory which proposes the mechanism of {\\em coercion}, next to a rich nominal lexical semantic structure called {\\em qualia structure}. In a previous paper we introduced coercion into the framework of {\\em sign-based} Categorial Grammar and investigated its impact on traditional Fregean compositionality. In this paper we will elaborate on this idea, mostly working towards the introduction of a new semantic dimension. Where in current versions of sign-based Categorial Grammar only two representations are derived: a prosodic one (form) and a logical one (modelling), here we introduce also a more detaled representation of the lexical semantics. This extra knowledge will serve to account for linguistic phenomena like {\\em metonymy\\/}.
A Note on the Complexity of Abstract Categorial Grammars
Salvati, Sylvain
This paper presents a precise and detailed study of the complexities of the membership and the universal membership problems for Abstract Categorial Grammars (ACG). ACGs have been introduced by Philippe de Groote in [2] as a simplification over categorial grammars which reduces the number of necessary primitives involved in the definition of the formalism. Thus in ACGs, every structure is represented with the help of the linear λ-calculus and the languages defined by means of ACGs are sets of linear λ-terms. The problem under investigation has already been studied in [7], but we give here some more precise results with some arguably simpler proofs. We use the same classification of the grammars in terms of the order of the lexicon and of the order of abstract language.
Amblard, Maxime
2011-01-01
Stabler proposes an implementation of the Chomskyan Minimalist Program, Chomsky 95 with Minimalist Grammars - MG, Stabler 97. This framework inherits a long linguistic tradition. But the semantic calculus is more easily added if one uses the Curry-Howard isomorphism. Minimalist Categorial Grammars - MCG, based on an extension of the Lambek calculus, the mixed logic, were introduced to provide a theoretically-motivated syntax-semantics interface, Amblard 07. In this article, we give full definitions of MG with algebraic tree descriptions and of MCG, and take the first steps towards giving a proof of inclusion of their generated languages.
Kubota, Yusuke
2010-01-01
This dissertation proposes a theory of categorial grammar called Multi-Modal Categorial Grammar with Structured Phonology. The central feature that distinguishes this theory from the majority of contemporary syntactic theories is that it decouples (without completely segregating) two aspects of syntax--hierarchical organization (reflecting…
Costa Florêncio, C.; Fernau, H.
2012-01-01
In Kanazawa (1998), the learnability of several parameterized families of categorial grammar classes was studied. These classes were shown to be learnable in the technical sense of identifiability in the limit from positive data. They are defined in terms of bounds on parameters of the grammars whic
Institute of Scientific and Technical Information of China (English)
JeanetteDecarrico; DianeLarsen-Freeman
2004-01-01
Previous sections have reviewed issues in describing grammar, issues that were mainly concerned with what to describe, how to describe it and how to account for differing approaches and their implications in terms of theory and pedagogy in applied linguistics. But however precise and thorough researchers may attempt to be in addressing these issues, there are certain limitations to descriptions of grammar given in isolation from all other parts of the language system
Institute of Scientific and Technical Information of China (English)
JeanetteDeCarrico; DianeLarsen-Freeman
2004-01-01
When it comes to definitions of grammar,confusion abounds.One problem is that the word grammar means different things to different people.For many,the term sugges tsa list of do's and don't's,rules that tell us we should say It is I,not It is me,that we should not say ain't,or that weshould avoid ending a sentence with a preposition.For oth
Institute of Scientific and Technical Information of China (English)
刘辉
2007-01-01
Instead of being a boring subject, grammar is in fact one of the most exciting, creative, relevant subjects. It is sometimes described as the skeleton of a language, but it is much more than bones. It is the language's heartbeat, for without grammar; there can be no meaningful or effective communication. And grammar has different definitions and categories according to different contexts. By first reviewing the past linguists, especially those grammarians and their research, the paper makes some comparisons between some categories of grammar and puts forward that there is no 'good' or 'bad' grammar but knowing grammar or knowing about grammar really has a close relationship with effective communication.
A Categorial Framework for Composition in Multiple Linguistic Domains
Bozsahin, C; Bozsahin, Cem; Gocmen, Elvan
1995-01-01
This paper describes a computational framework for a grammar architecture in which different linguistic domains such as morphology, syntax, and semantics are treated not as separate components but compositional domains. Word and phrase formation are modeled as uniform processes contributing to the derivation of the semantic form. The morpheme, as well as the lexeme, has lexical representation in the form of semantic content, tactical constraints, and phonological realization. The motivation for this work is to handle morphology-syntax interaction (e.g., valency change in causatives, subcategorization imposed by case-marking affixes) in an incremental way. The model is based on Combinatory Categorial Grammars.
生成语法中的四种空语类%On the Four Kinds of Empty Category in Generative Grammar
Institute of Scientific and Technical Information of China (English)
蔡焱
2012-01-01
空语类是生成语法中的一个重要概念。研究表明，空语类的存在具有心理现实性，因而可以认为它们是心智内在的反映，深入了解其性质可以揭示语言的语义表征和句法结构的特点。到目前为止，原则与参数理论区分了四种空语类，分别是NP语迹、wh语迹（或者“变项”）、PRO和pro。探索这四种空语类可以使语义、句法、心理方面的许多语言现象得以合理解释，有助于揭示并证明语言获得的内在本质，从而为普遍语法提供有力证据。%Empty Category is an important concept in Generative Grammar. So far, four categories have been distinguished, namely, NP-trace, wh-trace, PRO, and pro. It has been proven that the intro- duction of empty categories in syntactic analysis helps reveal the semantic and syntactic representations and hence reflect the innate nature of language acquisition.
Knowing Chinese character grammar.
Myers, James
2016-02-01
Chinese character structure has often been described as representing a kind of grammar, but the notion of character grammar has hardly been explored. Patterns in character element reduplication are particularly grammar-like, displaying discrete combinatoriality, binarity, phonology-like final prominence, and potentially the need for symbolic rules (X→XX). To test knowledge of these patterns, Chinese readers were asked to judge the acceptability of fake characters varying both in grammaticality (obeying or violating reduplication constraints) and in lexicality (of the reduplicative configurations). While lexical knowledge was important (lexicality improved acceptability and grammatical configurations were accepted more quickly when also lexical), grammatical knowledge was important as well, with grammaticality improving acceptability equally for lexical and nonlexical configurations. Acceptability was also higher for more frequent reduplicative elements, suggesting that the reduplicative configurations were decomposed. Chinese characters present an as-yet untapped resource for exploring fundamental questions about the nature of the human capacity for grammar.
Crawford, William J.
2013-01-01
Grammar is a component in all language skills: reading, writing, speaking, and listening. Teachers need to know rules of grammar (teacher knowledge) as well as techniques that help students use grammar effectively and effortlessly (teaching knowledge). Using reflective practice to help teachers become comfortable with teaching grammar, this…
Crawford, William J.
2013-01-01
Grammar is a component in all language skills: reading, writing, speaking, and listening. Teachers need to know rules of grammar (teacher knowledge) as well as techniques that help students use grammar effectively and effortlessly (teaching knowledge). Using reflective practice to help teachers become comfortable with teaching grammar, this…
DEFF Research Database (Denmark)
Christiansen, Henning
. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under...... integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming....
DEFF Research Database (Denmark)
Christiansen, Henning
2005-01-01
. The formalism extends previous logic programming based grammars with a form of context-sensitive rules and the possibility to include extra-grammatical hypotheses in both head and body of grammar rules. Among the applications are straightforward implementations of Assumption Grammars and abduction under...... integrity constraints for language analysis. CHR grammars appear as a powerful tool for specification and implementation of language processors and may be proposed as a new standard for bottom-up grammars in logic programming....
DEFF Research Database (Denmark)
Nielsen, John
1994-01-01
An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds.......An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds....
DEFF Research Database (Denmark)
Nielsen, John
1994-01-01
An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds.......An overview of combinatorial chemistry is presented. Combinatorial chemistry, sometimes referred to as `irrational drug design,' involves the generation of molecular diversity. The resulting chemical library is then screened for biologically active compounds....
A Construction Grammar for the Classroom
Holme, Randal
2010-01-01
Construction grammars (Lakoff, Women, fire and dangerous things: What categories reveal about the Mind, University of Chicago Press, 1987; Langacker, Foundations of cognitive grammar: Theoretical pre-requisites, Stanford University Press, 1987; Croft, Radical construction grammar: Syntactic theory in typological perspective, Oxford University…
A Construction Grammar for the Classroom
Holme, Randal
2010-01-01
Construction grammars (Lakoff, Women, fire and dangerous things: What categories reveal about the Mind, University of Chicago Press, 1987; Langacker, Foundations of cognitive grammar: Theoretical pre-requisites, Stanford University Press, 1987; Croft, Radical construction grammar: Syntactic theory in typological perspective, Oxford University…
Adams, Karen
2015-01-01
In this article Karen Adams demonstrates how to incorporate group grammar techniques into a classroom activity. In the activity, students practice using the target grammar to do something they naturally enjoy: learning about each other.
DEFF Research Database (Denmark)
Christiansen, Henning
2005-01-01
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...
DEFF Research Database (Denmark)
Christiansen, Henning
A grammar formalism based upon CHR is proposed analogously to the way Definite Clause Grammars are defined and implemented on top of Prolog. These grammars execute as robust bottom-up parsers with an inherent treatment of ambiguity and a high flexibility to model various linguistic phenomena...
English Grammar Comparison:Descriptive Grammar vs. Prescriptive Grammar
Institute of Scientific and Technical Information of China (English)
ZHANG Jing-wen; LI Yi-an
2015-01-01
English grammar is thought as one of the most important parts in both language learning and teaching. While few peo⁃ple know there is more than one kind of English grammar. This essay provides the features and comparison between two com⁃monly used English grammar, namely descriptive grammar and prescriptive grammar, and assist English teachers to explore further in grammar teaching.
Lovegren, Jesse Stuart James
2013-01-01
This dissertation is an attempt to state what is known at present about the grammar of Mungbam (ISO 693-3 [mij]). Mungbam is a Niger-Congo language spoken in the Northwest Region of Cameroon. The dissertation is a descriptive grammar, covering the phonetics, phonology morphology and syntax of the language. Source data are texts and elicited data…
Lovegren, Jesse Stuart James
2013-01-01
This dissertation is an attempt to state what is known at present about the grammar of Mungbam (ISO 693-3 [mij]). Mungbam is a Niger-Congo language spoken in the Northwest Region of Cameroon. The dissertation is a descriptive grammar, covering the phonetics, phonology morphology and syntax of the language. Source data are texts and elicited data…
Institute of Scientific and Technical Information of China (English)
Michael Swan
2008-01-01
@@ The trouble with teaching grammar is that we are never quite sure whether it works or not:its effects are uncertain and hard to assess.Michael Swan looks at grammar teaching and the carry-over to spontaneous production by students.
Institute of Scientific and Technical Information of China (English)
王楠
2012-01-01
This paper describes the nature of grammar as "universalness". The universal grammar indicates that all the languages in the world have identical grammar. This is discussed from three aspects, which gives insight into grammar acquisition.
DEFF Research Database (Denmark)
1997-01-01
The invention provides a method for the production of a combinatorial library of compound of general formula (I) using solid phase methodologies. The cleavage of the array of immobilised compounds of the phthalimido type from the solid support matrix is accomplished by using an array of dinucleop......The invention provides a method for the production of a combinatorial library of compound of general formula (I) using solid phase methodologies. The cleavage of the array of immobilised compounds of the phthalimido type from the solid support matrix is accomplished by using an array...... of dinucleophiles, e.g. hydrazines (hydrazinolysis) or N-hydroxylamines, whereby a combinatorial dimension is introduced in the cleavage step. The invention also provides a compound library....
Chvátal, V
2011-01-01
This book is a collection of six articles arising from the meeting of the NATO Advanced Study Institute (ASI) "Combinatorial Optimization: Methods and Applications," which was held at the University of Montreal in June 2006. This ASI consisted of seven series of five one-hour lectures and one series of four one-hour lectures. It was attended by some sixty students of graduate or postdoctoral level from fifteen countries worldwide. It includes topics such as: integer and mixed integer programming, facility location, branching on split disjunctions, convexity in combinatorial optimizat
Research into Practice: Grammar Learning and Teaching
Larsen-Freeman, Diane
2015-01-01
This selective review of the second language acquisition and applied linguistics research literature on grammar learning and teaching falls into three categories: where research has had little impact (the non-interface position), modest impact (form-focused instruction), and where it potentially can have a large impact (reconceiving grammar).…
Research into Practice: Grammar Learning and Teaching
Larsen-Freeman, Diane
2015-01-01
This selective review of the second language acquisition and applied linguistics research literature on grammar learning and teaching falls into three categories: where research has had little impact (the non-interface position), modest impact (form-focused instruction), and where it potentially can have a large impact (reconceiving grammar).…
Combinatorial Properties of Finite Models
Hubicka, Jan
2010-01-01
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite presentation). Extending classical work of Rado (for the random graph), we find a finite presentation for each of the following classes: homogeneous undirected graphs, homogeneous tournaments and homogeneous partially ordered sets. We also give a finite presentation of the rational Urysohn metric space and some homogeneous directed graphs. We survey well known structures that are finitely presented. We focus on structures endowed with natural partial orders and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism orders for various combinatorial objects. We give a new combinatorial proof of the existence of embedding-universal objects for homomorphism-defined...
A Review of the Development of Systemic-Functional Grammar
Institute of Scientific and Technical Information of China (English)
张晶
2014-01-01
50 years has seen Systemic-Functional Grammar(SFG)growing into its prosperity. With the efforts of Halliday and many other linguists, SFG has developed from Scale and Category Grammar to Systemic Grammar and then to Functional Gram-mar. The development of this general linguistic theory’s features and framework is the main focus of this study. SFG views lan-guage as a social semiotic resource people use to express meanings in context.
Dieleman, Peter; Waitukaitis, Scott; van Hecke, Martin
To design rigidly foldable quadrilateral meshes one generally needs to solve a complicated set of constraints. Here we present a systematic, combinatorial approach to create rigidly foldable quadrilateral meshes with a limited number of different vertices. The number of discrete, 1 degree-of-freedom folding branches for some of these meshes scales exponentially with the number of vertices on the edge, whilst other meshes generated this way only have two discrete folding branches, regardless of mesh size. We show how these two different behaviours both emerge from the two folding branches present in a single generic 4-vertex. Furthermore, we model generic 4-vertices as a spherical linkage and exploit a previously overlooked symmetry to create non-developable origami patterns using the same combinatorial framework.
Universal Grammar Is a Universal Grammar
Casares, Ramón
2014-01-01
Is Universal Grammar a universal grammar? From Chomsky's hierarchy we deduce that for each grammar there is a Turing machine, and conversely. Following this equivalence, it is immediate to conclude that a universal Turing machine is equivalent to a universal grammar. Meanwhile, in linguistics, Universal Grammar is the human brain circuitry that implements the faculty of language. So the definitive answer is achieved only when we show that the human brain is Turing complete, and that language ...
Berry, Roger
2015-01-01
This paper looks at the continued survival of "myths" about English grammar, for example, the statement that in negative and interrogative sentences "any" should be used instead of "some". It is based on a survey of 195 Hong Kong students majoring in English, in five different cohorts, which found that such myths are…
Normal ordering problem and the extensions of the Stirling grammar
Ma, S.-M.; Mansour, T.; Schork, M.
2014-04-01
The purpose of this paper is to investigate the connection between context-free grammars and normal ordered problem, and then to explore various extensions of the Stirling grammar. We present grammatical characterizations of several well known combinatorial sequences, including the generalized Stirling numbers of the second kind related to the normal ordered problem and the r-Dowling polynomials. Also, possible avenues for future research are described.
Institute of Scientific and Technical Information of China (English)
张松懋
1994-01-01
Forest grammar,a new type of high-dimensional grammar,is proposed in this paper,of which both the left and the right parts of every production are concatenations of tree structures.A classification of forest grammar is studied,especially,a subclass of the forest grammar,i.e.the context-sensitive forest grammar,and one of its subclasses is defined,called the weak precedence forest grammar.
Lexicalization and Grammar Development
Srinivas, B; Doran, C F; Becker, T; Egedi, Dania; Doran, Christy; Becker, Tilman
1994-01-01
In this paper we present a fully lexicalized grammar formalism as a particularly attractive framework for the specification of natural language grammars. We discuss in detail Feature-based, Lexicalized Tree Adjoining Grammars (FB-LTAGs), a representative of the class of lexicalized grammars. We illustrate the advantages of lexicalized grammars in various contexts of natural language processing, ranging from wide-coverage grammar development to parsing and machine translation. We also present a method for compact and efficient representation of lexicalized trees.
Evolution of Universal Grammar
Nowak, Martin A.; Komarova, Natalia L.; Niyogi, Partha
2001-01-01
Universal grammar specifies the mechanism of language acquisition. It determines the range of grammatical hypothesis that children entertain during language learning and the procedure they use for evaluating input sentences. How universal grammar arose is a major challenge for evolutionary biology. We present a mathematical framework for the evolutionary dynamics of grammar learning. The central result is a coherence threshold, which specifies the condition for a universal grammar to induce coherent communication within a population. We study selection of grammars within the same universal grammar and competition between different universal grammars. We calculate the condition under which natural selection favors the emergence of rule-based, generative grammars that underlie complex language.
Constraining Multiple Grammars
Hopp, Holger
2014-01-01
This article offers the author's commentary on the Multiple Grammars (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in the present issue. Multiple Grammars advances the claim that optionality is a constitutive characteristic of any one grammar, with interlanguage grammars being perhaps the clearest examples of a…
Constraining Multiple Grammars
Hopp, Holger
2014-01-01
This article offers the author's commentary on the Multiple Grammars (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in the present issue. Multiple Grammars advances the claim that optionality is a constitutive characteristic of any one grammar, with interlanguage grammars being perhaps the clearest examples of a…
King, Lid, Ed.; Boaks, Peter, Ed.
Papers from a conference on the teaching of grammar, particularly in second language instruction, include: "Grammar: Acquisition and Use" (Richard Johnstone); "Grammar and Communication" (Brian Page); "Linguistic Progression and Increasing Independence" (Bernardette Holmes); "La grammaire? C'est du bricolage!" ("Grammar? That's Hardware!") (Barry…
Applications of combinatorial optimization
Paschos, Vangelis Th
2013-01-01
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aims to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. "Applications of Combinatorial Optimization" is presenting a certain number among the most common and well-known applications of Combinatorial Optimization.
Lehmann, Volkmar
1979-01-01
Defines the practical functions of various types of grammars, and theoretical functions of linguistic grammars. Points out some differences between the two (stressing contrast between native and foreign languages), as well as differences in defining, finality, or variation of categories, and in psycho- and sociolinguistic components. (IFS/WGA)
Symmetric categorial grammar: residuation and Galois connections
Moortgat, Michael
2010-01-01
The Lambek-Grishin calculus is a symmetric extension of the Lambek calculus: in addition to the residuated family of product, left and right division operations of Lambek's original calculus, one also considers a family of coproduct, right and left difference operations, related to the former by an arrow-reversing duality. Communication between the two families is implemented in terms of linear distributivity principles. The aim of this paper is to complement the symmetry between (dual) resid...
Language specific bootstraps for UG categories
van Kampen, N.J.
2005-01-01
This paper argues that the universal categories N/V are not applied to content words before the grammatical markings for reference D(eterminers) and predication I(nflection) have been acquired (van Kampen, 1997, contra Pinker, 1984). Child grammar starts as proto-grammar with language-specific opera
Combinatorial Properties of Finite Models
Hubicka, Jan
2010-09-01
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite presentation). Extending classical work of Rado (for the random graph), we find a finite presentation for each of the following classes: homogeneous undirected graphs, homogeneous tournaments and homogeneous partially ordered sets. We also give a finite presentation of the rational Urysohn metric space and some homogeneous directed graphs. We survey well known structures that are finitely presented. We focus on structures endowed with natural partial orders and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism orders for various combinatorial objects. We give a new combinatorial proof of the existence of embedding-universal objects for homomorphism-defined classes of structures. This relates countable embedding-universal structures to homomorphism dualities (finite homomorphism-universal structures) and Urysohn metric spaces. Our explicit construction also allows us to show several properties of these structures.
Institute of Scientific and Technical Information of China (English)
XIAO Kunxue
2005-01-01
Constructionist approach with its brand-new perspective has begun to demonstrate its dynamic power. This paper attempts to review the basic ideas, achievements and comparison with generative grammar of Construction Grammar and generalize some problems and future research prospects.
Institute of Scientific and Technical Information of China (English)
张松懋
1994-01-01
The syntactic parsing algorithm of weak precedence forest grammar has been introduced and the correctness and unambiguity of this algorithm have been proved. An example is given to the syntactic parsing procedure of weak precedence forest grammar.
Institute of Scientific and Technical Information of China (English)
WU Cai-ling; WANG Xi
2015-01-01
More and more researchers have now agreed upon the necessity of teaching grammar, but it still remains controversial as how to teach the forms, with the central consideration of not to harm the meaning-focused communicative teaching method. In this essay, one of the issues in grammar teaching will be discussed as how to present new grammar to learners, through evaluating and modifying a particular presentation activity in a grammar-teaching textbook.
Nonterminal Separating Macro Grammars
Hogendorp, Jan Anne; Asveld, P.R.J.; Nijholt, A.; Verbeek, Leo A.M.
1987-01-01
We extend the concept of nonterminal separating (or NTS) context-free grammar to nonterminal separating $m$-macro grammar where the mode of derivation $m$ is equal to "unrestricted". "outside-in' or "inside-out". Then we show some (partial) characterization results for these NTS $m$-macro grammars.
Concepts of combinatorial optimization
Paschos, Vangelis Th
2014-01-01
Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.Concepts of Combinatorial Optimization, is divided into three parts:- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomi
McNab, Rosi
2014-01-01
The Grammar Made Easy series is ideal for complete beginners as well as for those non-linguists who have some knowledge of the language but need to know the basics of grammar to progress beyond phrasebook level. The books consist of seven units that present basic grammar topics in an accessible and non-patronising manner. The interactive CD-ROM provides extensive interactive grammar practice, it contains around 220 activities (those included in the book plus extra ones) covering all the language in French Grammar Made Easy. Learners work at their own pace and move through the different sect
Institute of Scientific and Technical Information of China (English)
孟静
2007-01-01
Grammar learning has often been regarded as a structure based activity .Grammar games which are worth paying attention to and implementing in the classroom can help learner to learn and recall a grammar material in a pleasant, entertaining way and motivate learners,promote the communicative competence and generate the fluency. In this essay, the author compares the use of games in learning grammar with some traditional techniques for grammar presentation and revision, in order to find the advantages of using games. Also the author discusses how to choose appropriate games and when to use games.
Functional and cognitive grammars
Institute of Scientific and Technical Information of China (English)
Anna Siewierska
2011-01-01
This paper presents a comprehensive review of the functional approach and cognitive approach to the nature of language and its relation to other aspects of human cognition. The paper starts with a brief discussion of the origins and the core tenets of the two approaches in Section 1. Section 2 discusses the similarities and differences between the three full-fledged structural functional grammars subsumed in the functional approach： Halliday＇s Systemic Functional Grammar （SFG）, Dik＇s Functional Grammar （FG）, and Van Valin＇s Role and Reference Grammar （RRG）. Section 3 deals with the major features of the three cognitive frameworks： Langacker＇s Cognitive Grammar （CG）, Goldberg＇s Cognitive Construction Grammar （CCG）, and Croft＇s Radical Construction Grammar （RCG）. Section 4 compares the two approaches and attempts to provide a unified functional-cognitive grammar. In the last section, the author concludes the paper with remarks on the unidirectional shift from functional grammar to cognitive grammar that may indicate a reinterpretation of the traditional relationship between functional and cognitive models of grammar.
Velasco, Pedro Pablo Perez
2008-01-01
This book objective is to develop an algebraization of graph grammars. Equivalently, we study graph dynamics. From the point of view of a computer scientist, graph grammars are a natural generalization of Chomsky grammars for which a purely algebraic approach does not exist up to now. A Chomsky (or string) grammar is, roughly speaking, a precise description of a formal language (which in essence is a set of strings). On a more discrete mathematical style, it can be said that graph grammars -- Matrix Graph Grammars in particular -- study dynamics of graphs. Ideally, this algebraization would enforce our understanding of grammars in general, providing new analysis techniques and generalizations of concepts, problems and results known so far.
Pisani, Claudio
2007-01-01
A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of finality (in particular terminal objects), discreteness and components, representability, colimits and universal arrows, seem to be best expressed in this very general setting. Furthermore, at this level we are in fact doing not only (E,M)-category theory but, in a sense, also (E,M)-topology. Other axioms, regarding power objects, duality, exponentials and the arrow object, are considered.
Jubb, Margaret
2013-01-01
Instructors' edition without answer keysDiscount of 20% offered when 10 ebooks are sold- e.g. they will be sold for 263.60/ £151.90 instead of 329.50/£189.90French Grammar in Context presents a unique and exciting approach to learning grammar. Authentic texts from a rich variety of sources, literary and journalistic, are used as the starting point for the illustration and explanation of key areas of French grammar. Each point is consolidated with a wide range of written and spoken exercises. Grammar is presented not as an end in itself, but as a
Précis of Foundations of language: brain, meaning, grammar, evolution.
Jackendoff, Ray
2003-12-01
The goal of this study is to reintegrate the theory of generative grammar into the cognitive sciences. Generative grammar was right to focus on the child's acquisition of language as its central problem, leading to the hypothesis of an innate Universal Grammar. However, generative grammar was mistaken in assuming that the syntactic component is the sole course of combinatoriality, and that everything else is "interpretive." The proper approach is a parallel architecture, in which phonology, syntax, and semantics are autonomous generative systems linked by interface components. The parallel architecture leads to an integration within linguistics, and to a far better integration with the rest of cognitive neuroscience. It fits naturally into the larger architecture of the mind/brain and permits a properly mentalistic theory of semantics. It results in a view of linguistic performance in which the rules of grammar are directly involved in processing. Finally, it leads to a natural account of the incremental evolution of the language capacity.
Grammar-translation and CLT in L2 Grammar Teaching
Institute of Scientific and Technical Information of China (English)
缪杉莎
2013-01-01
This paper puts forward to compare teaching method between grammar-translation and CLT in grammar teaching. Gram⁃mar leaning is a basic concept in English learning as grammar is an important element in a communicative approach to language. This paper discussed CLT method can help and encourage student to study, however, grammar-translation method is able to under⁃stand.
Grammar A and Grammar B: Rhetorical Life and Death.
Guinn, Dorothy Margaret
In the past, writers have chosen stylistic devices within the parameters of the traditional grammar of style, "Grammar A," characterized by analyticity, coherence, and clarity. But many contemporary writers are creating a new grammar of style, "Grammar B," characterized by synchronicity, discontinuity, and ambiguity, which relies on such devices…
Grammar Writing for a Grammar-reading Audience
2007-01-01
This paper will be concerned primarily with the problem of establishment of higher standards for grammar writing. The text includes a list of 28 points for grammar writers suggested by the Michael Noonan. About another issue, the evaluation of grammar writing within the profession and the professional support provided to grammar writers, the author makes some few comments at the end of this essay.
McCracken, Chelsea Leigh
2012-01-01
This dissertation is a description of the grammar of Belep [yly], an Austronesian language variety spoken by about 1600 people in and around the Belep Isles in New Caledonia. The grammar begins with a summary of the cultural and linguistic background of Belep speakers, followed by chapters on Belep phonology and phonetics, morphology and word…
Van Valin, Robert D., Jr.
This paper discusses Role and Reference Grammar (RRG), which is a structuralist-formalist theory of grammar. RRG grew out of an attempt to answer two fundamental questions: (1) what would linguistic theory look like if it were based on the analysis of Lakhota, Tagalog, and Dyirbal, rather than on the analysis of English?; and (2) how can the…
McCracken, Chelsea Leigh
2012-01-01
This dissertation is a description of the grammar of Belep [yly], an Austronesian language variety spoken by about 1600 people in and around the Belep Isles in New Caledonia. The grammar begins with a summary of the cultural and linguistic background of Belep speakers, followed by chapters on Belep phonology and phonetics, morphology and word…
Gramatica generadora (Generative Grammar)
Cruset, Jose
1975-01-01
Discusses the difficulty of describing the linguistic approach to the study of language to a non-linguist. Points out certain differences between traditional grammar, structural analysis and contemporary language analysis and gives a short description of the notion of generative grammar. (Text is in Spanish.) (TL)
Morrissey, Glenda; Young, Barbara N.
2005-01-01
The variety of theories relating to teaching ESL learners leads to contradictory ideas about teaching a second language. This paper focuses on the continuing importance of grammar in teaching and the current resurgence in interest in returning to grammar as an important component in the classroom.
Zhang, Jianyun
2009-01-01
Grammar is often misunderstood in the language teaching field. The misconception lies in the view that grammar is a collection of arbitrary rules about static structures in the language. Further questionable claims are that the structures do not have to be thought, learners will acquire them on their own, or if the structures are taught, the…
Institute of Scientific and Technical Information of China (English)
Jiang Nongxin
2003-01-01
@@ 1 Definition of grammar Grammar is the science dealing with the systematic rules of a language, its forms, inflections, syntax, and the art of using them correctly. It is summarized from language use and practice, and reflects the logic of thinking in people's speech or writing.
Grammar Instruction and Technology
Lacina, Jan
2005-01-01
Much of the research literature from the past 25 years has supported the importance of teaching grammar in the context of writing instruction (Calkins, 1980; DiStefano & Killion, 1984; Weaver, 1996,1998). Unlike other content areas, practice does not make perfect when learning grammar. While isolated drill and practice of grammatical concepts may…
REFLECTIONS ON GRAMMAR TEACHING
Institute of Scientific and Technical Information of China (English)
2000-01-01
This article aims to answer three questions:(1)Why there exists a discrepancy between the learner’sgrammar knowledge and their communicative skills?(2)What problems are there with grammar tests andteaching?(3)How should grammar be taught as"away of talking"rather than"a description of rules"?
Gramatica generadora (Generative Grammar)
Cruset, Jose
1975-01-01
Discusses the difficulty of describing the linguistic approach to the study of language to a non-linguist. Points out certain differences between traditional grammar, structural analysis and contemporary language analysis and gives a short description of the notion of generative grammar. (Text is in Spanish.) (TL)
Context-free Grammars for Triangular Arrays
Institute of Scientific and Technical Information of China (English)
Robert X. J. HAO; Larry X. W. WANG; Harold R. L. YANG
2015-01-01
We consider context-free grammars of the form G={f →fb1+b2+1ga1+a2, g→fb1ga1+1}, where ai and bi are integers subject to certain positivity conditions. Such a grammar G gives rise to triangular arrays {T (n, k)}0≤k≤n satisfying a three-term recurrence relation. Many combinatorial sequences can be generated in this way. Let Tn(x)=? nk=0 T (n, k)xk. Based on the diff erential operator with respect to G, we define a sequence of linear operators Pn such that Tn+1(x)=Pn(Tn(x)). Applying the characterization of real stability preserving linear operators on the multivariate polynomials due to Borcea and Bra¨nd´en, we obtain a necessary and suﬃ cient condition for the operator Pn to be real stability preserving for any n. As a consequence, we are led to a suﬃ cient condition for the real-rootedness of the polynomials defined by certain triangular arrays, obtained by Wang and Yeh. Moreover, as special cases we obtain grammars that lead to identities involving the Whitney numbers and the Bessel numbers.
Human kinship, from conceptual structure to grammar.
Jones, Doug
2010-10-01
Research in anthropology has shown that kin terminologies have a complex combinatorial structure and vary systematically across cultures. This article argues that universals and variation in kin terminology result from the interaction of (1) an innate conceptual structure of kinship, homologous with conceptual structure in other domains, and (2) principles of optimal, "grammatical" communication active in language in general. Kin terms from two languages, English and Seneca, show how terminologies that look very different on the surface may result from variation in the rankings of a universal set of constraints. Constraints on kin terms form a system: some are concerned with absolute features of kin (sex), others with the position (distance and direction) of kin in "kinship space", others with groups and group boundaries (matrilines, patrilines, generations, etc.). Also, kin terms sometimes extend indefinitely via recursion, and recursion in kin terminology has parallels with recursion in other areas of language. Thus the study of kinship sheds light on two areas of cognition, and their phylogeny. The conceptual structure of kinship seems to borrow its organization from the conceptual structure of space, while being specialized for representing genealogy. And the grammar of kinship looks like the product of an evolved grammar faculty, opportunistically active across traditional domains of semantics, syntax, and phonology. Grammar is best understood as an offshoot of a uniquely human capacity for playing coordination games.
Phonology without Universal Grammar
Directory of Open Access Journals (Sweden)
Diana eArchangeli
2015-09-01
Full Text Available The question of identifying the properties of language that are specific human linguistic abilities, i.e. Universal Grammar, lies at the center of linguistic research. This paper argues for a largely Emergent Grammar in phonology, taking as the starting point that memory, categorization, attention to frequency, and the creation of symbolic systems are all nonlinguistic characteristics of the human mind. The articulation patterns of American English rhotics illustrate categorization and systems; the distribution of vowels in Bantu vowel harmony uses frequencies of particular sequences to argue against Universal Grammar and in favor of Emergent Grammar; prefix allomorphy in Esimbi illustrates the Emergent symbolic system integrating phonological and morphological generalizations. The Esimbi case has been treated as an example of phonological opacity in a Universal Grammar account; the Emergent analysis resolves the pattern without opacity concerns.
Phonology without universal grammar.
Archangeli, Diana; Pulleyblank, Douglas
2015-01-01
The question of identifying the properties of language that are specific human linguistic abilities, i.e., Universal Grammar, lies at the center of linguistic research. This paper argues for a largely Emergent Grammar in phonology, taking as the starting point that memory, categorization, attention to frequency, and the creation of symbolic systems are all nonlinguistic characteristics of the human mind. The articulation patterns of American English rhotics illustrate categorization and systems; the distribution of vowels in Bantu vowel harmony uses frequencies of particular sequences to argue against Universal Grammar and in favor of Emergent Grammar; prefix allomorphy in Esimbi illustrates the Emergent symbolic system integrating phonological and morphological generalizations. The Esimbi case has been treated as an example of phonological opacity in a Universal Grammar account; the Emergent analysis resolves the pattern without opacity concerns.
Integer and combinatorial optimization
Nemhauser, George L
1999-01-01
Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION ""This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list.""-Optima ""A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such f
Spoken Grammar for Chinese Learners
Institute of Scientific and Technical Information of China (English)
徐晓敏
2013-01-01
Currently, the concept of spoken grammar has been mentioned among Chinese teachers. However, teach-ers in China still have a vague idea of spoken grammar. Therefore this dissertation examines what spoken grammar is and argues that native speakers’ model of spoken grammar needs to be highlighted in the classroom teaching.
La Grammaire: Lectures (Grammar: Readings).
Arrive, Michel; Chevalier, Jean-Claude
A historical perspective of French grammar is developed in this chronologically arranged reader. Part One includes material on French grammar from the 16th to the 19th century: (1) the "Premiere Epoque": 1530-1660, (2) the general grammar of Port-Royal, and (3) the "philosophical grammars" treating syntax, sentence structure, and discourse…
Computing FIRST and FOLLOW Functions for Feature-Theoretic Grammars
Trujillo, A
1994-01-01
This paper describes an algorithm for the computation of FIRST and FOLLOW sets for use with feature-theoretic grammars in which the value of the sets consists of pairs of feature-theoretic categories. The algorithm preserves as much information from the grammars as possible, using negative restriction to define equivalence classes. Addition of a simple data structure leads to an order of magnitude improvement in execution time over a naive implementation.
Institute of Scientific and Technical Information of China (English)
陈福生
1984-01-01
@@ There are two kinds of grammar, prescriptive grammar and descriptive grammar. The prescriptive grammar gives orders how a language ought to be used rather than simply describing how it is used.This type of grammar lays down a lot of rules for the student to follow but the gifted philologist Edward Sapir points out that all grammatical rules leak. This type of grammar also warns the student against what are called ‘Shall-nots', but these ‘Shall-nots' are more likely to cause the student muchconcern rather than helping him to exprese his ideas in English. On the contrary, the descriptive grammar just describes how a language is used.
Vector grammars and PN machines
Institute of Scientific and Technical Information of China (English)
蒋昌俊
1996-01-01
The concept of vector grammars under the string semantic is introduced.The dass of vector grammars is given,which is similar to the dass of Chomsky grammars.The regular vector grammar is divided further.The strong and weak relation between the vector grammar and scalar grammar is discussed,so the spectrum system graph of scalar and vector grammars is made.The equivalent relation between the regular vector grammar and Petri nets (also called PN machine) is pointed.The hybrid PN machine is introduced,and its language is proved equivalent to the language of the context-free vector grammar.So the perfect relation structure between vector grammars and PN machines is formed.
Directory of Open Access Journals (Sweden)
Wilhelm F. Maier
2004-10-01
Full Text Available Two recently published books examine combinatorial materials synthesis, high-throughput screening of libraries, and the design of successful experiments. Both are a must for those interested in materials development and discovery, says Wilhelm F. Maier
de Silva, Vin; Salamon, Dietmar
2012-01-01
We define combinatorial Floer homology of a transverse pair of noncontractibe nonisotopic embedded loops in an oriented 2-manifold without boundary, prove that it is invariant under isotopy, and prove that it is isomorphic to the original Lagrangian Floer homology.
Normal Order: Combinatorial Graphs
Solomon, A I; Blasiak, P; Horzela, A; Penson, K A; Solomon, Allan I.; Duchamp, Gerard; Blasiak, Pawel; Horzela, Andrzej; Penson, Karol A.
2004-01-01
A conventional context for supersymmetric problems arises when we consider systems containing both boson and fermion operators. In this note we consider the normal ordering problem for a string of such operators. In the general case, upon which we touch briefly, this problem leads to combinatorial numbers, the so-called Rook numbers. Since we assume that the two species, bosons and fermions, commute, we subsequently restrict ourselves to consideration of a single species, single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, specifically Bell and Stirling numbers. We explicitly give the generating functions for some classes of these numbers. In this note we concentrate on the combinatorial graph approach, showing how some important classical results of graph theory lead to transparent representations of the combinatorial numbers associated with the boson normal ordering problem.
Grammar and Grammar Teaching——A Reflective Journal of Grammar and Communication
Institute of Scientific and Technical Information of China (English)
周佳
2010-01-01
@@ 1 Introduction When we talk about grammar, we will usually refer to the detailed instruction rules of grammar. In China, grammar is usually taught explicitly in formal instructions, which is different from that in some western countries. So there are some controversial questions coming out: Should there be formal instruction of grammar?
Mazet, Veronique
2013-01-01
The easy way to master French grammar French Grammar For Dummies is a logical extension and complement to the successful language learning book, French For Dummies. In plain English, it teaches you the grammatical rules of the French language, including parts of speech, sentence construction, pronouns, adjectives, punctuation, stress and verb tenses, and moods. Throughout the book, you get plenty of practice opportunities to help you on your goal of mastering basic French grammar and usage. Grasp the grammatical rules of French including parts of speech, sentenc
Importance of Grammar in English Teaching
Institute of Scientific and Technical Information of China (English)
赵天毓
2011-01-01
Grammar teaching is one of the most difficult and important points in the middle school. However, there exist some problems with present grammar teaching, such as students＇ poor knowledge of grammar, improper teaching methods and the ignorance of grammar
Zaytsev, Vadim
2011-01-01
The paper describes in detail the recovery effort of one of the official MediaWiki grammars. Over two hundred grammar transformation steps are reported and annotated, leading to delivery of a level 2 grammar, semi-automatically extracted from a community created semi-formal text using at least five different syntactic notations, several non-enforced naming conventions, multiple misspellings, obsolete parsing technology idiosyncrasies and other problems commonly encountered in grammars that were not engineered properly. Having a quality grammar will allow to test and validate it further, without alienating the community with a separately developed grammar.
DEFF Research Database (Denmark)
Lack, Stephen; Sobocinski, Pawel
2003-01-01
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well...... to rewriting on arbitrary adhesive categories....
Functional categories in comparative linguistics
DEFF Research Database (Denmark)
Rijkhoff, Jan
’, meaning-based categories. The use of meaning-based or semantic categories, however, does not necessarily result in the identification of cross-linguistically comparable data either, as was already shown by Greenberg (1966: 88) himself. Whereas formal categories are too narrow in that they do not cover all...... the structural variants attested across languages, semantic categories can be too wide, including too many structural variants to be useful for e.g. morphosyntactic typology. Furthermore, major typological word order studies after Greenberg (1966) have failed to keep formal and semantic categories apart......: language diversity and its importance for cognitive science. Behavioral and Brain Sciences 32-5, 429–92. Greenberg, Joseph H. 1963. Some universals of grammar with particular reference to the order of meaningful elements. In Joseph H. Greenberg (ed.), Universals of Language, 73-113. Cambridge: MIT. Keesing...
DEFF Research Database (Denmark)
Larsen, Jesper Abildgaard; Wisniewski, Rafal; Grunnet, Jacob Deleuran
2008-01-01
As initially suggested by E. Sontag, it is possible to approximate an arbitrary nonlinear system by a set of piecewise linear systems. In this work we concentrate on how to control a system given by a set of piecewise linear systems defined on simplices. By using the results of L. Habets and J. van...... Schuppen, it is possible to find a controller for the system on each of the simplices thus guaranteeing that the system flow on the simplex only will leave the simplex through a subset of its faces. Motivated by R. Forman, on the triangulated state space we define a combinatorial vector field, which...... indicates for a given face the future simplex. In the suggested definition we allow nondeterminacy in form of splitting and merging of solution trajectories. The combinatorial vector field gives rise to combinatorial counterparts of most concepts from dynamical systems, such as duals to vector fields, flow...
Developmental assessment of Spanish grammar.
Toronto, A S
1976-05-01
The Developmental Assessment of Spanish Grammar (DASG) provides a language analysis procedure for Spanish-speaking children similar to the Developmental Sentence Scoring (DSS) procedure in English. The DASG is not an attempted translation of the DSS but was developed independently, taking into consideration the present knowledge of Spanish language acquisition. The purpose of the DASG is to evaluate the language of children with deficient grammatical skills in Spanish and to serve as a model for structuring Spanish language therapy. Proposed syntactic hierarchies for the following six grammatical categories are presented: indefinite pronouns and noun modifiers, personal pronouns, primary verbs, secondary verbs, conjunctions, and interrogative words. Weighted scores are assigned to groups of structures within the hierarchies and are used to score Spanish sentences children use spontaneously in conversation with an adult. The DASG was standardized on 128 Spanish-speaking children between the ages of 3.0 and 6.11 years. Norms and reliability measures are presented.
Introduction to combinatorial designs
Wallis, WD
2007-01-01
Combinatorial theory is one of the fastest growing areas of modern mathematics. Focusing on a major part of this subject, Introduction to Combinatorial Designs, Second Edition provides a solid foundation in the classical areas of design theory as well as in more contemporary designs based on applications in a variety of fields. After an overview of basic concepts, the text introduces balanced designs and finite geometries. The author then delves into balanced incomplete block designs, covering difference methods, residual and derived designs, and resolvability. Following a chapter on the e
Effective Grammar Teaching: Lessons from Confident Grammar Teachers
Petraki, Eleni; Hill, Deborah
2011-01-01
Learning the grammar of a language is an integral part of learning a second or foreign language. Studies on teacher beliefs, teacher language awareness (TLA) and grammar teaching have reported that the majority of English language teachers recognise the importance of teaching grammar (Borg, 2001; Borg & Burns, 2008). At the same time, many…
Effective Grammar Teaching: Lessons from Confident Grammar Teachers
Petraki, Eleni; Hill, Deborah
2011-01-01
Learning the grammar of a language is an integral part of learning a second or foreign language. Studies on teacher beliefs, teacher language awareness (TLA) and grammar teaching have reported that the majority of English language teachers recognise the importance of teaching grammar (Borg, 2001; Borg & Burns, 2008). At the same time, many…
Swahili Learners' Reference Grammar. African Language Learners' Reference Grammar Series.
Thompson, Katrina Daly; Schleicher, Antonia Folarin
This reference grammar is written for speakers of English who are learning Swahili. Because many language learners are not familiar with the grammatical terminology, this book explains the basic terminology and concepts of English grammar that are necessary for understanding the grammar of Swahili. It assumes no formal knowledge of English grammar…
Symplectic structures from topological Fukaya categories
Shende, Vivek; Takeda, Alex
2016-01-01
The topological Fukaya category is the global sections of a certain sheaf of categories on a Lagrangian skeleton. Nadler has given a combinatorial description of this sheaf in the case of generic singularities. We show here that restriction to the boundary of this sheaf of categories determines a shifted Lagrangian morphism on the corresponding moduli spaces. Examples of such moduli spaces include wild character varieties, certain cluster varieties, multiplicative Nakajima varieties, and the ...
Strictness Analysis for Attribute Grammars
DEFF Research Database (Denmark)
Rosendahl, Mads
1992-01-01
interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint...... semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned....
Closure properties of Watson-Crick grammars
Zulkufli, Nurul Liyana binti Mohamad; Turaev, Sherzod; Tamrin, Mohd Izzuddin Mohd; Azeddine, Messikh
2015-12-01
In this paper, we define Watson-Crick context-free grammars, as an extension of Watson-Crick regular grammars and Watson-Crick linear grammars with context-free grammar rules. We show the relation of Watson-Crick (regular and linear) grammars to the sticker systems, and study some of the important closure properties of the Watson-Crick grammars. We establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations, while the differences between other Watson-Crick grammars with their corresponding Chomsky grammars depend on the computational power of the Watson-Crick grammars which still need to be studied.
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Skyum, S.
1981-01-01
It is shown that any well-defined attribute grammar is k-visit for some k. Furthermore, it is shown that given a well-defined grammar G and an integer k, it is decidable whether G is k-visit. Finally it is shown that the k-visit grammars specify a proper hierarchy with respect to translations...
Teaching Grammar: What Really Works
Benjamin, Amy; Berger, Joan
2010-01-01
In this book, the authors share procedures for teaching grammar effectively and dynamically, in ways that appeal to students and teachers alike. Ideal for teachers just beginning their work in grammar instruction, this book includes day-by-day units and reproducibles to help them embed grammar lessons into writing instruction. Using visuals,…
The Necessity of Grammar Teaching
Wang, Fengjuan
2010-01-01
Mastering grammar is the foundation in the proficiency of a language. Grammar teaching is also an essential part of language teaching. However, with the communicative approach was introduced into China, many foreign language teachers gradually make little of grammar teaching. In terms of the theory of linguistics, this paper specifically explores…
Teaching Grammar: What Really Works
Benjamin, Amy; Berger, Joan
2010-01-01
In this book, the authors share procedures for teaching grammar effectively and dynamically, in ways that appeal to students and teachers alike. Ideal for teachers just beginning their work in grammar instruction, this book includes day-by-day units and reproducibles to help them embed grammar lessons into writing instruction. Using visuals,…
La gramatica comunicativa (Communicative Grammar).
Zierer, Ernesto
This paper explains the main concepts of communicative grammar and provides a detailed view of how communicative grammar analyses language at various levels. Language is discussed in terms of communication; the central elements in the analysis are those that carry information. Communicative grammar seeks to describe the process of the linguistic…
Manipulating Combinatorial Structures.
Labelle, Gilbert
This set of transparencies shows how the manipulation of combinatorial structures in the context of modern combinatorics can easily lead to interesting teaching and learning activities at every level of education from elementary school to university. The transparencies describe: (1) the importance and relations of combinatorics to science and…
DEFF Research Database (Denmark)
Lack, Stephen; Sobocinski, Pawel
2004-01-01
We introduce adhesive categories, which are categories with structure ensuring that pushouts along monomorphisms are well-behaved. Many types of graphical structures used in computer science are shown to be examples of adhesive categories. Double-pushout graph rewriting generalises well to rewrit...
A comprehensive French grammar
Price, Glanville
2013-01-01
Characterized by clear and accessible explanations, numerous examples and sample sentences, a new section on register and tone, and useful appendices covering topics including age and time, A Comprehensive French Grammar, Sixth Edition is an indispensable tool for advanced students of French language and literature.A revised edition of this established, bestselling French grammarIncludes a new section on register and medium and offers expanded treatment of French punctuationFeatures numerous examples and sample sentences, and useful appendices covering topics including age, time, and dimension
Ward, Lesley J
2009-01-01
If you're confused by commas, perplexed by pronouns, and plain terrified by tenses, English Grammar For Dummies will put your fears to rest. Packed with expert guidance, it covers everything from sentence basics to rules even your English teacher didn't know - if you want to brush up on your grammar, this is the only guide you'll ever need. Discover how to: avoid common grammatical errors; get to grips with apostrophes; structure sentences correctly; use verbs and find the right tense; and decide when to use slang or formal English.
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2009-01-01
By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting....... We formalize these ideas, and exemplify them both within and outside first-order logic, and for both fixed and dynamic knowledge bases. Within the latter variety, we consider the usual left-to-right derivations that are traditional in logic grammars, but also -- in a significant departure from...
Graben, Peter beim; Fröhlich, Flavio
2015-01-01
We optimally estimate the recurrence structure of a multivariate time series by Markov chains obtained from recurrence grammars. The goodness of fit is assessed with a utility function derived from the stochastic Markov transition matrix. It assumes a local maximum for the distance threshold of the optimal recurrence grammar. We validate our approach by means of the nonlinear Lorenz system and its linearized stochastic surrogates. Finally we apply our optimization procedure to the segmentation of neurophysiological time series obtained from anesthetized animals. We propose the number of optimal recurrence domains as a statistic for classifying an animals' state of consciousness.
Hawkins, Roger
2015-01-01
Long trusted as the most comprehensive, up-to-date and user-friendly grammar available, French Grammar and Usage is a complete guide to French as it is written and spoken today. It includes clear descriptions of all the main grammatical phenomena of French, and their use, illustrated by numerous examples taken from contemporary French, and distinguishes the most common forms of usage, both formal and informal.Key features include:Comprehensive content, covering all the major structures of contemporary French User-friendly organisation offering easy-to-find sections with cross-referencing and i
Grammar and Grammaring: Toward Modes for English Grammar Teaching in China
Nan, Chengyu
2015-01-01
The value of grammar instruction in foreign language learning and teaching has been a focus of debate for quite some time, which has resulted in different views on grammar and grammar teaching as well as different teaching approaches based on different perspectives or in different language learning contexts. To explore some modes for grammar…
Research on universal combinatorial coding.
Lu, Jun; Zhang, Zhuo; Mo, Juan
2014-01-01
The conception of universal combinatorial coding is proposed. Relations exist more or less in many coding methods. It means that a kind of universal coding method is objectively existent. It can be a bridge connecting many coding methods. Universal combinatorial coding is lossless and it is based on the combinatorics theory. The combinational and exhaustive property make it closely related with the existing code methods. Universal combinatorial coding does not depend on the probability statistic characteristic of information source, and it has the characteristics across three coding branches. It has analyzed the relationship between the universal combinatorial coding and the variety of coding method and has researched many applications technologies of this coding method. In addition, the efficiency of universal combinatorial coding is analyzed theoretically. The multicharacteristic and multiapplication of universal combinatorial coding are unique in the existing coding methods. Universal combinatorial coding has theoretical research and practical application value.
English Grammar Workbook For Dummies
Woods, Geraldine
2011-01-01
Get some good grammar practice-and start speaking and writing well. Good grammar is important, whether you want to advance your career, boost your GPA, or increase your SAT or ACT score. Practice is the key to improving your grammar skills, and that's what this workbook is all about. Honing speaking and writing skills through continued practice translates into everyday situations, such as writing papers, giving presentations, and communicating effectively in the workplace or classroom. In English Grammar Workbook For Dummies you'll find hundreds of fun problems to help build your grammar muscl
Institute of Scientific and Technical Information of China (English)
1996-01-01
IntroductionToday many Chinese students think of English grammar as an unpopular and difficult part of theirEnglish lessons Even more worryingly,that attitude is one they have usually picked up from theirteachers.Namely,grammar seems to be hard work for EFL teachers and students.So should grammarteaching be abolishedWhy do many teachers and students take a negative attitude toward grammarInthis paper,first,I will attempt to discuss the place of grammar in EFL teaching.Next,I will outline thetraditional methods of grammar teaching and the results of this kind of grammar teaching.Finally,I willput forward some suggestions on how to make grammar teaching more interesting in Chinese classrooms.
CARDONA, GEORGE
THIS REFERENCE GRAMMAR WAS WRITTEN TO FILL THE NEED FOR AN UP-TO-DATE ANALYSIS OF THE MODERN LANGUAGE SUITABLE FOR LANGUAGE LEARNERS AS WELL AS LINGUISTS. THE AUTHOR LISTS IN THE INTRODUCTION THOSE STUDIES PREVIOUS TO THIS ONE WHICH MAY BE OF INTEREST TO THE READER. INCLUDED IN HIS ANALYSIS OF THE LANGUAGE ARE MAJOR CHAPTERS ON--(1) PHONOLOGY, (2)…
Truscott, John
2014-01-01
Optionality is a central phenomenon in second language acquisition (SLA), for which any adequate theory must account. Amaral and Roeper (this issue; henceforth A&R) offer an appealing approach to it, using Roeper's Multiple Grammars Theory, which was created with first language in mind but which extends very naturally to SLA. They include…
Leslau, Wolf
This reference grammar presents a structural description of the orthography, phonology, morphology, and syntax of Amharic, the national language of Ethiopia. The Amharic material in this work, designed to prepare the student for speaking and reading the language, appears in both Amharic script and phonetic transcription. See ED 012 044-5 for the…
Negotiated Grammar Transformation
Zaytsev, V.
2012-01-01
In this paper, we study controlled adaptability of metamodel transformations. We consider one of the most rigid metamodel transformation formalisms — automated grammar transformation with operator suites, where a transformation script is built in such a way that it is essentially meant to be applica
Jonge, M. de; Visser, E.; Visser, J.M.W.
2001-01-01
Component-based development of language tools stands in need of meta-tool support. This support can be offered by generation of code -- libraries or full-fledged components -- from syntax definitions. We develop a comprehensive architecture for such syntax-driven meta-tooling in which grammars serve
Nunan, David
1998-01-01
Argues for an alternative to the conventional linear model of language acquisition in the learning of second-language grammar, proposing a more organic approach. The two approaches are contrasted, drawing on research in second-language learning and discourse analysis that supports the organic view. Some pedagogical implications of this approach…
Nunan, David
1998-01-01
Argues for an alternative to the conventional linear model of language acquisition in the learning of second-language grammar, proposing a more organic approach. The two approaches are contrasted, drawing on research in second-language learning and discourse analysis that supports the organic view. Some pedagogical implications of this approach…
Directory of Open Access Journals (Sweden)
MEISEL Jürgen M.
2000-01-01
Full Text Available This paper sketches various specific scenarios within the Principles and Parameter Theory under which the question of whether Universal Grammar remains accessible to second language learners should be addressed. It also discusses some implications of several approaches to this issue and offers some speculation as to how the question is to be reformulated in the context of the Minimalist Program.
Grammar and discourse prominence
DEFF Research Database (Denmark)
Christensen, Marie Herget; Kristensen, Line Burholt; Boye, Kasper
in Danish, the lexicon-grammar contrast is a more important cue to discourse prominence (foreground vs. background status) than focalization (by means of focus particles). BOYE, K. & HARDER, P. 2012. A usage-based theory of grammatical status and grammaticalization. Language, 88, 1-44. RENSINK, R. A., O...
Claremont, Francesca
1993-01-01
This reprint of a lecture published in 1976 examines the uses of history and literary stories for instructing children in grammar, creative dramatics, natural history, and prehistory, as well as literary analysis. Provides a starting point for thinking about the power of literature as an integrating medium in the Montessori elementary classroom.…
Combinatorial materials synthesis
Directory of Open Access Journals (Sweden)
Ichiro Takeuchi
2005-10-01
Full Text Available The pace at which major technological changes take place is often dictated by the rate at which new materials are discovered, and the timely arrival of new materials has always played a key role in bringing advances to our society. It is no wonder then that the so-called combinatorial or high-throughput strategy has been embraced by practitioners of materials science in virtually every field. High-throughput experimentation allows simultaneous synthesis and screening of large arrays of different materials. Pioneered by the pharmaceutical industry, the combinatorial method is now widely considered to be a watershed in accelerating the discovery and optimization of new materials1–5.
Combinatorial Reciprocity Theorems
Beck, Matthias
2012-01-01
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane arrangements, lattice points in polyhedra, proper colorings of graphs, and $P$-partitions. We will see that in each instance we get interesting information out of a counting function when we evaluate it at a \\emph{negative} integer (and so, a priori the counting function does not make sense at this number). Our goals are to convey some of the charm these "alternative" evaluations of counting functions exhibit, and to weave a unifying thread through various combinatorial reciprocity theorems by looking at them through the lens of geometry, which will include some scenic detours through other combinatorial concepts.
Pseudorandomness and Combinatorial Constructions
2006-01-01
In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constructions of objects with such properties are often very difficult, or unknown. In computer science, probabilistic algorithms are sometimes simpler and more efficient than the best known deterministic algorithms for the same problem. Despite this evidence for the power of random choices, the computational theory of pseudorandom...
Lyndon, Roger C
2001-01-01
From the reviews: "This book (...) defines the boundaries of the subject now called combinatorial group theory. (...)it is a considerable achievement to have concentrated a survey of the subject into 339 pages. This includes a substantial and useful bibliography; (over 1100 ÄitemsÜ). ...the book is a valuable and welcome addition to the literature, containing many results not previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews, AMS, 1979.
Trugenberger, Carlo A
2016-01-01
In a recently developed approach, geometry is modelled as an emergent property of random networks. Here I show that one of these models I proposed is exactly quantum gravity defined in terms of the combinatorial Ricci curvature recently derived by Ollivier. Geometry in the weak (classical) gravity regime arises in a phase transition driven by the condensation of short graph cycles. The strong (quantum) gravity regime corresponds to "small world" random graphs with logarithmic distance scaling.
DEFF Research Database (Denmark)
Drawing on social science perspectives, Contested Categories presents a series of empirical studies that engage with the often shifting and day-to-day realities of life sciences categories. In doing so, it shows how such categories remain contested and dynamic, and that the boundaries they create...... to life science categories. With contributions from an international team of scholars, this book will be essential reading for anyone interested in the social, legal, policy and ethical implications of science and technology and the life sciences....
Combinatorial auctions for electronic business
Indian Academy of Sciences (India)
Y Narahari; Pankaj Dayama
2005-04-01
Combinatorial auctions (CAs) have recently generated signiﬁcant interest as an automated mechanism for buying and selling bundles of goods. They are proving to be extremely useful in numerous e-business applications such as eselling, e-procurement, e-logistics, and B2B exchanges. In this article, we introduce combinatorial auctions and bring out important issues in the design of combinatorial auctions. We also highlight important contributions in current research in this area. This survey emphasizes combinatorial auctions as applied to electronic business situations.
The Yoccoz Combinatorial Analytic Invariant
DEFF Research Database (Denmark)
Petersen, Carsten Lunde; Roesch, Pascale
2008-01-01
In this paper we develop a combinatorial analytic encoding of the Mandelbrot set M. The encoding is implicit in Yoccoz' proof of local connectivity of M at any Yoccoz parameter, i.e. any at most finitely renormalizable parameter for which all periodic orbits are repelling. Using this encoding we...... define an explicit combinatorial analytic modelspace, which is sufficiently abstract that it can serve as a go-between for proving that other sets such as the parabolic Mandelbrot set M1 has the same combinatorial structure as M. As an immediate application we use here the combinatorial-analytic model...
2009-10-01
such as the difference between policy and politics; the first is the sausage , the second is everything that goes into making it. Put differently...grammar cannot cover how to strike deals and make bargains, as these require finesse unique to specific cultures; but it can underscore the...first or second grammar. In the face of imperceptible logic, we will make a choice. In other words, war’s second grammar gives those responsible for
A communicative grammar of English
Leech, Geoffrey
2013-01-01
A Communicative Grammar of English has long been established as a grammar innovative in approach, reliable in coverage, and clear in its explanations. This fully revised and redesigned third edition provides up-to-date and accessible help to teachers, advanced learners and undergraduate students of English. Part One looks at the way English grammar varies in different types of English, such as 'formal' and 'informal', 'spoken' and 'written'; Part Two focuses on the uses of grammar rather than on grammatical structure and Part Three provides a handy alphabetically arranged guide to
The Teaching of English Grammar
Institute of Scientific and Technical Information of China (English)
祖凤霞
2009-01-01
Acquiring the grammar system is vital in the foreign language learning, and there has always been the debate on how learners can best acquire the English grammar. Inthis paper, two methods for teaching grammar will be presented--traditional practice and consciousness-raising. Both thetwo methods have their ad-vantages and disadvantages. But in practice, it is a better idea to combine different methods to make grammar teaching more effective. In addition, the consideration of different individual learners is also very important.
Introduction to combinatorial analysis
Riordan, John
2002-01-01
This introduction to combinatorial analysis defines the subject as ""the number of ways there are of doing some well-defined operation."" Chapter 1 surveys that part of the theory of permutations and combinations that finds a place in books on elementary algebra, which leads to the extended treatment of generation functions in Chapter 2, where an important result is the introduction of a set of multivariable polynomials.Chapter 3 contains an extended treatment of the principle of inclusion and exclusion which is indispensable to the enumeration of permutations with restricted position given
Infinitary Combinatory Reduction Systems
DEFF Research Database (Denmark)
Ketema, Jeroen; Simonsen, Jakob Grue
2011-01-01
We define infinitary Combinatory Reduction Systems (iCRSs), thus providing the first notion of infinitary higher-order rewriting. The systems defined are sufficiently general that ordinary infinitary term rewriting and infinitary ¿-calculus are special cases. Furthermore,we generalise a number...... of knownresults fromfirst-order infinitary rewriting and infinitary ¿-calculus to iCRSs. In particular, for fully-extended, left-linear iCRSs we prove the well-known compression property, and for orthogonal iCRSs we prove that (1) if a set of redexes U has a complete development, then all complete developments...
Dynamic Combinatorial Chemistry
DEFF Research Database (Denmark)
Lisbjerg, Micke
This thesis is divided into seven chapters, which can all be read individually. The first chapter, however, contains a general introduction to the chemistry used in the remaining six chapters, and it is therefore recommended to read chapter one before reading the other chapters. Chapter 1...... is a general introductory chapter for the whole thesis. The history and concepts of dynamic combinatorial chemistry are described, as are some of the new and intriguing results recently obtained. Finally, the properties of a broad range of hexameric macrocycles are described in detail. Chapter 2 gives...
Dynamic Combinatorial Chemistry
DEFF Research Database (Denmark)
Lisbjerg, Micke
This thesis is divided into seven chapters, which can all be read individually. The first chapter, however, contains a general introduction to the chemistry used in the remaining six chapters, and it is therefore recommended to read chapter one before reading the other chapters. Chapter 1...... is a general introductory chapter for the whole thesis. The history and concepts of dynamic combinatorial chemistry are described, as are some of the new and intriguing results recently obtained. Finally, the properties of a broad range of hexameric macrocycles are described in detail. Chapter 2 gives...
Institute of Scientific and Technical Information of China (English)
张松懋
1994-01-01
Story understanding is one of the important branches of natural language understanding research in AI techniques.A new approach to story understanding is proposed in this paper.The so-called Story Parsing Grammar (SPG) is used to represent the story abstracting processes with different degrees in story understanding,and the story understanding process is converted to the storyn recognizing process done by the syntactic parser of SPG.This kind of story understanding is called story parsing.In this paper,firstly,a survey of story understanding research is given.Secondly,by the classification of various kinds of story structures,the so-called Case Frame Forest (CFF) is proposed to represent the superficial meaning of story.Based on CFF,a high-dimen-sional grammar,called Forest Grammar (FG),is defined.Furthermore,SPG is defined as a subclass of context-sensitive FG.Considering the context-sensitivity of story content,a type of context-sensitive derivation is defined in the definition of SPG.Lastly,data about runtime efficiency of the syntactic parsing algorithm of weak precedence SPG,a subclass of SPG,are given and analysed.
Simple Combinatorial Optimisation Cost Games
van Velzen, S.
2005-01-01
In this paper we introduce the class of simple combinatorial optimisation cost games, which are games associated to {0, 1}-matrices.A coalitional value of a combinatorial optimisation game is determined by solving an integer program associated with this matrix and the characteristic vector of the
Polyhedral Techniques in Combinatorial Optimization
Aardal, K.I.; van Hoesel, S.
1995-01-01
Combinatorial optimization problems arise in several areas ranging from management to mathematics and graph theory. Most combinatorial optimization problems are compu- tationally hard due to the restriction that a subset of the variables have to take integral values. During the last two decades
Automating 3D reconstruction using a probabilistic grammar
Xiong, Hanwei; Xu, Jun; Xu, Chenxi; Pan, Ming
2015-10-01
3D reconstruction of objects from point clouds with a laser scanner is still a laborious task in many applications. Automating 3D process is an ongoing research topic and suffers from the complex structure of the data. The main difficulty is due to lack of knowledge of real world objects structure. In this paper, we accumulate such structure knowledge by a probabilistic grammar learned from examples in the same category. The rules of the grammar capture compositional structures at different levels, and a feature dependent probability function is attached for every rule. The learned grammar can be used to parse new 3D point clouds, organize segment patches in a hierarchal way, and assign them meaningful labels. The parsed semantics can be used to guide the reconstruction algorithms automatically. Some examples are given to explain the method.
Grammar Dilemma: Teaching Grammar as a Resource for Making Meaning
Liamkina, Olga; Ryshina-Pankova, Marianna
2012-01-01
Adopting a functional perspective that views grammar as a rich resource for making contextualized meanings in a culture- and language-specific way, the article reconsiders the role of explicit grammar instruction in developing communicative abilities of second language learners. It draws on two distinct but complementary research frameworks,…
Grammar Dilemma: Teaching Grammar as a Resource for Making Meaning
Liamkina, Olga; Ryshina-Pankova, Marianna
2012-01-01
Adopting a functional perspective that views grammar as a rich resource for making contextualized meanings in a culture- and language-specific way, the article reconsiders the role of explicit grammar instruction in developing communicative abilities of second language learners. It draws on two distinct but complementary research frameworks,…
Creative Grammar and Art Education
Cunliffe, Leslie
2011-01-01
The grammar of creative practices is described by George Steiner as the "articulate organisation of perception, reflection and experience, the nerve structure of consciousness when it communicates with itself and with others." Steiner's description of creative grammar is consistent with Lev Vygotsky's comment that "art is the social within us, and…
Creative Grammar and Art Education
Cunliffe, Leslie
2011-01-01
The grammar of creative practices is described by George Steiner as the "articulate organisation of perception, reflection and experience, the nerve structure of consciousness when it communicates with itself and with others." Steiner's description of creative grammar is consistent with Lev Vygotsky's comment that "art is the social within us, and…
Teachers' Perceptions about Grammar Teaching
Thu, Tran Hoang
2009-01-01
This study investigates English as a second language (ESL) teachers' beliefs in grammar teaching. A 32-item questionnaire was administered to 11 ESL teachers in a language school in California. The results show that the participants generally believe that the formal study of grammar is essential to the eventual mastery of a foreign or second…
Cross-lingual Semantic Parsing with Categorial Grammars
Evang, Kilian
2017-01-01
Humans communicate using natural language. We need to make sure that computers can understand us so that they can act on our spoken commands or independently gain new insights from knowledge that is written down as text. A “semantic parser” is a program that translates natural-language sentences int
Etingof, Pavel; Nikshych, Dmitri; Ostrik, Victor
2015-01-01
Is there a vector space whose dimension is the golden ratio? Of course not-the golden ratio is not an integer! But this can happen for generalizations of vector spaces-objects of a tensor category. The theory of tensor categories is a relatively new field of mathematics that generalizes the theory of group representations. It has deep connections with many other fields, including representation theory, Hopf algebras, operator algebras, low-dimensional topology (in particular, knot theory), homotopy theory, quantum mechanics and field theory, quantum computation, theory of motives, etc. This bo
Weinstein, Alan
2009-01-01
Quantization problems suggest that the category of symplectic manifolds and symplectomorphisms be augmented by the inclusion of canonical relations as morphisms. These relations compose well when a transversality condition is satisfied, but the failure of the most general compositions to be smooth manifolds means that the canonical relations do not comprise the morphisms of a category. We discuss several existing and potential remedies to the nontransversality problem. Some of these involve restriction to classes of lagrangian submanifolds for which the transversality property automatically holds. Others involve allowing lagrangian "objects" more general than submanifolds.
Strictness Analysis for Attribute Grammars
DEFF Research Database (Denmark)
Rosendahl, Mads
1992-01-01
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The ``programs'' in this language take text or parse trees as input and return values of the synthesised attributes to the root as output. From this observation we establish a framework for abstract...... interpretation of attribute grammars. The framework is used to construct a strictness analysis for attribute grammars. Results of the analysis enable us to transform an attribute grammar such that attributes are evaluated during parsing, if possible. The analysis is proved correct by relating it to a fixpoint...... semantics for attribute grammars. An implementation of the analysis is discussed and some extensions to the analysis are mentioned....
Style representation in design grammars
DEFF Research Database (Denmark)
Ahmad, Sumbul; Chase, Scott Curland
2012-01-01
The concept of style is relevant for both the analysis and synthesis of designs. New styles are often formed by the adaptation of previous ones based on changes in design criteria and context. A formal characterization of style is given by shape grammars, which describe the compositional rules...... underlying a set of designs. Stylistic change can be modelled by grammar transformations, which allow the transformation of the structure and vocabulary of a grammar that is used to describe a particular style. In order for grammars to be useful beyond a single application, they should have the capability...... to be transformed according to changing design style needs. Issues of formalizing stylistic change necessitate a lucid and formal definition of style in the design language generated by a grammar. Furthermore, a significant aspect of the definition of style is the representation of aesthetic qualities attributed...
An explicit combinatorial design
Ma, Xiongfeng
2011-01-01
A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\\rho$, quantifying the overlap between the sets within the family, is directly related to the length of a random seed needed and the efficiency of an extractor. Nisan and Wigderson proposed an explicit construction of designs in 1994. Later in 2003, Hartman and Raz proved a bound of $\\rho\\le e^2$ for the Nisan-Wigderson construction. In this work, we prove a tighter bound of $\\rho
Modern French Grammar Workbook
Lang, Margaret
2012-01-01
An innovative new workbook of exercises and language tasks for intermediate and advanced learners of French. This Workbook can be used independently or alongside Modern French Grammar.This Workbook provides exercises in:* Essential grammatical structures* Everyday functions such as agreeing and disagreeing* Role-plays set in a wide range of different contextsIt is suitable for group or pair work and for private study.A comprehensive answer key at the back of the Workbook enables you to check on your progress.This Workbook is ideal for all learners who have a basic knowledge of French, includin
Combinatorial Maps with Normalized Knot
Zeps, Dainis
2010-01-01
We consider combinatorial maps with fixed combinatorial knot numbered with augmenting numeration called normalized knot. We show that knot's normalization doesn't affect combinatorial map what concerns its generality. Knot's normalization leads to more concise numeration of corners in maps, e.g., odd or even corners allow easy to follow distinguished cycles in map caused by the fixation of the knot. Knot's normalization may be applied to edge structuring knot too. If both are normalized then one is fully and other partially normalized mutually.
Classroom Grammar Teaching for Adult Learners
Institute of Scientific and Technical Information of China (English)
石怡
2014-01-01
As Wight (1999, p.33) pointed out to“know a language was to know the grammar of it”, hence grammar teaching is usually the main approach in second or foreign language teaching. This paper presents an analysis from three aspects to il-lustrate why classroom grammar teaching benefits adult learners. However, if grammar is overstated, some negative results will occur. Therefore a balance between grammar teaching and communicative skill teaching is need, as is a balance between accuracy and fluency.
On the (un)suitability of semantic categories
DEFF Research Database (Denmark)
Rijkhoff, Jan
2009-01-01
Since Greenberg’s groundbreaking publication on universals of grammar, typologists have used semantic categories to investigate (constraints on) morphological and syntactic variation in the world’s languages and this tradition has been continued in the WALS project. It is argued here that the emp......Since Greenberg’s groundbreaking publication on universals of grammar, typologists have used semantic categories to investigate (constraints on) morphological and syntactic variation in the world’s languages and this tradition has been continued in the WALS project. It is argued here...
Combinatorial fractal Brownian motion model
Institute of Scientific and Technical Information of China (English)
朱炬波; 梁甸农
2000-01-01
To solve the problem of how to determine the non-scaled interval when processing radar clutter using fractal Brownian motion (FBM) model, a concept of combinatorial FBM model is presented. Since the earth (or sea) surface varies diversely with space, a radar clutter contains several fractal structures, which coexist on all scales. Taking the combination of two FBMs into account, via theoretical derivation we establish a combinatorial FBM model and present a method to estimate its fractal parameters. The correctness of the model and the method is proved by simulation experiments and computation of practial data. Furthermore, we obtain the relationship between fractal parameters when processing combinatorial model with a single FBM model. Meanwhile, by theoretical analysis it is concluded that when combinatorial model is observed on different scales, one of the fractal structures is more obvious.
Combinatorial designs constructions and analysis
Stinson, Douglas R
2004-01-01
Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applie...
Practising French grammar a workbook
Dr Roger Hawkins; Towell, Richard
2015-01-01
This new edition of Practising French Grammar offers a set of varied and accessible exercises for developing a practical awareness of French as it is spoken and written today. The lively examples and authentic texts and cartoons have been updated to reflect current usage. A new companion website provides a wealth of additional interactive exercises to help consolidate challenging grammar points. Practising French Grammar provides concise summaries of key grammatical points at the beginning of each exercise, as well as model answers to the exercises and translations of difficult words, making i
English grammar a university course
Downing, Angela
2014-01-01
This best-selling comprehensive descriptive grammar forms a complete course, ideal for all students studying English Language ,whether on a course or for self-study. Broadly based on Hallidayan systemic-functional grammar but also drawing on cognitive linguistics and discourse analysis, English Grammar is accessible, avoiding overly theoretical or technical explanations.Divided into 12 self-contained chapters based around language functions, each chapter is divided into units of class-length material. Key features include:Numerous authentic texts from a wide range of sources, both spoken and w
Grammars for Language and Genes
Chiang, David
2012-01-01
Grammars are gaining importance in natural language processing and computational biology as a means of encoding theories and structuring algorithms. But one serious obstacle to applications of grammars is that formal language theory traditionally classifies grammars according to their weak generative capacity (what sets of strings they generate) and tends to ignore strong generative capacity (what sets of structural descriptions they generate) even though the latter is more relevant to applications. This book develops and demonstrates a framework for carrying out rigorous comparisons of gramma
Analyzing the Grammar of English
Teschner, Richard V
2007-01-01
Analyzing the Grammar of English offers a descriptive analysis of the indispensable elements of English grammar. Designed to be covered in one semester, this textbook starts from scratch and takes nothing for granted beyond a reading and speaking knowledge of English. Extensively revised to function better in skills-building classes, it includes more interspersed exercises that promptly test what is taught, simplified and clarified explanations, greatly expanded and more diverse activities, and a new glossary of over 200 technical terms.Analyzing the Grammar of English is the only English gram
English Grammar Workbook For Dummies
O'Sullivan, Nuala
2010-01-01
English Grammar Workbook For Dummies, UK Edition is grammar First Aid for anyone wanting to perfect their English and develop the practical skills needed to write and speak correctly. Each chapter focuses on key grammatical principles, with easy-to-follow theory and examples as well as practice questions and explanations. From verbs, prepositions and tenses, to style, expressions and tricky word traps, this hands-on workbook is essential for both beginners looking to learn and practise the basics of English grammar, and those who want to brush up skills they already have - quickly, easily, and
Stochastic integrals: a combinatorial approach
Rota, Gian-Carlo; Wallstrom, Timothy C.
1997-01-01
A combinatorial definition of multiple stochastic integrals is given in the setting of random measures. It is shown that some properties of such stochastic integrals, formerly known to hold in special cases, are instances of combinatorial identities on the lattice of partitions of a set. The notion of stochastic sequences of binomial type is introduced as a generalization of special polynomial sequences occuring in stochastic integration, such as Hermite, Poisson–Charlier an...
Combinatorial methods with computer applications
Gross, Jonathan L
2007-01-01
Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinatorial methods course or in a combined graph theory and combinatorics course.After an introduction to combinatorics, the book explores six systematic approaches within a comprehensive framework: sequences, solving recurrences, evaluating summation exp
Combinatorial chemistry in the agrosciences.
Lindell, Stephen D; Pattenden, Lisa C; Shannon, Jonathan
2009-06-15
Combinatorial chemistry and high throughput screening have had a profound effect upon the way in which agrochemical companies conduct their lead discovery research. The article reviews recent applications of combinatorial synthesis in the lead discovery process for new fungicides, herbicides and insecticides. The role and importance of bioavailability guidelines, natural products, privileged structures, virtual screening and X-ray crystallographic protein structures on the design of solid- and solution-phase compound libraries is discussed and illustrated.
Relativity in Combinatorial Gravitational Fields
Directory of Open Access Journals (Sweden)
Mao Linfan
2010-04-01
Full Text Available A combinatorial spacetime $(mathscr{C}_G| uboverline{t}$ is a smoothly combinatorial manifold $mathscr{C}$ underlying a graph $G$ evolving on a time vector $overline{t}$. As we known, Einstein's general relativity is suitable for use only in one spacetime. What is its disguise in a combinatorial spacetime? Applying combinatorial Riemannian geometry enables us to present a combinatorial spacetime model for the Universe and suggest a generalized Einstein gravitational equation in such model. Forfinding its solutions, a generalized relativity principle, called projective principle is proposed, i.e., a physics law ina combinatorial spacetime is invariant under a projection on its a subspace and then a spherically symmetric multi-solutions ofgeneralized Einstein gravitational equations in vacuum or charged body are found. We also consider the geometrical structure in such solutions with physical formations, and conclude that an ultimate theory for the Universe maybe established if all such spacetimes in ${f R}^3$. Otherwise, our theory is only an approximate theory and endless forever.
Algorithmic Strategies in Combinatorial Chemistry
Energy Technology Data Exchange (ETDEWEB)
GOLDMAN,DEBORAH; ISTRAIL,SORIN; LANCIA,GIUSEPPE; PICCOLBONI,ANTONIO; WALENZ,BRIAN
2000-08-01
Combinatorial Chemistry is a powerful new technology in drug design and molecular recognition. It is a wet-laboratory methodology aimed at ``massively parallel'' screening of chemical compounds for the discovery of compounds that have a certain biological activity. The power of the method comes from the interaction between experimental design and computational modeling. Principles of ``rational'' drug design are used in the construction of combinatorial libraries to speed up the discovery of lead compounds with the desired biological activity. This paper presents algorithms, software development and computational complexity analysis for problems arising in the design of combinatorial libraries for drug discovery. The authors provide exact polynomial time algorithms and intractability results for several Inverse Problems-formulated as (chemical) graph reconstruction problems-related to the design of combinatorial libraries. These are the first rigorous algorithmic results in the literature. The authors also present results provided by the combinatorial chemistry software package OCOTILLO for combinatorial peptide design using real data libraries. The package provides exact solutions for general inverse problems based on shortest-path topological indices. The results are superior both in accuracy and computing time to the best software reports published in the literature. For 5-peptoid design, the computation is rigorously reduced to an exhaustive search of about 2% of the search space; the exact solutions are found in a few minutes.
Linear grammar as a possible stepping-stone in the evolution of language.
Jackendoff, Ray; Wittenberg, Eva
2017-02-01
We suggest that one way to approach the evolution of language is through reverse engineering: asking what components of the language faculty could have been useful in the absence of the full complement of components. We explore the possibilities offered by linear grammar, a form of language that lacks syntax and morphology altogether, and that structures its utterances through a direct mapping between semantics and phonology. A language with a linear grammar would have no syntactic categories or syntactic phrases, and therefore no syntactic recursion. It would also have no functional categories such as tense, agreement, and case inflection, and no derivational morphology. Such a language would still be capable of conveying certain semantic relations through word order-for instance by stipulating that agents should precede patients. However, many other semantic relations would have to be based on pragmatics and discourse context. We find evidence of linear grammar in a wide range of linguistic phenomena: pidgins, stages of late second language acquisition, home signs, village sign languages, language comprehension (even in fully syntactic languages), aphasia, and specific language impairment. We also find a full-blown language, Riau Indonesian, whose grammar is arguably close to a pure linear grammar. In addition, when subjects are asked to convey information through nonlinguistic gesture, their gestures make use of semantically based principles of linear ordering. Finally, some pockets of English grammar, notably compounds, can be characterized in terms of linear grammar. We conclude that linear grammar is a plausible evolutionary precursor of modern fully syntactic grammar, one that is still active in the human mind.
GRAMMAR(S, SCHOOLING AND “LINGUISTIC ADEQUACY”
Directory of Open Access Journals (Sweden)
Maria Eugênia Lammoglia Duarte
2015-10-01
Full Text Available This article discusses some concepts of grammar, in an attempt to show that there are only two meanings and that they are not in complementary distribution as some linguistic publications addressed to students usually suggest. Once reviewed the meaning of grammar as the knowledge every speaker has of his language, we will turn our attention to what has been called “linguistic adequacy”, showing the misunderstanding that underlies this concept, which leads to the opposition “informality” / “formality”. As we will see, such opposition is related to rules that belong to different grammars and only speakers with longer exposure to the “grammar of school” can “change their grammar”, particularly in writing. A brief analysis of Portuguese and Brazilian raps and funks, very popular musical genders, will bring empirical evidence to our statements, showing what is “informality” and what is “grammar”. Our final remarks will concentrate on the importance of teaching the “grammar of writing” based on contemporary descriptions, without ignoring this will mean a big step for students and they must be aware of that. Recent proposals of “pedagogical intervention” with the purpose to teach new rules which are not part of the students’ performance seem fair and necessary, but it is important to value the students’ grammar in order not to deepen linguistic prejudice.
Mathematical grammar of biology
Yamagishi, Michel Eduardo Beleza
2017-01-01
This seminal, multidisciplinary book shows how mathematics can be used to study the first principles of DNA. Most importantly, it enriches the so-called “Chargaff’s grammar of biology” by providing the conceptual theoretical framework necessary to generalize Chargaff’s rules. Starting with a simple example of DNA mathematical modeling where human nucleotide frequencies are associated to the Fibonacci sequence and the Golden Ratio through an optimization problem, its breakthrough is showing that the reverse, complement and reverse-complement operators defined over oligonucleotides induce a natural set partition of DNA words of fixed-size. These equivalence classes, when organized into a matrix form, reveal hidden patterns within the DNA sequence of every living organism. Intended for undergraduate and graduate students both in mathematics and in life sciences, it is also a valuable resource for researchers interested in studying invariant genomic properties.
Teaching Grammar Using Pictures
Directory of Open Access Journals (Sweden)
Henny Uswatun Hasanah
2015-05-01
Full Text Available Teaching is a process of communication. It has to be created through the way ofteaching and exchanging the message or information by every teacher and student. The message can be knowledge, skills, ideas, experiences, and manyothers. Through the process of communication, the people can receive the message or information. To avoid misunderstanding in the process ofcommunication, media are needed in the process of teaching. Using pictures can make exercises and activities more interesting and more interactive. We canconstantly improve our activities by looking at what went well and what fell flat. These 5 unique ways to practice grammar using pictures are a jumping offpoint, and can be expanded in lots of interesting ways.
Learning Unification-Based Natural Language Grammars
Osborne, M
1999-01-01
When parsing unrestricted language, wide-covering grammars often undergenerate. Undergeneration can be tackled either by sentence correction, or by grammar correction. This thesis concentrates upon automatic grammar correction (or machine learning of grammar) as a solution to the problem of undergeneration. Broadly speaking, grammar correction approaches can be classified as being either {\\it data-driven}, or {\\it model-based}. Data-driven learners use data-intensive methods to acquire grammar. They typically use grammar formalisms unsuited to the needs of practical text processing and cannot guarantee that the resulting grammar is adequate for subsequent semantic interpretation. That is, data-driven learners acquire grammars that generate strings that humans would judge to be grammatically ill-formed (they {\\it overgenerate}) and fail to assign linguistically plausible parses. Model-based learners are knowledge-intensive and are reliant for success upon the completeness of a {\\it model of grammaticality}. Bu...
Organizational Categories as Viewing Categories
DEFF Research Database (Denmark)
Mik-Meyer, Nanna
This paper explores how two Danish rehabilitation organizations textual guidelines for assessment of clients' personality traits influence the actual evaluation of clients. The analysis will show how staff members produce institutional identities corresponding to organizational categories, which...... I elucidate how the two rehabilitation organizations local history, legislation, structural features of the present labour market and of social work result in a number of contradictions which make it difficult to deliver client-centred care. This exact goal is according to the staff one of the most...
Kaufmann, Ralph M
2013-01-01
In this paper we give a new foundational categorical formulation for operations and relations and objects parameterizing them. This generalizes operads and all their cousins including but not limited to PROPs, modular operads, twisted (modular) operads as well as algebras over operads and an abundance of other related structures, such as FI--algebras. The usefulness of this approach is that it allows us to handle all the classical as well as more esoteric structures under a common framework and we can treat all the situations simultaneously. Many of the known constructions simply become Kan extensions. In this common framework, we also derive universal operations, such as those underlying Deligne's conjecture, construct Hopf algebras as well as perform resolutions, (co)bar transforms and Feynman transforms which are related to master equations. For these applications, we construct the relevant model category structures.
Universally Balanced Combinatorial Optimization Games
Directory of Open Access Journals (Sweden)
Xiaotie Deng
2010-09-01
Full Text Available This article surveys studies on universally balanced properties of cooperative games defined in a succinct form. In particular, we focus on combinatorial optimization games in which the values to coalitions are defined through linear optimization programs, possibly combinatorial, that is subject to integer constraints. In economic settings, the integer requirement reflects some forms of indivisibility. We are interested in the classes of games that guarantee a non-empty core no matter what are the admissible values assigned to the parameters defining these programs. We call such classes universally balanced. We present characterization and complexity results on the universally balancedness property for some classes of interesting combinatorial optimization games. In particular, we focus on the algorithmic properties for identifying universally balancedness for the games under discussion.
A Learning Algorithm for Multimodal Grammar Inference.
D'Ulizia, A; Ferri, F; Grifoni, P
2011-12-01
The high costs of development and maintenance of multimodal grammars in integrating and understanding input in multimodal interfaces lead to the investigation of novel algorithmic solutions in automating grammar generation and in updating processes. Many algorithms for context-free grammar inference have been developed in the natural language processing literature. An extension of these algorithms toward the inference of multimodal grammars is necessary for multimodal input processing. In this paper, we propose a novel grammar inference mechanism that allows us to learn a multimodal grammar from its positive samples of multimodal sentences. The algorithm first generates the multimodal grammar that is able to parse the positive samples of sentences and, afterward, makes use of two learning operators and the minimum description length metrics in improving the grammar description and in avoiding the over-generalization problem. The experimental results highlight the acceptable performances of the algorithm proposed in this paper since it has a very high probability of parsing valid sentences.
Combinatorial optimization theory and algorithms
Korte, Bernhard
2002-01-01
Combinatorial optimization is one of the youngest and most active areas of discrete mathematics, and is probably its driving force today. This book describes the most important ideas, theoretical results, and algorithms of this field. It is conceived as an advanced graduate text, and it can also be used as an up-to-date reference work for current research. The book includes the essential fundamentals of graph theory, linear and integer programming, and complexity theory. It covers classical topics in combinatorial optimization as well as very recent ones. The emphasis is on theoretical results and algorithms with provably good performance. Some applications and heuristics are mentioned, too.
Combinatorial synthesis of natural products
DEFF Research Database (Denmark)
Nielsen, John
2002-01-01
for preparation of combinatorial libraries. In other examples, natural products or intermediates have served as building blocks or scaffolds in the synthesis of complex natural products, bioactive analogues or designed hybrid molecules. Finally, structural motifs from the biologically active parent molecule have......Combinatorial syntheses allow production of compound libraries in an expeditious and organized manner immediately applicable for high-throughput screening. Natural products possess a pedigree to justify quality and appreciation in drug discovery and development. Currently, we are seeing a rapid...
Some Key Principles for Developing Grammar Skills
Institute of Scientific and Technical Information of China (English)
张威
2008-01-01
Grammar is sometimes defined aft"the way words are put together to make correct sentences"(Ur,2004,P.75).The aim of teaching grammar is to raise the rates of the correctness of language use and help the students transfer the isolated language points to apply language.In this essay，the author introduces two kinds of Conlnlon methods in English grammar class. And there are some key principles in grammar teaching.
Generic Graph Grammar: A Simple Grammar for Generic Procedural Modelling
DEFF Research Database (Denmark)
Christiansen, Asger Nyman; Bærentzen, Jakob Andreas
2012-01-01
in a directed cyclic graph. Furthermore, the basic productions are chosen such that Generic Graph Grammar seamlessly combines the capabilities of L-systems to imitate biological growth (to model trees, animals, etc.) and those of split grammars to design structured objects (chairs, houses, etc.). This results......Methods for procedural modelling tend to be designed either for organic objects, which are described well by skeletal structures, or for man-made objects, which are described well by surface primitives. Procedural methods, which allow for modelling of both kinds of objects, are few and usually...
On an Extension of a Combinatorial Identity
Indian Academy of Sciences (India)
M Rana; A K Agarwal
2009-02-01
Using Frobenius partitions we extend the main results of [4]. This leads to an infinite family of 4-way combinatorial identities. In some particular cases we get even 5-way combinatorial identities which give us four new combinatorial versions of Göllnitz–Gordon identities.
Teaching the Topography of Gretel Ehrlich's Grammar.
Gessell, Donna A.
When writing, few students have any concept that word placement affects the content of their writing. They seldom rework their papers at the sentence level in order to assure that their grammar reflects and enhances their content. Recognizing the relationship of grammar to meaning, composition researchers are reasserting the place of grammar in…
Reframing the English Grammar Schools Debate
Morris, Rebecca; Perry, Thomas
2017-01-01
In October 2015 the Department for Education (DfE) permitted a grammar school in Tonbridge, Kent, to open up an annexe in Sevenoaks, 10 miles away. Amidst claims that the annexe was essentially a new grammar school, the decision reignited an old debate about the value of academically-selective "grammar" schools in England. The intensity…
The design and implementation of Object Grammars
Storm, T. van der; Cook, W.R.; Loh, A.
2014-01-01
An Object Grammar is a variation on traditional BNF grammars, where the notation is extended to support declarative bidirectional mappings between text and object graphs. The two directions for interpreting Object Grammars are parsing and formatting. Parsing transforms text into an object graph by r
French grammar you really need to know
Adamson, Robin
2012-01-01
Comprehensive and clear explanations of key grammar patterns and structures are reinforced and contextualized through authentic materials. You will not only learn how to construct grammar correctly, but when and where to use it so you sound natural and appropriate. French Grammar You Really Need to Know will help you gain the intuition you need to become a confident communicator in your new language.
Integrating Grammar in Adult TESOL Classrooms
Borg, Simon; Burns, Anne
2008-01-01
This paper examines the beliefs and practices about the integration of grammar and skills teaching reported by 176 English language teachers from 18 countries. Teachers completed a questionnaire which elicited beliefs about grammar teaching generally as well as specific beliefs and reported practices about the integration of grammar and skills…
Teaching Grammar as a Liberating Force
Cullen, Richard
2008-01-01
The idea of grammar as a "liberating force" comes from a paper by Henry Widdowson (1990) in which grammar is depicted as a resource which liberates the language user from an over-dependency on lexis and context for the expression of meaning. In this paper, I consider the implications for second language teaching of the notion of grammar as a…
Drama Grammar: Towards a Performative Postmethod Pedagogy
Even, Susanne
2011-01-01
This article presents the original concept of drama grammar, the synthesis of grammar instruction and drama pedagogy, which integrates both structural and communicative paradigms through a dialectic combination of acting and linguistic analysis. Based on the principles of drama pedagogy, drama grammar makes use of techniques from the performing…
The Philosophical Significance of Universal Grammar
Hinzen, Wolfram
2012-01-01
Throughout its long history, the project of a science of grammar has always been an inherently philosophical one, in which the study of grammar was taken to have special epistemological significance. I ask why 20th and 21st century inquiry into Universal Grammar (UG) has largely lost this dimension, a fact that I argue is partially responsible for…
Analyzing Ambiguity of Context-Free Grammars
DEFF Research Database (Denmark)
Brabrand, Claus; Giegerich, Robert; Møller, Anders
2010-01-01
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. We ...
Analyzing Ambiguity of Context-Free Grammars
DEFF Research Database (Denmark)
Brabrand, Claus; Giegerich, Robert; Møller, Anders
2007-01-01
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. We ...
Welcoming Grammar Back into the Writing Classroom.
Devet, Bonnie
2002-01-01
Describes three approaches with which grammar may be welcomed back into the composition classroom. Considers how the teaching of grammar is making a comeback, with scholars acknowledging that the objections raised by process theories were valid but also investigating how to use grammar in writing classrooms, how to answer old process objections,…
An Evaluation of the Grammar Teaching Material
Institute of Scientific and Technical Information of China (English)
张可科
2013-01-01
Of the many issues surrounding grammar, perhaps the hottest debate is whether to teach it or not. We review briefly argu⁃ments against and in support of grammar teaching before examining current grammar approaches in second language teaching.
Drama Grammar: Towards a Performative Postmethod Pedagogy
Even, Susanne
2011-01-01
This article presents the original concept of drama grammar, the synthesis of grammar instruction and drama pedagogy, which integrates both structural and communicative paradigms through a dialectic combination of acting and linguistic analysis. Based on the principles of drama pedagogy, drama grammar makes use of techniques from the performing…
Teaching Grammar as a Liberating Force
Cullen, Richard
2008-01-01
The idea of grammar as a "liberating force" comes from a paper by Henry Widdowson (1990) in which grammar is depicted as a resource which liberates the language user from an over-dependency on lexis and context for the expression of meaning. In this paper, I consider the implications for second language teaching of the notion of grammar as a…
Controlling Combinatorial Complexity in Software and Malware Behavior Computation
Energy Technology Data Exchange (ETDEWEB)
Pleszkoch, Mark G [ORNL; Linger, Richard C [ORNL
2015-01-01
Virtually all software is out of intellectual control in that no one knows its full behavior. Software Behavior Computation (SBC) is a new technology for understanding everything software does. SBC applies the mathematics of denotational semantics implemented by function composition in Functional Trace Tables (FTTs) to compute the behavior of programs, expressed as disjoint cases of conditional concurrent assignments. In some circumstances, combinatorial explosions in the number of cases can occur when calculating the behavior of sequences of multiple branching structures. This paper describes computational methods that avoid combinatorial explosions. The predicates that control branching structures such as ifthenelses can be organized into three categories: 1) Independent, resulting in no behavior case explosion, 2) Coordinated, resulting in two behavior cases, or 3) Goaloriented, with potential exponential growth in the number of cases. Traditional FTT-based behavior computation can be augmented by two additional computational methods, namely, Single-Value Function Abstractions (SVFAs) and, introduced in this paper, Relational Trace Tables (RTTs). These methods can be applied to the three predicate categories to avoid combinatorial growth in behavior cases while maintaining mathematical correctness.
Combinatorial optimization networks and matroids
Lawler, Eugene
2011-01-01
Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.
Combinatorial reasoning to solve problems
Coenen, Tom; Hof, Frits; Verhoef, Nellie
2016-01-01
This study reports combinatorial reasoning to solve problems. We observed the mathematical thinking of students aged 14-16. We study the variation of the students’ solution strategies in the context of emergent modelling. The results show that the students are tempted to begin the problem solving pr
Algorithms in combinatorial design theory
Colbourn, CJ
1985-01-01
The scope of the volume includes all algorithmic and computational aspects of research on combinatorial designs. Algorithmic aspects include generation, isomorphism and analysis techniques - both heuristic methods used in practice, and the computational complexity of these operations. The scope within design theory includes all aspects of block designs, Latin squares and their variants, pairwise balanced designs and projective planes and related geometries.
The evolution of combinatorial phonology
Zuidema, Willem; de Boer, Bart
2009-01-01
A fundamental, universal property of human language is that its phonology is combinatorial. That is, one can identify a set of basic, distinct units (phonemes, syllables) that can be productively combined in many different ways. In this paper, we develop a methodological framework based on evolution
Combinatorial synthesis of natural products
DEFF Research Database (Denmark)
Nielsen, John
2002-01-01
Combinatorial syntheses allow production of compound libraries in an expeditious and organized manner immediately applicable for high-throughput screening. Natural products possess a pedigree to justify quality and appreciation in drug discovery and development. Currently, we are seeing a rapid...
The Yoccoz Combinatorial Analytic Invariant
DEFF Research Database (Denmark)
Petersen, Carsten Lunde; Roesch, Pascale
2008-01-01
In this paper we develop a combinatorial analytic encoding of the Mandelbrot set M. The encoding is implicit in Yoccoz' proof of local connectivity of M at any Yoccoz parameter, i.e. any at most finitely renormalizable parameter for which all periodic orbits are repelling. Using this encoding we ...
Grammar Specialization through Entropy Thresholds
Samuelsson, C
1994-01-01
Explanation-based generalization is used to extract a specialized grammar from the original one using a training corpus of parse trees. This allows very much faster parsing and gives a lower error rate, at the price of a small loss in coverage. Previously, it has been necessary to specify the tree-cutting criteria (or operationality criteria) manually; here they are derived automatically from the training set and the desired coverage of the specialized grammar. This is done by assigning an entropy value to each node in the parse trees and cutting in the nodes with sufficiently high entropy values.
Oxford dictionary of English grammar
Chalker, Sylvia
1994-01-01
English grammar has changed a great deal since the beginning of the Twentieth Century, and it is a subject that can provide a complex minefield of uncertainties within the language. This accessible and comprehensive dictionary comes to the aid of both the general reader and the student or teacher, offering straightforward and immediate A-Z access to 1,000 grammatical terms and their meanings. All the currently accepted terms of grammar are included, as well as older, traditional names, controversial new coinages, and items from the study of other languages. Concise definitions of the wider sub
Leech, Geoffrey
2006-01-01
A Glossary of English Grammar presents a wide range of terms used to describe the way the English language is structured. Grammatical terms can be a problem for students, especially when there are alternative names for the same thing (for example, 'past tense' and 'preterite'). This book therefore provides a basic and accessible guide, focusing on the English language. Definitions of grammatical terms are given in simple language, with clear examples, many from authentic texts and spoken sources, showing how they are used. The terms used in the Comprehensive Grammar of the English Language are
Procedure Of Teaching Grammar Using Memory Enhancement
Directory of Open Access Journals (Sweden)
Herri Susanto
2011-11-01
Full Text Available Teaching grammar has been regarded as a process of understanding from the context. It means a teacher teaches the pupils contextually more than just the rules. However, I have my own experience that teaching grammar methods must depend on the purposes of learning grammar. Some people learn grammar as a means to fulfill the syllabus needs for schools but other people learn grammar for special purposes out of school syllabus, such as for entrance test. For these reasons, the methods of teaching grammar should be different. The students who learn grammar based on the school syllabus probably needs longer procedure of learning that usually uses contextual teaching through listening, speaking, writing, and reading. Nevertheless, students who learn grammar for test need shorter procedure of learning such as memorizing. Therefore, I propose giving a workshop of teaching grammar using memory enhancement as another alternative teaching grammar method. This workshop would show the class that grammar can be learnt through memory enhancement process, i.e.; mind map, music, memory technique and drill to boost up students understanding for test preparation.
The evolutionary dynamics of grammar acquisition.
Komarova, N L; Niyogi, P; Nowak, M A
2001-03-07
Grammar is the computational system of language. It is a set of rules that specifies how to construct sentences out of words. Grammar is the basis of the unlimited expressibility of human language. Children acquire the grammar of their native language without formal education simply by hearing a number of sample sentences. Children could not solve this learning task if they did not have some pre-formed expectations. In other words, children have to evaluate the sample sentences and choose one grammar out of a limited set of candidate grammars. The restricted search space and the mechanism which allows to evaluate the sample sentences is called universal grammar. Universal grammar cannot be learned; it must be in place when the learning process starts. In this paper, we design a mathematical theory that places the problem of language acquisition into an evolutionary context. We formulate equations for the population dynamics of communication and grammar learning. We ask how accurate children have to learn the grammar of their parents' language for a population of individuals to evolve and maintain a coherent grammatical system. It turns out that there is a maximum error tolerance for which a predominant grammar is stable. We calculate the maximum size of the search space that is compatible with coherent communication in a population. Thus, we specify the conditions for the evolution of universal grammar.
Casebook in functional discourse grammar
Mackenzie, J.L.; Olbertz, H.
2013-01-01
This book provides ten case studies in Functional Discourse Grammar (FDG), a typologically-oriented theory of the organization of natural languages that has risen to prominence in recent years. The authors, all committed practitioners of FDG, include Kees Hengeveld, the intellectual father of the th
Kent Sakoda Discusses Pidgin Grammar
Sakoda, Kent; Tamura, Eileen H.
2008-01-01
For a number of years, Kent Sakoda has been teaching at the University of Hawai'i at Manoa in the Department of Second Language Studies. His course, "Pidgin and Creole English in Hawai'i," is popular among students on campus. He has also taught at Hawai'i Pacific University. Because of his expertise on the grammar of Pidgin (Hawai'i…
Indexed Languages and Unification Grammars
Burheim, T
1995-01-01
Indexed languages are interesting in computational linguistics because they are the least class of languages in the Chomsky hierarchy that has not been shown not to be adequate to describe the string set of natural language sentences. We here define a class of unification grammars that exactly describe the class of indexed languages.
Grammar Rules as Computer Algorithms.
Rieber, Lloyd
1992-01-01
One college writing teacher engaged his class in the revision of a computer program to check grammar, focusing on improvement of the algorithms for identifying inappropriate uses of the passive voice. Process and problems of constructing new algorithms, effects on student writing, and other algorithm applications are discussed. (MSE)
A Lifetime of Grammar Teaching
Ellis, Rod
2012-01-01
The author has worked as a language teacher, teacher educator, and second language acquisition (SLA) researcher for over forty years. During this time grammar has figured largely in his thinking, in part because it has traditionally been so central to language pedagogy and in part because he became fascinated with how the human mind grapples with…
Notation-Parametric Grammar Recovery
Zaytsev, V.; Sloane, A.M.; Andova, S.
2012-01-01
Automation of grammar recovery is an important research area that received attention over the last decade and a half. Given the abundance of available documentation for software languages that is only going to keep increasing in the future, there is need for reliable extraction techniques that allow
Narrative Comprehension and Story Grammar
Directory of Open Access Journals (Sweden)
Mehwish Zahoor
2013-09-01
Full Text Available Every text has an underlying structure which has a vital contribution in making it a meaningful whole. Awareness of a text’s structure therefore is significant in developing an overall sense of the text. Story grammar offers a simple and effective framework to analyze a coherent structure in narrative texts, hence is assumed to facilitate the comprehension of narratives. The research has been designed to be a descriptive study, with the objective to explain and illustrate how story grammar functions in constructing and decoding meanings in a narrative text, and, to highlight its scope in pedagogy. A short story text has been randomly selected from the short story collection in the English text book by Punjab text book board for Intermediate level. A three stepped comprehensive analysis of the sample text has been done by implementing the selected story grammar model. It has been found that story grammar helped in deriving coherent structure and meanings from the selected short story text; hence it has pedagogical implications in developing narrative comprehension.
Readings in Applied Transformational Grammar.
Lester, Mark, Ed.
This volume contains nineteen essays, dealing with various aspects of transformational grammar, by scholars such as Noam Chomsky, Eric H. Lenneberg, and Leon Jakobovits. These essays have been reprinted from sources such as "College English" and "Language Learning" and are intended for the most part for a nontechnical audience. The anthology is…
Transformational Grammar and Cognitive Psycholinguistics.
Lester, Mark
1973-01-01
An overview of Noam Chomsky's theories about transformational grammar and phonology is given. Since Chomsky was interested in characterizing what it is to know a language, the ways in which we demonstrate knowledge of our native language are discussed in detail. Particular emphasis is placed on describing how the transformational approach actually…
Readings in Applied Transformational Grammar.
Lester, Mark, Ed.
This volume contains nineteen essays, dealing with various aspects of transformational grammar, by scholars such as Noam Chomsky, Eric H. Lenneberg, and Leon Jakobovits. These essays have been reprinted from sources such as "College English" and "Language Learning" and are intended for the most part for a nontechnical audience. The anthology is…
Ternate Malay : grammar and texts
Litamahuputty, Bathseba Helena Johanna
2012-01-01
This book is the first grammar on Ternate Malay, a local variety of Malay spoken on the island of Ternate, North-Moluccas, Indonesia. It is a language with words flexible in function and meaning, which do not bear overtly expressed features to indicate grammatical functions. Linguistic tools traditi
Micmac Teaching Grammar. Preliminary Version.
Delisle, Gilles L.; Metallic, Manny L.
This teaching grammar is designed primarily for university-level students, but may also be used for adult courses, high school classes, and in junior colleges. The text takes the transformational-generative approach to language, in which the notions of system, derivation, and relation are emphasized rather than categorization and classification.…
Notation-Parametric Grammar Recovery
V. Zaytsev (Vadim); A.M. Sloane; S. Andova
2012-01-01
htmlabstractAutomation of grammar recovery is an important research area that received attention over the last decade and a half. Given the abundance of available documentation for software languages that is only going to keep increasing in the future, there is need for reliable extraction
Abstract Interpretation Using Attribute Grammar
DEFF Research Database (Denmark)
Rosendahl, Mads
1990-01-01
This paper deals with the correctness proofs of attribute grammars using methods from abstract interpretation. The technique will be described by defining a live-variable analysis for a small flow-chart language and proving it correct with respect to a continuation style semantics. The proof...
Micmac Teaching Grammar. Preliminary Version.
Delisle, Gilles L.; Metallic, Manny L.
This teaching grammar is designed primarily for university-level students, but may also be used for adult courses, high school classes, and in junior colleges. The text takes the transformational-generative approach to language, in which the notions of system, derivation, and relation are emphasized rather than categorization and classification.…
A Case for Explicit Grammar Instruction in English as Second/Foreign Language Classrooms
Williams, Kent
2013-01-01
This paper will provide a review of research--regarding explicit grammar instruction--that groups recent studies into three main categories and then sub-categorizes these studies under key terms in second language acquisition (SLA) research. The overall purpose of this paper is to argue that in light of these issues, recent studies have shown that…
Combinatorial algebra syntax and semantics
Sapir, Mark V
2014-01-01
Combinatorial Algebra: Syntax and Semantics provides a comprehensive account of many areas of combinatorial algebra. It contains self-contained proofs of more than 20 fundamental results, both classical and modern. This includes Golod–Shafarevich and Olshanskii's solutions of Burnside problems, Shirshov's solution of Kurosh's problem for PI rings, Belov's solution of Specht's problem for varieties of rings, Grigorchuk's solution of Milnor's problem, Bass–Guivarc'h theorem about the growth of nilpotent groups, Kleiman's solution of Hanna Neumann's problem for varieties of groups, Adian's solution of von Neumann-Day's problem, Trahtman's solution of the road coloring problem of Adler, Goodwyn and Weiss. The book emphasize several ``universal" tools, such as trees, subshifts, uniformly recurrent words, diagrams and automata. With over 350 exercises at various levels of difficulty and with hints for the more difficult problems, this book can be used as a textbook, and aims to reach a wide and diversified...
Stem cells and combinatorial science.
Fang, Yue Qin; Wong, Wan Qing; Yap, Yan Wen; Orner, Brendan P
2007-09-01
Stem cell-based technologies have the potential to help cure a number of cell degenerative diseases. Combinatorial and high throughput screening techniques could provide tools to control and manipulate the self-renewal and differentiation of stem cells. This review chronicles historic and recent progress in the stem cell field involving both pluripotent and multipotent cells, and it highlights relevant cellular signal transduction pathways. This review further describes screens using libraries of soluble, small-molecule ligands, and arrays of molecules immobilized onto surfaces while proposing future trends in similar studies. It is hoped that by reviewing both the stem cell and the relevant high throughput screening literature, this paper can act as a resource to the combinatorial science community.
Quotients of cluster categories
Jorgensen, Peter
2007-01-01
Higher cluster categories were recently introduced as a generalization of cluster categories. This paper shows that in Dynkin types A and D, half of all higher cluster categories are actually just quotients of cluster categories. The other half can be obtained as quotients of 2-cluster categories, the "lowest" type of higher cluster categories. Hence, in Dynkin types A and D, all higher cluster phenomena are implicit in cluster categories and 2-cluster categories. In contrast, the same is not...
Combinatorial Approach of Associative Classification
P. R. Pal; R.C. Jain
2010-01-01
Association rule mining and classification are two important techniques of data mining in knowledge discovery process. Integration of these two has produced class association rule mining or associative classification techniques, which in many cases have shown better classification accuracy than conventional classifiers. Motivated by this study we have explored and applied the combinatorial mathematics in class association rule mining in this paper. Our algorithm is based on producing co...
Combinatorial aspects of covering arrays
Directory of Open Access Journals (Sweden)
Charles J. Colbourn
2004-11-01
Full Text Available Covering arrays generalize orthogonal arrays by requiring that t -tuples be covered, but not requiring that the appearance of t -tuples be balanced.Their uses in screening experiments has found application in software testing, hardware testing, and a variety of fields in which interactions among factors are to be identified. Here a combinatorial view of covering arrays is adopted, encompassing basic bounds, direct constructions, recursive constructions, algorithmic methods, and applications.
Grammar Teaching Revisited: EFL Teachers between Grammar Abstinence and Formal Grammar Teaching
Nazari, Ahmad; Allahyar, Negah
2012-01-01
The study of English language teachers' cognitions and its relationship to teachers' classroom practices have recently been the focus of language teaching and teacher education (Borg, 2006 & 2010). However, rarely have the studies delved into teachers' knowledge about grammar (reviewed by Borg, 2001) or investigated the relationships between…
Distinct Grammars and their Role in Interlanguage Development
Directory of Open Access Journals (Sweden)
Aparecida de Araújo Oliveira
2016-07-01
Full Text Available The expression of temporality encompasses the concepts of tense and aspect, typically conveyed by lexical and inflectional morphemes that usually vary from language to language. This kind of cross-linguistic distinctions often affects L2 learning. In this paper I discuss the role of the Portuguese grammar in the acquisition of the English present perfect tense by eighteen Brazilian EFL learners. I compared patterns found in interlanguage data to L2 patterns, and, as expected, L1 phonology affected learners’ production of regular past tenses, especially in early interlanguage. As for form-function mappings, besides L2 patterns, learners created two major meaning categories of current relevance, based on persisting / non-persisting situations, which were systematically conveyed by forms that resembled their L1 grammar. Durative events and states (imperfective situations persisting into the present were expressed by present tenses, while all aspectual categories of concluded (perfective situations were encoded by past tenses. Specific adverbials were used in each category
Enriched model categories and diagram categories
Guillou, Bertrand
2011-01-01
We collect in one place a variety of known and folklore results in enriched model category theory and add a few new twists. One twist is a new perspective on equivariant model categories. A central theme is a general procedure for constructing a Quillen adjunction, often a Quillen equivalence, between a given V-model category and a category of diagrams in V, where V is any good enriching category. From this perspective, we rederive the result of Schwede and Shipley that reasonable stable model categories are Quillen equivalent to diagram categories of spectra (alias categories of module spectra). The general theory will be applied to G-spectra in a sequel, and for that we need quite a few technical improvements and modifications of general model categorical results. We collect those here. They are bound to have applications in a variety of other contexts.
Teacher beliefs and practices of grammar teaching: focusing on ...
African Journals Online (AJOL)
refuses any direct instruction on grammar, explicit error correction, or even .... teachers in general believe that grammar is central to language learning and students ... grammar teaching and to explore the possible factors behind their common ...
Dupont, Louis
1972-01-01
Author cites philological grammar" as one of three ways of treating language. The other two approaches to language are traditional grammar and linguistic grammar or transformational generative grammar. Philological grammar stresses the art of reading. (DS)
Some polyhedral results in combinatorial optimization
Xiao, Han; 肖汉
2016-01-01
Many combinatorial optimization problems can be conceived of as optimizing a linear function over a polyhedron. Investigating properties of the associated polyhedron has been evidenced to be a powerful schema for solving combinatorial optimization problems, especially for characterizing min-max relations. Three different topics in combinatorial optimization are explored in this thesis, which fall within a unified characterization: integrality of polyhedra. Various min-max relations in com...
Hybrid Genetic Algorithm with PSO Effect for Combinatorial Optimisation Problems
Directory of Open Access Journals (Sweden)
M. H. Mehta
2012-12-01
Full Text Available In engineering field, many problems are hard to solve in some definite interval of time. These problems known as “combinatorial optimisation problems” are of the category NP. These problems are easy to solve in some polynomial time when input size is small but as input size grows problems become toughest to solve in some definite interval of time. Long known conventional methods are not able to solve the problems and thus proper heuristics is necessary. Evolutionary algorithms based on behaviours of different animals and species have been invented and studied for this purpose. Genetic Algorithm is considered a powerful algorithm for solving combinatorial optimisation problems. Genetic algorithms work on these problems mimicking the human genetics. It follows principle of “survival of the fittest” kind of strategy. Particle swarm optimisation is a new evolutionary approach that copies behaviour of swarm in nature. However, neither traditional genetic algorithms nor particle swarm optimisation alone has been completely successful for solving combinatorial optimisation problems. Here a hybrid algorithm is proposed in which strengths of both algorithms are merged and performance of proposed algorithm is compared with simple genetic algorithm. Results show that proposed algorithm works definitely better than the simple genetic algorithm.
Grammar Games: A Case for Instructionist Game Models to Enhance Grammar Awareness and Accuracy
Raftery, Brian; Santos, Jennifer
2015-01-01
Based on our own experiences teaching grammar in developmental writing classes and classes not dedicated to writing instruction, along with a history of scholarship that indicates a need for grammar pedagogies (e.g., Dougherty, 2012), instructor-designed grammar games can likely help facilitate learning about these mechanics of writing while…
The Value of Grammar m English Teaching
Institute of Scientific and Technical Information of China (English)
李小艳
2011-01-01
Few students know that grammar is acquired naturally; it need not be taught. Grammar is often misunderstood in the language teaching. There are some students thinking it a waste of time to memorize the rules. They even claim that if the structures are taught, the lessons will be boring. This paper will help to realize how helpful and useful as well as beneficial learning English grammar well will be, not only for students, but also for teachers.
The Grammar of Linguistic Semiotics
DEFF Research Database (Denmark)
Durst-Andersen, Per
2009-01-01
The paper presents a new typology of linguistic signs primarily based on Peirce’s sign conception. It is demonstrated that the fundamental simple sign, the symbolic nominal lexeme, has an arbitrary relationship to its object in order to make it omnipotent, that is, open to various possible......) 'it cannot by itself refer, but must have a vehicle, a grammar. There is an obligatory choice between three types of grammar corresponding to the three ways in which a state of affairs exists in a communication situation: (1) the situation as such in a real or in an imagined world being common...... it is impossible to find a matching experience in the hearer’s store of experiences. In other words, the static linguistic symbol needs an index that needs an icon (or the lack of an icon) in order for it to be properly decoded by the hearer. Furthermore, it is demonstrated that in addition to the level of naming...
Ternate Malay: grammar and texts
Litamahuputty, Bathseba Helena Johanna
2012-01-01
This book is the first grammar on Ternate Malay, a local variety of Malay spoken on the island of Ternate, North-Moluccas, Indonesia. It is a language with words flexible in function and meaning, which do not bear overtly expressed features to indicate grammatical functions. Linguistic tools traditionally used to distinguish between word classes do not work satisfactorily for this language. Certain lexical items and their position in a string of words serve as indicators of relationships betw...
Writing Study and Grammar Study
Institute of Scientific and Technical Information of China (English)
马青
2013-01-01
This study is undertaken to describe,classify and analyze the problems in Chinese college students’ writing of CET-4 through contrastive analysis,statistical analysis and error analysis.The main problems appearing in CET-4 writing are the wrong usage of words,sentence structures and the lack of coherence.Meanwhile it proves grammar study plays an important and basic role in CET-4 writing.
Evaluation of a Grammar of French Determiners
Laporte, Eric
2007-01-01
Existing syntactic grammars of natural languages, even with a far from complete coverage, are complex objects. Assessments of the quality of parts of such grammars are useful for the validation of their construction. We evaluated the quality of a grammar of French determiners that takes the form of a recursive transition network. The result of the application of this local grammar gives deeper syntactic information than chunking or information available in treebanks. We performed the evaluation by comparison with a corpus independently annotated with information on determiners. We obtained 86% precision and 92% recall on text not tagged for parts of speech.
Analyzing Ambiguity of Context-Free Grammars
DEFF Research Database (Denmark)
Brabrand, Claus; Giegerich, Robert; Møller, Anders
2010-01-01
It has been known since 1962 that the ambiguity problem for context-free grammars is undecidable. Ambiguity in context-free grammars is a recurring problem in language design and parser generation, as well as in applications where grammars are used as models of real-world physical structures. We...... observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this by presenting an ambiguity analysis framework based on conservative language approximations. As a concrete example, we propose a technique based on local regular approximations...
English Traditional Grammars An international perspective
Leitner, Gerhard
1991-01-01
Until recently grammars of English have received surprisingly little scholarly attention, while a lot of research is done on dictionaries. It appears, however, that learners of English shy away from modern grammars and prefer to consult dictionaries or traditional reference grammars instead. This raises questions as to the relationship between theoretical linguistics and grammar writing and calls for more research into this area, especially for the period from 1800 onwards, which was crucial for the development of grammatical thinking and its acceptance (or rejection) at all educational levels
Product Grammars for Alignment and Folding.
Höner Zu Siederdissen, Christian; Hofacker, Ivo L; Stadler, Peter F
2015-01-01
We develop a theory of algebraic operations over linear and context-free grammars that makes it possible to combine simple "atomic" grammars operating on single sequences into complex, multi-dimensional grammars. We demonstrate the utility of this framework by constructing the search spaces of complex alignment problems on multiple input sequences explicitly as algebraic expressions of very simple one-dimensional grammars. In particular, we provide a fully worked frameshift-aware, semiglobal DNA-protein alignment algorithm whose grammar is composed of products of small, atomic grammars. The compiler accompanying our theory makes it easy to experiment with the combination of multiple grammars and different operations. Composite grammars can be written out in L(A)T(E)X for documentation and as a guide to implementation of dynamic programming algorithms. An embedding in Haskell as a domain-specific language makes the theory directly accessible to writing and using grammar products without the detour of an external compiler. Software and supplemental files available here: http://www.bioinf. uni-leipzig.de/Software/gramprod/.
A Brief Study on the Grammar Theory
Institute of Scientific and Technical Information of China (English)
李爱华
2013-01-01
Grammar has been an important part of school teaching, language study and applying, and the word grammar has vari-ous definitions. During the development of linguistics, lots of grammatical schools emerge, and different schools have different opinions on grammar. This article first of all presents some different definitions and theories of different grammatical schools. It then analyses some main grammatical theories of those schools. Finally, it airs the present writer ’s view about the nature of gram-mar by analyzing specifically the opinions of those different grammatical schools.
Grammar and Its Teaching: Challenging the Myths
Institute of Scientific and Technical Information of China (English)
Diane Larsen-Freeman
2008-01-01
@@ Grammar is often misunderstood in the language teaching field.The misconception lies in the view that grammar is a collection of arbitrary rules about static structures in the language.Further questionable claims are that the structures do not have to be taught,learners will acquire them on their own,or if the structures are taught,the lessons that ensue will he boring.Consequently,communicative and proficiency-based teaching approaches sometimes unduly limit grammar instruction.Of the many claims about grammar that deserve to be called myths,this digest will challenge ten.
The minimalist grammar of action.
Pastra, Katerina; Aloimonos, Yiannis
2012-01-12
Language and action have been found to share a common neural basis and in particular a common 'syntax', an analogous hierarchical and compositional organization. While language structure analysis has led to the formulation of different grammatical formalisms and associated discriminative or generative computational models, the structure of action is still elusive and so are the related computational models. However, structuring action has important implications on action learning and generalization, in both human cognition research and computation. In this study, we present a biologically inspired generative grammar of action, which employs the structure-building operations and principles of Chomsky's Minimalist Programme as a reference model. In this grammar, action terminals combine hierarchically into temporal sequences of actions of increasing complexity; the actions are bound with the involved tools and affected objects and are governed by certain goals. We show, how the tool role and the affected-object role of an entity within an action drives the derivation of the action syntax in this grammar and controls recursion, merge and move, the latter being mechanisms that manifest themselves not only in human language, but in human action too.
Dynamic Combinatorial Libraries : From Exploring Molecular Recognition to Systems Chemistry
Li, Jianwei; Nowak, Piotr; Otto, Sijbren
2013-01-01
Dynamic combinatorial chemistry (DCC) is a subset of combinatorial chemistry where the library members interconvert continuously by exchanging building blocks with each other. Dynamic combinatorial libraries (DCLs) are powerful tools for discovering the unexpected and have given rise to many
Probabilistic methods in combinatorial analysis
Sachkov, Vladimir N
2014-01-01
This 1997 work explores the role of probabilistic methods for solving combinatorial problems. These methods not only provide the means of efficiently using such notions as characteristic and generating functions, the moment method and so on but also let us use the powerful technique of limit theorems. The basic objects under investigation are nonnegative matrices, partitions and mappings of finite sets, with special emphasis on permutations and graphs, and equivalence classes specified on sequences of finite length consisting of elements of partially ordered sets; these specify the probabilist
Statistical mechanics of combinatorial auctions
Galla, Tobias; Leone, Michele; Marsili, Matteo; Sellitto, Mauro; Weigt, Martin; Zecchina, Riccardo
2006-05-01
Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solutions. We introduce an iterative algorithm to solve intermediate and large instances, and discuss competing states of optimal revenue and maximal number of satisfied bidders. The algorithm can be generalized to the hard phase and to more sophisticated auction protocols.
Fairness in Combinatorial Auctioning Systems
Saini, Megha
2008-01-01
One of the Multi-Agent Systems that is widely used by various government agencies, buyers and sellers in a market economy, in such a manner so as to attain optimized resource allocation, is the Combinatorial Auctioning System (CAS). We study another important aspect of resource allocations in CAS, namely fairness. We present two important notions of fairness in CAS, extended fairness and basic fairness. We give an algorithm that works by incorporating a metric to ensure fairness in a CAS that uses the Vickrey-Clark-Groves (VCG) mechanism, and uses an algorithm of Sandholm to achieve optimality. Mathematical formulations are given to represent measures of extended fairness and basic fairness.
Cubature formulas on combinatorial graphs
Pesenson, Isaac Z
2011-01-01
Many contemporary applications, for example, cataloging of galaxies, document analysis, face recognition, learning theory, image processing, operate with a large amount of data which is often represented as a graph embedded into a high dimensional Euclidean space. The variety of problems arising in contemporary data processing requires development on graphs such topics of the classical harmonic analysis as Shannon sampling, splines, wavelets, cubature formulas. The goal of the paper is to establish cubature formulas on finite combinatorial graphs. The results have direct applications to problems that arise in connection with data filtering, data denoising and data dimension reduction.
Missed periods and other grammar scares how to avoid unplanned and unwanted grammar errors
Baranick, Jenny
2012-01-01
Grammar has finally let its hair down! Unlike uptight grammar books that overwhelm us with every single grammar rule, Missed Periods and Other Grammar Scares is like a bikini: it's fun, flirty, and covers only the most important bits. Its lessons, which are 100 percent free of complicated grammar jargon, have been carefully selected to include today's most common, noticeable errors-the ones that confuse our readers or make them wonder if we are, in fact, smarter than a fifth grader. What is the proper use of an apostrophe? When should an ellipsis be used instead of an em dash? Why do we capita
Atomical Grothendieck categories
Directory of Open Access Journals (Sweden)
C. Năstăsescu
2003-01-01
Full Text Available Motivated by the study of Gabriel dimension of a Grothendieck category, we introduce the concept of atomical Grothendieck category, which has only two localizing subcategories, and we give a classification of this type of Grothendieck categories.
Combinatorial algorithms for the seriation problem
Seminaroti, Matteo
2016-01-01
In this thesis we study the seriation problem, a combinatorial problem arising in data analysis, which asks to sequence a set of objects in such a way that similar objects are ordered close to each other. We focus on the combinatorial structure and properties of Robinsonian matrices, a special class
Combinatorial Interpretation of General Eulerian Numbers
Directory of Open Access Journals (Sweden)
Tingyao Xiong
2014-01-01
Full Text Available Since the 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and q-Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on general arithmetic progressions a,a+d,a+2d,….
Combinatorial Solutions to Normal Ordering of Bosons
Blasiak, P; Horzela, A; Penson, K A; Solomon, A I
2005-01-01
We present a combinatorial method of constructing solutions to the normal ordering of boson operators. Generalizations of standard combinatorial notions - the Stirling and Bell numbers, Bell polynomials and Dobinski relations - lead to calculational tools which allow to find explicitly normally ordered forms for a large class of operator functions.
Heafford, Michael
1993-01-01
Attempts to clarify the role of grammar in second-language instruction. It is suggested that changes in language teaching have encouraged the view that grammar is one of several dimensions along which learners need to progress to achieve greater proficiency but that it should not be dominant. (22 references) (CK)
Reading and Grammar Learning through Mobile Phones
Wang, Shudong; Smith, Simon
2013-01-01
This paper describes an ongoing language-learning project, three years into its development. We examine both the feasibility and the limitations of developing English reading and grammar skills through the interface of mobile phones. Throughout the project, reading and grammar materials were regularly sent to students' mobile phones. Students read…
The Role of Output in Grammar Learning
Institute of Scientific and Technical Information of China (English)
尹莉; 段薇; 谢璐
2014-01-01
In China, English teachers tend to emphasize a lot on the importance of grammar learning because knowledge of gram⁃mar is the base of the competence of communication. This thesis just focuses on how output affects students ’grammar learning by analyzing the role of output in learning of English and the strategies of English learning.
Making a Case for Rhetorical Grammar
Micciche, Laura R.
2004-01-01
Rhetorical grammar analysis encourages students to view writing as a material social practice in which meaning is actively made, rather than passively relayed or effortlessly produced. The study of rhetorical grammar can demonstrate to students that language does purposeful, consequential work in the world--work that can be learned and applied.
Reading and Grammar Learning through Mobile Phones
Wang, Shudong; Smith, Simon
2013-01-01
This paper describes an ongoing language-learning project, three years into its development. We examine both the feasibility and the limitations of developing English reading and grammar skills through the interface of mobile phones. Throughout the project, reading and grammar materials were regularly sent to students' mobile phones. Students…
From Attribute Grammars to Constraint Handling Rules
Serrano Mena, A.; Hage, J.
2016-01-01
Attribute grammars provide a framework to de ne compu- tations over trees, by decorating those trees with attributes. Attribute grammars have been successfully applied in many areas, including compiler construction and natural language processing. In this paper we present a translation of attribute
Grammar-Based Teaching: A Practitioner's Perspective
Azar, Betty
2007-01-01
This article addresses the role of grammar in second language instruction from the point of view of a longtime practitioner. It outlines the basic methods and assumptions underlying Grammar-Based Teaching (GBT), which the author sees as an effective, ever-evolving, and widespread pedagogical practice. The article discusses the importance of…
Student Teacher Beliefs on Grammar Instruction
Graus, Johan; Coppen, Peter-Arno
2016-01-01
The role of grammar teaching in foreign language education is a controversial one both in second language acquisition (SLA) research and language pedagogy and, as a result, a potential source of confusion to student teachers. The objective of this study was to gain insight into the beliefs on grammar teaching of student teachers of English as a…
Probe into Methods of Teaching English Grammar
Institute of Scientific and Technical Information of China (English)
刘春华
2011-01-01
@@ 1 Definition of grammar People sometlmes descibe grammaras the "rules" of a language, to be accurate,grammar is the science dealing with thesystematic rules of a language,its forms,inflections,syntax,and the rules of usingthem correctly.It is summarized from lan-guage use and practice,and reflects thelogic of thinking in people's speech orwriting.
Second Language Acquisition and Universal Grammar.
White, Lydia
1990-01-01
Discusses the motivation for Universal Grammar (UG), as assumed in the principles and parameters framework of generative grammar (Chomsky, 1981), focusing on the logical problem of first-language acquisition and the potential role of UG in second-language acquisition. Recent experimental research regarding the second-language status of the…
Towards a Framework for Teaching Spoken Grammar
Timmis, Ivor
2005-01-01
Since the advent of spoken corpora, descriptions of native speaker spoken grammar have become far more detailed and comprehensive. These insights, however, have been relatively slow to filter through to ELT practice. The aim of this article is to outline an approach to the teaching of native-speaker spoken grammar which is not only pedagogically…
Grammar and Usage: History and Myth
Watson, Ken
2010-01-01
The paper first traces the history of thinking about language from the Greek writers of the fifth century BC to the development of the first Greek grammar in about 100 BC. Since the glories of Ancient Greek literature predate the development of grammar, there is every reason to doubt the received wisdom that one must have an explicit knowledge of…
Grammar-Guided Writing for AAC Users
Hunnicutt, Sheri; Magnuson, Tina
2007-01-01
A method of grammar-guided writing has been devised to guide graphic sign users through the construction of text messages for use in e-mail and other applications with a remote receiver. The purpose is to promote morphologically and syntactically correct sentences. The available grammatical structures in grammar-guided writing are the highest…
Reading and Grammar Learning through Mobile Phones
Wang, Shudong; Smith, Simon
2013-01-01
This paper describes an ongoing language-learning project, three years into its development. We examine both the feasibility and the limitations of developing English reading and grammar skills through the interface of mobile phones. Throughout the project, reading and grammar materials were regularly sent to students' mobile phones. Students read…
Video Game Based Learning in English Grammar
Singaravelu, G.
2008-01-01
The study enlightens the effectiveness of Video Game Based Learning in English Grammar at standard VI. A Video Game package was prepared and it consisted of self-learning activities in play way manner which attracted the minds of the young learners. Chief objective: Find out the effectiveness of Video-Game based learning in English grammar.…
Albanian Basic Course: Exercises in Grammar.
Defense Language Inst., Washington, DC.
This volume of exercises in grammar has been designed by the Defense Language Institute as a supplement to volumes 2-6 to reinforce and overlearn grammar patterns, with emphasis on case structure through specially developed sentences. Contents include exercises on: (1) interrogative pronouns, (2) declension of nouns, (3) demonstrative adjectives,…
Exploring Dyslexics' Phonological Deficit II: Phonological Grammar
Szenkovits, Gayaneh; Darma, Quynliaan; Darcy, Isabelle; Ramus, Franck
2016-01-01
Language learners have to acquire the phonological grammar of their native language, and different levels of representations on which the grammar operates. Developmental dyslexia is associated with a phonological deficit, which is commonly assumed to stem from degraded phonological representations. The present study investigates one aspect of the…
Towards a Pedagogy of Grammar Instruction
Richards, Jack C.; Reppen, Randi
2014-01-01
Grammar can be viewed both as knowledge and as ability. When viewed as knowledge, the focus is on rules for sentence formation. When viewed as ability, the focus is on how grammar is used as a resource in the creation of spoken and written texts. Twelve principles are proposed as the basis for a pedagogy that focusses on acquiring learning to use…
Flexible Processing and the Design of Grammar
Sag, Ivan A.; Wasow, Thomas
2015-01-01
We explore the consequences of letting the incremental and integrative nature of language processing inform the design of competence grammar. What emerges is a view of grammar as a system of local monotonic constraints that provide a direct characterization of the signs (the form-meaning correspondences) of a given language. This…
Studying Grammar in the Technological Age
Ediger, Marlow
2012-01-01
When being a student in grade school as well as in high school (1934-1946), grammar was heavily emphasized in English/language arts classes, particularly in grades four through the senior year in high school. Evidently, teachers and school administrators then saw a theoretical way to assist pupils in writing achievement. Grammar and writing were…
Pratiquer une grammaire textuelle (Practicing Textual Grammar).
Bourdet, Jean-Francois
1992-01-01
A discussion of textual, as contrasted with traditional, grammar for French second-language instruction argues that textual grammar is essential for acquisition of communicative competence because it identifies grammatical facts relevant to everyday communication and allows the student to experience the construction of meaning through them. (MSE)
Competitive exclusion and coexistence of universal grammars.
Mitchener, W Garrett; Nowak, Martin A
2003-01-01
Universal grammar (UG) is a list of innate constraints that specify the set of grammars that can be learned by the child during primary language acquisition. UG of the human brain has been shaped by evolution. Evolution requires variation. Hence, we have to postulate and study variation of UG. We investigate evolutionary dynamics and language acquisition in the context of multiple UGs. We provide examples for competitive exclusion and stable coexistence of different UGs. More specific UGs admit fewer candidate grammars, and less specific UGs admit more candidate grammars. We will analyze conditions for more specific UGs to outcompete less specific UGs and vice versa. An interesting finding is that less specific UGs can resist invasion by more specific UGs if learning is more accurate. In other words, accurate learning stabilizes UGs that admit large numbers of candidate grammars.
Process Grammar The Basis of Morphology
Leyton, Michael
2012-01-01
Leyton's Process Grammar has been applied by scientists and engineers in many disciplines including medical diagnosis, geology, computer-aided design, meteorology, biological anatomy, neuroscience, chemical engineering, etc. This book demonstrates the following: The Process Grammar invents several entirely new concepts in biological morphology and manufacturing design, and shows that these concepts are fundamentally important. The Process Grammar has process-inference rules that give, to morphological transitions, powerful new causal explanations. Remarkably, the book gives a profound unification of biological morphology and vehicle design. The book invents over 30 new CAD operations that realize fundamentally important functions of a product. A crucial fact is that the Process Grammar is an example of the laws in Leyton's Generative Theory of Shape which give the ability to recover the design intents for which the shape features of a CAD model were created. The book demonstrates that the Process Grammar ...
Weak Precedence Story Parsing Grammar
Institute of Scientific and Technical Information of China (English)
张松懋
1995-01-01
Story understanding is one of the important branches of natural language understanding research in AI techniques.The story understanding approach based on Story Parsing Grammar (SPG) involves that SPG is used to represent different abstracting processes of stories with different levels in story understanding and that the story understanding process is converted to the recognition process of stories using the syntactic parser of SPG.This kind of story understanding is called story parsing.In this paper,firstly a subclass of SPG,called Weak Precedence SPG(WPSPG),is defined.Afterwards the syntactic parsing algorithm of WPSPG is studied.An example of story parsing is also given.
A Survey of Grammar Instruction from Scholastic Perspective
Peng, Yanghua
2017-01-01
The study of grammar has been paid much attention and the grammar instruction becomes an emphasis and key problem in English language teaching and learning. How to instruct students grammar appropriately becomes controversial for some English teachers increasingly. Some linguistics, theorists and teachers hold that the grammar instruction should…
Using a Linguistic Theory of Humour in Teaching English Grammar
Abdulmajeed, Rufaidah Kamal; Hameed, Sarab Khalil
2017-01-01
Teachers who teach a new language grammar do not usually have the time and the proper situation to introduce humour when starting a new topic in grammar. There are many different opinions about teaching grammar. Many teachers seem to believe in the importance of grammar lessons devoted to a study of language rules and practical exercises. Other…
What English Teachers Need to Know about Grammar.
Murdick, William
1996-01-01
Suggests that English teachers need to know that grammar is a difficult subject; know what children know about grammar; know that grammatical error is complex; and know more about language than just grammar. Concludes with the advice of Noam Chomsky--that grammar should be taught for its own intrinsic interest. (RS)
Ambiguity Detection Methods for Context-Free Grammars
Basten, H.J.S.
2007-01-01
The Meta-Environment enables the creation of grammars using the SDF formalism. From these grammars an SGLR parser can be generated. One of the advantages of these parsers is that they can handle the entire class of context-free grammars (CFGs). The grammar developer does not have to squeeze his gram
What English Teachers Need to Know about Grammar.
Murdick, William
1996-01-01
Suggests that English teachers need to know that grammar is a difficult subject; know what children know about grammar; know that grammatical error is complex; and know more about language than just grammar. Concludes with the advice of Noam Chomsky--that grammar should be taught for its own intrinsic interest. (RS)
The Importance of English Grammar Teaching at College
Institute of Scientific and Technical Information of China (English)
孙丽伟
2012-01-01
This paper attempts to elaborate the importance of grammar teaching at college through the four linguistic skills: listening, speaking, reading,and writing.The nature of grammar determines the significance of grammar teaching. This paper shows the importance of grammar teaching from its relationship with listening,speaking,reading and writing.
Pourquoi les exercices de grammaire? (Why Grammar Exercises?)
Bastuji, Jacqueline
1977-01-01
Recent theories and experiementation running the gamut from the absolute necessity of grammar to its uselessness in teaching a language form the basis of this article. Topics covered are: a typology of the grammar exercise; explicit grammar and linguistic competence; grammar exercises responding to real needs. (Text is in French.) (AMH)
Hanna, Jeff; Mejias, Sandrine; Schelstraete, Marie-Anne; Pulvermüller, Friedemann; Shtyrov, Yury; Van der Lely, Heather K J
2014-01-01
Though activation of Broca's region in the combinatorial processing of symbols (language, music) has been revealed by neurometabolic studies, most previous neurophysiological research found the earliest grammar indices in the temporal cortex, with inferior-frontal generators becoming active at relatively late stages. We use the attention- and task-free syntactic mismatch negativity (sMMN) event-related potential (ERP) to measure rapid and automatic sensitivity of the human brain to grammatical information in participants' native language (French). Further, sources underlying the MMN were estimated by applying the Parametrical Empirical Bayesian (PEB) approach, with the Multiple Sparse Priors (MSP) technique. Results showed reliable grammar-related activation focused on Broca's region already in the 150-190 ms time window, providing robust documentation of its involvement in the first stages of syntactic processing.
Institute of Scientific and Technical Information of China (English)
滕丽梅
2016-01-01
This paper analyzed how flipped classroom facilitated grammar teaching for English majors by indicating the principle status of students in class, shaping good classroom atmosphere of grammar learning and expanding English grammar teaching. Meanwhile, it raised strategies of flipped classroom applied in English majors' grammar teaching such as preparations before class and abundant teaching methods.
Combinatorial Chemistry for Optical Sensing Applications
Díaz-García, M. E.; Luis, G. Pina; Rivero-Espejel, I. A.
The recent interest in combinatorial chemistry for the synthesis of selective recognition materials for optical sensing applications is presented. The preparation, screening, and applications of libraries of ligands and chemosensors against molecular species and metal ions are first considered. Included in this chapter are also the developments involving applications of combinatorial approaches to the discovery of sol-gel and acrylic-based imprinted materials for optical sensing of antibiotics and pesticides, as well as libraries of doped sol-gels for high-throughput optical sensing of oxygen. The potential of combinatorial chemistry applied to the discovery of new sensing materials is highlighted.
Three-dimensional object representation by array grammars
Wang, Patrick S. P.
1991-02-01
A new approach for representing 3-d objects by 3-d array grammar is introduced. The concept of universal array grammar is proposed for 3-d object representation. it uses parallelism for pattern generation. Many interesting 3-d objecis can indeed he represented by this universal 3-d array grammar which paves a ground for 3-d object recognition. description and understanding. Keywords: 3-d array grammars. universal array grammars pattern generation. object representation parallel generation I.
Modelling dynamics with context-free grammars
García-Huerta, Juan-M.; Jiménez-Hernández, Hugo; Herrera-Navarro, Ana-M.; Hernández-Díaz, Teresa; Terol-Villalobos, Ivan
2014-03-01
This article presents a strategy to model the dynamics performed by vehicles in a freeway. The proposal consists on encode the movement as a set of finite states. A watershed-based segmentation is used to localize regions with high-probability of motion. Each state represents a proportion of a camera projection in a two-dimensional space, where each state is associated to a symbol, such that any combination of symbols is expressed as a language. Starting from a sequence of symbols through a linear algorithm a free-context grammar is inferred. This grammar represents a hierarchical view of common sequences observed into the scene. Most probable grammar rules express common rules associated to normal movement behavior. Less probable rules express themselves a way to quantify non-common behaviors and they might need more attention. Finally, all sequences of symbols that does not match with the grammar rules, may express itself uncommon behaviors (abnormal). The grammar inference is built with several sequences of images taken from a freeway. Testing process uses the sequence of symbols emitted by the scenario, matching the grammar rules with common freeway behaviors. The process of detect abnormal/normal behaviors is managed as the task of verify if any word generated by the scenario is recognized by the grammar.
CAN ENUNCIATION CONTRIBUTE FOR TEACHING GRAMMAR?
Directory of Open Access Journals (Sweden)
Valdir do Nascimento Flores
2016-04-01
Full Text Available The article discusses which concept of grammar can be understood from the point of view of Émile Benveniste’s enunciative theory, compiled in Problems on general linguistics, volumes 1 and 2. In order to do so, we present a brief review of the different concepts that the term grammar has taken on throughout the linguistic studies developed in Brazil. The text ends with some considerations on the relevance of the proposal of an Enunciative Grammar to the teaching of mother tongue.
An Empirically Motivated Reinterpretation of Dependency Grammar
Covington, M A
1994-01-01
Dependency grammar is usually interpreted as equivalent to a strict form of X--bar theory that forbids the stacking of nodes of the same bar level (e.g., N' immediately dominating N' with the same head). But adequate accounts of _one_--anaphora and of the semantics of multiple modifiers require such stacking and accordingly argue against dependency grammar. Dependency grammar can be salvaged by reinterpreting its claims about phrase structure, so that modifiers map onto binary--branching X--bar trees rather than ``flat'' ones.
Accessing Specific Peptide Recognition by Combinatorial Chemistry
DEFF Research Database (Denmark)
Li, Ming
Peptide Recognition by Combinatorial Chemistry”. Molecular recognition is a specific interaction between two or more molecules through noncovalent bonding, such as hydrogen bonding, metal coordination, van der Waals forces, π−π, hydrophobic, or electrostatic interactions. The association involves kinetic....... Combinatorial chemistry was invented in 1980s based on observation of functional aspects of the adaptive immune system. It was employed for drug development and optimization in conjunction with high-throughput synthesis and screening. (chapter 2) Combinatorial chemistry is able to rapidly produce many thousands...... was studied with this hook peptide library via the beadbead adhesion screening approach. The recognition pairs interlocked and formed a complex. (chapter 8) During accessing peptide molecular recognition by combinatorial chemistry, we faced several problems, which were solved by a range of analytical...
Combinatorial Discovery and Optimization of New Materials
Institute of Scientific and Technical Information of China (English)
Gao Chen; Zhang Xinyi; Yan Dongsheng
2001-01-01
The concept of the combinatorial discovery and optimization of new materials, and its background,importance, and application, as well as its current status in the world, are briefly reviewed in this paper.
Conferences on Combinatorial and Additive Number Theory
2014-01-01
This proceedings volume is based on papers presented at the Workshops on Combinatorial and Additive Number Theory (CANT), which were held at the Graduate Center of the City University of New York in 2011 and 2012. The goal of the workshops is to survey recent progress in combinatorial number theory and related parts of mathematics. The workshop attracts researchers and students who discuss the state-of-the-art, open problems, and future challenges in number theory.
A product formula and combinatorial field theory
Horzela, A; Duchamp, G H E; Penson, K A; Solomon, A I
2004-01-01
We treat the problem of normally ordering expressions involving the standard boson operators a, a* where [a,a*]=1. We show that a simple product formula for formal power series - essentially an extension of the Taylor expansion - leads to a double exponential formula which enables a powerful graphical description of the generating functions of the combinatorial sequences associated with such functions - in essence, a combinatorial field theory. We apply these techniques to some examples related to specific physical Hamiltonians.
Cubical version of combinatorial differential forms
DEFF Research Database (Denmark)
Kock, Anders
2010-01-01
The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry.......The theory of combinatorial differential forms is usually presented in simplicial terms. We present here a cubical version; it depends on the possibility of forming affine combinations of mutual neighbour points in a manifold, in the context of synthetic differential geometry....
Poss, R.
2014-01-01
The concept of category from mathematics happens to be useful to computer programmers in many ways. Unfortunately, all "good" explanations of categories so far have been designed by mathematicians, or at least theoreticians with a strong background in mathematics, and this makes categories especiall
Stochastic phonological grammars and acceptability
Coleman, J; Coleman, John; Pierrehumbert, Janet
1997-01-01
In foundational works of generative phonology it is claimed that subjects can reliably discriminate between possible but non-occurring words and words that could not be English. In this paper we examine the use of a probabilistic phonological parser for words to model experimentally-obtained judgements of the acceptability of a set of nonsense words. We compared various methods of scoring the goodness of the parse as a predictor of acceptability. We found that the probability of the worst part is not the best score of acceptability, indicating that classical generative phonology and Optimality Theory miss an important fact, as these approaches do not recognise a mechanism by which the frequency of well-formed parts may ameliorate the unacceptability of low-frequency parts. We argue that probabilistic generative grammars are demonstrably a more psychologically realistic model of phonological competence than standard generative phonology or Optimality Theory.
The Compactness of Construction Grammars
Zadrozny, W
1995-01-01
We present an argument for {\\em construction grammars} based on the minimum description length (MDL) principle (a formal version of the Ockham Razor). The argument consists in using linguistic and computational evidence in setting up a formal model, and then applying the MDL principle to prove its superiority with respect to alternative models. We show that construction-based representations are at least an order of magnitude more compact that the corresponding lexicalized representations of the same linguistic data. The result is significant for our understanding of the relationship between syntax and semantics, and consequently for choosing NLP architectures. For instance, whether the processing should proceed in a pipeline from syntax to semantics to pragmatics, and whether all linguistic information should be combined in a set of constraints. From a broader perspective, this paper does not only argue for a certain model of processing, but also provides a methodology for determining advantages of different...
Universal Grammar, statistics or both?
Yang, Charles D
2004-10-01
Recent demonstrations of statistical learning in infants have reinvigorated the innateness versus learning debate in language acquisition. This article addresses these issues from both computational and developmental perspectives. First, I argue that statistical learning using transitional probabilities cannot reliably segment words when scaled to a realistic setting (e.g. child-directed English). To be successful, it must be constrained by knowledge of phonological structure. Then, turning to the bona fide theory of innateness--the Principles and Parameters framework--I argue that a full explanation of children's grammar development must abandon the domain-specific learning model of triggering, in favor of probabilistic learning mechanisms that might be domain-general but nevertheless operate in the domain-specific space of syntactic parameters.
Cognitive grammar and aphasic discourse.
Manning, Molly; Franklin, Sue
2016-01-01
In cognitive grammar (CG), there is no clear division between language and other cognitive processes; all linguistic form is conceptually meaningful. In this pilot study, a CG approach was applied to investigate whether people with aphasia (PWA) have cognitive linguistic difficulty not predicted from traditional, componential models of aphasia. Narrative samples from 22 PWA (6 fluent, 16 non-fluent) were compared with samples from 10 participants without aphasia. Between-group differences were tested statistically. PWA had significant difficulty with temporal sequencing, suggesting problems that are not uniquely linguistic. For some, these problems were doubly dissociated with naming, used as a general measure of severity, which indicates that cognitive linguistic difficulties are not linked with more widespread brain damage. Further investigation may lead to a richer account of aphasia in line with contemporary linguistics and cognitive science approaches.
Vocatives and discourse markers in textualinteractive grammar
Directory of Open Access Journals (Sweden)
Eduardo Penhavel
2012-12-01
Full Text Available In this paper, we discuss the class of Vocatives and the class of Discourse Markers as proposed within Textualinteractive Grammar, and we try to demonstrate that Vocatives can work as Discourse Markers.
A Concise Contrastive Grammar of English
DEFF Research Database (Denmark)
Hjulmand, Lise-Lotte
of the workbook is to supply students and teachers with material which can be used in connection with the study of grammar. The workbook is organised so that each chapter in the grammar book matches a chapter in the workbook. There are exercises of many different kinds in the workbook. Some aim at explanation......Like the first edition, this second revised edition of the workbook is intended to be used together with A Concise Contrastive Grammar of English for Danish Students, which is a systematic and pedagogical introduction to English grammar for Danish students of English at bachelor level. The purpose...... and exemplification, others at awareness-raising and recognition of particular structures. Some aim at production in the form of either insertion of particular forms or translation, others at recognising differences between English and Danish. Finally, there are a number of exercises where students get...
Measuring strategic control in artificial grammar learning.
Norman, Elisabeth; Price, Mark C; Jones, Emma
2011-12-01
In response to concerns with existing procedures for measuring strategic control over implicit knowledge in artificial grammar learning (AGL), we introduce a more stringent measurement procedure. After two separate training blocks which each consisted of letter strings derived from a different grammar, participants either judged the grammaticality of novel letter strings with respect to only one of these two grammars (pure-block condition), or had the target grammar varying randomly from trial to trial (novel mixed-block condition) which required a higher degree of conscious flexible control. Random variation in the colour and font of letters was introduced to disguise the nature of the rule and reduce explicit learning. Strategic control was observed both in the pure-block and mixed-block conditions, and even among participants who did not realise the rule was based on letter identity. This indicated detailed strategic control in the absence of explicit learning.
On Determinatives and the Category-Function Distinction: A Reply to Brett Reynolds
Lenchuk, Iryna; Ahmed, Amer
2014-01-01
This article examines the arguments made in the article "Determiners, Feline Marsupials, and the Category-Function Distinction: A Critique of ELT Grammars" by Brett Reynolds recently published in the "TESL Canada Journal" (2013). In our response, we demonstrate that the author's arguments are problematic on both…
Street, Ross
2012-01-01
Spurred by the new examples found by Kornel Szlach\\'anyi of a form of lax monoidal category, the author felt the time ripe to publish a reworking of Eilenberg-Kelly's original paper on closed categories appropriate to the laxer context. The new examples are connected with bialgebroids. With Stephen Lack, we have also used the concept to give an alternative definition of quantum category and quantum groupoid. Szlach\\'anyi has called the lax notion {\\em skew monoidal}. This paper defines {\\em skew closed category}, proves Yoneda lemmas for categories enriched over such, and looks at closed cocompletion.
The elements of grammar in 90 minutes
Hollander, Robert
2011-01-01
An eminent scholar explains the essentials of English grammar to those who never studied the basics as well as those who need a refresher course. Inspired by Strunk & White's classic The Elements of Style, this user-friendly guide focuses exclusively on grammar, explaining the individual parts of speech and their proper arrangement in sentence form. A modest investment of 90 minutes can provide readers of all ages with simple but important tools that will improve their communication skills. Dover (2011) original publication.
A Generative Grammar for Modal Syntagms
Galofaro, Francesco
2015-01-01
Part 1: Organisational Semiotics: Theory and Concepts; International audience; The contribution presents a generative grammar for Greimas’ semiotic square, designed to represent modal syntax. In particular: (1) the grammar will generate both modal syntagms and their structural descriptions; (2) the articulation of the immanent narrative structure will be clarified; (3) structural features which are not manifested on the linear surface will become easier to examine. This model contributes to c...
Encoding Frequency Information in Lexicalized Grammars
Carroll, J; Carroll, John; Weir, David
1997-01-01
We address the issue of how to associate frequency information with lexicalized grammar formalisms, using Lexicalized Tree Adjoining Grammar as a representative framework. We consider systematically a number of alternative probabilistic frameworks, evaluating their adequacy from both a theoretical and empirical perspective using data from existing large treebanks. We also propose three orthogonal approaches for backing off probability estimates to cope with the large number of parameters involved.
Capturing CFLs with Tree Adjoining Grammars
Rogers, J
1994-01-01
We define a decidable class of TAGs that is strongly equivalent to CFGs and is cubic-time parsable. This class serves to lexicalize CFGs in the same manner as the LCFGs of Schabes and Waters but with considerably less restriction on the form of the grammars. The class provides a normal form for TAGs that generate local sets in much the same way that regular grammars provide a normal form for CFGs that generate regular sets.
Pronominal expression rule ordering in Danish and the question of a discourse grammar
DEFF Research Database (Denmark)
Jakobsen, Lisbeth Falster
2005-01-01
Dansk, funktionel grammatik, discourse grammar, personlige pronominer, modtageorientering, referens......Dansk, funktionel grammatik, discourse grammar, personlige pronominer, modtageorientering, referens...
Generative Power and Closure Properties of Watson-Crick Grammars
Directory of Open Access Journals (Sweden)
Nurul Liyana Mohamad Zulkufli
2016-01-01
Full Text Available We define WK linear grammars, as an extension of WK regular grammars with linear grammar rules, and WK context-free grammars, thus investigating their computational power and closure properties. We show that WK linear grammars can generate some context-sensitive languages. Moreover, we demonstrate that the family of WK regular languages is the proper subset of the family of WK linear languages, but it is not comparable with the family of linear languages. We also establish that the Watson-Crick regular grammars are closed under almost all of the main closure operations.
A Communicative Approach to College English Grammar Teaching and Learning
Institute of Scientific and Technical Information of China (English)
LI Yong-xian
2016-01-01
In response to the misconception that Communicative Language Teaching means no teaching of grammar, it is argued that grammar is as important as traffic rules for safe and smooth traffic on the road. To achieve appropriate and effective commu-nication, a communicative approach to college grammar teaching and learning is proposed. Both teachers and learners should change their attitudes toward and conceptions about grammar teaching and learning;additionally, teaching grammar in the com-pany of reading and writing helps learners learn and acquire grammar in meaningful contexts.
Grammar Instruction for Writing Skills: Do Students Perceive Grammar as Useful?
Manley, Joan M.; Calk, Linda
1997-01-01
Examines second language students' perceptions of grammar instruction, with specific reference to writing skill. Discusses issues involved in defining a role for grammar study and presents excerpts from student essays and explanations of classroom lessons. Results indicate that the instruction provided helped to improve students' ability to use…
Watson, Annabel Mary
2015-01-01
This paper reports on an investigation of L1 English teachers' conceptual and evaluative beliefs about teaching grammar, one strand of a larger Economic and Social Research Council (ESRC)-funded investigation into the impact of contextualised grammar teaching [RES-062-23-0775]. Thirty-one teachers in English secondary schools were interviewed…
Watson, Annabel Mary
2015-01-01
This paper reports on an investigation of L1 English teachers' conceptual and evaluative beliefs about teaching grammar, one strand of a larger Economic and Social Research Council (ESRC)-funded investigation into the impact of contextualised grammar teaching [RES-062-23-0775]. Thirty-one teachers in English secondary schools were interviewed…
Watson, Annabel Mary
2015-01-01
This paper reports on an investigation of L1 English teachers' conceptual and evaluative beliefs about teaching grammar, one strand of a larger Economic and Social Research Council (ESRC)-funded investigation into the impact of contextualised grammar teaching [RES-062-23-0775]. Thirty-one teachers in English secondary schools were interviewed…
Vannestal, Maria Estling; Lindquist, Hans
2007-01-01
Corpora have been used for pedagogical purposes for more than two decades but empirical studies are relatively rare, particularly in the context of grammar teaching. The present study focuses on students' attitudes towards grammar and how these attitudes are affected by the introduction of concordancing. The principal aims of the project were to…
Butler, Christopher S.
2012-01-01
The aim of this paper is to compare the treatment of syntactic functions, and more particularly those traditionally labelled as Subject and Object, in Functional Discourse Grammar and Role and Reference Grammar. Relevant aspects of the overall structure of the two theories are briefly described. The concept of alignment between levels of the…
Winkler, A.P.
2016-01-01
The grammar written in Latin, in 1668, by the Jesuit missionary Father Diego Luis de Sanvitores (1627-1672) is the oldest description we have of Chamorro, a language spoken on the Mariana islands. The grammar received a number of bad reviews and as a consequence has become neglected and almost
The Tower of Babel and the Teaching of Grammar: Writing Instruction for a New Century.
Martinsen, Amy
2000-01-01
Considers the teaching of grammar and its importance in the writing classroom. Examines what grammar is; why writing instruction has moved away from grammar; differing opinions regarding grammar and writing instruction; and grammar's place in the writing classroom of the new century. Argues that grammar must be applied to students' own writing.…
Extending Grammars to New Domains.
1984-01-01
Adding new attributes to lexical entries. Problems: • Discriminating between homographs and multiple word-senses. • Discriminating between category...for a word already in the lexicon, indicating that its lexical entry needs revising or that it requires additional entries as a homograph . For example...word to be added to DIAGRAM’s lexicon was "terminal". It also is a homograph , and is assigned by lexicographers ordinarily to the major word categories
Combinatorial stresses kill pathogenic Candida species.
Kaloriti, Despoina; Tillmann, Anna; Cook, Emily; Jacobsen, Mette; You, Tao; Lenardon, Megan; Ames, Lauren; Barahona, Mauricio; Chandrasekaran, Komelapriya; Coghill, George; Goodman, Daniel; Gow, Neil A R; Grebogi, Celso; Ho, Hsueh-Lui; Ingram, Piers; McDonagh, Andrew; de Moura, Alessandro P S; Pang, Wei; Puttnam, Melanie; Radmaneshfar, Elahe; Romano, Maria Carmen; Silk, Daniel; Stark, Jaroslav; Stumpf, Michael; Thiel, Marco; Thorne, Thomas; Usher, Jane; Yin, Zhikang; Haynes, Ken; Brown, Alistair J P
2012-10-01
Pathogenic microbes exist in dynamic niches and have evolved robust adaptive responses to promote survival in their hosts. The major fungal pathogens of humans, Candida albicans and Candida glabrata, are exposed to a range of environmental stresses in their hosts including osmotic, oxidative and nitrosative stresses. Significant efforts have been devoted to the characterization of the adaptive responses to each of these stresses. In the wild, cells are frequently exposed simultaneously to combinations of these stresses and yet the effects of such combinatorial stresses have not been explored. We have developed a common experimental platform to facilitate the comparison of combinatorial stress responses in C. glabrata and C. albicans. This platform is based on the growth of cells in buffered rich medium at 30°C, and was used to define relatively low, medium and high doses of osmotic (NaCl), oxidative (H(2)O(2)) and nitrosative stresses (e.g., dipropylenetriamine (DPTA)-NONOate). The effects of combinatorial stresses were compared with the corresponding individual stresses under these growth conditions. We show for the first time that certain combinations of combinatorial stress are especially potent in terms of their ability to kill C. albicans and C. glabrata and/or inhibit their growth. This was the case for combinations of osmotic plus oxidative stress and for oxidative plus nitrosative stress. We predict that combinatorial stresses may be highly significant in host defences against these pathogenic yeasts.
Unsupervised grammar induction of clinical report sublanguage
Directory of Open Access Journals (Sweden)
Kate Rohit J
2012-10-01
Full Text Available Abstract Background Clinical reports are written using a subset of natural language while employing many domain-specific terms; such a language is also known as a sublanguage for a scientific or a technical domain. Different genres of clinical reports use different sublaguages, and in addition, different medical facilities use different medical language conventions. This makes supervised training of a parser for clinical sentences very difficult as it would require expensive annotation effort to adapt to every type of clinical text. Methods In this paper, we present an unsupervised method which automatically induces a grammar and a parser for the sublanguage of a given genre of clinical reports from a corpus with no annotations. In order to capture sentence structures specific to clinical domains, the grammar is induced in terms of semantic classes of clinical terms in addition to part-of-speech tags. Our method induces grammar by minimizing the combined encoding cost of the grammar and the corresponding sentence derivations. The probabilities for the productions of the induced grammar are then learned from the unannotated corpus using an instance of the expectation-maximization algorithm. Results Our experiments show that the induced grammar is able to parse novel sentences. Using a dataset of discharge summary sentences with no annotations, our method obtains 60.5% F-measure for parse-bracketing on sentences of maximum length 10. By varying a parameter, the method can induce a range of grammars, from very specific to very general, and obtains the best performance in between the two extremes.
Directory of Open Access Journals (Sweden)
Peter F. Stadler
2013-09-01
Full Text Available Polymers of hydrogen cyanide and their hydrolysis products constitute a plausible, but still poorly understood proposal for early prebiotic chemistry on Earth. HCN polymers are generated by the interplay of more than a dozen distinctive reaction mechanisms and form a highly complex mixture. Here we use a computational model based on graph grammars as a means of exploring the chemical spaces of HCN polymerization and hydrolysis. A fundamental issue is to understand the combinatorial explosion inherent in large, complex chemical systems. We demonstrate that experimental data, here obtained by mass spectrometry, and computationally predicted free energies together can be used to guide the exploration of the chemical space and makes it feasible to investigate likely pathways and chemical motifs even in potentially open-ended chemical systems.
Algebraic Theories and (Infinity,1)-Categories
Cranch, James
2010-01-01
We adapt the classical framework of algebraic theories to work in the setting of (infinity,1)-categories developed by Joyal and Lurie. This gives a suitable approach for describing highly structured objects from homotopy theory. A central example, treated at length, is the theory of E_infinity spaces: this has a tidy combinatorial description in terms of span diagrams of finite sets. We introduce a theory of distributive laws, allowing us to describe objects with two distributing E_infinity stuctures. From this we produce a theory of E_infinity ring spaces. We also study grouplike objects, and produce theories modelling infinite loop spaces (or connective spectra), and infinite loop spaces with coherent multiplicative structure (or connective ring spectra). We use this to construct the units of a grouplike E_infinity ring space in a natural manner. Lastly we provide a speculative pleasant description of the K-theory of monoidal quasicategories and quasicategories with ring-like structures.
A few thoughts about teaching listening and grammar
Institute of Scientific and Technical Information of China (English)
吴西
2014-01-01
Listening and grammar are the most difficult subjects for both teacher and students. This passage discussed how to visual aid and brain storming in the listening class;and the importance of confidence in the grammar teaching and learning.
Current Developments in Research on the Teaching of Grammar
Institute of Scientific and Technical Information of China (English)
Hossein Nassaji; Sandra Fotos
2006-01-01
@@ With the rise of communicative methodology in the late 1970s, the role of grammar instruction in second language learning was downplayed, and it was even suggested that teaching grammar was not only unhelpful but might actually be detrimental.
Quel Eclectisme en grammaire? (What Eclecticism in Grammar?)
Beacco, Jean-Claude
1987-01-01
The teaching of grammar provides more options for teacher strategies than almost any other area of language teaching, but because of the nature of grammar and classroom language instruction, using a variety of approaches is a more appropriate strategy. (MSE)
A new variant of Petri net controlled grammars
Jan, Nurhidaya Mohamad; Turaev, Sherzod; Fong, Wan Heng; Sarmin, Nor Haniza
2015-10-01
A Petri net controlled grammar is a Petri net with respect to a context-free grammar where the successful derivations of the grammar can be simulated using the occurrence sequences of the net. In this paper, we introduce a new variant of Petri net controlled grammars, called a place-labeled Petri net controlled grammar, which is a context-free grammar equipped with a Petri net and a function which maps places of the net to productions of the grammar. The language consists of all terminal strings that can be obtained by parallelly applying multisets of the rules which are the images of the sets of the input places of transitions in a successful occurrence sequence of the Petri net. We study the effect of the different labeling strategies to the computational power and establish lower and upper bounds for the generative capacity of place-labeled Petri net controlled grammars.
Partition functions and graphs: A combinatorial approach
Solomon, A I; Duchamp, G; Horzela, A; Penson, K A; Solomon, Allan I.; Blasiak, Pawel; Duchamp, Gerard; Horzela, Andrzej; Penson, Karol A.
2004-01-01
Although symmetry methods and analysis are a necessary ingredient in every physicist's toolkit, rather less use has been made of combinatorial methods. One exception is in the realm of Statistical Physics, where the calculation of the partition function, for example, is essentially a combinatorial problem. In this talk we shall show that one approach is via the normal ordering of the second quantized operators appearing in the partition function. This in turn leads to a combinatorial graphical description, giving essentially Feynman-type graphs associated with the theory. We illustrate this methodology by the explicit calculation of two model examples, the free boson gas and a superfluid boson model. We show how the calculation of partition functions can be facilitated by knowledge of the combinatorics of the boson normal ordering problem; this naturally gives rise to the Bell numbers of combinatorics. The associated graphical representation of these numbers gives a perturbation expansion in terms of a sequen...
Accessing Specific Peptide Recognition by Combinatorial Chemistry
DEFF Research Database (Denmark)
Li, Ming
Molecular recognition is at the basis of all processes for life, and plays a central role in many biological processes, such as protein folding, the structural organization of cells and organelles, signal transduction, and the immune response. Hence, my PhD project is entitled “Accessing Specific...... Peptide Recognition by Combinatorial Chemistry”. Molecular recognition is a specific interaction between two or more molecules through noncovalent bonding, such as hydrogen bonding, metal coordination, van der Waals forces, π−π, hydrophobic, or electrostatic interactions. The association involves kinetic....... Combinatorial chemistry was invented in 1980s based on observation of functional aspects of the adaptive immune system. It was employed for drug development and optimization in conjunction with high-throughput synthesis and screening. (chapter 2) Combinatorial chemistry is able to rapidly produce many thousands...
Categories of Fractions Revisited
Fritz, Tobias
2008-01-01
The theory of categories of fractions as originally developed by Gabriel and Zisman is reviewed in a pedagogical manner giving detailed proofs of all statements. A weakening of the category of fractions axioms used by Higson is discussed and shown to be equivalent to the original axioms.
Constraints and Logic Programming in Grammars and Language Analysis
DEFF Research Database (Denmark)
Christiansen, Henning
2014-01-01
Constraints are an important notion in grammars and language analysis, and constraint programming techniques have been developed concurrently for solving a variety of complex problems. In this chapter we consider the synthesis of these branches into practical and effective methods for language...... methods that combine constraints with logic grammars such as Definite Clause Grammars and CHR Grammars, and show also a direct relationship to abductive reasoning....
The Complexity of Recognition of Linguistically Adequate Dependency Grammars
Neuhaus, P; Neuhaus, Peter; Broeker, Norbert
1997-01-01
Results of computational complexity exist for a wide range of phrase structure-based grammar formalisms, while there is an apparent lack of such results for dependency-based formalisms. We here adapt a result on the complexity of ID/LP-grammars to the dependency framework. Contrary to previous studies on heavily restricted dependency grammars, we prove that recognition (and thus, parsing) of linguistically adequate dependency grammars is NP-complete.
Combinatorial study of colored Hurwitz polyz\\^etas
Enjalbert, Jean-Yves; Minh, Hoang Ngoc
2012-01-01
A combinatorial study discloses two surjective morphisms between generalized shuffle algebras and algebras generated by the colored Hurwitz polyz\\^etas. The combinatorial aspects of the products and co-products involved in these algebras will be examined.
Combinatorial set theory partition relations for cardinals
Erdös, P; Hajnal, A; Rado, P
2011-01-01
This work presents the most important combinatorial ideas in partition calculus and discusses ordinary partition relations for cardinals without the assumption of the generalized continuum hypothesis. A separate section of the book describes the main partition symbols scattered in the literature. A chapter on the applications of the combinatorial methods in partition calculus includes a section on topology with Arhangel''skii''s famous result that a first countable compact Hausdorff space has cardinality, at most continuum. Several sections on set mappings are included as well as an account of
Toward Chemical Implementation of Encoded Combinatorial Libraries
DEFF Research Database (Denmark)
Nielsen, John; Janda, Kim D.
1994-01-01
by existing methodologies. Here we detail the synthesis of several matrices and the necessary chemistry to implement the conceptual scheme. In addition, we disclose how this novel technology permits a controlled ′dendritic" display of the chemical libraries. © 1994 Academic Press. All rights reserved.......The recent application of "combinatorial libraries" to supplement existing drug screening processes might simplify and accelerate the search for new lead compounds or drugs. Recently, a scheme for encoded combinatorial chemistry was put forward to surmount a number of the limitations possessed...
Combinatorial designs a tribute to Haim Hanani
Hartman, A
1989-01-01
Haim Hanani pioneered the techniques for constructing designs and the theory of pairwise balanced designs, leading directly to Wilson''s Existence Theorem. He also led the way in the study of resolvable designs, covering and packing problems, latin squares, 3-designs and other combinatorial configurations.The Hanani volume is a collection of research and survey papers at the forefront of research in combinatorial design theory, including Professor Hanani''s own latest work on Balanced Incomplete Block Designs. Other areas covered include Steiner systems, finite geometries, quasigroups, and t-designs.
The structure of modern standard French a student grammar
Hansen, Maj-Britt Mosegaard
2016-01-01
This book is an advanced student's grammar of French that integrates traditional grammar with knowledge and insights from modern linguistics. It assumes some prior knowledge of French grammar but is designed to be accessible to those with no background in linguistics.
LR-parsing of Extended Context-free Grammars
DEFF Research Database (Denmark)
Madsen, Ole Lehrmann; Kristensen, Bent Bruun
1976-01-01
To improve the readability of a grammar it is common to use extended context free grammars (ECFGs) which are context free grammars (CFGs) extended with the repetition operator (*), the alternation operator (¦) and parentheses to express the right hand sides of the productions. The topic treated h...
Playful Explicitness with Grammar: A Pedagogy for Writing
Myhill, Debra; Jones, Susan; Watson, Annabel; Lines, Helen
2013-01-01
The place of grammar within the teaching of writing has long been contested and successive research studies have indicated no correlation between grammar teaching and writing attainment. However, a recent study has shown a significant positive impact on writing outcomes when the grammar input is intrinsically linked to the demands of the writing…
Web Exclusive--The Case for Not Teaching Grammar
Zwagerman, Sean
2012-01-01
The value of grammar instruction in improving students' writing has been debated for at least 150 years, and is showing no signs of tiring. But would teaching grammar actually improve writing? In fact, study after study has shown that the study of grammar does not translate to improved student writing. Indeed, the basic skills of writing are not…
From left-regular to Greibach normal form grammars
Nijholt, Antinus
1979-01-01
Each context-free grammar can be transformed to a context-free grammar in Greibach normal form, that is, a context-free grammar where each right-hand side of a prorfuction begins with a terminal symbol and the remainder of the right-hand side consists of nonterminal symbols. In this short paper we
Safford, Kimberly
2016-01-01
The research examined the impact on teachers of the grammar element of a new statutory test in Spelling, Punctuation and Grammar (SPaG) in primary schools in England. The research aimed to evaluate the nature and the extent of changes to the teaching of grammar and to wider literacy teaching since the introduction of the test in 2013. The research…
Learning unification-based grammars using the Spoken English Corpus
Osborne, M; Osborne, Miles; Bridge, Derek
1994-01-01
This paper describes a grammar learning system that combines model-based and data-driven learning within a single framework. Our results from learning grammars using the Spoken English Corpus (SEC) suggest that combined model-based and data-driven learning can produce a more plausible grammar than is the case when using either learning style isolation.
Van Wijngaarden grammars, metamorphism and K-ary malwares
Gueguen, Geoffroy
2010-01-01
Grammars are used to describe sentences structure, thanks to some sets of rules, which depends on the grammar type. A classification of grammars has been made by Noam Chomsky, which led to four well-known types. Yet, there are other types of grammars, which do not exactly fit in Chomsky's classification, such as the two-level grammars. As their name suggests it, the main idea behind these grammars is that they are composed of two grammars. Van Wijngaarden grammars, particularly, are such grammars. They are interesting by their power (expressiveness), which can be the same, under some hypotheses, as the most powerful grammars of Chomsky's classification, i.e. Type 0 grammars. Another point of interest is their relative conciseness and readability. Van Wijngaarden grammars can describe static and dynamic semantic of a language. So, by using them as a generative engine, it is possible to generate a possibly infinite set of words, while assuring us that they all have the same semantic. Moreover, they can describe...
Pupils' Word Choices and the Teaching of Grammar
Wyse, Dominic
2006-01-01
The idea that formal grammar teaching leads to improvements in school pupils' writing has been a popular one. However, the robust and extensive evidence base shows that this is not the case. Despite this, policy initiatives have continued to suggest that grammar teaching does improve pupils' writing: the "Grammar for Writing" resource is the most…
When Is a Verb? Using Functional Grammar to Teach Writing
Fearn, Leif; Farnan, Nancy
2007-01-01
While evidence shows that grammar study focused on identification, description, and definition (IDD) fails to enhance writing performance, the grammar most students study remains focused on the IDD tradition. We taught a functional grammar that featured what words do in sentences, rather than what words are called and how they are defined, to two…
Ways of Knowing: Writing with Grammar in Mind
Myhill, Debra
2005-01-01
In the international context of concerns about standards in writing, this article addresses the role of grammar in the teaching of writing. It considers both current and historical perspectives on the teaching of grammar and offers a critique of research which attempts to determine the impact of grammar teaching on writing, but which does not…
Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving
Bransen, Jeroen; van Binsbergen, L.Thomas; Claessen, Koen; Dijkstra, Atze
2015-01-01
Many computations over trees can be specified using attribute grammars. Compilers for attribute grammars need to find an evaluation order (or schedule) in order to generate efficient code. For the class of linearly ordered attribute grammars such a schedule can be found statically, but this problem
Spoken Grammar and Its Role in the English Language Classroom
Hilliard, Amanda
2014-01-01
This article addresses key issues and considerations for teachers wanting to incorporate spoken grammar activities into their own teaching and also focuses on six common features of spoken grammar, with practical activities and suggestions for teaching them in the language classroom. The hope is that this discussion of spoken grammar and its place…
Safford, Kimberly
2016-01-01
The research examined the impact on teachers of the grammar element of a new statutory test in Spelling, Punctuation and Grammar (SPaG) in primary schools in England. The research aimed to evaluate the nature and the extent of changes to the teaching of grammar and to wider literacy teaching since the introduction of the test in 2013. The research…
Playful Explicitness with Grammar: A Pedagogy for Writing
Myhill, Debra; Jones, Susan; Watson, Annabel; Lines, Helen
2013-01-01
The place of grammar within the teaching of writing has long been contested and successive research studies have indicated no correlation between grammar teaching and writing attainment. However, a recent study has shown a significant positive impact on writing outcomes when the grammar input is intrinsically linked to the demands of the writing…
Web Exclusive--The Case for Not Teaching Grammar
Zwagerman, Sean
2012-01-01
The value of grammar instruction in improving students' writing has been debated for at least 150 years, and is showing no signs of tiring. But would teaching grammar actually improve writing? In fact, study after study has shown that the study of grammar does not translate to improved student writing. Indeed, the basic skills of writing are not…
On the Generating Power of Regularly Controlled Bidirectional Grammars
Asveld, Peter R.J.; Hogendorp, Jan Anne
1989-01-01
RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this
On the generating power of regularly controlled bidirection grammars
Asveld, P.R.J.; Hogendorp, J.A.
1991-01-01
RCB-grammars or regularly controlled bidirectional grammars are context-free grammars of which the rules can be used in a productive and in a reductive fashion. In addition, the application of these rules is controlled by a regular language. Several modes of derivation can be distinguished for this
Scheler, G
1996-01-01
In this paper, we use a feature model of the semantics of plural determiners to present an approach to grammar checking for definiteness. Using neural network techniques, a semantics -- morphological category mapping was learned. We then applied a textual encoding technique to the 125 occurences of the relevant category in a 10 000 word narrative text and learned a surface -- semantics mapping. By applying the learned generation function to the newly generated representations, we achieved a correct category assignment in many cases (87 %). These results are considerably better than a direct surface categorization approach (54 %), with a baseline (always guessing the dominant category) of 60 %. It is discussed, how these results could be used in multilingual NLP applications.
A New Approach for Proving or Generating Combinatorial Identities
Gonzalez, Luis
2010-01-01
A new method for proving, in an immediate way, many combinatorial identities is presented. The method is based on a simple recursive combinatorial formula involving n + 1 arbitrary real parameters. Moreover, this formula enables one not only to prove, but also generate many different combinatorial identities (not being required to know them "a…
How grammar can be best taught
Directory of Open Access Journals (Sweden)
Luciana Braga Carneiro Leão
2012-06-01
Full Text Available In the field of language teaching, especially in second language teaching, teachers and researchers are constantly concerned with using the most efficient ways to provide knowledge to learners leading to acquisition. This article aims to analyze form-focused instructional options regarding grammar teaching, in light of the computational model for second language acquisition, and discuss if there is a best way to teach grammar and what it is. For that, firstly, the instructional possibilities are presented, in their macro and micro-options. Secondly, discussions on whether we should select or not and on if we could balance different options throughout a lesson are carried. Finally, sample material is provided in order to present possible ways to conduct a grammar lesson.
The autonomy of grammar and semantic internalism
Directory of Open Access Journals (Sweden)
Dobler Tamara
2014-01-01
Full Text Available In his post-Tractatus work on natural language use, Wittgenstein defended the notion of what he dubbed the autonomy of grammar. According to this thought, grammar - or semantics, in a more recent idiom - is essentially autonomous from metaphysical considerations, and is not answerable to the nature of things. The argument has several related incarnations in Wittgenstein’s post-Tractatus writings, and has given rise to a number of important insights, both critical and constructive. In this paper I will argue for a potential connection between Wittgenstein’s autonomy argument and some more recent internalist arguments for the autonomy of semantics. My main motivation for establishing this connection comes from the fact that the later Wittgenstein’s comments on grammar and meaning stand in opposition to some of the core assumptions of semantic externalism.
Reading and grammar learning through mobile phones
Directory of Open Access Journals (Sweden)
Shudong Wang
2016-08-01
Full Text Available This paper describes an ongoing language-learning project, three years into its development. We examine both the feasibility and the limitations of developing English reading and grammar skills through the interface of mobile phones. Throughout the project, reading and grammar materials were regularly sent to students’ mobile phones. Students read or took part in any aspect of the materials that appealed to them. Information gathered from participants and server logs indicate that reading and learning grammar using mobile devices is regarded as a positive language experience. However, the data also indicate that the success of any mobile learning project could be limited unless certain criteria are applied. This includes (a providing engaging learning materials that are neither too long nor overly-demanding; (b a proper degree of teacher monitoring; (c student involvement; (d the need for incentives; (e a respect for privacy; and (f a safe and secure mobile-learning technical environment.
Grammars with two-sided contexts
Directory of Open Access Journals (Sweden)
Mikhail Barash
2014-05-01
Full Text Available In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012, the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the substring being defined. This paper proposes a more general model, in which context specifications may be two-sided, that is, both the left and the right contexts can be specified by the corresponding operators. The paper gives the definitions and establishes the basic theory of such grammars, leading to a normal form and a parsing algorithm working in time O(n^4, where n is the length of the input string.
Probabilistic Grammar: The view from Cognitive Sociolinguistics
Directory of Open Access Journals (Sweden)
Jeroen Claes
2017-06-01
Full Text Available In this paper, I propose that Probabilistic Grammar may benefit from incorporating theoretical insights from Cognitive (SocioLinguistics. I begin by introducing Cognitive Linguistics. Then, I propose a model of the domain-general cognitive constraints (markedness of coding, statistical preemption, and structural priming that condition language (variation. Subsequently, three case studies are presented that test the predictions of this model on three distinct alternations in English and Spanish (variable agreement with existential 'haber', variable agreement with existential 'there be', and Spanish subject pronoun expression. For each case study, the model generates empirically correct predictions. I conclude that, with the support of Cognitive Sociolinguistics, Probabilistic Grammar may move beyond description towards explanation. This article is part of the special collection: Probabilistic grammars: Syntactic variation in a comparative perspective
He, Jingrui
2012-01-01
In many real-world problems, rare categories (minority classes) play essential roles despite their extreme scarcity. The discovery, characterization and prediction of rare categories of rare examples may protect us from fraudulent or malicious behavior, aid scientific discovery, and even save lives. This book focuses on rare category analysis, where the majority classes have smooth distributions, and the minority classes exhibit the compactness property. Furthermore, it focuses on the challenging cases where the support regions of the majority and minority classes overlap. The author has devel
Boot, Inge; Pecher, Diane
2011-01-01
In the present study we investigated whether the mental representation of the concept categories is represented by the container image schema (Lakoff & Johnson, 1980). In two experiments participants decided whether two pictures were from the same category (animal or vehicle). Pictures were presented inside or outside a frame that should activate the container schema. We found that performance to pictures was influenced by the frame in congruence with the metaphorical mapping (same category—inside bounded region; different category—not in same bounded region). These results show that the concept categories is metaphorically represented by containers.
Triangulated categories (AM-148)
Neeman, Amnon
2014-01-01
The first two chapters of this book offer a modern, self-contained exposition of the elementary theory of triangulated categories and their quotients. The simple, elegant presentation of these known results makes these chapters eminently suitable as a text for graduate students. The remainder of the book is devoted to new research, providing, among other material, some remarkable improvements on Brown''s classical representability theorem. In addition, the author introduces a class of triangulated categories""--the ""well generated triangulated categories""--and studies their properties. This
Understanding Grammars through Diachronic Change
Directory of Open Access Journals (Sweden)
Nerea Madariaga
2017-07-01
Full Text Available In this paper, I will vindicate the importance of syntactic change for the study of synchronic stages of natural languages, according to the following outline. First, I will analyze the relationship between the diachrony and synchrony of grammars, introducing some basic concepts: the notions of I-language/E-language, the role of Chomsky's (2005 three factors in language change, and some assumptions about language acquisition. I will briefly describe the different approaches to syntactic change adopted in generative accounts, as well as their assumptions and implications (Lightfoot, 1999, 2006; van Gelderen, 2004; Biberauer et al., 2010; Roberts, 2012. Finally, I will illustrate the convenience of introducing the diachronic dimension into the study of at least certain synchronic phenomena with the help of a practical example: variation in object case marking of several verbs in Modern Russian, namely, the verbs denoting avoidance and the verbs slušat'sja “obey” and dožidat'sja “expect,” which show two object case-marking patterns, genitive case in standard varieties and accusative case in colloquial varieties. To do so, I will review previous descriptive and/or functionalist accounts on this or equivalent phenomena (Jakobson, 1984 [1936]; Clancy, 2006; Nesset and Kuznetsova, 2015a,b. Then, I will present a formal—but just synchronic—account, applying Sigurðsson (2011 hypothesis on the expression of morphological case to this phenomenon. Finally, I will show that a formal account including the diachronic dimension is superior (i.e., more explanative than purely synchronic accounts.
Understanding Grammars through Diachronic Change
Madariaga, Nerea
2017-01-01
In this paper, I will vindicate the importance of syntactic change for the study of synchronic stages of natural languages, according to the following outline. First, I will analyze the relationship between the diachrony and synchrony of grammars, introducing some basic concepts: the notions of I-language/E-language, the role of Chomsky's (2005) three factors in language change, and some assumptions about language acquisition. I will briefly describe the different approaches to syntactic change adopted in generative accounts, as well as their assumptions and implications (Lightfoot, 1999, 2006; van Gelderen, 2004; Biberauer et al., 2010; Roberts, 2012). Finally, I will illustrate the convenience of introducing the diachronic dimension into the study of at least certain synchronic phenomena with the help of a practical example: variation in object case marking of several verbs in Modern Russian, namely, the verbs denoting avoidance and the verbs slušat'sja “obey” and dožidat'sja “expect,” which show two object case-marking patterns, genitive case in standard varieties and accusative case in colloquial varieties. To do so, I will review previous descriptive and/or functionalist accounts on this or equivalent phenomena (Jakobson, 1984 [1936]; Clancy, 2006; Nesset and Kuznetsova, 2015a,b). Then, I will present a formal—but just synchronic—account, applying Sigurðsson (2011) hypothesis on the expression of morphological case to this phenomenon. Finally, I will show that a formal account including the diachronic dimension is superior (i.e., more explanative) than purely synchronic accounts. PMID:28824474
GenoCAD Plant Grammar to Design Plant Expression Vectors for Promoter Analysis.
Coll, Anna; Wilson, Mandy L; Gruden, Kristina; Peccoud, Jean
2016-01-01
With the rapid advances in prediction tools for discovery of new promoters and their cis-elements, there is a need to improve plant expression methodologies in order to facilitate a high-throughput functional validation of these promoters in planta. The promoter-reporter analysis is an indispensible approach for characterization of plant promoters. It requires the design of complex plant expression vectors, which can be challenging. Here, we describe the use of a plant grammar implemented in GenoCAD that will allow the users to quickly design constructs for promoter analysis experiments but also for other in planta functional studies. The GenoCAD plant grammar includes a library of plant biological parts organized in structural categories to facilitate their use and management and a set of rules that guides the process of assembling these biological parts into large constructs.
Optimality: from neural networks to universal grammar.
Prince, A; Smolensky, P
1997-03-14
Can concepts from the theory of neural computation contribute to formal theories of the mind? Recent research has explored the implications of one principle of neural computation, optimization, for the theory of grammar. Optimization over symbolic linguistic structures provides the core of a new grammatical architecture, optimality theory. The proposition that grammaticality equals optimality sheds light on a wide range of phenomena, from the gulf between production and comprehension in child language, to language learnability, to the fundamental questions of linguistic theory: What is it that the grammars of all languages share, and how may they differ?
Priority Union and Generalization in Discourse Grammars
Grover, C; Manandhar, S; Moens, M; Grover, Claire; Brew, Chris; Manandhar, Suresh; Moens, Marc
1994-01-01
We describe an implementation in Carpenter's typed feature formalism, ALE, of a discourse grammar of the kind proposed by Scha, Polanyi, et al. We examine their method for resolving parallelism-dependent anaphora and show that there is a coherent feature-structural rendition of this type of grammar which uses the operations of priority union and generalization. We describe an augmentation of the ALE system to encompass these operations and we show that an appropriate choice of definition for priority union gives the desired multiple output for examples of VP-ellipsis which exhibit a strict/sloppy ambiguity.
Combinatorial biosynthesis of medicinal plant secondary metabolites
Julsing, Mattijs K.; Koulman, Albert; Woerdenbag, Herman J.; Quax, Wim J.; Kayser, Oliver
2006-01-01
Combinatorial biosynthesis is a new tool in the generation of novel natural products and for the production of rare and expensive natural products. The basic concept is combining metabolic pathways in different organisms on a genetic level. As a consequence heterologous organisms provide precursors
Polyhredral techniques in combinatorial optimization I: theory
Aardal, K.; Hoesel, S. van
2001-01-01
Combinatorial optimization problems appear in many disciplines ranging from management and logistics to mathematics, physics, and chemistry. These problems are usually relatively easy to formulate mathematically, but most of them are computationally hard due to the restriction that a subset of the v
Combinatorial optimization tolerances calculated in linear time
Goldengorin, Boris; Sierksma, Gerard
2003-01-01
For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal
Grobner Basis Approach to Some Combinatorial Problems
Directory of Open Access Journals (Sweden)
Victor Ufnarovski
2012-10-01
Full Text Available We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \\GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
Grobner Basis Approach to Some Combinatorial Problems
2012-01-01
We consider several simple combinatorial problems and discuss different ways to express them using polynomial equations and try to describe the \\GB of the corresponding ideals. The main instruments are complete symmetric polynomials that help to express different conditions in rather compact way.
Infinitary Combinatory Reduction Systems: Normalising Reduction Strategies
Ketema, Jeroen; Simonsen, Jakob Grue
2010-01-01
We study normalising reduction strategies for infinitary Combinatory Reduction Systems (iCRSs). We prove that all fair, outermost-fair, and needed-fair strategies are normalising for orthogonal, fully-extended iCRSs. These facts properly generalise a number of results on normalising strategies in fi
Erratum to Ordered Partial Combinatory Algebras
Hofstra, P.; Oosten, J. van
2003-01-01
To our regret the paper Ordered Partial Combinatory Algebras contains a mistake which we correct here The flaw concerns the definition of compu tational density definition 3.5 which appeared in section 3.3 page 451 This definition is too rigid and as a consequence Lemma 3.6 on page 452
A Model of Students' Combinatorial Thinking
Lockwood, Elise
2013-01-01
Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…
A Model of Students' Combinatorial Thinking
Lockwood, Elise
2013-01-01
Combinatorial topics have become increasingly prevalent in K-12 and undergraduate curricula, yet research on combinatorics education indicates that students face difficulties when solving counting problems. The research community has not yet addressed students' ways of thinking at a level that facilitates deeper understanding of how students…
Combinatorial optimization tolerances calculated in linear time
Goldengorin, Boris; Sierksma, Gerard
2003-01-01
For a given optimal solution to a combinatorial optimization problem, we show, under very natural conditions, the equality of the minimal values of upper and lower tolerances, where the upper tolerances are calculated for the given optimal solution and the lower tolerances outside the optimal soluti
Recent developments in dynamic combinatorial chemistry
Otto, Sijbren; Furlan, Ricardo L.E.; Sanders, Jeremy K.M.
2002-01-01
Generating combinatorial libraries under equilibrium conditions has the important advantage that the libraries are adaptive (i.e. they can respond to exterior influences in the form of molecular recognition events). Thus, a ligand will direct and amplify the formation of its ideal receptor and vice
Boltzmann Samplers for Colored Combinatorial Objects
Bodini, Olivier
2009-01-01
In this paper, we give a general framework for the Boltzmann generation of colored objects belonging to combinatorial constructible classes. We propose an intuitive notion called profiled objects which allows the sampling of size-colored objects (and also of k-colored objects) although the corresponding class cannot be described by an analytic ordinary generating function.
Combinatorial biosynthesis of medicinal plant secondary metabolites
Julsing, Mattijs K.; Koulman, Albert; Woerdenbag, Herman J.; Quax, Wim J.; Kayser, Oliver
2006-01-01
Combinatorial biosynthesis is a new tool in the generation of novel natural products and for the production of rare and expensive natural products. The basic concept is combining metabolic pathways in different organisms on a genetic level. As a consequence heterologous organisms provide precursors
PIPERIDINE OLIGOMERS AND COMBINATORIAL LIBRARIES THEREOF
DEFF Research Database (Denmark)
1999-01-01
The present invention relates to piperidine oligomers, methods for the preparation of piperidine oligomers and compound libraries thereof, and the use of piperidine oligomers as drug substances. The present invention also relates to the use of combinatorial libraries of piperidine oligomers...... in libraries (arrays) of compounds especially suitable for screening purposes....
EXPLAIN AND EXPLORE——THE INDUCTIVE APPROACH TO EFL GRAMMAR INSTRUCTION
Institute of Scientific and Technical Information of China (English)
YuGuoxing
2004-01-01
The new role of grammar instruction now is based on the increasing understandings that grammar per se is a comprehensive conglomerate. The paper examines the inductive approach to EFL grammar instruction. It starts with some theoretical considerations on inductive approach to formal grammar instruction, followed by its methodological considerations such as how to deal with grammar generalizations and exceptions, learner variables, and grammar complexity, and proposes a sensitive and dynamic balance of explorations and explanations in EFL grammar instruction.
Das-Smaal, E.A.; Swart, de J.H.
1984-01-01
Two aspects of variation within categories, relating to different models of categorization, were investigated - frequency of dimensional values and typicality differences within values. The influence of range of typicality experienced during learning and of informational value of feedback was also
Consumer Product Category Database
U.S. Environmental Protection Agency — The Chemical and Product Categories database (CPCat) catalogs the use of over 40,000 chemicals and their presence in different consumer products. The chemical use...
He, Jingrui
2012-01-01
This book focuses on rare category analysis where the majority classes have smooth distributions and the minority classes exhibit the compactness property. It focuses on challenging cases where the support regions of the majority and minority classes overlap.
Diaz, F; Garcia, P; Murillo, A; Remedios, J
2011-01-01
We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.
DEVELOPING A SOUND POLICY FOR THE TREATMENT OF GRAMMAR
Institute of Scientific and Technical Information of China (English)
2001-01-01
Should grammar be taught at all?Is it a hindrance or anaid?Communicative language teaching approach seems to havecast doubts on the value of grammar teaching.The present paperargues that the positive effect of grammar in College Englishteaching and learning should not be overlooked.Grammar servesas a means to the final achievement of language proficiency.Itis time for language teachers to reconsider the role of grammarand to come up with a more appropriate and thus,moreeffective treatment of grammar in College English teaching.
Teaching Children Foreign-Language Grammar: Are Authentic Materials Appropriate?
Directory of Open Access Journals (Sweden)
Olga Malova
2016-10-01
Full Text Available The paper discusses authentic materials as a resource for teaching grammar to young learners. Difficulties in foreign-language grammar learning for Russian pupils are presented, and typical challenges are described. The paper provides a pre-/post-intervention study of the development of children’s grammar skills. The research question is, “How does one use authentic materials for teaching grammar in an English as a foreign language (EFL classroom?” A qualitative method is used to assess the learning outcomes of using authentic materials in teaching grammar to eight–nine-year-old pupils (the second year of studying English.
A Contrastive Study of Two Approaches to Teach Grammar
Institute of Scientific and Technical Information of China (English)
Cai; Lin
2007-01-01
There are many kinds of methods of teaching grammar, no matter what they are, these approaches can generally be classified into two approaches-deductive and inductive. What an appropriate grammar teaching approach is by examining the inductive and deductive approaches to grammar teaching and learning. It starts with the definitions of inductive and deductive approaches to grammar teaching, followed by a contrastive study of these two approaches in terms of both the bases and the application. Finally, it explores the inductive approach and outlines the benefits of this approach and suggests an alternative view of grammar teaching.
Tvorba konceptu category managementu
Lepař, Martin
2012-01-01
The goal of this thesis is to define proces of creating the concept of category management and to apply the proces via existing assortment concept of certain retail company. The theoretical part covers basics of category management, merchandising and other related disciplines and its influence to creating concepts. Practical part includes detailed description of creating the concept, realized by retail company, selling Do it yourself products. Creation proces will start by anylysing current s...
Grammar: A Complex Structure. A Linguistic Description of Esperanto in Functional Discourse Grammar
Directory of Open Access Journals (Sweden)
Wim Jansesn
2015-04-01
Full Text Available Functional Discourse-Grammar or FDG is the latest development in the functional grammar that was initiated by the Dutch linguist Simon Dik (1940-1995. In this paper, the FDG architecture proper is described, including the role of the extra-grammatical conceptual and contextual components. A simple interrogative clause in Esperanto is used to illustrate how a linguistic expression is built up from the formulation of its (pragmatic intention to its articulation. Attention is paid to linguistic transparencies and opacities, defined here as the absence or presence of discontinuities between the descriptive levels in the grammar. Opacities are held accountable, among other factors, for making languages more or less easy to learn. The grammar of every human language is a complex system. This is clearly demonstrable precisely in Esperanto, in which the relatively few difficulties, identified by the opacities in the system, form such a sharp contrast to the general background of freedom, regularity and lack of exceptions.
A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars
Directory of Open Access Journals (Sweden)
Frédéric Saubion
2002-12-01
Full Text Available Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification .... In order to extend the regular tree language framework, more complex formalisms have been developed. In this paper, we focus on Tree Synchronized Grammars and Primal Grammars which introduce specific control structures to represent non regular sets of terms. We propose a common unified framework in order to achieve the membership test for these particular languages. Thanks to a proof system, we provide a full operational framework, that allows us to transform tree grammars into Prolog programs (as it already exists for word grammars with DCG whose goal is to recognize terms of the corresponding language.
Combinatorial structures to modeling simple games and applications
Molinero, Xavier
2017-09-01
We connect three different topics: combinatorial structures, game theory and chemistry. In particular, we establish the bases to represent some simple games, defined as influence games, and molecules, defined from atoms, by using combinatorial structures. First, we characterize simple games as influence games using influence graphs. It let us to modeling simple games as combinatorial structures (from the viewpoint of structures or graphs). Second, we formally define molecules as combinations of atoms. It let us to modeling molecules as combinatorial structures (from the viewpoint of combinations). It is open to generate such combinatorial structures using some specific techniques as genetic algorithms, (meta-)heuristics algorithms and parallel programming, among others.
Efficient Grammar Induction Algorithm with Parse Forests from Real Corpora
Kurihara, Kenichi; Kameya, Yoshitaka; Sato, Taisuke
The task of inducing grammar structures has received a great deal of attention. The reasons why researchers have studied are different; to use grammar induction as the first stage in building large treebanks or to make up better language models. However, grammar induction has inherent computational complexity. To overcome it, some grammar induction algorithms add new production rules incrementally. They refine the grammar while keeping their computational complexity low. In this paper, we propose a new efficient grammar induction algorithm. Although our algorithm is similar to algorithms which learn a grammar incrementally, our algorithm uses the graphical EM algorithm instead of the Inside-Outside algorithm. We report results of learning experiments in terms of learning speeds. The results show that our algorithm learns a grammar in constant time regardless of the size of the grammar. Since our algorithm decreases syntactic ambiguities in each step, our algorithm reduces required time for learning. This constant-time learning considerably affects learning time for larger grammars. We also reports results of evaluation of criteria to choose nonterminals. Our algorithm refines a grammar based on a nonterminal in each step. Since there can be several criteria to decide which nonterminal is the best, we evaluate them by learning experiments.
Machine Translation Using Constraint-Based Synchronous Grammar
Institute of Scientific and Technical Information of China (English)
WONG Fai; DONG Mingchui; HU Dongcheng
2006-01-01
A synchronous grammar based on the formalism of context-free grammar was developed by generalizing the first component of production that models the source text. Unlike other synchronous grammars,the grammar allows multiple target productions to be associated to a single production rule which can be used to guide a parser to infer different possible translational equivalences for a recognized input string according to the feature constraints of symbols in the pattern. An extended generalized LR algorithm was adapted to the parsing of the proposed formalism to analyze the syntactic structure of a language. The grammar was used as the basis for building a machine translation system for Portuguese to Chinese translation. The empirical results show that the grammar is more expressive when modeling the translational equivalences of parallel texts for machine translation and grammar rewriting applications.
Abstraction processes in artificial grammar learning.
Shanks, D R; Johnstone, T; Staggs, L
1997-02-01
Four experiments explored the extent the extent to which abstract knowledge may underlie subjects' performance when asked to judge the grammaticality of letter strings generated from an artificial grammar. In Experiment 1 and 2 subjects studied grammatical strings instantiated with one set of letters and were then tested on grammatical and ungrammatical strings formed either from the same or a changed letter-set. Even with a change of letter-set, subjects were found to be sensitive to a variety of violation of the grammar. In Experiments 3 and 4, the critical manipulation involved the way in which the training strings were studied: an incidental learning procedure was used for some subjects, and others engaged in an explicit code-breaking task to try to learn the rules of the grammar. When strings were generated from a biconditional (Experiment 4) but not from a standard finite-state grammar (Experiment 3), grammaticality judgements for test strings were independent of their surface similarity to specific studied strings. Overall, the results suggest that transfer in this simple memory task is mediated at least to some extent by abstract knowledge.
Grammar Schools: Where Are We Now?
Tulloch, Margaret
2015-01-01
Apart from one amalgamation there are as many grammar schools in England as when Labour took office in 1997. Selection at age 11 still influences English education and unless there are changes its effect is likely to increase. Legislation introduced in 1998 which could have ended selection had no effect. The pressure from the right-wing minority…
On defining semantics of extended attribute grammars
DEFF Research Database (Denmark)
Madsen, Ole Lehrmann
1980-01-01
Knuth has introduced attribute grammars (AGs) as a tool to define the semanitcs of context-free languages. The use of AGs in connection with programming language definitions has mostly been to define the context-sensitive syntax of the language and to define a translation in code for a hypothetical...
Grammar and the English National Curriculum
Paterson, Laura Louise
2010-01-01
In 1998 the regulatory body for the National Curriculum, the Qualifications and Curriculum Authority, acknowledged that there was "widespread uncertainty" over the grammar requirements of the English Curriculum. In this paper I argue that the QCA still has not addressed this uncertainty. I analyse the 1999 and 2011 Primary English Curricula,…
Multiple Grammars: Old Wine in Old Bottles
Sorace, Antonella
2014-01-01
Amaral and Roeper (this issue; henceforth A&R) argue that all speakers -- regardless of whether monolingual or bilingual -- have multiple grammars in their mental language representations. They further claim that this simple assumption can explain many things: optionality in second language (L2) language behaviour, multilingualism, language…
Ambiguity Detection for Programming Language Grammars
Basten, H.J.S.
2011-01-01
Context-free grammars are the most suitable and most widely used method for describing the syntax of programming languages. They can be used to generate parsers, which transform a piece of source code into a tree-shaped representation of the code's syntactic structure. These parse trees can then be
Individual strategies in artificial grammar learning
Visser, I.; Raijmakers, M.E.J.; Pothos, E.M.
2009-01-01
Artificial grammar learning (AGL) has been used extensively to study theories of learning, but compelling conclusions cannot be drawn without an analysis of individual strategies. We describe a new statistical method for doing so, based on the increasingly popular framework of latent variable
A Progressive Grammar of the Tamil Language.
Arden, A. H.; Clayton, A. C.
The first chapter of this grammar of prose Tamil introduces the alphabet and orthography. Following chapters deal with parts of speech and verb constructions. A final chapter deals with colloquialisms and foreign words. Appended are lists of abbreviations, grammatical and temporal terms, and other information useful to the student, as well as a…
Teaching Grammar as a Humanities Course.
Kliman, Bernice W.
Nassau Community College (NCC) offers a grammar course as a humanities option that may be taken instead of a literature course. The approach to the course incorporates reader-response theory, feminist criticism, new historicism, and journal writing as the key means for enabling students to learn. Each student has a notebook divided into sections…
A Reference Grammar of Spoken Kannada.
Schiffman, Harold
This reference grammar is a description of the speech of educated people of the Bangalore/Mysore area of Karnataka State in South India. This particular dialect is used in films and, to some extent, on the radio. The four sections of the book deal with: (1) phonology, (2) the noun phrase, (3) the verb phrase, and (4) syntax. Each item that is…
NL Understanding with a Grammar of Constructions
Zadrozny, W; Jarecki, S; Johnson, D E; Morgenstern, L; Zadrozny, Wlodek; Szummer, Marcin; Jarecki, Stanislaw; Johnson, David E.; Morgenstern, Leora
1995-01-01
We present an approach to natural language understanding based on a computable grammar of constructions. A "construction" consists of a set of features of form and a description of meaning in a context. A grammar is a set of constructions. This kind of grammar is the key element of Mincal, an implemented natural language, speech-enabled interface to an on-line calendar system. The system consists of a NL grammar, a parser, an on-line calendar, a domain knowledge base (about dates, times and meetings), an application knowledge base (about the calendar), a speech recognizer, a speech generator, and the interfaces between those modules. We claim that this architecture should work in general for spoken interfaces in small domains. In this paper we present two novel aspects of the architecture: (a) the use of constructions, integrating descriptions of form, meaning and context into one whole; and (b) the separation of domain knowledge from application knowledge. We describe the data structures for encoding constru...
The Strengths and Weaknesses of Universal Grammar
Institute of Scientific and Technical Information of China (English)
华芳
2013-01-01
Chomsky’s universal grammar (UG) has always had a following among certain linguists. This article discusses the strengths and weaknesses of UG in the L2 setting according to its proponents and opponents. The author also evaluates it using Ka⁃plan’s five-point tool and Long’s eight-point measuring stick.
Nativism Does Not Equal Universal Grammar.
Wolfe-Quintero, Kate
1996-01-01
Focuses on nativist theories of language learning and how they apply to second-language acquisition (SLA). The article is seeking a nativism that goes beyond the scope of Universal Grammar and explains the human cognitive capacity for language learning, the learning of all language structures found in natural languages, and SLA. (95 references)…
Universal Grammar Theory and the Classroom.
Cook, Vivian
1989-01-01
Explores the implications of the principles and parameters theory of Universal Grammar for language teaching. Classroom acquisition depends on the provision of appropriate syntactic evidence to trigger parameter setting, and certain aspects of vocabulary are also crucial. (33 references) (Author/VWL)
Yes, We Still Need Universal Grammar
Lidz, Jeffrey; Gleitman, Lila R.
2004-01-01
In a recent paper [Lidz, J., Gleitman, H., & Gleitman, L. (2003). Understanding how input matters: Verb learning and the footprint of universal grammar. "Cognition," 87, 151-178], we provided cross-linguistic evidence in favor of the following linked assertions: (i) Verb argument structure is a correlate of verb meaning; (ii) However, argument…
Universal Grammar and the Basic Variety.
Bierwisch, Manfred
1997-01-01
Discusses the feasibility of Basic Variety (BV) principles proposed by Klein and Perdue, arguing that some of them need clarification with learner varieties and that they are not part of Universal Grammar (UG) as they exclude phenomena (e.g., psych verbs) that cannot be excluded from the core of natural language. (15 references) (Author/CK)
To Teach Spoken Grammar With Corpus Studies
Institute of Scientific and Technical Information of China (English)
CHENG Li
2016-01-01
Using scripted materials in spoken language teaching has been challenged in recent years. Accordingly, many scholars have proposed to employ corpus in spoken language teaching. This article proved it is an efficient way to teach spoken grammar by combining scripted materials with authentic materials from corpus.
On Parallel Evaluation of Ordered Attribute Grammars
Institute of Scientific and Technical Information of China (English)
王顺迁; 叶大兴
1991-01-01
In this paper,a parallel algorithm is presented for the evaluation of orgered attribute grammars.The parallelism is achieved by constructing the so-called paralled visit sequences and accordingly augmenting the ordinary evaluation driver as well.For experimental purposes,the algorithm has been implemented by simulation.
Education and the Grammar of Assent
Harris, Suzy
2015-01-01
John Henry Newman is probably known best for "The Idea of a University." In his most philosophical work, "An Essay in Aid of a Grammar of Assent," however, he undertakes a detailed investigation of different ways of knowing and understanding in a manner that is of clear pertinence for philosophical enquiry into education. He…
A DESCRIPTIVE INDONESIAN GRAMMAR--PRELIMINARY EDITION.
DYEN, ISIDORE
THIS PRELIMINARY EDITION COMPRISES A DESCRIPTIVE GRAMMAR OF INDONESIAN (BAHASA INDONESIA), THE OFFICIAL LANGUAGE OF THE REPUBLIC OF INDONESIA. THE THREE SECTIONS--PHONOLOGY, SYNTAX, AND MORPHOLOGY--PRESENT A COMPREHENSIVE LINGUISTIC ANALYSIS OF INDONESIAN, WITH OCCASIONAL CONTRASTIVE REFERENCE TO MALAY, JAVANESE, SUNDANESE, AND SUMATRAN. THIS…
Enriching a Descriptive Grammar with Treebank Queries
Bouma, G.; van Koppen, J.M.|info:eu-repo/dai/nl/203188934; Landsbergen, Frank; Odijk, J.E.J.M.|info:eu-repo/dai/nl/082781710; van der Wouden, Ton; van de Camp, Matje
2015-01-01
The Syntax of Dutch (SoD) is a descriptive and detailed grammar of Dutch, that provides data for many issues raised in linguistic theory. We present the results of a pilot project that investigated the possibility of enriching the online version of the text with links to queries that provide
Multiple Grammars and Second Language Representation
Amaral, Luiz; Roeper, Tom
2014-01-01
This paper presents an extension of the Multiple Grammars Theory (Roeper, 1999) to provide a formal mechanism that can serve as a generative-based alternative to current descriptive models of interlanguage. The theory extends historical work by Kroch and Taylor (1997), and has been taken into a computational direction by Yang (2003). The proposal…
Random Access to Grammar Compressed Strings
Bille, Philip; Weimann, Oren
2010-01-01
Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many of the popular compression schemes, including the Lempel-Ziv family, Run-Length Encoding, Byte-Pair Encoding, Sequitur, and Re-Pair. In this paper, we present a novel grammar representation that allows efficient random access to any character or substring of $S$ without decompressing $S$. Let $S$ be a string of length $N$ compressed into a context-free grammar $\\mathcal{S}$ of size $n$. We present two representations of $\\mathcal{S}$ achieving either O(n) construction time and space and $O(\\log N \\log \\log N)$ random access time, or $O(n\\cdot \\alpha_k(n))$ construction time and space and $O(\\log N)$ random access time. Here, $\\alpha_k(n)$ is the inverse of the $k^{th}$ row of Ackermann's function. Our representations extend to efficiently support decompression of any substring in $S$. Namely, we can decompress any substring of length $m$ in...
A Grammar Library for Information Structure
Song, Sanghoun
2014-01-01
This dissertation makes substantial contributions to both the theoretical and computational treatment of information structure, with an eye toward creating natural language processing applications such as multilingual machine translation systems. The aim of the present dissertation is to create a grammar library of information structure for the…
Multiple Grammars and Second Language Representation
Amaral, Luiz; Roeper, Tom
2014-01-01
This paper presents an extension of the Multiple Grammars Theory (Roeper, 1999) to provide a formal mechanism that can serve as a generative-based alternative to current descriptive models of interlanguage. The theory extends historical work by Kroch and Taylor (1997), and has been taken into a computational direction by Yang (2003). The proposal…
Eye Movements in Implicit Artificial Grammar Learning
Silva, Susana; Inácio, Filomena; Folia, Vasiliki; Petersson, Karl Magnus
2017-01-01
Artificial grammar learning (AGL) has been probed with forced-choice behavioral tests (active tests). Recent attempts to probe the outcomes of learning (implicitly acquired knowledge) with eye-movement responses (passive tests) have shown null results. However, these latter studies have not tested for sensitivity effects, for example, increased…
Grammar success in 20 minutes a day
Express, Learning
2013-01-01
Thorough and concise, Grammar Success in 20 Minutes a Day, covers all the essentials, including common and proper nouns; personal, reflexive, and demonstrative pronouns; regular and irregular verbs; adjectives, adverbs, misplaced modifiers, prepositions, subordinate and insubordinate clauses; coordinating and correlating conjunctions; compound sentences; and punctuation.
Lardiere, Donna
2014-01-01
This article offers commentary on the Multiple Grammars (MG) language acquisition theory proposed by Luiz Amaral and Tom Roeper in this issue. It argues that more precise definitions are needed for the terms "rule," "simple," and "productive." Topics discussed include Amaral and Roeper's verb second (V2) rule,…
Grammaire et communication (Grammar and Communication).
Stirman-Langlois, Martine
1994-01-01
A technique for teaching French grammar that involves reading, rereading, and analyzing the language in authentic materials is discussed. The student is led to recognition and generalization of structures in the text. Text examples used here include a comic strip and a publicity blurb for a French city. (MSE)
Visual Feature Learning in Artificial Grammar Classification
Chang, Grace Y.; Knowlton, Barbara J.
2004-01-01
The Artificial Grammar Learning task has been used extensively to assess individuals' implicit learning capabilities. Previous work suggests that participants implicitly acquire rule-based knowledge as well as exemplar-specific knowledge in this task. This study investigated whether exemplar-specific knowledge acquired in this task is based on the…
Interactive Russian Grammar: The Case System
Directory of Open Access Journals (Sweden)
Rimma Gam
2009-01-01
Full Text Available My paper addresses a problem many of us in North American college language programs confront regularly, the solution to which regularly and frustratingly remains just out of our reach. I refer to the teaching of the most basic and most crucial element of Russian grammar, namely, its case system, and teaching it to our students whose native language, English, does not have such a system. As I teach the Russian cases, I see vividly the disconnect between grammar presented for students (simplified, episodic, based on the "pick it up along the way" principle and the learned papers on Russian grammar by linguists, which are barely comprehensible to a non-linguist. Materials in the middle are lacking-materials to help a literature professor acting as a "de facto" language instructor understand and address the needs of students as they learn this crucial segment of basic Russian grammar. This core element of Russian grammar is presented to students in the first year of college language study, is revisited in the second year, and very often by the third year students either manage to completely block it out from their memory (as if it were some traumatic experience that happened "a long time ago"-that is, before .summer break-but most importantly due to the lack of practice or demonstrate a partial or even complete lack of understanding or misunderstanding of this system forcing us to deal with it again in the third year. Not only is it frustrating for both the students and the language instructor; but from the point of view of their overall proficiency, the lack of control of the case system holds our students back. There can be no talk of advanced language proficiency without a complete and automatic mastery of this basic system. Unfortunately, regardless of the specific textbooks used, the students very often manage not to have a general idea and mastery of this system even by the third year of study.
A convenient differential category
Blute, Richard; Tasson, Christine
2010-01-01
In this paper, we show that the category of Mackey-complete, separated, topological convex bornological vector spaces and bornological linear maps is a differential category. Such spaces were introduced by Fr\\"olicher and Kriegl, where they were called convenient vector spaces. While much of the structure necessary to demonstrate this observation is already contained in Fr\\"olicher and Kriegl's book, we here give a new interpretation of the category of convenient vector spaces as a model of the differential linear logic of Ehrhard and Regnier. Rather than base our proof on the abstract categorical structure presented by Fr\\"olicher and Kriegl, we prefer to focus on the bornological structure of convenient vector spaces. We believe bornological structures will ultimately yield a wide variety of models of differential logics.
Preschool Children Differentiation According to the Lingua- Grammatical Categories Development
Directory of Open Access Journals (Sweden)
Z. V. Polivara
2012-01-01
Full Text Available The parallel existence of languages and cultures brings forward the necessity of studying this linguistic phenomenon and designing special methods of speech development for the bilingual children. The particular attention should be given to the preschool age, for according to A. A. Leontyev’s study, the parallel acquiring of two languages often results in insufficient development of socio-linguistic speech standards. The research is devoted to the phenomenon of the two language systems coexistence in a bilingual person’s consciousness, both of them functioning and encoding the same subjects and phenomena. The peculiarities of language interference are described with the reference to the Russian-Tatar bilingual environment. The author believes that the bilingual interference problems are not caused by the phonetic and grammar system differences of the two languages. To find out the potential source of inter-language transition and interrelations between the native and non-native languages, it is necessary to identify the cognitive, neurolinguistic and psycho-linguistic aspects. Therefore, the regional phenomenon of mass bilingualism among the Tatar population is examined by the author in the framework of the psycho-linguistic and cognitive approaches. The paper presents the model of the lexical and grammar categories formation based on differentiated preschool teaching of the bilingual children. The proposed model makes it possible to overcome the limited viewpoint on the general speech dysfunctions, as well as the specifics of lexical and grammar categories development. It can be used for the further development of educational programs in psycho-linguistics, ethno-linguistics, onto-linguistics, cognitive linguistics, social-linguistics, contrastive linguistics and the language theory by means of extending the teaching course content.
Combined Grammar for the Modeling of Building Interiors
Becker, S.; Peter, M.; Fritsch, D.; Philipp, D.; Baier, P.; Dibak, C.
2013-11-01
As spatial grammars have proven successful and efficient to deliver LOD3 models, the next challenge is their extension to indoor applications, leading to LOD4 models. Therefore, a combined indoor grammar for the automatic generation of indoor models from erroneous and incomplete observation data is presented. In building interiors where inaccurate observation data is available, the grammar can be used to make the reconstruction process robust, and verify the reconstructed geometries. In unobserved building interiors, the grammar can generate hypotheses about possible indoor geometries matching the style of the rest of the building. The grammar combines concepts from L-systems and split grammars. It is designed in such way that it can be derived from observation data fully automatically. Thus, manual predefinitions of the grammar rules usually required to tune the grammar to a specific building style, become obsolete. The potential benefit of using our grammar as support for indoor modeling is evaluated based on an example where the grammar has been applied to automatically generate an indoor model from erroneous and incomplete traces gathered by foot-mounted MEMS/IMU positioning systems.
Gems of combinatorial optimization and graph algorithms
Skutella, Martin; Stiller, Sebastian; Wagner, Dorothea
2015-01-01
Are you looking for new lectures for your course on algorithms, combinatorial optimization, or algorithmic game theory? Maybe you need a convenient source of relevant, current topics for a graduate student or advanced undergraduate student seminar? Or perhaps you just want an enjoyable look at some beautiful mathematical and algorithmic results, ideas, proofs, concepts, and techniques in discrete mathematics and theoretical computer science? Gems of Combinatorial Optimization and Graph Algorithms is a handpicked collection of up-to-date articles, carefully prepared by a select group of international experts, who have contributed some of their most mathematically or algorithmically elegant ideas. Topics include longest tours and Steiner trees in geometric spaces, cartograms, resource buying games, congestion games, selfish routing, revenue equivalence and shortest paths, scheduling, linear structures in graphs, contraction hierarchies, budgeted matching problems, and motifs in networks. This ...
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2011-01-01
We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this syntactic theory as a reduction semantics, which we refocus into the first storeless abstract machine...... for combinatory graph reduction, which we refunctionalize into the first storeless natural semantics for combinatory graph reduction.We then factor out the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand, resulting in a second syntactic theory, this one...... of term graphs in the sense of Barendregt et al. The corresponding storeless abstract machine and natural semantics follow mutatis mutandis. We then interpret let expressions as operations over a global store (thus shifting, in Strachey's words, from denotable entities to storable entities), resulting...
Three Syntactic Theories for Combinatory Graph Reduction
DEFF Research Database (Denmark)
Danvy, Olivier; Zerny, Ian
2013-01-01
We present a purely syntactic theory of graph reduction for the canonical combinators S, K, and I, where graph vertices are represented with evaluation contexts and let expressions. We express this rst syntactic theory as a storeless reduction semantics of combinatory terms. We then factor out...... the introduction of let expressions to denote as many graph vertices as possible upfront instead of on demand . The factored terms can be interpreted as term graphs in the sense of Barendregt et al. We express this second syntactic theory, which we prove equivalent to the rst, as a storeless reduction semantics...... of combinatory term graphs. We then recast let bindings as bindings in a global store, thus shifting, in Strachey's words, from denotable entities to storable entities. The store-based terms can still be interpreted as term graphs. We express this third syntactic theory, which we prove equivalent to the second...
Dynamical System Approaches to Combinatorial Optimization
DEFF Research Database (Denmark)
Starke, Jens
2013-01-01
Several dynamical system approaches to combinatorial optimization problems are described and compared. These include dynamical systems derived from penalty methods; the approach of Hopfield and Tank; self-organizing maps, that is, Kohonen networks; coupled selection equations; and hybrid methods....... Many of them are investigated analytically, and the costs of the solutions are compared numerically with those of solutions obtained by simulated annealing and the costs of a global optimal solution. Using dynamical systems, a solution to the combinatorial optimization problem emerges in the limit...... of large times as an asymptotically stable point of the dynamics. The obtained solutions are often not globally optimal but good approximations of it. Dynamical system and neural network approaches are appropriate methods for distributed and parallel processing. Because of the parallelization...
Dynamic combinatorial self-replicating systems.
Moulin, Emilie; Giuseppone, Nicolas
2012-01-01
Thanks to their intrinsic network topologies, dynamic combinatorial libraries (DCLs) represent new tools for investigating fundamental aspects related to self-organization and adaptation processes. Very recently the first examples integrating self-replication features within DCLs have pushed even further the idea of implementing dynamic combinatorial chemistry (DCC) towards minimal systems capable of self-construction and/or evolution. Indeed, feedback loop processes - in particular in the form of autocatalytic reactions - are keystones to build dynamic supersystems which could possibly approach the roots of "Darwinian" evolvability at mesoscale. This topic of current interest also shows significant potentialities beyond its fundamental character, because truly smart and autonomous materials for the future will have to respond to changes of their environment by selecting and by exponentially amplifying their fittest constituents.
Stochastic Combinatorial Optimization under Probabilistic Constraints
Agrawal, Shipra; Ye, Yinyu
2008-01-01
In this paper, we present approximation algorithms for combinatorial optimization problems under probabilistic constraints. Specifically, we focus on stochastic variants of two important combinatorial optimization problems: the k-center problem and the set cover problem, with uncertainty characterized by a probability distribution over set of points or elements to be covered. We consider these problems under adaptive and non-adaptive settings, and present efficient approximation algorithms for the case when underlying distribution is a product distribution. In contrast to the expected cost model prevalent in stochastic optimization literature, our problem definitions support restrictions on the probability distributions of the total costs, via incorporating constraints that bound the probability with which the incurred costs may exceed a given threshold.
Assessment of structural diversity in combinatorial synthesis.
Fergus, Suzanne; Bender, Andreas; Spring, David R
2005-06-01
This article covers the combinatorial synthesis of small molecules with maximal structural diversity to generate a collection of pure compounds that are attractive for lead generation in a phenotypic, high-throughput screening approach. Nature synthesises diverse small molecules, but there are disadvantages with using natural product sources. The efficient chemical synthesis of structural diversity (and complexity) is the aim of diversity-oriented synthesis, and recent progress is reviewed. Specific highlights include a discussion of strategies to obtain structural diversity and an analysis of molecular descriptors used to classify compounds. The assessment of how successful one synthesis is versus another is subjective, therefore we test-drive software to assess structural diversity in combinatorial synthesis, which is freely available via a web interface.
Memetic firefly algorithm for combinatorial optimization
Fister, Iztok; Fister, Iztok; Brest, Janez
2012-01-01
Firefly algorithms belong to modern meta-heuristic algorithms inspired by nature that can be successfully applied to continuous optimization problems. In this paper, we have been applied the firefly algorithm, hybridized with local search heuristic, to combinatorial optimization problems, where we use graph 3-coloring problems as test benchmarks. The results of the proposed memetic firefly algorithm (MFFA) were compared with the results of the Hybrid Evolutionary Algorithm (HEA), Tabucol, and the evolutionary algorithm with SAW method (EA-SAW) by coloring the suite of medium-scaled random graphs (graphs with 500 vertices) generated using the Culberson random graph generator. The results of firefly algorithm were very promising and showed a potential that this algorithm could successfully be applied in near future to the other combinatorial optimization problems as well.
DNA-Encoded Dynamic Combinatorial Chemical Libraries.
Reddavide, Francesco V; Lin, Weilin; Lehnert, Sarah; Zhang, Yixin
2015-06-26
Dynamic combinatorial chemistry (DCC) explores the thermodynamic equilibrium of reversible reactions. Its application in the discovery of protein binders is largely limited by difficulties in the analysis of complex reaction mixtures. DNA-encoded chemical library (DECL) technology allows the selection of binders from a mixture of up to billions of different compounds; however, experimental results often show low a signal-to-noise ratio and poor correlation between enrichment factor and binding affinity. Herein we describe the design and application of DNA-encoded dynamic combinatorial chemical libraries (EDCCLs). Our experiments have shown that the EDCCL approach can be used not only to convert monovalent binders into high-affinity bivalent binders, but also to cause remarkably enhanced enrichment of potent bivalent binders by driving their in situ synthesis. We also demonstrate the application of EDCCLs in DNA-templated chemical reactions.
High throughput combinatorial screening of semiconductor materials
Mao, Samuel S.
2011-11-01
This article provides an overview of an advanced combinatorial material discovery platform developed recently for screening semiconductor materials with properties that may have applications ranging from radiation detectors to solar cells. Semiconductor thin-film libraries, each consisting of 256 materials of different composition arranged into a 16×16 matrix, were fabricated using laser-assisted evaporation process along with a combinatorial mechanism to achieve variations. The composition and microstructure of individual materials on each thin-film library were characterized with an integrated scanning micro-beam x-ray fluorescence and diffraction system, while the band gaps were determined by scanning optical reflection and transmission of the libraries. An ultrafast ultraviolet photon-induced charge probe was devised to measure the mobility and lifetime of individual thin-film materials on semiconductor libraries. Selected results on the discovery of semiconductors with desired band gaps and transport properties are illustrated.
COMBINATORIAL DESIGN APPROACHES FOR TEST GENERATION
Institute of Scientific and Technical Information of China (English)
Shi Liang; Xu Baowen; Nie Changhai
2005-01-01
The n-way combination testing is a specification-based testing criterion, which requires that for a system consisted of a few parameters, every combination of valid values of arbitrary n(n ≥ 2) parameters be covered by at least one test. This letter proposed two different test generation algorithms based on combinatorial design for the n-way coverage criterion. The automatic test generators are implemented and some valuable empirical results are obtained.
Switched Systems and Motion Coordination: Combinatorial Challenges
Sadovsky, Alexander V.
2016-01-01
Problems of routing commercial air traffic in a terminal airspace encounter different constraints: separation assurance, aircraft performance limitations, regulations. The general setting of these problems is that of a switched control system. Such a system combines the differentiable motion of the aircraft with the combinatorial choices of choosing precedence when traffic routes merge and choosing branches when the routes diverge. This presentation gives an overview of the problem, the ATM context, related literature, and directions for future research.
A combinatorial approach to metamaterials discovery
Plum, E; Chen, W T; Fedotov, V A; Tsai, D P; Zheludev, N I
2010-01-01
We report a high through-put combinatorial approach to photonic metamaterial optimization. The new approach is based on parallel synthesis and consecutive optical characterization of large numbers of spatially addressable nano-fabricated metamaterial samples (libraries) with quasi-continuous variation of design parameters under real manufacturing conditions. We illustrate this method for Fano-resonance plasmonic nanostructures arriving at explicit recipes for high quality factors needed for switching and sensing applications.
One-parameter groups and combinatorial physics
Duchamp, G; Solomon, A I; Horzela, A; Blasiak, P; Duchamp, Gerard; Penson, Karol A.; Solomon, Allan I.; Horzela, Andrej; Blasiak, Pawel
2004-01-01
In this communication, we consider the normal ordering of sums of elements of the form (a*^r a a*^s), where a* and a are boson creation and annihilation operators. We discuss the integration of the associated one-parameter groups and their combinatorial by-products. In particular, we show how these groups can be realized as groups of substitutions with prefunctions.
The Combinatorial Retention Auction Mechanism (CRAM)
Coughlan, Peter; Gates, William (Bill); Myung, Noah
2013-01-01
Approved for public release; distribution is unlimited. Revised version We propose a reverse uniform price auction called Combinatorial Retention Auction Mechanism (CRAM) that integrates both monetary and non-monetary incentives (NMIs). CRAM computes the cash bonus and NMIs to a single cost parameter, retains the lowest cost employees and provides them with compensation equal to the cost of the first excluded employee. CRAM is dominant strategy incentive compatible. We provide optimal b...
Combinatorial Cis-regulation in Saccharomyces Species
Directory of Open Access Journals (Sweden)
Aaron T. Spivak
2016-03-01
Full Text Available Transcriptional control of gene expression requires interactions between the cis-regulatory elements (CREs controlling gene promoters. We developed a sensitive computational method to identify CRE combinations with conserved spacing that does not require genome alignments. When applied to seven sensu stricto and sensu lato Saccharomyces species, 80% of the predicted interactions displayed some evidence of combinatorial transcriptional behavior in several existing datasets including: (1 chromatin immunoprecipitation data for colocalization of transcription factors, (2 gene expression data for coexpression of predicted regulatory targets, and (3 gene ontology databases for common pathway membership of predicted regulatory targets. We tested several predicted CRE interactions with chromatin immunoprecipitation experiments in a wild-type strain and strains in which a predicted cofactor was deleted. Our experiments confirmed that transcription factor (TF occupancy at the promoters of the CRE combination target genes depends on the predicted cofactor while occupancy of other promoters is independent of the predicted cofactor. Our method has the additional advantage of identifying regulatory differences between species. By analyzing the S. cerevisiae and S. bayanus genomes, we identified differences in combinatorial cis-regulation between the species and showed that the predicted changes in gene regulation explain several of the species-specific differences seen in gene expression datasets. In some instances, the same CRE combinations appear to regulate genes involved in distinct biological processes in the two different species. The results of this research demonstrate that (1 combinatorial cis-regulation can be inferred by multi-genome analysis and (2 combinatorial cis-regulation can explain differences in gene expression between species.
Methods for combinatorial and parallel library design.
Schnur, Dora M; Beno, Brett R; Tebben, Andrew J; Cavallaro, Cullen
2011-01-01
Diversity has historically played a critical role in design of combinatorial libraries, screening sets and corporate collections for lead discovery. Large library design dominated the field in the 1990s with methods ranging anywhere from purely arbitrary through property based reagent selection to product based approaches. In recent years, however, there has been a downward trend in library size. This was due to increased information about the desirable targets gleaned from the genomics revolution and to the ever growing availability of target protein structures from crystallography and homology modeling. Creation of libraries directed toward families of receptors such as GPCRs, kinases, nuclear hormone receptors, proteases, etc., replaced the generation of libraries based primarily on diversity while single target focused library design has remained an important objective. Concurrently, computing grids and cpu clusters have facilitated the development of structure based tools that screen hundreds of thousands of molecules. Smaller "smarter" combinatorial and focused parallel libraries replaced those early un-focused large libraries in the twenty-first century drug design paradigm. While diversity still plays a role in lead discovery, the focus of current library design methods has shifted to receptor based methods, scaffold hopping/bio-isostere searching, and a much needed emphasis on synthetic feasibility. Methods such as "privileged substructures based design" and pharmacophore based design still are important methods for parallel and small combinatorial library design. This chapter discusses some of the possible design methods and presents examples where they are available.
Rodriguez Gonzalez, Beatriz
2008-04-01
Much of the homotopical and homological structure of the categories of chain complexes and topological spaces can be deduced from the existence and properties of the 'simple' functors Tot : {double chain complexes} -> {chain complexes} and geometric realization : {sSets} -> {Top}, or similarly, Tot : {simplicial chain complexes} -> {chain complexes} and | | : {sTop} -> {Top}. The purpose of this thesis is to abstract this situation, and to this end we introduce the notion of '(co)simplicial descent category'. It is inspired by Guillen-Navarros's '(cubical) descent categories'. The key ingredients in a (co)simplicial descent category D are a class E of morphisms in D, called equivalences, and a 'simple' functor s : {(co)simplicial objects in D} -> D. They must satisfy axioms like 'Eilenberg-Zilber', 'exactness' and 'acyclicity'. This notion covers a wide class of examples, as chain complexes, sSets, topological spaces, filtered cochain complexes (where E = filtered quasi-isomorphisms or E = E_2-isomorphisms), commutative differential graded algebras (with s = Navarro's Thom-Whitney simple), DG-modules over a DG-category and mixed Hodge complexes, where s = Deligne's simple. From the simplicial descent structure we obtain homotopical structure on D, as cone and cylinder objects. We use them to i) explicitly describe the morphisms of HoD=D[E^{-1}] similarly to the case of calculus of fractions; ii) endow HoD with a non-additive pre-triangulated structure, that becomes triangulated in the stable additive case. These results use the properties of a 'total functor', which associates to any biaugmented bisimplicial object a simplicial object. It is the simplicial analogue of the total chain complex of a double complex, and it is left adjoint to Illusie's 'decalage' functor.
Brookes, David T
2007-01-01
This paper introduces a theory about the role of language in learning physics. The theory is developed in the context of physics students' and physicists' talking and writing about the subject of quantum mechanics. We found that physicists' language encodes different varieties of analogical models through the use of grammar and conceptual metaphor. We hypothesize that students categorize concepts into ontological categories based on the grammatical structure of physicists' language. We also hypothesize that students over-extend and misapply conceptual metaphors in physicists' speech and writing. Using our theory, we will show how, in some cases, we can explain student difficulties in quantum mechanics as difficulties with language.
Brookes, David T.; Etkina, Eugenia
2007-06-01
This paper introduces a theory about the role of language in learning physics. The theory is developed in the context of physics students and physicists talking and writing about the subject of quantum mechanics. We found that physicists’ language encodes different varieties of analogical models through the use of grammar and conceptual metaphor. We hypothesize that students categorize concepts into ontological categories based on the grammatical structure of physicists’ language. We also hypothesize that students overextend and misapply conceptual metaphors in physicists’ speech and writing. Using our theory, we will show how, in some cases, we can explain student difficulties in quantum mechanics as difficulties with language.
Directory of Open Access Journals (Sweden)
Eugenia Etkina
2007-05-01
Full Text Available This paper introduces a theory about the role of language in learning physics. The theory is developed in the context of physics students and physicists talking and writing about the subject of quantum mechanics. We found that physicists’ language encodes different varieties of analogical models through the use of grammar and conceptual metaphor. We hypothesize that students categorize concepts into ontological categories based on the grammatical structure of physicists’ language. We also hypothesize that students overextend and misapply conceptual metaphors in physicists’ speech and writing. Using our theory, we will show how, in some cases, we can explain student difficulties in quantum mechanics as difficulties with language.
On the Balance of Grammar and Communication Teaching for Chinese Students
Institute of Scientific and Technical Information of China (English)
秦耀咏
2002-01-01
To the problem of neglecting grammar teaching when the Communicative approach is encouraged,this paper tries to analyze the position of teaching grammar and put forward some suggestions on how to balance grammar and communication teaching.
Highest weight categories and recollements
Krause, Henning
2015-01-01
We provide several equivalent descriptions of a highest weight category using recollements of abelian categories. Also, we explain the connection between sequences of standard and exceptional objects.
Consistent Parameter and Transfer Function Estimation using Context Free Grammars
Klotz, Daniel; Herrnegger, Mathew; Schulz, Karsten
2017-04-01
This contribution presents a method for the inference of transfer functions for rainfall-runoff models. Here, transfer functions are defined as parametrized (functional) relationships between a set of spatial predictors (e.g. elevation, slope or soil texture) and model parameters. They are ultimately used for estimation of consistent, spatially distributed model parameters from a limited amount of lumped global parameters. Additionally, they provide a straightforward method for parameter extrapolation from one set of basins to another and can even be used to derive parameterizations for multi-scale models [see: Samaniego et al., 2010]. Yet, currently an actual knowledge of the transfer functions is often implicitly assumed. As a matter of fact, for most cases these hypothesized transfer functions can rarely be measured and often remain unknown. Therefore, this contribution presents a general method for the concurrent estimation of the structure of transfer functions and their respective (global) parameters. Note, that by consequence an estimation of the distributed parameters of the rainfall-runoff model is also undertaken. The method combines two steps to achieve this. The first generates different possible transfer functions. The second then estimates the respective global transfer function parameters. The structural estimation of the transfer functions is based on the context free grammar concept. Chomsky first introduced context free grammars in linguistics [Chomsky, 1956]. Since then, they have been widely applied in computer science. But, to the knowledge of the authors, they have so far not been used in hydrology. Therefore, the contribution gives an introduction to context free grammars and shows how they can be constructed and used for the structural inference of transfer functions. This is enabled by new methods from evolutionary computation, such as grammatical evolution [O'Neill, 2001], which make it possible to exploit the constructed grammar as a
Completeness of Compositional Translation for Context-Free Grammars
Huijsen, W O
1996-01-01
A machine translation system is said to be *complete* if all expressions that are correct according to the source-language grammar can be translated into the target language. This paper addresses the completeness issue for compositional machine translation in general, and for compositional machine translation of context-free grammars in particular. Conditions that guarantee translation completeness of context-free grammars are presented.
PROBLEM-BASED LEARNING TO IMPROVE STUDENTS’ GRAMMAR COMPETENCE
Directory of Open Access Journals (Sweden)
Mukminatus Zuhriyah
2017-06-01
Full Text Available Grammar becomes one of the subjects studied in all Indonesian English Department. It is because grammar has the important role in all English skills. Grammar makes those four English skills meaningful. Somebody can be said as a master of English when he or she also masters grammar. Unfortunately, learning grammar is not as easy as what we think. It needs the effective method that can make the learners motivated and active in learning as well as in applying the grammar in the real life. Problem-based learning applied in this research is one of the alternatives that can help the learners learn grammar easily. This research was a collaborative action research whose general purpose to know whether or not Problem-based learning could improve the students’ grammar competence. Meanwhile, the specific purposes were to know the lecturer’s activities, the students’ activities, and the students’ responses when problem-based learning was implemented in grammar class. Nine students of the fifth semester of English department of education faculty of Hasyim Asy’ari University (UNHASY Tebuireng Jombang in the academic year of 2016/2017 became the subjects of this research. The data got was from the observation notes and the grammar test. There was an improvement on students’ grammar competence from cycle one to cycle two. It was proven by their mean score from 66.7 in cycle one to 72.8 in cycle two. Meanwhile, the percentage of students passing the minimum mastery criteria was from 44.4 in cycle one and 88.9 in cycle two. So that it can be concluded that problem-based learning could improve students’ grammar competence.
XTAG system A Wide Coverage Grammar for English
Doran, C F; Hockey, B A; Srinivas, B; Zaidel, M; Doran, Christy; Egedi, Dania; Hockey, Beth Ann; Zaidel, Martin
1994-01-01
This paper presents the XTAG system, a grammar development tool based on the Tree Adjoining Grammar (TAG) formalism that includes a wide-coverage syntactic grammar for English. The various components of the system are discussed and preliminary evaluation results from the parsing of various corpora are given. Results from the comparison of XTAG against the IBM statistical parser and the Alvey Natural Language Tool parser are also given.
Handbook of graph grammars and computing by graph transformation
Engels, G; Kreowski, H J; Rozenberg, G
1999-01-01
Graph grammars originated in the late 60s, motivated by considerations about pattern recognition and compiler construction. Since then, the list of areas which have interacted with the development of graph grammars has grown quite impressively. Besides the aforementioned areas, it includes software specification and development, VLSI layout schemes, database design, modeling of concurrent systems, massively parallel computer architectures, logic programming, computer animation, developmental biology, music composition, visual languages, and many others.The area of graph grammars and graph tran
Visual feature learning in artificial grammar classification.
Chang, Grace Y; Knowlton, Barbara J
2004-05-01
The Artificial Grammar Learning task has been used extensively to assess individuals' implicit learning capabilities. Previous work suggests that participants implicitly acquire rule-based knowledge as well as exemplar-specific knowledge in this task. This study investigated whether exemplar-specific knowledge acquired in this task is based on the visual features of the exemplars. When a change in the font and case occurred between study and test, there was no effect on sensitivity to grammatical rules in classification judgments. However, such a change did virtually eliminate sensitivity to training frequencies of letter bigrams and trigrams (chunk strength) in classification judgments. Performance of a secondary task during study eliminated this font sensitivity and generally reduced the contribution of chunk strength knowledge. The results are consistent with the idea that perceptual fluency makes a contribution to artificial grammar judgments.
Categories and Commutative Algebra
Salmon, P
2011-01-01
L. Badescu: Sur certaines singularites des varietes algebriques.- D.A. Buchsbaum: Homological and commutative algebra.- S. Greco: Anelli Henseliani.- C. Lair: Morphismes et structures algebriques.- B.A. Mitchell: Introduction to category theory and homological algebra.- R. Rivet: Anneaux de series formelles et anneaux henseliens.- P. Salmon: Applicazioni della K-teoria all'algebra commutativa.- M. Tierney: Axiomatic sheaf theory: some constructions and applications.- C.B. Winters: An elementary lecture on algebraic spaces.
Neural Meta-Memes Framework for Combinatorial Optimization
Song, Li Qin; Lim, Meng Hiot; Ong, Yew Soon
In this paper, we present a Neural Meta-Memes Framework (NMMF) for combinatorial optimization. NMMF is a framework which models basic optimization algorithms as memes and manages them dynamically when solving combinatorial problems. NMMF encompasses neural networks which serve as the overall planner/coordinator to balance the workload between memes. We show the efficacy of the proposed NMMF through empirical study on a class of combinatorial problem, the quadratic assignment problem (QAP).
Generalized topological spaces in evolutionary theory and combinatorial chemistry.
Stadler, Bärbel M R; Stadler, Peter F
2002-01-01
The search spaces in combinatorial chemistry as well as the sequence spaces underlying (molecular) evolution are conventionally thought of as graphs. Recombination, however, implies a nongraphical structure of the combinatorial search spaces. These structures, and their implications for search process itself, are heretofore not well understood in general. In this contribution we review a very general formalism from point set topology and discuss its application to combinatorial search spaces, fitness landscapes, evolutionary trajectories, and artificial chemistries.
Determiners, Feline Marsupials, and the Category-Function Distinction: A Critique of ELT Grammars
Reynolds, Brett
2013-01-01
The concept of determiners is widely employed in linguistics, but mostly absent from English Language Teaching (ELT) materials (dictionaries, teacher-reference books, and student-oriented texts). Among those employing the concept, there is near-universal confusion between determiners and pronouns, arising mainly from an analytical and…
Automatic Transformation of the Thai Categorial Grammar Treebank to Dependency Trees
DEFF Research Database (Denmark)
Rishøj, Christian; Ruangrajitpakorn, Taneth; Boonkwan, Prachya
2011-01-01
training set achieves 76.5% label accuracy. In the process, a number of annotation errors in the CG bank were identified and corrected. Although rather limited in its coverage, excluding e.g. long-distance dependencies, topicalisations and longer sentences, the resulting treebank is believed to be sound...... in terms of structural annotational consistency and a valuable complement to the scarce Thai language resources in existence....
Grammar Based Genetic Programming Using Linear Representations
Institute of Scientific and Technical Information of China (English)
ZHANGHong; LUYinan; WANGFei
2003-01-01
In recent years,there has been a great interest in genetic programming(GP),which is used to solve many applications such as data mining,electronic engineering and pattern recognition etc.. Genetic programming paradigm as a from of adaptive learning is a functional approach to many problems that require a nonfixed representation and GP typically operates on a population of parse which usually represent computer programs whose nodes have single data type.In this paper GP using context-free grammars(CFGs) is described.This technique separates search space from solution space through a genotype to phenotype mapping.The genotypes and phenotypes of the individuals both act on different linear representations.A phenotype is postfix expression,a new method of representing which is described by making use of the definition and related features of a context-free grammar,i.e.a genotype is a variable length,linear valid genome determined by a simplifled derivation tree(SDT) generated from a context-free grammar.A CFG is used to specify how the possible solutions are created according to experiential knowledge and to direct legal crossover(ormutation)operations without any explicit reference to the process of program generation and parsing,and automatically ensuring typing and syntax correctness.Some related definitions involving genetic operators are described.Fitness evaluation is given.This technique is applied to a symbol regression problem-the identification of nonlinear dynamic characteristics of cushioning packaging.Experimental results show this method can flnd good relations between variables and is better than basic GP without a grammar.Future research on it is outlined.
Nigel: A Systemic Grammar for Text Generation.
1983-02-01
in the logical component). Henrici [ Henrici 811 observes that "linear recursion is rather more troublesome" than recursion through embedding (which...notation defined by Henrici [ Henrici 81]. However, we have neither exhausted the grammar nor reached the lexicon. This section will present how the...Halliday, M. A. K., Language as Social Semiotic, University Park Press, Baltimore, 1978 [ Henrici 81] Henrici , A., "Some notes on the systemic generation of
Stream Processing Using Grammars and Regular Expressions
DEFF Research Database (Denmark)
Rasmussen, Ulrik Terp
Kleenex, a language for expressing high-performance streaming string processing programs as regular grammars with embedded semantic actions, and its compilation to streaming string transducers with worst-case linear-time performance. Its underlying theory is based on transducer decomposition into oracle...... is based on a bottom-up tabulation algorithm reformulated using least fixed points and evaluated using an instance of the chaotic iteration scheme by Cousot and Cousot....
Experimental functional realization of attribute grammar system
Directory of Open Access Journals (Sweden)
I. Attali
2002-07-01
Full Text Available In this paper we present an experimental functional realization of attribute grammar(AG system for personal computers. For AG system functioning only Turbo Prolog compiler is required. The system functioning is based on a specially elaborated metalanguage for AG description, universal syntactic and semantic constructors. The AG system provides automatic generation of target compiler (syntax--oriented software using Turbo Prolog as object language.
Categorial compositionality: a category theory explanation for the systematicity of human cognition.
Phillips, Steven; Wilson, William H
2010-07-22
Classical and Connectionist theories of cognitive architecture seek to explain systematicity (i.e., the property of human cognition whereby cognitive capacity comes in groups of related behaviours) as a consequence of syntactically and functionally compositional representations, respectively. However, both theories depend on ad hoc assumptions to exclude specific instances of these forms of compositionality (e.g. grammars, networks) that do not account for systematicity. By analogy with the Ptolemaic (i.e. geocentric) theory of planetary motion, although either theory can be made to be consistent with the data, both nonetheless fail to fully explain it. Category theory, a branch of mathematics, provides an alternative explanation based on the formal concept of adjunction, which relates a pair of structure-preserving maps, called functors. A functor generalizes the notion of a map between representational states to include a map between state transformations (or processes). In a formal sense, systematicity is a necessary consequence of a higher-order theory of cognitive architecture, in contrast to the first-order theories derived from Classicism or Connectionism. Category theory offers a re-conceptualization for cognitive science, analogous to the one that Copernicus provided for astronomy, where representational states are no longer the center of the cognitive universe--replaced by the relationships between the maps that transform them.
Introduction (of 'The Noun Phrase in Functional Discourse Grammar')
DEFF Research Database (Denmark)
García Velasco, Daniel; Rijkhoff, Jan
2008-01-01
The articles in this volume analyse the noun phrase within the framework of Functional Discourse Grammar (FDG), the successor to Simon C. Dik’s Functional Grammar (FG). The Noun Phrase was the main conference theme of the 11th International Conference on Functional Grammar, which took place......, the most recent treatment of NPs by Dik in terms of “classical FG” was published (posthumously) in 1997, in the first volume of The Theory of Functional Grammar. Given the fact that FDG presents a strongly revised version of Dikkian FG with respect to rules, variables, representations and overall design...
English grammar a function-based introduction, v.2
Givón, T
1993-01-01
The approach to language and grammar that motivates this book is unabashedly functional; grammar is not just a system of empty rules, it is a means to an end, an instrument for constructing concise coherent communication. In grammar as in music, good expression rides on good form. Figuratively and literally, grammar like musical form must make sense. But for the instrument to serve its purpose, it must first exist; the rules must be real, they can be explicitly described and taught. This book is intended for both students and teachers, at college level, for both native and nonnative speakers.
English grammar a function-based introduction, v.1
Givón, T
1993-01-01
The approach to language and grammar that motivates this book is unabashedly functional; grammar is not just a system of empty rules, it is a means to an end, an instrument for constructing concise coherent communication. In grammar as in music, good expression rides on good form. Figuratively and literally, grammar like musical form must make sense. But for the instrument to serve its purpose, it must first exist; the rules must be real, they can be explicitly described and taught. This book is intended for both students and teachers, at college level, for both native and nonnative speakers.
Teaching English Grammar Through Communicative Language Teaching Approach
Institute of Scientific and Technical Information of China (English)
王玮
2013-01-01
Grammar is an important part of language learning. In order for students to have a functional knowledge of a language (in other words, that they can spontaneously produce language) they must have at least some knowledge about the grammatical con⁃structs of the language in question. How grammar can be taught? Considering various second language teaching methods, teaching grammar through Communicative Language Teaching Approach is the most talked. Emphasis in this article is put on the applica⁃tion of Communicative Language Teaching Approach in grammar teaching in college English classes.
Kiss my asterisk a feisty guide to punctuation and grammar
Baranick, Jenny
2014-01-01
Grammar has finally let its hair down! Unlike uptight grammar books that overwhelm us with every single grammar rule, Kiss My Asterisk is like a bikini: it's fun, flirty, and covers only the most important bits. Its lessons, which are 100 percent free of complicated grammar jargon, have been carefully selected to include today's most common, noticeable errors—the ones that confuse our readers or make them wonder if we are, in fact, smarter than a fifth grader. What is the proper use of an apostrophe? When should an ellipsis be used instead of an em dash? Why do we capitalize President Obama bu
Advanced Aqueous Phase Catalyst Development using Combinatorial Methods Project
National Aeronautics and Space Administration — Combinatorial methods are proposed to develop advanced Aqueous Oxidation Catalysts (AOCs) with the capability to mineralize organic contaminants present in effluents...
伊東, 治己
1992-01-01
This article is intended to provide a framework or viewpoint for future studies to be conducted by the same author concerning grammar teaching for Japanese EFL learners at secondary school. Its specific aim is to discuss the requirements to be met by pedagogical grammar intended for use in the EFL classroom at Japanese secondary school. Unlike theoretical grammar, which is intended for researchers on linguistics and whose main purpose is to systematize the regularities observed in the use of ...
Directory of Open Access Journals (Sweden)
Kaoru Takahashi
2013-08-01
Full Text Available In order for intermediate students poor at English grammar to enjoy learning it, a unique methodology has been improved in the classroom. In this article illustrated vehicles relevant to the five basic sentence patterns are presented in order to show how helpful this method is to understand English grammar. Also, more enhanced areas of this theory are discussed, which clarifies the feasibility of this methodology. The items to be introduced in my method are gerund, the passive voice, the relative pronoun and so on.
Effects of Suboptimal Bidding in Combinatorial Auctions
Schneider, Stefan; Shabalin, Pasha; Bichler, Martin
Though the VCG auction assumes a central place in the mechanism design literature, there are a number of reasons for favoring iterative combinatorial auction designs. Several promising ascending auction formats have been developed throughout the past few years based on primal-dual and subgradient algorithms and linear programming theory. Prices are interpreted as a feasible dual solution and the provisional allocation is interpreted as a feasible primal solution. iBundle( 3) (Parkes and Ungar 2000), dVSV (de Vries et al. 2007) and the Ascending Proxy auction (Ausubel and Milgrom 2002) result in VCG payoffs when the coalitional value function satisfies the buyer submodularity condition and bidders bid straightforward, which is an expost Nash equilibrium in that case. iBEA and CreditDebit auctions (Mishra and Parkes 2007) do not even require the buyer submodularity condition and achieve the same properties for general valuations. In many situations, however, one cannot assume bidders to bid straightforward and it is not clear from the theory how these non-linear personalized price auctions (NLPPAs) perform in this case. Robustness of auctions with respect to different bidding behavior is therefore a critical issue for any application. We have conducted a large number of computational experiments to analyze the performance of NLPPA designs with respect to different bidding strategies and different valuation models. We compare the results of NLPPAs to those of the VCG auction and those of iterative combinatorial auctions with approximate linear prices, such as ALPS (Bichler et al. 2009) and the Combinatorial Clock auction (Porter et al. 2003).
LIBERTARISMO & ERROR CATEGORIAL
Directory of Open Access Journals (Sweden)
Carlos G. Patarroyo G.
2009-01-01
Full Text Available En este artículo se ofrece una defensa del libertarismo frente a dos acusaciones según las cuales éste comete un error categorial. Para ello, se utiliza la filosofía de Gilbert Ryle como herramienta para explicar las razones que fundamentan estas acusaciones y para mostrar por qué, pese a que ciertas versiones del libertarismo que acuden a la causalidad de agentes o al dualismo cartesiano cometen estos errores, un libertarismo que busque en el indeterminismo fisicalista la base de la posibilidad de la libertad humana no necesariamente puede ser acusado de incurrir en ellos.