Chemical Graph Transformation with Stereo-Information

DEFF Research Database (Denmark)

Andersen, Jakob Lykke; Flamm, Christoph; Merkle, Daniel

2017-01-01

Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms and their neighbo......Double Pushout graph transformation naturally facilitates the modelling of chemical reactions: labelled undirected graphs model molecules and direct derivations model chemical reactions. However, the most straightforward modelling approach ignores the relative placement of atoms...... and their neighbours in space. Stereoisomers of chemical compounds thus cannot be distinguished, even though their chemical activity may differ substantially. In this contribution we propose an extended chemical graph transformation system with attributes that encode information about local geometry. The modelling...... of graph transformation, but we here propose a framework that also allows for partially specified stereoinformation. While there are several stereochemical configurations to be considered, we focus here on the tetrahedral molecular shape, and suggest general principles for how to treat all other chemically...

From LL-regular to LL(1) grammars: Transformations, covers and parsing

NARCIS (Netherlands)

Nijholt, Antinus

1982-01-01

In this paper it is shown that it is possible to transform any LL-regular grammar G into an LL(1) grammar G' in such a way that parsing G' is as good as parsing G. That is, a parse of a sentence of grammar G can be obtained with a simple string homomorphism from the parse of a corresponding sentence

Graph Transforming Java Data

NARCIS (Netherlands)

de Mol, M.J.; Rensink, Arend; Hunt, James J.

This paper introduces an approach for adding graph transformation-based functionality to existing JAVA programs. The approach relies on a set of annotations to identify the intended graph structure, as well as on user methods to manipulate that structure, within the user’s own JAVA class

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.

Improved Conflict Detection for Graph Transformation with Attributes

Directory of Open Access Journals (Sweden)

Géza Kulcsár

2015-04-01

Full Text Available In graph transformation, a conflict describes a situation where two alternative transformations cannot be arbitrarily serialized. When enriching graphs with attributes, existing conflict detection techniques typically report a conflict whenever at least one of two transformations manipulates a shared attribute. In this paper, we propose an improved, less conservative condition for static conflict detection of graph transformation with attributes by explicitly taking the semantics of the attribute operations into account. The proposed technique is based on symbolic graphs, which extend the traditional notion of graphs by logic formulas used for attribute handling. The approach is proven complete, i.e., any potential conflict is guaranteed to be detected.

Graph Creation, Visualisation and Transformation

Directory of Open Access Journals (Sweden)

Maribel Fernández

2010-03-01

Full Text Available We describe a tool to create, edit, visualise and compute with interaction nets - a form of graph rewriting systems. The editor, called GraphPaper, allows users to create and edit graphs and their transformation rules using an intuitive user interface. The editor uses the functionalities of the TULIP system, which gives us access to a wealth of visualisation algorithms. Interaction nets are not only a formalism for the specification of graphs, but also a rewrite-based computation model. We discuss graph rewriting strategies and a language to express them in order to perform strategic interaction net rewriting.

Transformation of UML models to CSP : a case study for graph transformation tools

NARCIS (Netherlands)

Varró, D.; Asztalos, M.; Bisztray, D.; Boronat, A.; Dang, D.; Geiß, R.; Greenyer, J.; Van Gorp, P.M.E.; Kniemeyer, O.; Narayanan, A.; Rencis, E.; Weinell, E.; Schürr, A.; Nagl, M.; Zündorf, A.

2008-01-01

Graph transformation provides an intuitive mechanism for capturing model transformations. In the current paper, we investigate and compare various graph transformation tools using a compact practical model transformation case study carried out as part of the AGTIVE 2007 Tool Contest [22]. The aim of

Graph Transformation for Consolidation of Creativity Sessions Results

DEFF Research Database (Denmark)

Dolog, Peter

2010-01-01

Graph transformation approach for consolidation of creativity sessions results is part of the FP7 EU/IST project idSpace: Tooling of and training for collaborative, distributed product innovation. The goal of graph transformation approach is to provide a tool for merging results of various sessions...... (such as brainstorming sessions), which are represented as graphs, when the session participants- are physically distributed....

Understanding the Models of Grammar

OpenAIRE

Mahaputri, Ratna Andhika

2013-01-01

This article provides comprehensive explanation about several models of grammar. The first model of grammar which is explained is considered from the functional grammar and associated with the American linguist Noam Chomsky that is Transformational Grammar. This model of grammar is consisted of three components they are phrase structure rule, the lexicon, and transformation. The second model of grammar which is explained in this article is Minimalist Grammar. This article also compares her...

Engineering Object-Oriented Semantics Using Graph Transformations

NARCIS (Netherlands)

Kastenberg, H.; Kleppe, A.G.; Rensink, Arend

In this paper we describe the application of the theory of graph transformations to the practise of language design. We have defined the semantics of a small but realistic object-oriented language (called TAAL) by mapping the language constructs to graphs and their operational semantics to graph

Proving termination of graph transformation systems using weighted type graphs over semirings

NARCIS (Netherlands)

Bruggink, H.J.S.; König, B.; Nolte, D.; Zantema, H.; Parisi-Presicce, F.; Westfechtel, B.

2015-01-01

We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapting it to graph rewriting instead of string rewriting and by generalizing to ordered semirings. In this way we obtain a

Single-View 3D Scene Reconstruction and Parsing by Attribute Grammar.

Science.gov (United States)

Liu, Xiaobai; Zhao, Yibiao; Zhu, Song-Chun

2018-03-01

In this paper, we present an attribute grammar for solving two coupled tasks: i) parsing a 2D image into semantic regions; and ii) recovering the 3D scene structures of all regions. The proposed grammar consists of a set of production rules, each describing a kind of spatial relation between planar surfaces in 3D scenes. These production rules are used to decompose an input image into a hierarchical parse graph representation where each graph node indicates a planar surface or a composite surface. Different from other stochastic image grammars, the proposed grammar augments each graph node with a set of attribute variables to depict scene-level global geometry, e.g., camera focal length, or local geometry, e.g., surface normal, contact lines between surfaces. These geometric attributes impose constraints between a node and its off-springs in the parse graph. Under a probabilistic framework, we develop a Markov Chain Monte Carlo method to construct a parse graph that optimizes the 2D image recognition and 3D scene reconstruction purposes simultaneously. We evaluated our method on both public benchmarks and newly collected datasets. Experiments demonstrate that the proposed method is capable of achieving state-of-the-art scene reconstruction of a single image.

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...

Parameterized Verification of Graph Transformation Systems with Whole Neighbourhood Operations

OpenAIRE

Delzanno, Giorgio; Stückrath, Jan

2014-01-01

We introduce a new class of graph transformation systems in which rewrite rules can be guarded by universally quantified conditions on the neighbourhood of nodes. These conditions are defined via special graph patterns which may be transformed by the rule as well. For the new class for graph rewrite rules, we provide a symbolic procedure working on minimal representations of upward closed sets of configurations. We prove correctness and effectiveness of the procedure by a categorical presenta...

TGGs for Transforming UML to CSP

DEFF Research Database (Denmark)

Greenyer, Joel; Kindler, Ekkart; Rieke, Jan

Contest. The second transformation problem, a transformation from UML activity diagrams to CSP processes, i.e. a transformation between two models, is a typical application for Triple Graph Grammars (TGGs). We present our contributed solution, presenting the TGG rules and the implementation of our TGG...... interpreter. Moreover, we point out the advantages of our soulution as well as some restrictions of the current implementation. This paper will only briefly state the transformation problem and focus on our TGG approach and the discussion of the rules....

Attribute And-Or Grammar for Joint Parsing of Human Pose, Parts and Attributes.

Science.gov (United States)

Park, Seyoung; Nie, Xiaohan; Zhu, Song-Chun

2017-07-25

This paper presents an attribute and-or grammar (A-AOG) model for jointly inferring human body pose and human attributes in a parse graph with attributes augmented to nodes in the hierarchical representation. In contrast to other popular methods in the current literature that train separate classifiers for poses and individual attributes, our method explicitly represents the decomposition and articulation of body parts, and account for the correlations between poses and attributes. The A-AOG model is an amalgamation of three traditional grammar formulations: (i)Phrase structure grammar representing the hierarchical decomposition of the human body from whole to parts; (ii)Dependency grammar modeling the geometric articulation by a kinematic graph of the body pose; and (iii)Attribute grammar accounting for the compatibility relations between different parts in the hierarchy so that their appearances follow a consistent style. The parse graph outputs human detection, pose estimation, and attribute prediction simultaneously, which are intuitive and interpretable. We conduct experiments on two tasks on two datasets, and experimental results demonstrate the advantage of joint modeling in comparison with computing poses and attributes independently. Furthermore, our model obtains better performance over existing methods for both pose estimation and attribute prediction tasks.

Performance of children with developmental dyslexia on high and low topological entropy artificial grammar learning task.

Science.gov (United States)

Katan, Pesia; Kahta, Shani; Sasson, Ayelet; Schiff, Rachel

2017-07-01

Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine whether children's performance depends on the complexity level of the grammar system learned. We conducted two artificial grammar learning experiments that compared performance of children with developmental dyslexia with that of age- and reading level-matched controls. Experiment 1 was a high topological entropy artificial grammar learning task that aimed to establish implicit learning phenomena in children with developmental dyslexia using previously published experimental conditions. Experiment 2 is a lower topological entropy variant of that task. Results indicated that given a high topological entropy grammar system, children with developmental dyslexia who were similar to the reading age-matched control group had substantial difficulty in performing the task as compared to typically developing children, who exhibited intact implicit learning of the grammar. On the other hand, when tested on a lower topological entropy grammar system, all groups performed above chance level, indicating that children with developmental dyslexia were able to identify rules from a given grammar system. The results reinforced the significance of graph complexity when experimenting with artificial grammar learning tasks, particularly with dyslexic participants.

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....

Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages

DEFF Research Database (Denmark)

Mendling, Jan; Lassen, Kristian Bisgaard; Zdun, Uwe

2006-01-01

Much recent research work discusses the transformation between different process modelling languages. This work, however, is mainly focussed on specific process modelling languages, and thus the general reusability of the applied transformation concepts is rather limited. In this paper, we aim...... to abstract from concrete transformation strategies by distinguishing two major paradigms for representing control flow in process modelling languages: block-oriented languages (such as BPEL and BPML) and graph-oriented languages (such as EPCs and YAWL). The contribution of this paper are generic strategies...... for transforming from block-oriented process languages to graph-oriented languages, and vice versa....

ANNSVM: A Novel Method for Graph-Type Classification by Utilization of Fourier Transformation, Wavelet Transformation, and Hough Transformation

Directory of Open Access Journals (Sweden)

Sarunya Kanjanawattana

2017-07-01

Full Text Available Image classification plays a vital role in many areas of study, such as data mining and image processing; however, serious problems collectively referred to as the course of dimensionality have been encountered in previous studies as factors that reduce system performance. Furthermore, we also confront the problem of different graph characteristics even if graphs belong to same types. In this study, we propose a novel method of graph-type classification. Using our approach, we open up a new solution of high-dimensional images and address problems of different characteristics by converting graph images to one dimension with a discrete Fourier transformation and creating numeric datasets using wavelet and Hough transformations. Moreover, we introduce a new classifier, which is a combination between artificial neuron networks (ANNs and support vector machines (SVMs, which we call ANNSVM, to enhance accuracy. The objectives of our study are to propose an effective graph-type classification method that includes finding a new data representative used for classification instead of two-dimensional images and to investigate what features make our data separable. To evaluate the method of our study, we conducted five experiments with different methods and datasets. The input dataset we focused on was a numeric dataset containing wavelet coefficients and outputs of a Hough transformation. From our experimental results, we observed that the highest accuracy was provided using our method with Coiflet 1, which achieved a 0.91 accuracy.

Procedural Content Graphs for Urban Modeling

Directory of Open Access Journals (Sweden)

Pedro Brandão Silva

2015-01-01

Full Text Available Massive procedural content creation, for example, for virtual urban environments, is a difficult, yet important challenge. While shape grammars are a popular example of effectiveness in architectural modeling, they have clear limitations regarding readability, manageability, and expressive power when addressing a variety of complex structural designs. Moreover, shape grammars aim at geometry specification and do not facilitate integration with other types of content, such as textures or light sources, which could rather accompany the generation process. We present procedural content graphs, a graph-based solution for procedural generation that addresses all these issues in a visual, flexible, and more expressive manner. Besides integrating handling of diverse types of content, this approach introduces collective entity manipulation as lists, seamlessly providing features such as advanced filtering, grouping, merging, ordering, and aggregation, essentially unavailable in shape grammars. Hereby, separated entities can be easily merged or just analyzed together in order to perform a variety of context-based decisions and operations. The advantages of this approach are illustrated via examples of tasks that are either very cumbersome or simply impossible to express with previous grammar approaches.

Recovering grammar relationships for the Java language specification

NARCIS (Netherlands)

R. Lämmel (Ralf); V. Zaytsev (Vadim)

2011-01-01

textabstractGrammar convergence is a method that helps in discovering relationships between different grammars of the same language or different language versions. The key element of the method is the operational, transformation-based representation of those relationships. Given input grammars for

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.

Graph and model transformation tools for model migration : empirical results from the transformation tool contest

NARCIS (Netherlands)

Rose, L.M.; Herrmannsdoerfer, M.; Mazanek, S.; Van Gorp, P.M.E.; Buchwald, S.; Horn, T.; Kalnina, E.; Koch, A.; Lano, K.; Schätz, B.; Wimmer, M.

2014-01-01

We describe the results of the Transformation Tool Contest 2010 workshop, in which nine graph and model transformation tools were compared for specifying model migration. The model migration problem—migration of UML activity diagrams from version 1.4 to version 2.2—is non-trivial and practically

Grammar-Based Multi-Frontal Solver for One Dimensional Isogeometric Analysis with Multiple Right-Hand-Sides

KAUST Repository

Kuźnik, Krzysztof

2013-06-01

This paper introduces a grammar-based model for developing a multi-thread multi-frontal parallel direct solver for one- dimensional isogeometric finite element method. The model includes the integration of B-splines for construction of the element local matrices and the multi-frontal solver algorithm. The integration and the solver algorithm are partitioned into basic indivisible tasks, namely the grammar productions, that can be executed squentially. The partial order of execution of the basic tasks is analyzed to provide the scheduling for the execution of the concurrent integration and multi-frontal solver algo- rithm. This graph grammar analysis allows for optimal concurrent execution of all tasks. The model has been implemented and tested on NVIDIA CUDA GPU, delivering logarithmic execution time for linear, quadratic, cubic and higher order B-splines. Thus, the CUDA implementation delivers the optimal performance predicted by our graph grammar analysis. We utilize the solver for multiple right hand sides related to the solution of non-stationary or inverse problems.

Transformation Strategies between Block-Oriented and Graph-Oriented Process Modelling Languages

DEFF Research Database (Denmark)

Mendling, Jan; Lassen, Kristian Bisgaard; Zdun, Uwe

to abstract from concrete transformationstrategies by distinguishing two major paradigms for process modelling languages:block-oriented languages (such as BPEL and BPML) and graph-oriented languages(such as EPCs and YAWL). The contribution of this paper are generic strategiesfor transforming from block......Much recent research work discusses the transformation between differentprocess modelling languages. This work, however, is mainly focussed on specific processmodelling languages, and thus the general reusability of the applied transformationconcepts is rather limited. In this paper, we aim......-oriented process languages to graph-oriented languages,and vice versa. We also present two case studies of applying our strategies....

TG Grammar's Implications for the Foreign Language Teaching

Institute of Scientific and Technical Information of China (English)

殷彩

2009-01-01

Chomsky's Transformational-Generative (TG) grammar is another revolution to linguistics after Saussure's strueturalism, and it plays an important role in the modem linguistics. Introducing the research perspective and method of TG grammar, this paper analyses its implications for the foreign language teaching.

Performance of Children with Developmental Dyslexia on High and Low Topological Entropy Artificial Grammar Learning Task

Science.gov (United States)

Katan, Pesia; Kahta, Shani; Sasson, Ayelet; Schiff, Rachel

2017-01-01

Graph complexity as measured by topological entropy has been previously shown to affect performance on artificial grammar learning tasks among typically developing children. The aim of this study was to examine the effect of graph complexity on implicit sequential learning among children with developmental dyslexia. Our goal was to determine…

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?

Clone Detection for Graph-Based Model Transformation Languages

DEFF Research Database (Denmark)

Strüber, Daniel; Plöger, Jennifer; Acretoaie, Vlad

2016-01-01

and analytical quality assurance. From these use cases, we derive a set of key requirements. We describe our customization of existing model clone detection techniques allowing us to address these requirements. Finally, we provide an experimental evaluation, indicating that our customization of ConQAT, one......Cloning is a convenient mechanism to enable reuse across and within software artifacts. On the downside, it is also a practice related to significant long-term maintainability impediments, thus generating a need to identify clones in affected artifacts. A large variety of clone detection techniques...... has been proposed for programming and modeling languages; yet no specific ones have emerged for model transformation languages. In this paper, we explore clone detection for graph-based model transformation languages. We introduce potential use cases for such techniques in the context of constructive...

Comparison of Context-free Grammars Based on Parsing Generated Test Data

NARCIS (Netherlands)

B. Fischer (Bernd); R. Lämmel (Ralf); V. Zaytsev (Vadim); U. Aßmann; J. Saraiva; A.M. Sloane

2011-01-01

textabstractThere exist a number of software engineering scenarios that essentially involve equivalence or correspondence assertions for some of the context-free grammars in the scenarios. For instance, when applying grammar transformations during parser development---be it for the sake of

Grammar-Based Multi-Frontal Solver for One Dimensional Isogeometric Analysis with Multiple Right-Hand-Sides

KAUST Repository

Kuźnik, Krzysztof; Paszyński, Maciej; Calo, Victor M.

2013-01-01

on NVIDIA CUDA GPU, delivering logarithmic execution time for linear, quadratic, cubic and higher order B-splines. Thus, the CUDA implementation delivers the optimal performance predicted by our graph grammar analysis. We utilize the solver for multiple

CHR grammars

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....... 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....

CHR Grammars

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....... 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....

Grammar and Grammaring: Toward Modes for English Grammar Teaching in China

Science.gov (United States)

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…

A Modal-Logic Based Graph Abstraction

NARCIS (Netherlands)

Bauer, J.; Boneva, I.B.; Kurban, M.E.; Rensink, Arend; Ehrig, H; Heckel, R.; Rozenberg, G.; Taentzer, G.

2008-01-01

Infinite or very large state spaces often prohibit the successful verification of graph transformation systems. Abstract graph transformation is an approach that tackles this problem by abstracting graphs to abstract graphs of bounded size and by lifting application of productions to abstract

Grammar and Context in Functional Discourse Grammar

NARCIS (Netherlands)

Hengeveld, K.; Mackenzie, J.L.

2014-01-01

This article presents a proposal for the organization of the Contextual Component in Functional Discourse Grammar. A guiding principle in this proposal is that, given the fact that Functional Discourse Grammar is a theory of grammar, the Contextual Component should provide the information that is

Teaching Grammar

Science.gov (United States)

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…

LL-regular grammars

NARCIS (Netherlands)

Nijholt, Antinus

1980-01-01

Culik II and Cogen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. In this paper we consider an analogous extension of the LL(k) grammars called the LL-regular grammars. The relation of this class of grammars to other classes of grammars will be shown. Any LL-regular

Forest Grammar(Ⅰ)

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.

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.

Learning System of Web Navigation Patterns through Hypertext Probabilistic Grammars

Directory of Open Access Journals (Sweden)

Augusto Cortez Vasquez

2015-01-01

Full Text Available One issue of real interest in the area of web data mining is to capture users’ activities during connection and extract behavior patterns that help define their preferences in order to improve the design of future pages adapting websites interfaces to individual users. This research is intended to provide, first of all, a presentation of the methodological foundations of the use of probabilistic languages to identify relevant or most visited websites. Secondly, the web sessions are represented by graphs and probabilistic context-free grammars so that the sessions that have the highest probabilities are considered the most visited and most preferred, therefore, the most important in relation to a particular topic. It aims to develop a tool for processing web sessions obtained from a log server represented by probabilistic context-free grammars.

Grammar and Communication

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.

Modelling and analysis of distributed simulation protocols with distributed graph transformation

OpenAIRE

Lara, Juan de; Taentzer, Gabriele

2005-01-01

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. J. de Lara, and G. Taentzer, "Modelling and analysis of distributed simulation protocols with distributed graph transformation...

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.

Essential French grammar

CERN Document Server

Thacker, Mike

2014-01-01

Essential French Grammar is an innovative reference grammar and workbook for intermediate and advanced undergraduate students of French (CEFR levels B2 to C1). Its clear explanations of grammar are supported by contemporary examples and lively cartoon drawings.  Each chapter contains: * real-life language examples in French, with English translations * a 'key points' box and tables that summarise grammar concepts * a variety of exercises to reinforce learning * a contemporary primary source or literary extract to illustrate grammar in context. To aid your understanding, this book also contains a glossary of grammatical terms in French and English, useful verb tables and a key to the exercises. Together, these features all help you to grasp complex points of grammar and develop your French language skills.

The Nature of Grammar

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.

Reconciling TGGs with QVT

DEFF Research Database (Denmark)

Greenyer, Joel; Kindler, Ekkart

2007-01-01

. QVT (Query/View/Transformation) is the transformation technology recently proposed for this purpose by the OMG. TGGs (Triple Graph Grammars) are another transformation technology proposed in the mid-nineties, used for example in the FUJABA CASE tool. In contrast to many other transformation...

Presenting New 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.

Algorithms for Regular Tree Grammar Network Search and Their Application to Mining Human-viral Infection Patterns.

Science.gov (United States)

Smoly, Ilan; Carmel, Amir; Shemer-Avni, Yonat; Yeger-Lotem, Esti; Ziv-Ukelson, Michal

2016-03-01

Network querying is a powerful approach to mine molecular interaction networks. Most state-of-the-art network querying tools either confine the search to a prespecified topology in the form of some template subnetwork, or do not specify any topological constraints at all. Another approach is grammar-based queries, which are more flexible and expressive as they allow for expressing the topology of the sought pattern according to some grammar-based logic. Previous grammar-based network querying tools were confined to the identification of paths. In this article, we extend the patterns identified by grammar-based query approaches from paths to trees. For this, we adopt a higher order query descriptor in the form of a regular tree grammar (RTG). We introduce a novel problem and propose an algorithm to search a given graph for the k highest scoring subgraphs matching a tree accepted by an RTG. Our algorithm is based on the combination of dynamic programming with color coding, and includes an extension of previous k-best parsing optimization approaches to avoid isomorphic trees in the output. We implement the new algorithm and exemplify its application to mining viral infection patterns within molecular interaction networks. Our code is available online.

Grammar! A Conference Report.

Science.gov (United States)

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…

Design Transformations for Rule-based Procedural Modeling

KAUST Repository

Lienhard, Stefan; Lau, Cheryl; Mü ller, Pascal; Wonka, Peter; Pauly, Mark

2017-01-01

We introduce design transformations for rule-based procedural models, e.g., for buildings and plants. Given two or more procedural designs, each specified by a grammar, a design transformation combines elements of the existing designs to generate new designs. We introduce two technical components to enable design transformations. First, we extend the concept of discrete rule switching to rule merging, leading to a very large shape space for combining procedural models. Second, we propose an algorithm to jointly derive two or more grammars, called grammar co-derivation. We demonstrate two applications of our work: we show that our framework leads to a larger variety of models than previous work, and we show fine-grained transformation sequences between two procedural models.

Design Transformations for Rule-based Procedural Modeling

KAUST Repository

Lienhard, Stefan

2017-05-24

We introduce design transformations for rule-based procedural models, e.g., for buildings and plants. Given two or more procedural designs, each specified by a grammar, a design transformation combines elements of the existing designs to generate new designs. We introduce two technical components to enable design transformations. First, we extend the concept of discrete rule switching to rule merging, leading to a very large shape space for combining procedural models. Second, we propose an algorithm to jointly derive two or more grammars, called grammar co-derivation. We demonstrate two applications of our work: we show that our framework leads to a larger variety of models than previous work, and we show fine-grained transformation sequences between two procedural models.

Compiler generation based on grammar inheritance

NARCIS (Netherlands)

Aksit, Mehmet; Mostert, Rene; Haverkort, Boudewijn R.H.M.

1990-01-01

The concept of grammar inheritance is introduced. Grammar inheritance is a structural organization of grammar rules by which a grammar inherits rules from ancestor grammars or may have its own rules inherited by descendant grammars. Grammar inheritance supports reusability and extensibility of

Learning a generative probabilistic grammar of experience: a process-level model of language acquisition.

Science.gov (United States)

Kolodny, Oren; Lotem, Arnon; Edelman, Shimon

2015-03-01

We introduce a set of biologically and computationally motivated design choices for modeling the learning of language, or of other types of sequential, hierarchically structured experience and behavior, and describe an implemented system that conforms to these choices and is capable of unsupervised learning from raw natural-language corpora. Given a stream of linguistic input, our model incrementally learns a grammar that captures its statistical patterns, which can then be used to parse or generate new data. The grammar constructed in this manner takes the form of a directed weighted graph, whose nodes are recursively (hierarchically) defined patterns over the elements of the input stream. We evaluated the model in seventeen experiments, grouped into five studies, which examined, respectively, (a) the generative ability of grammar learned from a corpus of natural language, (b) the characteristics of the learned representation, (c) sequence segmentation and chunking, (d) artificial grammar learning, and (e) certain types of structure dependence. The model's performance largely vindicates our design choices, suggesting that progress in modeling language acquisition can be made on a broad front-ranging from issues of generativity to the replication of human experimental findings-by bringing biological and computational considerations, as well as lessons from prior efforts, to bear on the modeling approach. Copyright © 2014 Cognitive Science Society, Inc.

Group Grammar

Science.gov (United States)

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.

Closure properties of Watson-Crick grammars

Science.gov (United States)

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.

Learn Grammar in Games

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.

Multi-rate equivalents of cyclo-static synchronous dataflow graphs

NARCIS (Netherlands)

de Groote, Robert; Holzenspies, P.K.F.; Kuper, Jan; Smit, Gerardus Johannes Maria

In this paper, we present a transformation that takes a cyclo-static dataflow (CSDF) graph and produces an equivalent multi-rate synchronous dataflow (MRSDF) graph. This fills a gap in existing analysis techniques for synchronous dataflow graphs; transformations into equivalent homogeneous

ESTUDIO ESTADÍSTICO DEL NÚMERO DE REGLAS RESULTANTES AL TRANSFORMAR UNA GRAMÁTICA LIBRE DE CONTEXTO A LA FORMA NORMAL DE CHOMSKY STATISTICAL STUDY OF THE NUMBER OF RESULTING RULES WHEN TRANSFORMING A CONTEXT-FREE GRAMMAR TO CHOMSKY NORMAL FORM

Directory of Open Access Journals (Sweden)

Fredy Ángel Miguel Amaya Robayo

2010-08-01

Full Text Available Es un hecho conocido que toda gramática libre de contexto puede ser transformada a la forma normal de Chomsky de tal forma que los lenguajes generados por las dos gramáticas son equivalentes. Una gramática en forma normal de Chomsky (FNC, tiene algunas ventajas, por ejemplo sus árboles de derivación son binarios, la forma de sus reglas más simples etc. Por eso es siempre deseable poder trabajar con una gramática en FNC en las aplicaciones que lo requieran. Existe un algoritmo que permite transformar una gramática libre de contexto a una en FNC, sin embargo la cantidad de reglas generadas al hacer la transformación depende del número de reglas en la gramática inicial así como de otras características. En este trabajo se analiza desde el punto de vista experimental y estadístico, la relación existente entre el número de reglas iniciales y el número de reglas que resultan luego de transformar una Gramática Libre de Contexto a la FNC. Esto permite planificar la cantidad de recursos computacionales necesarios en caso de tratar con gramáticas de alguna complejidad.It is well known that any context-free grammar can be transformed to the Chomsky normal form so that the languages generated by each one are equivalent. A grammar in Chomsky Normal Form (CNF, has some advantages: their derivation trees are binary, simplest rules and so on. So it is always desirable to work with a grammar in CNF in applications that require them. There is an algorithm that can transform a context-free grammar to one CNF grammar, however the number of rules generated after the transformation depends on the initial grammar and other circumstances. In this work we analyze from the experimental and statistical point of view the relationship between the number of initial rules and the number of resulting rules after transforming. This allows you to plan the amount of computational resources needed in case of dealing with grammars of some complexity.

The preverbal locative NP in Lexical Functional Grammar

African Journals Online (AJOL)

Data is drawn from some of the findings of the study I conducted on the locative inversion constructions in Botswana in 2003. I explore an information structure analysis of the findings. I also propose an analysis within Lexical Functional Grammar (Henceforth LFG), a non-transformational theory which considers languages ...

Subverting the grammar

Directory of Open Access Journals (Sweden)

Bárbara Amaral da Silva

2015-03-01

Full Text Available From the notion of parody, credibility and legitimacy, coming mainly from studies in discourse analysis, and ideas from the sociolinguistic we intend to develop a brief comparison between the Expositive Grammar – Advanced Course (46st ed.:1926 of Eduardo Carlos Pereira, who initially presents itself as a merely descriptive grammar, and the Portuguese Grammar by the Confused Method, written by Mendes Fradique (4st ed.: 1985. We observed that the first one claims to be “expositive” when it is cle­arly prescriptive. The work of Mendes Fradique uses humor and irony to parody pres­criptive grammars, criticizing the “good use”. In order to prove the above statement, we selected some of the concepts presented by those works, checking the position taken by each one. Among them is the very concept of grammar, language etc.

A Brief Survey of Grammar

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.

Teaching Grammar

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.

Grammar

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

SERIOUS GRAMMAR CAN BE FUN

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.

Effect of X-Word Grammar and Traditional Grammar Instruction on Grammatical Accuracy

Science.gov (United States)

Livingston, Sue; Toce, Andi; Casey, Toce; Montoya, Fernando; Hart, Bonny R.; O'Flaherty, Carmela

2018-01-01

This study first briefly describes an instructional approach to teaching grammar known as X-Word Grammar and then compares its effectiveness in assisting students in achieving grammatical accuracy with traditionally taught grammar. Two groups of L2 pre-college students were taught using curricula and practice procedures in two different grammar…

Creation Myths of Generative Grammar and the Mathematics of Syntactic Structures

Science.gov (United States)

Pullum, Geoffrey K.

Syntactic Structures (Chomsky [6]) is widely believed to have laid the foundations of a cognitive revolution in linguistic science, and to have presented (i) the first use in linguistics of powerful new ideas regarding grammars as generative systems, (ii) a proof that English was not a regular language, (iii) decisive syntactic arguments against context-free phrase structure grammar description, and (iv) a demonstration of how transformational rules could provide a formal solution to those problems. None of these things are true. This paper offers a retrospective analysis and evaluation.

Grammar

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

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.

Phonology without universal grammar.

Science.gov (United States)

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.

Graphing trillions of triangles.

Science.gov (United States)

Burkhardt, Paul

2017-07-01

The increasing size of Big Data is often heralded but how data are transformed and represented is also profoundly important to knowledge discovery, and this is exemplified in Big Graph analytics. Much attention has been placed on the scale of the input graph but the product of a graph algorithm can be many times larger than the input. This is true for many graph problems, such as listing all triangles in a graph. Enabling scalable graph exploration for Big Graphs requires new approaches to algorithms, architectures, and visual analytics. A brief tutorial is given to aid the argument for thoughtful representation of data in the context of graph analysis. Then a new algebraic method to reduce the arithmetic operations in counting and listing triangles in graphs is introduced. Additionally, a scalable triangle listing algorithm in the MapReduce model will be presented followed by a description of the experiments with that algorithm that led to the current largest and fastest triangle listing benchmarks to date. Finally, a method for identifying triangles in new visual graph exploration technologies is proposed.

k-visit Attribute Grammars

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...

The Lattice-Valued Turing Machines and the Lattice-Valued Type 0 Grammars

Directory of Open Access Journals (Sweden)

Juan Tang

2014-01-01

Full Text Available Purpose. The purpose of this paper is to study a class of the natural languages called the lattice-valued phrase structure languages, which can be generated by the lattice-valued type 0 grammars and recognized by the lattice-valued Turing machines. Design/Methodology/Approach. From the characteristic of natural language, this paper puts forward a new concept of the l-valued Turing machine. It can be used to characterize recognition, natural language processing, and dynamic characteristics. Findings. The mechanisms of both the generation of grammars for the lattice-valued type 0 grammar and the dynamic transformation of the lattice-valued Turing machines were given. Originality/Value. This paper gives a new approach to study a class of natural languages by using lattice-valued logic theory.

Explicit teaching of grammar and improvement in the grammar of ...

African Journals Online (AJOL)

Explicit teaching of grammar and improvement in the grammar of student writing. J Parkinson. Abstract. No Abstract. Full Text: EMAIL FREE FULL TEXT EMAIL FREE FULL TEXT · DOWNLOAD FULL TEXT DOWNLOAD FULL TEXT. Article Metrics. Metrics Loading ... Metrics powered by PLOS ALM

French grammar in context

CERN Document Server

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

Forest Grammar (Ⅱ)

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.

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...... observe that there is a simple linguistic characterization of the grammar ambiguity problem, and we show how to exploit this to conservatively approximate the problem based on local regular approximations and grammar unfoldings. As an application, we consider grammars that occur in RNA analysis...

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

TEACHING GRAMMAR IN CONTEXT: WHY AND HOW?

OpenAIRE

Noor Maulidiyah

2017-01-01

Grammar is an important component of English. Without grammar, it is not possible to communicate meaning successfully. Therefore, teachers and educators have to pay close attention to teaching grammar effectively. Based on the writer‘s experience in teaching grammar using the traditional way, many students still had difficulty in acquiring the grammar points. The grammar meetings were not effective, and the students did not thoroughly understand the grammar exercises. The students seemed bore...

On Construction Grammar

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.

Grammar-based Automatic 3D Model Reconstruction from Terrestrial Laser Scanning Data

Science.gov (United States)

Yu, Q.; Helmholz, P.; Belton, D.; West, G.

2014-04-01

The automatic reconstruction of 3D buildings has been an important research topic during the last years. In this paper, a novel method is proposed to automatically reconstruct the 3D building models from segmented data based on pre-defined formal grammar and rules. Such segmented data can be extracted e.g. from terrestrial or mobile laser scanning devices. Two steps are considered in detail. The first step is to transform the segmented data into 3D shapes, for instance using the DXF (Drawing Exchange Format) format which is a CAD data file format used for data interchange between AutoCAD and other program. Second, we develop a formal grammar to describe the building model structure and integrate the pre-defined grammars into the reconstruction process. Depending on the different segmented data, the selected grammar and rules are applied to drive the reconstruction process in an automatic manner. Compared with other existing approaches, our proposed method allows the model reconstruction directly from 3D shapes and takes the whole building into account.

How to Learn English Grammar?

Institute of Scientific and Technical Information of China (English)

肖琳燃

2017-01-01

Grammar is an aspect of language about which learners have different opinions. Some learners are very interested in ifnding out or learning grammar rules and doing lots of grammar exercises. Others hate grammar and think it is the most boring part of learning a new language. Whatever opinion you have, however, you cannot escape from grammar; it is in every sentence you read or write, speak or hear. Grammar is simply the word for the rules that people follow when they use a language. We need those rules in the same way as we need the rules in a game. If there are no rules, or if everybody follows their own rules, the game would soon break down. It's the same with language; without rules we would not be able to communicate with other people. So you cannot escape from grammar, but the key question here is: what is the best way to learn grammar? You can learn the rules of a game by simply playing the game. You will certainly make mistakes; you may even get hurt. Eventually, however, you will know how to play. Of course, the rules of a language are very much more complicated than the rules of any game, but in fact this is exactly how you learned your own language. Nobody taught you the rules of your mother tongue as you were growing up but now you never make a grammar mistake.

A Task-driven Grammar Refactoring Algorithm

Directory of Open Access Journals (Sweden)

Ivan Halupka

2012-01-01

Full Text Available This paper presents our proposal and the implementation of an algorithm for automated refactoring of context-free grammars. Rather than operating under some domain-specific task, in our approach refactoring is perfomed on the basis of a refactoring task defined by its user. The algorithm and the corresponding refactoring system are called mARTINICA. mARTINICA is able to refactor grammars of arbitrary size and structural complexity. However, the computation time needed to perform a refactoring task with the desired outcome is highly dependent on the size of the grammar. Until now, we have successfully performed refactoring tasks on small and medium-size grammars of Pascal-like languages and parts of the Algol-60 programming language grammar. This paper also briefly introduces the reader to processes occurring in grammar refactoring, a method for describing desired properties that a refactored grammar should fulfill, and there is a discussion of the overall significance of grammar refactoring.

Generation of components for software renovation factories from context-free grammars

NARCIS (Netherlands)

Brand, van den M.G.J.; Sellink, M.P.A.; Verhoef, C.

2000-01-01

We present an approach for the generation of components for a software renovation factory. These components are generated from a contex-free grammar definition that recognizes the code that has to be renovated. We generate analysis and transformation components that can be instantiated with a

Grammar Games: A Case for Instructionist Game Models to Enhance Grammar Awareness and Accuracy

Science.gov (United States)

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…

System dynamics and control with bond graph modeling

CERN Document Server

Kypuros, Javier

2013-01-01

Part I Dynamic System ModelingIntroduction to System DynamicsIntroductionSystem Decomposition and Model ComplexityMathematical Modeling of Dynamic SystemsAnalysis and Design of Dynamic SystemsControl of Dynamic SystemsDiagrams of Dynamic SystemsA Graph-Centered Approach to ModelingSummaryPracticeExercisesBasic Bond Graph ElementsIntroductionPower and Energy VariablesBasic 1-Port ElementsBasic 2-Ports ElementsJunction ElementsSimple Bond Graph ExamplesSummaryPracticeExercisesBond Graph Synthesis and Equation DerivationIntroductionGeneral GuidelinesMechanical TranslationMechanical RotationElectrical CircuitsHydraulic CircuitsMixed SystemsState Equation DerivationState-Space RepresentationsAlgebraic Loops and Derivative CausalitySummaryPracticeExercisesImpedance Bond GraphsIntroductionLaplace Transform of the State-Space EquationBasic 1-Port ImpedancesImpedance Bond Graph SynthesisJunctions, Transformers, and GyratorsEffort and Flow DividersSign ChangesTransfer Function DerivationAlternative Derivation of Transf...

Analysis of a planetary gear modelled with a contour graph considering the decision making complexity of game-tree structures

Directory of Open Access Journals (Sweden)

Deptuła Adam

2017-01-01

Full Text Available Analysis and synthesis of mechanisms is one of the fundamental tasks of engineering. Mechanisms can suffer from errors due to versatile reasons. Graph-based methods of analysis and synthesis of planetary gears constitute an alternative method for checking their correctness. Previous applications of the graph theory concerned modelling gears for dynamic analysis, kinematic analysis, synthesis, structural analysis, gearshift optimization and automatic design based on so-called graph grammars. Some tasks may be performed only with the methods resulting from the graph theory, e.g. enumeration of structural solutions. The contour plot method consists in distinguishing a series of consecutive rigid units of the analysed mechanism, forming a closed loop (so-called contour. At a later stage, it is possible to analyze the obtained contour graph as a directed graph of dependence. This work presents an example of the application of game-tree structures in describing the contour graph of a planetary gear. In addition, complex parametric tree structures are included.

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.

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.

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.

Teaching Grammar and Testing Grammar in the English Primary School: The Impact on Teachers and Their Teaching of the Grammar Element of the Statutory Test in Spelling, Punctuation and Grammar (SPaG)

Science.gov (United States)

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…

Regular extensions of some classes of grammars

NARCIS (Netherlands)

Nijholt, Antinus

Culik and Cohen introduced the class of LR-regular grammars, an extension of the LR(k) grammars. In this report we consider the analogous extension of the LL(k) grammers, called the LL-regular grammars. The relations of this class of grammars to other classes of grammars are shown. Every LL-regular

The Necessity of Grammar Teaching

Science.gov (United States)

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…

A communicative grammar of English

CERN Document Server

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

Structural priming, action planning, and grammar.

Science.gov (United States)

MacDonald, Maryellen C; Weiss, Daniel J

2017-01-01

Structural priming is poorly understood and cannot inform accounts of grammar for two reasons. First, those who view performance as grammar + processing will always be able to attribute psycholinguistic data to processing rather than grammar. Second, structural priming may be simply an example of hysteresis effects in general action planning. If so, then priming offers no special insight into grammar.

LexGram - a practical categorial grammar formalism -

OpenAIRE

Koenig, Esther

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.

TEACHING GRAMMAR IN CONTEXT: WHY AND HOW?

Directory of Open Access Journals (Sweden)

Noor Maulidiyah

2017-04-01

Then the paper explains the concept of context in teaching grammar and describes the reasons for teaching grammar in context. The last part of the paper demonstrates how grammar is taught in context. These sample lessons are taken from different sources based on experts when teaching grammar in context.Teaching grammar in context is more useful and can help the students to master English better.

French grammar for dummies

CERN Document Server

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

The History of Modern Chinese Grammar Studies

NARCIS (Netherlands)

Peverelli, P.J.

2015-01-01

This book discusses the way Chinese scholars developed a national grammar. Chinese didnt develop grammar until Chinas contact with Western grammar books in the 19th Century. The first indigenous grammar was published in 1889. It included some traditional notions, but mainly imitated European

Classification of group behaviors in social media via social behavior grammars

Science.gov (United States)

Levchuk, Georgiy; Getoor, Lise; Smith, Marc

2014-06-01

The increasing use of online collaboration and information sharing in the last decade has resulted in explosion of criminal and anti-social activities in online communities. Detection of such behaviors are of interest to commercial enterprises who want to guard themselves from cyber criminals, and the military intelligence analysts who desire to detect and counteract cyberwars waged by adversarial states and organizations. The most challenging behaviors to detect are those involving multiple individuals who share actions and roles in the hostile activities and individually appear benign. To detect these behaviors, the theories of group behaviors and interactions must be developed. In this paper we describe our exploration of the data from collaborative social platform to categorize the behaviors of multiple individuals. We applied graph matching algorithms to explore consistent social interactions. Our research led us to a conclusion that complex collaborative behaviors can be modeled and detected using a concept of group behavior grammars, in a manner analogous to natural language processing. These grammars capture constraints on how people take on roles in virtual environments, form groups, and interact over time, providing the building blocks for scalable and accurate multi-entity interaction analysis and social behavior hypothesis testing.

A Learning Algorithm for Multimodal Grammar Inference.

Science.gov (United States)

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.

Ambiguity Detection Methods for Context-Free Grammars

NARCIS (Netherlands)

H.J.S. Basten (Bas)

2007-01-01

textabstractThe 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

A Construction Grammar for the Classroom

Science.gov (United States)

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…

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.

ULTRA: Universal Grammar as a Universal Parser.

Science.gov (United States)

Medeiros, David P

2018-01-01

A central concern of generative grammar is the relationship between hierarchy and word order, traditionally understood as two dimensions of a single syntactic representation. A related concern is directionality in the grammar. Traditional approaches posit process-neutral grammars, embodying knowledge of language, put to use with infinite facility both for production and comprehension. This has crystallized in the view of Merge as the central property of syntax, perhaps its only novel feature. A growing number of approaches explore grammars with different directionalities, often with more direct connections to performance mechanisms. This paper describes a novel model of universal grammar as a one-directional, universal parser. Mismatch between word order and interpretation order is pervasive in comprehension; in the present model, word order is language-particular and interpretation order (i.e., hierarchy) is universal. These orders are not two dimensions of a unified abstract object (e.g., precedence and dominance in a single tree); rather, both are temporal sequences, and UG is an invariant real-time procedure (based on Knuth's stack-sorting algorithm) transforming word order into hierarchical order. This shift in perspective has several desirable consequences. It collapses linearization, displacement, and composition into a single performance process. The architecture provides a novel source of brackets (labeled unambiguously and without search), which are understood not as part-whole constituency relations, but as storage and retrieval routines in parsing. It also explains why neutral word order within single syntactic cycles avoids 213-like permutations. The model identifies cycles as extended projections of lexical heads, grounding the notion of phase. This is achieved with a universal processor, dispensing with parameters. The empirical focus is word order in noun phrases. This domain provides some of the clearest evidence for 213-avoidance as a cross

Snowball Throwing in Teaching Grammar

Directory of Open Access Journals (Sweden)

Yanuarti Apsari

2018-05-01

Full Text Available The aims of this study are to describe the implementation of snowball throwing in teaching grammar and to investigate the benefits of applying snowball throwing. The research was conducted at STKIP Siliwangi Bandung. This study applied qualitative research involving one class consisting of second semester students in English Department who were taking the subject of foundation of English Grammar. The data were obtained from classroom observation and students’ interview. The findings showed that there are seven stages in implementing snowball throwing in teaching grammar. The stages consist of preparing teaching material, forming group, re-explaining the material to the member of the group, formulating question, tossing the ball, answering questions and evaluating teaching and learning process. In addition, the findings also revealed that there are some benefits from applying snowball throwing in teaching grammar such as improving students’ comprehension in learning grammar, creating enjoyable learning atmosphere, increasing students’ vocabulary, developing students’ speaking skill, developing students’ cooperation skill and increasing students’ participation in the class.

Researches on Problems in College Students'Grammar Learning and Countermeasures%Researches on Problems in College Students' Grammar Learning and Countermeasures

Institute of Scientific and Technical Information of China (English)

廖芳

2016-01-01

Grammar is the guiding rules of language, and a good mastery of grammar is the basis of English learning. This paper starts from the problems in college students' current grammar learning and put forwards some strategies to improve their English grammar.

Graph based communication analysis for hardware/software codesign

DEFF Research Database (Denmark)

Knudsen, Peter Voigt; Madsen, Jan

1999-01-01

In this paper we present a coarse grain CDFG (Control/Data Flow Graph) model suitable for hardware/software partitioning of single processes and demonstrate how it is necessary to perform various transformations on the graph structure before partitioning in order to achieve a structure that allows...... for accurate estimation of communication overhead between nodes mapped to different processors. In particular, we demonstrate how various transformations of control structures can lead to a more accurate communication analysis and more efficient implementations. The purpose of the transformations is to obtain...

Grammar and Teaching ESL

Science.gov (United States)

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.

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"?

GRAMMAR IN LANGUAGE TEACHING

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.

HIGHER ORDER THINKING IN TEACHING GRAMMAR

Directory of Open Access Journals (Sweden)

Citra Dewi

2017-04-01

Full Text Available The aim of this paper discussed about how to enhance students’ higher order thinking that should be done by teacher in teaching grammar. Usually teaching grammar was boring and has the same way to learn like change the pattern of sentence into positive, negative and introgative while the students’ need more various way to develop their thinking. The outcome of students’ competence in grammar sometimes not sufficient enough when the students’ occured some test international standart like Test of English Foreign Language, International English Language Testing. Whereas in TOEFL test it needed higher order thinking answer, so teacher should develop students’ higher order thingking in daily teaching grammar in order to make the students’ enhance their thinking are higher. The method was used in this paper by using field study based on the experience of teaching grammar. It can be shown by students’ toefl score was less in stucture and written expression. The result of this paper was after teacher gave some treatments to enhance students’ higher order thinking in teaching grammar, the students’ toefl scores are sufficient enough as a part of stucture and written expression. It can concluded that it needed some strategies to enhancce students higher order thinking by teaching grammar it can make students’ higher toefl score. Teachers should be creative and inovative to teach the students’ started from giving the students’ question or test in teaching grammar.

Knowing Chinese character grammar.

Science.gov (United States)

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. Copyright © 2015 Elsevier B.V. All rights reserved.

Visual artificial grammar learning by rhesus macaques (Macaca mulatta): exploring the role of grammar complexity and sequence length.

Science.gov (United States)

Heimbauer, Lisa A; Conway, Christopher M; Christiansen, Morten H; Beran, Michael J; Owren, Michael J

2018-03-01

Humans and nonhuman primates can learn about the organization of stimuli in the environment using implicit sequential pattern learning capabilities. However, most previous artificial grammar learning studies with nonhuman primates have involved relatively simple grammars and short input sequences. The goal in the current experiments was to assess the learning capabilities of monkeys on an artificial grammar-learning task that was more complex than most others previously used with nonhumans. Three experiments were conducted using a joystick-based, symmetrical-response serial reaction time task in which two monkeys were exposed to grammar-generated sequences at sequence lengths of four in Experiment 1, six in Experiment 2, and eight in Experiment 3. Over time, the monkeys came to respond faster to the sequences generated from the artificial grammar compared to random versions. In a subsequent generalization phase, subjects generalized their knowledge to novel sequences, responding significantly faster to novel instances of sequences produced using the familiar grammar compared to those constructed using an unfamiliar grammar. These results reveal that rhesus monkeys can learn and generalize the statistical structure inherent in an artificial grammar that is as complex as some used with humans, for sequences up to eight items long. These findings are discussed in relation to whether or not rhesus macaques and other primate species possess implicit sequence learning abilities that are similar to those that humans draw upon to learn natural language grammar.

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...

Grammar Teaching in Chinese Tertiary Education

Institute of Scientific and Technical Information of China (English)

LAN Hui-hui

2016-01-01

Grammar teaching, as one essential aspect of English language teaching (ELT), has been and continues to be an area of some controversy and debates, which entails the emergency of diverse classroom practices for language teachers:Focus on Form or Focus on FormS. Connected with the specific context of grammar teaching in Chinese higher education, this paper tends to re-consider the place of grammar teaching in the classroom, and come up with some feasible approaches to instructing grammar so as to make appropriate connections between grammatical forms and the meanings.

Reframing the English Grammar Schools Debate

Science.gov (United States)

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…

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.

Classical dynamics on graphs

International Nuclear Information System (INIS)

Barra, F.; Gaspard, P.

2001-01-01

We consider the classical evolution of a particle on a graph by using a time-continuous Frobenius-Perron operator that generalizes previous propositions. In this way, the relaxation rates as well as the chaotic properties can be defined for the time-continuous classical dynamics on graphs. These properties are given as the zeros of some periodic-orbit zeta functions. We consider in detail the case of infinite periodic graphs where the particle undergoes a diffusion process. The infinite spatial extension is taken into account by Fourier transforms that decompose the observables and probability densities into sectors corresponding to different values of the wave number. The hydrodynamic modes of diffusion are studied by an eigenvalue problem of a Frobenius-Perron operator corresponding to a given sector. The diffusion coefficient is obtained from the hydrodynamic modes of diffusion and has the Green-Kubo form. Moreover, we study finite but large open graphs that converge to the infinite periodic graph when their size goes to infinity. The lifetime of the particle on the open graph is shown to correspond to the lifetime of a system that undergoes a diffusion process before it escapes

Implicit Learning of Recursive Context-Free Grammars

Science.gov (United States)

Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

2012-01-01

Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning. PMID:23094021

Implicit learning of recursive context-free grammars.

Science.gov (United States)

Rohrmeier, Martin; Fu, Qiufang; Dienes, Zoltan

2012-01-01

Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams) between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

Implicit learning of recursive context-free grammars.

Directory of Open Access Journals (Sweden)

Martin Rohrmeier

Full Text Available Context-free grammars are fundamental for the description of linguistic syntax. However, most artificial grammar learning experiments have explored learning of simpler finite-state grammars, while studies exploring context-free grammars have not assessed awareness and implicitness. This paper explores the implicit learning of context-free grammars employing features of hierarchical organization, recursive embedding and long-distance dependencies. The grammars also featured the distinction between left- and right-branching structures, as well as between centre- and tail-embedding, both distinctions found in natural languages. People acquired unconscious knowledge of relations between grammatical classes even for dependencies over long distances, in ways that went beyond learning simpler relations (e.g. n-grams between individual words. The structural distinctions drawn from linguistics also proved important as performance was greater for tail-embedding than centre-embedding structures. The results suggest the plausibility of implicit learning of complex context-free structures, which model some features of natural languages. They support the relevance of artificial grammar learning for probing mechanisms of language learning and challenge existing theories and computational models of implicit learning.

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.

A Survey of Grammar Instruction from Scholastic Perspective

Science.gov (United States)

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…

Functional discourse grammar: pragmatic aspects

NARCIS (Netherlands)

Hannay, M.; Hengeveld, K.; Brisard, F.; Östman, J.O.; Verschueren, J.

2009-01-01

This chapter introduces Functional Discourse Grammar, focusing on the way in which this model is capable of accounting for the grammatical encoding of pragmatic distinctions and for the typological variation found in this area of grammar.

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.

English grammar a university course

CERN Document Server

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

What English Teachers Need to Know about Grammar.

Science.gov (United States)

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)

Ch(k) grammars: A characterization of LL(k) languages

NARCIS (Netherlands)

Becvar, J.; Nijholt, Antinus; Soisalon-Soininen, E.

In this paper we introduce the class of so called Ch(k) grammars [pronounced "chain k grammars"]. This class of grammars is properly contained in the class of LR(k) grammars and it properly contains the LL(k) grammars. However, the family of Ch[k) languages coincides with the family of LL(k)

Chargaff's "Grammar of Biology": New Fractal-like Rules

OpenAIRE

Yamagishi, Michel Eduardo Beleza; Herai, Roberto H.

2011-01-01

Chargaff once said that "I saw before me in dark contours the beginning of a grammar of Biology". In linguistics, "grammar" is the set of natural language rules, but we do not know for sure what Chargaff meant by "grammar" of Biology. Nevertheless, assuming the metaphor, Chargaff himself started a "grammar of Biology" discovering the so called Chargaff's rules. In this work, we further develop his grammar. Using new concepts, we were able to discovery new genomic rules that seem to be invaria...

English Grammar Workbook For Dummies

CERN Document Server

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

Practising French grammar a workbook

CERN Document Server

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

Teachers'Perceptions of Teaching Grammar in Young Learners'Classroom%Teachers' Perceptions of Teaching Grammar in Young Learners' Classroom

Institute of Scientific and Technical Information of China (English)

余媛

2016-01-01

The present essay studies the role of grammar in young learners' classroom, perceived by the English teachers in China. The study gives a detailed description of what the role of grammar is like in young learners' classroom, by interviewing primary school teachers both from a city in a developed coastal city and a less developed city in central China. It highlights the differences in the perceptions of teachers on the prominence of grammar in their classes. These differences may indicate regional disparity and potential factors for teachers' teaching approaches to grammar instruction.

CLIMB grammars: three projects using metagrammar engineering

NARCIS (Netherlands)

Fokkens, A.S.; Avgustinova, T.; Zhang, Yi

2012-01-01

This paper introduces the CLIMB (Comparative Libraries of Implementations with Matrix Basis) methodology and grammars. The basic idea behind CLIMB is to use code generation as a general methodology for grammar development in order to create a more systematic approach to grammar development. The

EIT Imaging Regularization Based on Spectral Graph Wavelets.

Science.gov (United States)

Gong, Bo; Schullcke, Benjamin; Krueger-Ziolek, Sabine; Vauhkonen, Marko; Wolf, Gerhard; Mueller-Lisse, Ullrich; Moeller, Knut

2017-09-01

The objective of electrical impedance tomographic reconstruction is to identify the distribution of tissue conductivity from electrical boundary conditions. This is an ill-posed inverse problem usually solved under the finite-element method framework. In previous studies, standard sparse regularization was used for difference electrical impedance tomography to achieve a sparse solution. However, regarding elementwise sparsity, standard sparse regularization interferes with the smoothness of conductivity distribution between neighboring elements and is sensitive to noise. As an effect, the reconstructed images are spiky and depict a lack of smoothness. Such unexpected artifacts are not realistic and may lead to misinterpretation in clinical applications. To eliminate such artifacts, we present a novel sparse regularization method that uses spectral graph wavelet transforms. Single-scale or multiscale graph wavelet transforms are employed to introduce local smoothness on different scales into the reconstructed images. The proposed approach relies on viewing finite-element meshes as undirected graphs and applying wavelet transforms derived from spectral graph theory. Reconstruction results from simulations, a phantom experiment, and patient data suggest that our algorithm is more robust to noise and produces more reliable images.

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...

Grammar in Context using Comprehended Input

Directory of Open Access Journals (Sweden)

Mariam Mohamed Nor

2014-03-01

Full Text Available There have been so many ongoing disputes on different approaches to teaching grammar. This study aims to evaluate the effectiveness of teaching grammar using Gass comprehended Input technique (GCI (1997 (implicit and to explore the undergraduates’ perception on the GCI technique. The respondents consisted of 30 undergraduates’ who are currently pursuing their Bachelor of English. Using the qualitative method, the research instrument was a set of 23- item interview and content analysis of the students’ written work. Results showed that the teaching of grammar using explicit instructions was more preferred than implicit instruction for complex components in grammatical rules. However, implicit instruction is equally effective regardless of the proficiency levels to enable pedagogy to be executed. It is also noted that there is lots of room for improvement, since the undergraduates have a weak grasp of the basic tense aspect of English grammar. Therefore, the Malaysian Ministry of Education should consider having grammar formally taught in isolation as what was practised previously.

Introducing English grammar

CERN Document Server

Borjars, Kersti

2013-01-01

Answering key questions such as 'Why study grammar?' and 'What is standard English?', Introducing English Grammar guides readers through the practical analysis of the syntax of English sentences. With all special terms carefully explained as they are introduced, the book is written for readers with no previous experience of grammatical analysis. It is ideal for all those beginning their study of linguistics, English language or speech pathology, as well as students with primarily literary interests who need to cover the basics of linguistic analysis. The approach taken is in line with current research in grammar, a particular advantage for students who may go on to study syntax in more depth. All the examples and exercises use real language taken from newspaper articles, non-standard dialects and include excerpts from studies of patients with language difficulties. Students are encouraged to think about the terminology as a tool kit for studying language and to test what can and cannot be described using thes...

The Grammar Movie Project

Science.gov (United States)

Kreutner, Edith

2015-01-01

In this case study, I will show how directing a movie on grammar can help students improve their oral skills as well as their language competency, team working and planning skills, and also teach them about learning itself. I will present an innovative teaching project that uses the medium of film to get students engaged with grammar and that aims…

Drama Grammar: Towards a Performative Postmethod Pedagogy

Science.gov (United States)

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…

Conceptualisations of "Grammar Teaching": L1 English Teachers' Beliefs about Teaching Grammar for Writing

Science.gov (United States)

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…

Missionary Pragmalinguistics: Father Diego Luis de Sanvitores’ grammar within the tradition of Philippine grammars

NARCIS (Netherlands)

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

Does Teaching Grammar Really Hinder Students＇ Speaking Abilities？

Institute of Scientific and Technical Information of China (English)

Kazumi Araki

2015-01-01

In the history of formal English education in Japan, grammar used to be the mainstream. In the secondary education system, teachers used to spend many hours teaching grammar to the students. However, it has been replaced by the aural/oral method of teaching a foreign language. There was even a remark that teaching grammar hinders students from communicating fluently. Literally, there was a time when grammar was set aside in formal English education. However, the author noticed that in grammar classes, the students speak English more loudly and confidently without much hesitation than in other types of English classes. One of the reasons is that they are not worried about the contents of the speeches. They are simply concentrating on the forms. They are not afraid of making major mistakes, and the errors they make are minor so they do not feel embarrassed in public. The atmosphere of the grammar classes is very positive and the students enjoy speaking English. In this paper, the author shows how grammar classes can contribute to the acquisition of the students＇ speaking abilities and manners. ＂Learning grammar was a precious experience＂, one student reported after the course.

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.

Recent Developments in Transformational Grammar.

Science.gov (United States)

Jacobs, Roderick A.

1969-01-01

In the years following the appearance of Noam Chomsky's book, "Syntactic Structures," in 1957, transformational grammarians modified and improved his initial model of language. The notion of a deep structure of meaning underlying a sentence's surface structure was revised to embody elements representing negation, command, and interrogation, and to…

Abductive Logic Grammars

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...

The equivalence problem for LL- and LR-regular grammars

NARCIS (Netherlands)

Nijholt, Antinus

1982-01-01

The equivalence problem for context-free grammars is "given two arbitrary grammars, do they generate the same language?" Since this is undecidable in general, attention has been restricted to decidable subclasses of the context-free grammars. For example, the classes of LL(k) grammars and real-time

An 00 visual language definition approach supporting multiple views

OpenAIRE

Akehurst, David H.; I.E.E.E. Computer Society

2000-01-01

The formal approach to visual language definition is to use graph grammars and/or graph transformation techniques. These techniques focus on specifying the syntax and manipulation rules of the concrete representation. This paper presents a constraint and object-oriented approach to defining visual languages that uses UML and OCL as a definition language. Visual language definitions specify a mapping between concrete and abstract models of possible visual sentences, which carl subsequently be ...

Performance Grammars

National Research Council Canada - National Science Library

Robinson, Jane J

1974-01-01

.... The theory of systematic variation affords better direction for gathering data on rule-governed language use and a means for representing the results in formal grammars that predict speech behavior...

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.

Strategic Port Graph Rewriting: An Interactive Modelling and Analysis Framework

Directory of Open Access Journals (Sweden)

Maribel Fernández

2014-07-01

Full Text Available We present strategic portgraph rewriting as a basis for the implementation of visual modelling and analysis tools. The goal is to facilitate the specification, analysis and simulation of complex systems, using port graphs. A system is represented by an initial graph and a collection of graph rewriting rules, together with a user-defined strategy to control the application of rules. The strategy language includes constructs to deal with graph traversal and management of rewriting positions in the graph. We give a small-step operational semantics for the language, and describe its implementation in the graph transformation and visualisation tool PORGY.

RAISING YOUNG LEARNERS‟ AWARENESS OF GRAMMAR THROUGH CREATIVE LANGUAGE ACTIVITIES

Directory of Open Access Journals (Sweden)

C. Murni Wahyanti

2017-04-01

Full Text Available Current developments in foreign language teaching have shown the need to reconsider the role of grammar. It is argued that grammar understanding can promote more precise use of the foreign language. This belief has led to an increased interest in grammar teaching, including grammar teaching for young learners. In teaching English to young learners, activities that can promote grammar awareness are needed. The activities should be presented in context to make sure that the meaning is clear. The activities should also be creatively designed in order to challenge students‘ motivation and involvement. Grammar activities presented creatively in meaningful contexts are useful for noticing the language patterns. This paper focuses on the changing status of grammar, the importance of grammar in the young learner classroom, and how to raise grammar awareness through creative language activities. It also reports the result of a small-scale study on implementing grammarawareness activities for teaching English to Elementary School students.

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.

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.

Teachers' Perceptions about Grammar Teaching

Science.gov (United States)

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…

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.

Linearly Ordered Attribute Grammar Scheduling Using SAT-Solving

NARCIS (Netherlands)

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

Object grammars and random generation

Directory of Open Access Journals (Sweden)

I. Dutour

1998-12-01

Full Text Available This paper presents a new systematic approach for the uniform random generation of combinatorial objects. The method is based on the notion of object grammars which give recursive descriptions of objects and generalize context-freegrammars. The application of particular valuations to these grammars leads to enumeration and random generation of objects according to non algebraic parameters.

XPath Node Selection over Grammar-Compressed Trees

Directory of Open Access Journals (Sweden)

Sebastian Maneth

2013-11-01

Full Text Available XML document markup is highly repetitive and therefore well compressible using grammar-based compression. Downward, navigational XPath can be executed over grammar-compressed trees in PTIME: the query is translated into an automaton which is executed in one pass over the grammar. This result is well-known and has been mentioned before. Here we present precise bounds on the time complexity of this problem, in terms of big-O notation. For a given grammar and XPath query, we consider three different tasks: (1 to count the number of nodes selected by the query, (2 to materialize the pre-order numbers of the selected nodes, and (3 to serialize the subtrees at the selected nodes.

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....

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.

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.

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.

XML Graphs in Program Analysis

DEFF Research Database (Denmark)

Møller, Anders; Schwartzbach, Michael Ignatieff

2007-01-01

XML graphs have shown to be a simple and effective formalism for representing sets of XML documents in program analysis. It has evolved through a six year period with variants tailored for a range of applications. We present a unified definition, outline the key properties including validation...... of XML graphs against different XML schema languages, and provide a software package that enables others to make use of these ideas. We also survey four very different applications: XML in Java, Java Servlets and JSP, transformations between XML and non-XML data, and XSLT....

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.

Unsupervised grammar induction of clinical report sublanguage.

Science.gov (United States)

Kate, Rohit J

2012-10-05

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. 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. 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.

ncRNA consensus secondary structure derivation using grammar strings.

Science.gov (United States)

Achawanantakun, Rujira; Sun, Yanni; Takyar, Seyedeh Shohreh

2011-04-01

Many noncoding RNAs (ncRNAs) function through both their sequences and secondary structures. Thus, secondary structure derivation is an important issue in today's RNA research. The state-of-the-art structure annotation tools are based on comparative analysis, which derives consensus structure of homologous ncRNAs. Despite promising results from existing ncRNA aligning and consensus structure derivation tools, there is a need for more efficient and accurate ncRNA secondary structure modeling and alignment methods. In this work, we introduce a consensus structure derivation approach based on grammar string, a novel ncRNA secondary structure representation that encodes an ncRNA's sequence and secondary structure in the parameter space of a context-free grammar (CFG) and a full RNA grammar including pseudoknots. Being a string defined on a special alphabet constructed from a grammar, grammar string converts ncRNA alignment into sequence alignment. We derive consensus secondary structures from hundreds of ncRNA families from BraliBase 2.1 and 25 families containing pseudoknots using grammar string alignment. Our experiments have shown that grammar string-based structure derivation competes favorably in consensus structure quality with Murlet and RNASampler. Source code and experimental data are available at http://www.cse.msu.edu/~yannisun/grammar-string.

Fast Parsing using Pruning and Grammar Specialization

OpenAIRE

Rayner, Manny; Carter, David

1996-01-01

We show how a general grammar may be automatically adapted for fast parsing of utterances from a specific domain by means of constituent pruning and grammar specialization based on explanation-based learning. These methods together give an order of magnitude increase in speed, and the coverage loss entailed by grammar specialization is reduced to approximately half that reported in previous work. Experiments described here suggest that the loss of coverage has been reduced to the point where ...

A comprehensive French grammar

CERN Document Server

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

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.

The structure of modern standard French a student grammar

CERN Document Server

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.

Implementing GraphQL as a Query Language for Deductive Databases in SWI-Prolog Using DCGs, Quasi Quotations, and Dicts

Directory of Open Access Journals (Sweden)

Falco Nogatz

2017-01-01

Full Text Available The methods to access large relational databases in a distributed system are well established: the relational query language SQL often serves as a language for data access and manipulation, and in addition public interfaces are exposed using communication protocols like REST. Similarly to REST, GraphQL is the query protocol of an application layer developed by Facebook. It provides a unified interface between the client and the server for data fetching and manipulation. Using GraphQL's type system, it is possible to specify data handling of various sources and to combine, e.g., relational with NoSQL databases. In contrast to REST, GraphQL provides a single API endpoint and supports flexible queries over linked data. GraphQL can also be used as an interface for deductive databases. In this paper, we give an introduction of GraphQL and a comparison to REST. Using language features recently added to SWI-Prolog 7, we have developed the Prolog library GraphQL.pl, which implements the GraphQL type system and query syntax as a domain-specific language with the help of definite clause grammars (DCG, quasi quotations, and dicts. Using our library, the type system created for a deductive database can be validated, while the query system provides a unified interface for data access and introspection.

English Grammar and Thai University Students: An Insurmountable Linguistic Battle?

Science.gov (United States)

Saengboon, Saksit

2017-01-01

This study aimed at investigating English grammar knowledge of a group of Thai university students. The three main research questions revolved around their knowledge of English grammar, the kinds of difficulties they had encountered in using the grammar as well as their perceptions of the roles of grammar in using English. The participants were…

Analyses of Common Grammar Mistakes in High-school English

Institute of Scientific and Technical Information of China (English)

Yang Liou

2017-01-01

English has an important position in the basic education stage as a language subject. English teaching requires students to have the abilities of listening, speaking, reading and writing in high school. If students want to learn these skills well, they should not only memorize vocabularies, but also master grammar knowledge. This paper illustrates the importance of English grammar for learning English and lists the common grammar mistakes. It also introduces some skills of learning English grammar.

An Attempt to Employ Diagrammatic Illustrations in Teaching English Grammar: Pictorial English Grammar

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.

Using a Linguistic Theory of Humour in Teaching English Grammar

Science.gov (United States)

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…

French grammar and usage

CERN Document Server

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

English Grammar For Dummies

CERN Document Server

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.  

Essential grammar for today's writers, students, and teachers

CERN Document Server

Sullivan, Nancy

2014-01-01

This innovative grammar text is an ideal resource for writers, language students, and current and future classroom teachers who need an accessible "refresher" in a step-by-step guide to essential grammar. Rather than becoming mired in overly detailed linguistic definitions, Nancy Sullivan helps writers and students understand and apply grammatical concepts and develop the skills they need to enhance their own writing. Along with engaging discussions of both contemporary and traditional terminology, Sullivan's text provides clear explanations of the basics of English grammar and a highly practical, hands-on approach to mastering the use of language. Complementing the focus on constructing excellent sentences, every example and exercise set is contextually grounded in language themes. Teachers, students, and writers will appreciate the streamlined, easy-to-understand coverage of essential grammar, as well as the affordable price. This is an ideal textbook for future teachers enrolled in an upper-level grammar c...

A survey and comparison of transformation tools based on the transformation tool contest

NARCIS (Netherlands)

Jakumeit, E.; Van Gorp, P.; Buchwald, S.; Rose, L.; Wagelaar, D.; Dan, L.; Hegedüs, Á; Hermannsdörfer, M.; Horn, T.; Kalnina, E.; Krause, C.; Lano, K.; Lepper, M.; Rensink, Arend; Rose, L.M.; Wätzoldt, S.; Mazanek, S.

Model transformation is one of the key tasks in model-driven engineering and relies on the efficient matching and modification of graph-based data structures; its sibling graph rewriting has been used to successfully model problems in a variety of domains. Over the last years, a wide range of graph

Simplifying Scalable Graph Processing with a Domain-Specific Language

KAUST Repository

Hong, Sungpack; Salihoglu, Semih; Widom, Jennifer; Olukotun, Kunle

2014-01-01

Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel's programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.

Simplifying Scalable Graph Processing with a Domain-Specific Language

KAUST Repository

Hong, Sungpack

2014-01-01

Large-scale graph processing, with its massive data sets, requires distributed processing. However, conventional frameworks for distributed graph processing, such as Pregel, use non-traditional programming models that are well-suited for parallelism and scalability but inconvenient for implementing non-trivial graph algorithms. In this paper, we use Green-Marl, a Domain-Specific Language for graph analysis, to intuitively describe graph algorithms and extend its compiler to generate equivalent Pregel implementations. Using the semantic information captured by Green-Marl, the compiler applies a set of transformation rules that convert imperative graph algorithms into Pregel\\'s programming model. Our experiments show that the Pregel programs generated by the Green-Marl compiler perform similarly to manually coded Pregel implementations of the same algorithms. The compiler is even able to generate a Pregel implementation of a complicated graph algorithm for which a manual Pregel implementation is very challenging.

A Qualitative Approach to Sketch the Graph of a Function.

Science.gov (United States)

Alson, Pedro

1992-01-01

Presents a qualitative and global method of graphing functions that involves transformations of the graph of a known function in the cartesian coordinate system referred to as graphic operators. Explains how the method has been taught to students and some comments about the results obtained. (MDH)

Belief propagation and loop series on planar graphs

International Nuclear Information System (INIS)

Chertkov, Michael; Teodorescu, Razvan; Chernyak, Vladimir Y

2008-01-01

We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of Chertkov and Chernyak (2006 Phys. Rev. E 73 065102(R) [cond-mat/0601487]; 2006 J. Stat. Mech. P06009 [cond-mat/0603189]) is used to evaluate the resulting series expansion for the partition function. We show that, for planar graphs, truncating the series at single-connected loops reduces, via a map reminiscent of the Fisher transformation (Fisher 1961 Phys. Rev. 124 1664), to evaluating the partition function of the dimer-matching model on an auxiliary planar graph. Thus, the truncated series can be easily re-summed, using the Pfaffian formula of Kasteleyn (1961 Physics 27 1209). This allows us to identify a big class of computationally tractable planar models reducible to a dimer model via the Belief Propagation (gauge) transformation. The Pfaffian representation can also be extended to the full Loop Series, in which case the expansion becomes a sum of Pfaffian contributions, each associated with dimer matchings on an extension to a subgraph of the original graph. Algorithmic consequences of the Pfaffian representation, as well as relations to quantum and non-planar models, are discussed

Grammar as a Programming Language. Artificial Intelligence Memo 391.

Science.gov (United States)

Rowe, Neil

Student projects that involve writing generative grammars in the computer language, "LOGO," are described in this paper, which presents a grammar-running control structure that allows students to modify and improve the grammar interpreter itself while learning how a simple kind of computer parser works. Included are procedures for…

The equivalence problem for LL- and LR-regular grammars

NARCIS (Netherlands)

Nijholt, Antinus; Gecsec, F.

It will be shown that the equivalence problem for LL-regular grammars is decidable. Apart from extending the known result for LL(k) grammar equivalence to LLregular grammar equivalence, we obtain an alternative proof of the decidability of LL(k) equivalence. The equivalence prob]em for LL-regular

Shape Grammars for Innovative Hybrid Typological Design

DEFF Research Database (Denmark)

Al-kazzaz, Dhuha; Bridges, Alan; Chase, Scott Curland

2010-01-01

This paper describes a new methodology of deriving innovative hybrid designs using shape grammars of heterogeneous designs. The method is detailed within three phases of shape grammars: analysis, synthesis and evaluation. In the analysis phase, the research suggests that original rules of each...... design component are grouped in subclass rule sets to facilitate rule choices. Additionally, adding new hybrid rules to original rules expands the options available to the grammar user. In the synthesis phase, the research adopts state labels and markers to drive the design generation. The former...... is implemented with a user guide grammar to ensure hybridity in the generated design, while the latter aims to ensure feasible designs. Lastly evaluation criteria are added to measure the degree of innovation of the hybrid designs. This paper describes the derivation of hybrid minaret designs from a corpus...

Left-forbidding cooperating distributed grammar systems

Czech Academy of Sciences Publication Activity Database

Goldefus, F.; Masopust, Tomáš; Meduna, A.

2010-01-01

Roč. 411, 40-42 (2010), s. 3661-3667 ISSN 0304-3975 Institutional research plan: CEZ:AV0Z10190503 Keywords : cooperating distributed grammar system * cooperating derivation mode * left-forbidding grammar * generative power * descriptional complexity Subject RIV: BA - General Mathematics Impact factor: 0.838, year: 2010 http://www.sciencedirect.com/science/article/pii/S0304397510003440

Studying Grammar in the Technological Age

Science.gov (United States)

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…

Propelling Students into Active Grammar Participation

Science.gov (United States)

Jurhill, Dennis A.

2011-01-01

"O! this learning, what a thing it is." -W. Shakespeare, "The Taming of the Shrew." The aim of this action research was to find out if active grammar involvement amongst students might lead to better results. My approach was to activate my students during grammar instruction by using cooperative learning: that is a form of…

Teaching english grammar through interactive methods

OpenAIRE

Aminova N.

2016-01-01

The article is devoted for the effective ways of teaching grammar. Actuality of the theme is justified as it sets conditions for revealing high progress in teaching a foreign language and for developing effective methods which can be helpful for foreign language teachers. Different progressive methods of teaching English grammar are given in this paper as well.

High-level methodologies for grammar engineering, introduction to the special issue

Directory of Open Access Journals (Sweden)

Denys Duchier

2015-06-01

Full Text Available Grammar Engineering is the task of designing and implementing linguistically motivated electronic descriptions of natural language (so-called grammars. These grammars are expressed within well-defined theoretical frameworks, and offer a fine-grained description of natural language. While grammars were first used to describe syntax, that is to say, the relations between constituents in a sentence, they often go beyond syntax and include semantic information. Grammar engineering provides precise descriptions which can be used for natural language understanding and generation, making these valuable resources for various natural language applications, including textual entailment, dialogue systems, or machine translation. The first attempts at designing large-scale resource grammars were costly because of the complexity of the task (Erbach et al. 1990 and of the number of persons that were needed (see e.g. Doran et al. 1997. Advances in the field have led to the development of environments for semi-automatic grammar engineering, borrowing ideas from compilation (grammar engineering is compared with software development and machine learning. This special issue reports on new trends in the field, where grammar engineering benefits from elaborate high-level methodologies and techniques, dealing with various issues (both theoretical and practical.

The contribution of phonological short-term memory to artificial grammar learning.

Science.gov (United States)

Andrade, Jackie; Baddeley, Alan

2011-05-01

Three experiments investigated the contribution of phonological short-term memory (STM) to grammar learning by manipulating rehearsal during study of an auditory artificial grammar made up from a vocabulary of spoken Mandarin syllables. Experiment 1 showed that concurrent, irrelevant articulation impaired grammar learning compared with a nonverbal control task. Experiment 2 replicated and extended this finding, showing that repeating the grammatical strings at study improved grammar learning compared with suppressing rehearsal or remaining silent during learning. Experiment 3 found no effects of rehearsal on grammar learning once participants had learned the component syllables. The findings suggest that phonological STM aids artificial grammar learning via effects on vocabulary learning.

Evolving stochastic context-free grammars for RNA secondary structure prediction

DEFF Research Database (Denmark)

Anderson, James WJ; Tataru, Paula Cristina; Stains, Joe

2012-01-01

Background Stochastic Context-Free Grammars (SCFGs) were applied successfully to RNA secondary structure prediction in the early 90s, and used in combination with comparative methods in the late 90s. The set of SCFGs potentially useful for RNA secondary structure prediction is very large, but a few...... to structure prediction as has been previously suggested. Results These search techniques were applied to predict RNA secondary structure on a maximal data set and revealed new and interesting grammars, though none are dramatically better than classic grammars. In general, results showed that many grammars...... with quite different structure could have very similar predictive ability. Many ambiguous grammars were found which were at least as effective as the best current unambiguous grammars. Conclusions Overall the method of evolving SCFGs for RNA secondary structure prediction proved effective in finding many...

Understanding the Complex Processes in Developing Student Teachers' Knowledge about Grammar

Science.gov (United States)

Svalberg, Agneta M.-L.

2015-01-01

This article takes the view that grammar is driven by user choices and is therefore complex and dynamic. This has implications for the teaching of grammar in language teacher education and how teachers' cognitions about grammar, and hence their own grammar teaching, might change. In this small, interpretative study, the participants--students on…

Towards a Pedagogy of Grammar Instruction

Science.gov (United States)

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…

Grammar and Usage: History and Myth

Science.gov (United States)

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…

An Exploration of the Relationship between Vietnamese Students' Knowledge of L1 Grammar and Their English Grammar Proficiency

Science.gov (United States)

Tran, Tammie M.

2010-01-01

The problem. This research study explores an important issue in the field of TESOL (Teaching English to Speakers of Other Languages) and second language acquisition (SLA). Its purpose is to examine the relationship between Vietnamese students' L1 grammar knowledge and their English grammar proficiency. Furthermore, it investigates the extent to…

An Overview of the Nigel Text Generation Grammar.

Science.gov (United States)

1983-04-01

34 76b, Hudson 76, Halliday 81, de Joia 80, Fawcett 80].3 1.2. Design Goals for the Grammar Three kinds of goals have guided the work of creating Nigel...Davey 79] Davey, A., Discourse Production, Edinburgh University Press, Edinburgh, 1979. [ de Joia 80] de Joia , A., and A. Stenton, Terms in Systemic...1 1.1. The Text Generation Task as a Stimulus for Grammar Design .........................1I -1.2. Design Goals for the Grammar

A constraint-based bottom-up counterpart to definite clause grammars

DEFF Research Database (Denmark)

Christiansen, Henning

2004-01-01

A new grammar formalism, CHR Grammars (CHRG), is proposed that provides a constraint-solving approach to language analysis, built on top of the programming language of Constraint Handling Rules in the same way as Definite Clause Grammars (DCG) on Prolog. CHRG works bottom-up and adds the following......, integrity constraints, operators a la assumption grammars, and to incorporate other constraint solvers. (iv)~Context-sensitive rules that apply for disambiguation, coordination in natural language and tagger-like rules....

Grammar-Based Specification and Parsing of Binary File Formats

Directory of Open Access Journals (Sweden)

William Underwood

2012-03-01

Full Text Available The capability to validate and view or play binary file formats, as well as to convert binary file formats to standard or current file formats, is critically important to the preservation of digital data and records. This paper describes the extension of context-free grammars from strings to binary files. Binary files are arrays of data types, such as long and short integers, floating-point numbers and pointers, as well as characters. The concept of an attribute grammar is extended to these context-free array grammars. This attribute grammar has been used to define a number of chunk-based and directory-based binary file formats. A parser generator has been used with some of these grammars to generate syntax checkers (recognizers for validating binary file formats. Among the potential benefits of an attribute grammar-based approach to specification and parsing of binary file formats is that attribute grammars not only support format validation, but support generation of error messages during validation of format, validation of semantic constraints, attribute value extraction (characterization, generation of viewers or players for file formats, and conversion to current or standard file formats. The significance of these results is that with these extensions to core computer science concepts, traditional parser/compiler technologies can potentially be used as a part of a general, cost effective curation strategy for binary file formats.

Measuring strategic control in artificial grammar learning.

Science.gov (United States)

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. Copyright © 2011 Elsevier Inc. All rights reserved.

Research into Practice: Grammar Learning and Teaching

Science.gov (United States)

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).…

How Should English Grammar Be Taught in Middle Schools By Wang Shikun

Institute of Scientific and Technical Information of China (English)

王仕坤

2014-01-01

This paper mainly deals with the idea that whether grammar teaching should be weakened or not ,the importance of grammar teaching,the present situation of grammar and some suggestions on how to teach grammar ,aiming at the improvement of English teaching and learning.

A brief analysis of the necessity of grammar teaching in CLT

Institute of Scientific and Technical Information of China (English)

胡晓; 王榛

2017-01-01

Grammar teaching is the important component of communicative language teaching, and also the teaching content of communicative approach. This study is going to analyze the status of English grammar learning, the theoretical basis of CLT, and some difficulties with regard to grammar education in China, while discussing teachers might try to adjust the current grammar approach in communicative English teaching.

A robust approach towards unknown transformation, regional adjacency graphs, multigraph matching, segmentation video frames from unnamed aerial vehicles (UAV)

Science.gov (United States)

Gohatre, Umakant Bhaskar; Patil, Venkat P.

2018-04-01

In computer vision application, the multiple object detection and tracking, in real-time operation is one of the important research field, that have gained a lot of attentions, in last few years for finding non stationary entities in the field of image sequence. The detection of object is advance towards following the moving object in video and then representation of object is step to track. The multiple object recognition proof is one of the testing assignment from detection multiple objects from video sequence. The picture enrollment has been for quite some time utilized as a reason for the location the detection of moving multiple objects. The technique of registration to discover correspondence between back to back casing sets in view of picture appearance under inflexible and relative change. The picture enrollment is not appropriate to deal with event occasion that can be result in potential missed objects. In this paper, for address such problems, designs propose novel approach. The divided video outlines utilizing area adjancy diagram of visual appearance and geometric properties. Then it performed between graph sequences by using multi graph matching, then getting matching region labeling by a proposed graph coloring algorithms which assign foreground label to respective region. The plan design is robust to unknown transformation with significant improvement in overall existing work which is related to moving multiple objects detection in real time parameters.

The construction of semantic memory: grammar based representations learned from relational episodic information

Directory of Open Access Journals (Sweden)

Francesco P Battaglia

2011-08-01

Full Text Available After acquisition, memories underlie a process of consolidation, making them more resistant to interference and brain injury. Memory consolidation involves systems-level interactions, most importantly between the hippocampus and associated structures, which takes part in the initial encoding of memory, and the neocortex, which supports long-term storage. This dichotomy parallels the contrast between episodic memory (tied to the hippocampal formation, collecting an autobiographical stream of experiences, and semantic memory, a repertoire of facts and statistical regularities about the world, involving the neocortex at large. Experimental evidence points to a gradual transformation of memories, following encoding, from an episodic to a semantic character. This may require an exchange of information between different memory modules during inactive periods. We propose a theory for such interactions and for the formation of semantic memory, in which episodic memory is encoded as relational data. Semantic memory is modeled as a modified stochastic grammar, which learns to parse episodic configurations expressed as an association matrix. The grammar produces tree-like representations of episodes, describing the relationships between its main constituents at multiple levels of categorization, based on its current knowledge of world regularities. These regularities are learned by the grammar from episodic memory information, through an expectation-maximization procedure, analogous to the inside-outside algorithm for stochastic context-free grammars. We propose that a Monte-Carlo sampling version of this algorithm can be mapped on the dynamics of ``sleep replay'' of previously acquired information in the hippocampus and neocortex. We propose that the model can reproduce several properties of semantic memory such as decontextualization, top-down processing, and creation of schemata.

The Construction of Semantic Memory: Grammar-Based Representations Learned from Relational Episodic Information

Science.gov (United States)

Battaglia, Francesco P.; Pennartz, Cyriel M. A.

2011-01-01

After acquisition, memories underlie a process of consolidation, making them more resistant to interference and brain injury. Memory consolidation involves systems-level interactions, most importantly between the hippocampus and associated structures, which takes part in the initial encoding of memory, and the neocortex, which supports long-term storage. This dichotomy parallels the contrast between episodic memory (tied to the hippocampal formation), collecting an autobiographical stream of experiences, and semantic memory, a repertoire of facts and statistical regularities about the world, involving the neocortex at large. Experimental evidence points to a gradual transformation of memories, following encoding, from an episodic to a semantic character. This may require an exchange of information between different memory modules during inactive periods. We propose a theory for such interactions and for the formation of semantic memory, in which episodic memory is encoded as relational data. Semantic memory is modeled as a modified stochastic grammar, which learns to parse episodic configurations expressed as an association matrix. The grammar produces tree-like representations of episodes, describing the relationships between its main constituents at multiple levels of categorization, based on its current knowledge of world regularities. These regularities are learned by the grammar from episodic memory information, through an expectation-maximization procedure, analogous to the inside–outside algorithm for stochastic context-free grammars. We propose that a Monte-Carlo sampling version of this algorithm can be mapped on the dynamics of “sleep replay” of previously acquired information in the hippocampus and neocortex. We propose that the model can reproduce several properties of semantic memory such as decontextualization, top-down processing, and creation of schemata. PMID:21887143

Inferring ontology graph structures using OWL reasoning

KAUST Repository

Rodriguez-Garcia, Miguel Angel; Hoehndorf, Robert

2018-01-01

' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies

Flexible Processing and the Design of Grammar

Science.gov (United States)

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…

Reading and Grammar Learning through Mobile Phones

Science.gov (United States)

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…

GRAMMAR IN TEFL: A CRITIQUE OF INDONESIAN HIGH SCHOOL TEXTBOOKS

Directory of Open Access Journals (Sweden)

Peter Collins

2006-01-01

Full Text Available Abstract: The aim of this paper is to critically assess the presentation of English grammar in textbooks used in secondary schools in Indonesia. The influence of the Communicative Approach is in evidence in the books examined, and yet the importance of explicit grammar instruction is not ignored, reflecting the view of many today that grammatical forms cannot be successfully learnt merely on the basis of comprehensible input. Despite recognition of its central role, the grammar instruction presented in the textbooks invites questions as to its linguistic adequacy and accuracy. Writers often seem unwilling to take on board the insights recorded in the influential and authoritative descriptive grammars of recent years, continuing to accept tacitly the principles exposed in Traditional Grammar.

The Role of Simple Semantics in the Process of Artificial Grammar Learning.

Science.gov (United States)

Öttl, Birgit; Jäger, Gerhard; Kaup, Barbara

2017-10-01

This study investigated the effect of semantic information on artificial grammar learning (AGL). Recursive grammars of different complexity levels (regular language, mirror language, copy language) were investigated in a series of AGL experiments. In the with-semantics condition, participants acquired semantic information prior to the AGL experiment; in the without-semantics control condition, participants did not receive semantic information. It was hypothesized that semantics would generally facilitate grammar acquisition and that the learning benefit in the with-semantics conditions would increase with increasing grammar complexity. Experiment 1 showed learning effects for all grammars but no performance difference between conditions. Experiment 2 replicated the absence of a semantic benefit for all grammars even though semantic information was more prominent during grammar acquisition as compared to Experiment 1. Thus, we did not find evidence for the idea that semantics facilitates grammar acquisition, which seems to support the view of an independent syntactic processing component.

Missionary Pragmalinguistics: Father Diego Luis de Sanvitores’ grammar (1668) within the tradition of Philippine grammars

OpenAIRE

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 forgotten. The main point of criticism has been that Sanvitores used the Latin grammatical framework to explain a language that in many ways does not fit this framework. In this thesis it is argued inst...

Language Practice with Multimedia Supported Web-Based Grammar Revision Material

Science.gov (United States)

Baturay, Meltem Huri; Daloglu, Aysegul; Yildirim, Soner

2010-01-01

The aim of this study was to investigate the perceptions of elementary-level English language learners towards web-based, multimedia-annotated grammar learning. WEBGRAM, a system designed to provide supplementary web-based grammar revision material, uses audio-visual aids to enrich the contextual presentation of grammar and allows learners to…

Transformation language integration based on profiles and higher order transformations

NARCIS (Netherlands)

Van Gorp, P.M.E.; Keller, A.; Janssens, D.; Gaševic, D.; Lämmel, R.; Van Wyk, Eric

2009-01-01

For about two decades, researchers have been constructing tools for applying graph transformations on large model transformation case studies. Instead of incrementally extending a common core, these competitive tool builders have repeatedly reconstructed mechanisms that were already supported by

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.

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.

Transforming the Way We Teach Function Transformations

Science.gov (United States)

Faulkenberry, Eileen Durand; Faulkenberry, Thomas J.

2010-01-01

In this article, the authors discuss "function," a well-defined rule that relates inputs to outputs. They have found that by using the input-output definition of "function," they can examine transformations of functions simply by looking at changes to input or output and the respective changes to the graph. Applying transformations to the input…

Spoken Grammar and Its Role in the English Language Classroom

Science.gov (United States)

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…

Inferring ontology graph structures using OWL reasoning

KAUST Repository

Rodriguez-Garcia, Miguel Angel

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies\\' semantic content remains a challenge.We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies\\' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph .Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

Inferring ontology graph structures using OWL reasoning.

Science.gov (United States)

Rodríguez-García, Miguel Ángel; Hoehndorf, Robert

2018-01-05

Ontologies are representations of a conceptualization of a domain. Traditionally, ontologies in biology were represented as directed acyclic graphs (DAG) which represent the backbone taxonomy and additional relations between classes. These graphs are widely exploited for data analysis in the form of ontology enrichment or computation of semantic similarity. More recently, ontologies are developed in a formal language such as the Web Ontology Language (OWL) and consist of a set of axioms through which classes are defined or constrained. While the taxonomy of an ontology can be inferred directly from the axioms of an ontology as one of the standard OWL reasoning tasks, creating general graph structures from OWL ontologies that exploit the ontologies' semantic content remains a challenge. We developed a method to transform ontologies into graphs using an automated reasoner while taking into account all relations between classes. Searching for (existential) patterns in the deductive closure of ontologies, we can identify relations between classes that are implied but not asserted and generate graph structures that encode for a large part of the ontologies' semantic content. We demonstrate the advantages of our method by applying it to inference of protein-protein interactions through semantic similarity over the Gene Ontology and demonstrate that performance is increased when graph structures are inferred using deductive inference according to our method. Our software and experiment results are available at http://github.com/bio-ontology-research-group/Onto2Graph . Onto2Graph is a method to generate graph structures from OWL ontologies using automated reasoning. The resulting graphs can be used for improved ontology visualization and ontology-based data analysis.

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.

Associative Cognitive CREED for Successful Grammar Learning

Directory of Open Access Journals (Sweden)

Andrias Tri Susanto

2016-06-01

Full Text Available This research article reports a qualitative study which was conducted to investigate ways successful EFL learners learned English grammar. The subjects of this research were eight successful EFL learners from six different countries in Asia: China, Indonesia, Japan, South Korea, Thailand, and Vietnam. The data was collected by interviewing each subject in person individually at an agreed time and place. The result showed that all the grammar learning processes described by the subjects were closely linked to the framework of Associative Cognitive CREED. There were also some contributing factors that could be integrally combined salient to the overall grammar learning process. However, interestingly, each subject emphasized different aspects of learning.

Business Rules Definition for Decision Support System Using Matrix Grammar

Directory of Open Access Journals (Sweden)

Eva Zámečníková

2016-06-01

Full Text Available This paper deals with formalization of business rules by formal grammars. In our work we focus on methods for high frequency data processing. We process data by using complex event platforms (CEP which allow to process high volume of data in nearly real time. Decision making process is contained by one level of processing of CEP. Business rules are used for decision making process description. For the business rules formalization we chose matrix grammar. The use of formal grammars is quite natural as the structure of rules and its rewriting is very similar both for the business rules and for formal grammar. In addition the matrix grammar allows to simulate dependencies and correlations between the rules. The result of this work is a model for data processing of knowledge-based decision support system described by the rules of formal grammar. This system will support the decision making in CEP. This solution may contribute to the speedup of decision making process in complex event processing and also to the formal verification of these systems.

Using Graph and Vertex Entropy to Compare Empirical Graphs with Theoretical Graph Models

Directory of Open Access Journals (Sweden)

Tomasz Kajdanowicz

2016-09-01

Full Text Available Over the years, several theoretical graph generation models have been proposed. Among the most prominent are: the Erdős–Renyi random graph model, Watts–Strogatz small world model, Albert–Barabási preferential attachment model, Price citation model, and many more. Often, researchers working with real-world data are interested in understanding the generative phenomena underlying their empirical graphs. They want to know which of the theoretical graph generation models would most probably generate a particular empirical graph. In other words, they expect some similarity assessment between the empirical graph and graphs artificially created from theoretical graph generation models. Usually, in order to assess the similarity of two graphs, centrality measure distributions are compared. For a theoretical graph model this means comparing the empirical graph to a single realization of a theoretical graph model, where the realization is generated from the given model using an arbitrary set of parameters. The similarity between centrality measure distributions can be measured using standard statistical tests, e.g., the Kolmogorov–Smirnov test of distances between cumulative distributions. However, this approach is both error-prone and leads to incorrect conclusions, as we show in our experiments. Therefore, we propose a new method for graph comparison and type classification by comparing the entropies of centrality measure distributions (degree centrality, betweenness centrality, closeness centrality. We demonstrate that our approach can help assign the empirical graph to the most similar theoretical model using a simple unsupervised learning method.

Difficulties in Teaching and Learning Grammar in an EFL Context

Science.gov (United States)

Al-Mekhlafi, Abdu Mohammed; Nagaratnam, Ramani Perur

2011-01-01

The role of grammar instruction in an ESL/EFL context has been for decades a major issue for students and teachers alike. Researchers have debated whether grammar should be taught in the classroom and students, for their part, have generally looked upon grammar instruction as a necessary evil at best, and an avoidable burden at worst. The paper…

Communicating Grammatically: Evaluating a Learner Strategy Website for Spanish Grammar

Science.gov (United States)

Cohen, Andrew D.; Pinilla-Herrera, Angela; Thompson, Jonathan R.; Witzig, Lance E.

2011-01-01

After a brief introduction to language learner strategies and grammar strategies as a subcategory, it is pointed out that research on the use of grammar strategies by learners of a second language (L2) has been limited. The article then describes the construction of a website with strategies for learning and performing Spanish grammar, with a…

Enhancing Empirical Research for Linguistically Motivated Precision Grammars

NARCIS (Netherlands)

Fokkens, A.S.

2014-01-01

Grammars of natural language are highly complex objects. This complexity is reflected in formal analyses found in both syntactic theory and computational grammars. In particular, there are two factors that make it notoriously difficult to make strong assertions about analyses for natural language

On the Equivalence of Formal Grammars and Machines.

Science.gov (United States)

Lund, Bruce

1991-01-01

Explores concepts of formal language and automata theory underlying computational linguistics. A computational formalism is described known as a "logic grammar," with which computational systems process linguistic data, with examples in declarative and procedural semantics and definite clause grammars. (13 references) (CB)

Metagrammar Engineering: Towards systematic exploration of implemented grammars

NARCIS (Netherlands)

Fokkens, A.S.

2011-01-01

When designing grammars of natural language, typically, more than one formal analysis can account for a given phenomenon. Moreover, because analyses interact, the choices made by the engineer influence the possibilities available in further grammar development. The order in which phenomena are

A Pure Object-Oriented Embedding of Attribute Grammars

NARCIS (Netherlands)

Sloane, A.M.; Kats, L.C.L.; Visser, E.

2010-01-01

Attribute grammars are a powerful specification paradigm for many language processing tasks, particularly semantic analysis of programming languages. Recent attribute grammar systems use dynamic scheduling algorithms to evaluate attributes by need. In this paper, we show how to remove the need for a

Indirect Positive Evidence in the Acquisition of a Subset Grammar

Science.gov (United States)

Schwartz, Misha; Goad, Heather

2017-01-01

This article proposes that second language learners can use indirect positive evidence (IPE) to acquire a phonological grammar that is a subset of their L1 grammar. IPE is evidence from errors in the learner's L1 made by native speakers of the learner's L2. It has been assumed that subset grammars may be acquired using direct or indirect negative…

Resistance Distances in Vertex-Face Graphs

Science.gov (United States)

Shangguan, Yingmin; Chen, Haiyan

2018-01-01

The computation of two-point resistances in networks is a classical problem in electric circuit theory and graph theory. Let G be a triangulation graph with n vertices embedded on an orientable surface. Define K(G) to be the graph obtained from G by inserting a new vertex vϕ to each face ϕ of G and adding three new edges (u, vϕ), (v, vϕ) and (w, vϕ), where u, v and w are three vertices on the boundary of ϕ. In this paper, using star-triangle transformation and resistance local-sum rules, explicit relations between resistance distances in K(G) and those in G are obtained. These relations enable us to compute resistance distance between any two points of Kk(G) recursively. As explanation examples, some resistances in several networks are computed, including the modified Apollonian network and networks constructed from tetrahedron, octahedron and icosahedron, respectively.

Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

KAUST Repository

Yasin Yazicioǧlu, A.; Egerstedt, Magnus; Shamma, Jeff S.

2015-01-01

Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

Formation of Robust Multi-Agent Networks through Self-Organizing Random Regular Graphs

KAUST Repository

Yasin Yazicioǧlu, A.

2015-11-25

Multi-Agent networks are often modeled as interaction graphs, where the nodes represent the agents and the edges denote some direct interactions. The robustness of a multi-Agent network to perturbations such as failures, noise, or malicious attacks largely depends on the corresponding graph. In many applications, networks are desired to have well-connected interaction graphs with relatively small number of links. One family of such graphs is the random regular graphs. In this paper, we present a decentralized scheme for transforming any connected interaction graph with a possibly non-integer average degree of k into a connected random m-regular graph for some m ϵ [k+k ] 2. Accordingly, the agents improve the robustness of the network while maintaining a similar number of links as the initial configuration by locally adding or removing some edges. © 2015 IEEE.

Dwie (antyfilozoficzne „gramatyki” Wittgensteina [Two (anti philosophical grammars of Ludwig Wittgenstein

Directory of Open Access Journals (Sweden)

Adam Nowaczyk

2013-09-01

Full Text Available Wittgenstein is the author of two conceptions of “grammar”, that were meant to be tools of reaching the same goal: discrediting of the traditional, i.e. “metaphysical” questions of philosophy. His early conception concerns logical grammar being the language of logic notation, which is devoid of logical constants. This idea was supported by the ontological thesis that there are no logical objects. In fact, it was not indispensable for achieving the intended purpose, since the elimination of philosophical problems was provided by the semantic argument that the only sensible statements are those of the natural sciences. The second concept of grammar, presented in the writings of the later Wittgenstein, seems more ambiguous. Grammar is a set of rules of the language game, having a status of grammatical statements. Examples of such statements are diverse, and desirable, according to the authors, reformulation of them all into concrete orders or prohibitions seems problematic. In the Investigations Wittgenstein distinguishes between deep and surface grammar, which serves to determine the proper task of philosophy as description of the deep grammar (especially the grammar of philosophically relevant words. In this sense New Philosophy is a kind of philosophical grammar. Wittgensteinian grammar is also anti-philosophical, as it aims at the elimination of erroneous (pseudometaphysical claims derived from misleading forms of surface grammar. Despite the differences in the concepts of language and grammar in the early and late Wittgenstein, he has not changed his critical approach to the traditional philosophical questions.

Kiss my asterisk a feisty guide to punctuation and grammar

CERN Document Server

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

Nigel: A Systemic Grammar for Text Generation.

Science.gov (United States)

1983-02-01

presumed. Basic references on the systemic framework include [Berry 75, Berry 77, Halliday 76a, Halliday 76b, Hudson 76, Halliday 81, de Joia 80...Edinburgh, 1979. [do Joia 80] de Joia , A., and A. Stanton, Terms in Systemic Linguistics, Batsford Academic and Educational, Ltd., London, 1980. -’C...1 A Grammar for Text Generation- -The Challenge ................................. 1 *1.2 A Grammar for Text Generation--The Design

The Role of Grammar Instruction in Language Teaching

Institute of Scientific and Technical Information of China (English)

无

2001-01-01

@@ The role of grammar instruction in foreign or second language acquisition is one of the most con troversial issues in foreign/second language teach ing and learning research. The advocators of gram mar instruction argue that grammar should be the core of language instruction and formal instruction enhances formal accuracy. On the other hand, crit ics naintain that the grammar knowledge has lim ited uses and may hinder the students from acquir ing the communicative competence and efficiency. Undoubtedly these two extreme theories often put teachers into a dilemma. What theory should they believe then? Do they accept the one and ignore the other?

The minimalist grammar of action

Science.gov (United States)

Pastra, Katerina; Aloimonos, Yiannis

2012-01-01

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. PMID:22106430

USING PREZI PRESENTATION AS INSTRUCTIONAL MATERIAL IN ENGLISH GRAMMAR CLASSROOM

Directory of Open Access Journals (Sweden)

Rahmat Yusny

2016-05-01

Full Text Available Utilizing digital technology as a medium for educational instruction has now become one of the 21 century pedagogy trends. Numerous researches suggested that using digital technology provides positive impacts as it gives more access to resources for the learning. In Foreign language pedagogy, using digital technology fosters learners’ autonomy by self-managing the amount of learning inputs outside the classroom. However, many studies emphasize more on the communicative and the vast resources accessible for the learners. Very limited attention given to the impact of the visual aid that focuses on aesthetic values of instructional design. English Grammar is one of many subjects that often received complaints by learners and claimed as a “boring” subject. Many English teachers especially in developing countries still utilize traditional method in teaching grammar. They introduce sentence structure using grammar formulas. Although, this method is still very popular, it often considered monotonous by many learners. This paper discusses about the study of using Prezi.com presentation to deliver grammar instruction materials in an English language classroom. From the study, it was found that the majority of the students involved in the study are fond of the materials and the post-test results showed grammar mastery improvement after receiving a grammar lesson that shows instructional materials using prezi. On the other hand, the control class that uses only writing boards and worksheets showed less improvement. This research provides new technique in developing grammar instruction design using a web tool called Prezi in enhancing the display of the instruction material. The experiment was given to students of English Language Education. The result of the study shows students’ positive perception toward the use of Prezi in English grammar instructional material.

On the interaction of Linguistic Typology and Functional Grammar

DEFF Research Database (Denmark)

Rijkhoff, J.

2002-01-01

of adjectives as a distinct word class. Conversely it will be shown that facts from many different languages have played an important role in the development of a layered model of the noun phrase in Functional Grammar and how currently these facts are used to test hypotheses concerning parallels between NPs...... empirical research in a wide variety of languages as practiced in the context of linguistic typology and one particular theory, Simon Dik's theory of Functional Grammar. In my view, the relationship between Functional Grammar and linguistic typology is an excellent example of the fruitful combination...... of theory driven data collection and data driven hypothesis formation. Furthermore, typological facts do not only serve to confirm the theory of Functional Grammar, but they also serve as a heuristics for an extension of the theory.Research conducted within the wider theoretical framework of Dik...

Grammar for College Writing: A Sentence-Composing Approach

Science.gov (United States)

Killgallon, Don; Killgallon, Jenny

2010-01-01

Across America, in thousands of classrooms, from elementary school to high school, the time-tested sentence-composing approach has given students tools to become better writers. Now the authors present a much anticipated sentence-composing grammar worktext for college writing. This book presents a new and easier way to understand grammar: (1) Noun…

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.

A graph rewriting programming language for graph drawing

OpenAIRE

Rodgers, Peter

1998-01-01

This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process. The languages which gave a diagrammatic view of graphs were not computationally complete and so could not be used to implement complex graph drawing algorithms. Hence current graph drawing tools are all text based. Recent developments in graph rewriting systems have produced computationally com...

Visualizing Dataflow Graphs of Deep Learning Models in TensorFlow.

Science.gov (United States)

Wongsuphasawat, Kanit; Smilkov, Daniel; Wexler, James; Wilson, Jimbo; Mane, Dandelion; Fritz, Doug; Krishnan, Dilip; Viegas, Fernanda B; Wattenberg, Martin

2018-01-01

We present a design study of the TensorFlow Graph Visualizer, part of the TensorFlow machine intelligence platform. This tool helps users understand complex machine learning architectures by visualizing their underlying dataflow graphs. The tool works by applying a series of graph transformations that enable standard layout techniques to produce a legible interactive diagram. To declutter the graph, we decouple non-critical nodes from the layout. To provide an overview, we build a clustered graph using the hierarchical structure annotated in the source code. To support exploration of nested structure on demand, we perform edge bundling to enable stable and responsive cluster expansion. Finally, we detect and highlight repeated structures to emphasize a model's modular composition. To demonstrate the utility of the visualizer, we describe example usage scenarios and report user feedback. Overall, users find the visualizer useful for understanding, debugging, and sharing the structures of their models.

STUDENTS’ ATTITUDES TO EXPLICIT GRAMMAR TEACHING AND ITS RELATIONAHIP TO COMMUNICATION

Institute of Scientific and Technical Information of China (English)

2000-01-01

Grammar teaching is greatly emphasised in English language teaching in China, but does it really attain the goal the students desire? An investigation was made with overseas students about their attitudes to explicit grammar teaching. The investigation reveals that grammar teaching should focus on developing the learners’ communicative ability more than presenting and explaining grammatical rules.

Grammar Maturity Model

NARCIS (Netherlands)

Zaytsev, V.; Pierantonio, A.; Schätz, B.; Tamzalit, D.

2014-01-01

The evolution of a software language (whether modelled by a grammar or a schema or a metamodel) is not limited to development of new versions and dialects. An important dimension of a software language evolution is maturing in the sense of improving the quality of its definition. In this paper, we

REEP Grammar Favorites.

Science.gov (United States)

Arlington County Public Schools, VA. REEP, Arlington Education and Employment Program.

This document provides the Arlington Education and Employment Program's (REEP) favorite techniques for teaching English-as-a-Second-Language (ESL) grammar. The focus, levels, and materials needed are presented for each of the techniques as well as the steps to follow. (Adjunct ERIC Clearinghouse for ESL Literacy Education) (Author/VWL)

Grammar-Supported 3d Indoor Reconstruction from Point Clouds for As-Built Bim

Science.gov (United States)

Becker, S.; Peter, M.; Fritsch, D.

2015-03-01

The paper presents a grammar-based approach for the robust automatic reconstruction of 3D interiors from raw point clouds. The core of the approach is a 3D indoor grammar which is an extension of our previously published grammar concept for the modeling of 2D floor plans. The grammar allows for the modeling of buildings whose horizontal, continuous floors are traversed by hallways providing access to the rooms as it is the case for most office buildings or public buildings like schools, hospitals or hotels. The grammar is designed in such way that it can be embedded in an iterative automatic learning process providing a seamless transition from LOD3 to LOD4 building models. Starting from an initial low-level grammar, automatically derived from the window representations of an available LOD3 building model, hypotheses about indoor geometries can be generated. The hypothesized indoor geometries are checked against observation data - here 3D point clouds - collected in the interior of the building. The verified and accepted geometries form the basis for an automatic update of the initial grammar. By this, the knowledge content of the initial grammar is enriched, leading to a grammar with increased quality. This higher-level grammar can then be applied to predict realistic geometries to building parts where only sparse observation data are available. Thus, our approach allows for the robust generation of complete 3D indoor models whose quality can be improved continuously as soon as new observation data are fed into the grammar-based reconstruction process. The feasibility of our approach is demonstrated based on a real-world example.

Enhancing Competency in English: The Covert Approach a Complementary to the Overt Approach in Teaching Grammar

Directory of Open Access Journals (Sweden)

Hussein Islam Abdullah

2015-01-01

Full Text Available Over the years, there has been a decline in the competency of the English Language in Malaysian schools. Many parties among them the Ministry of Education, relevant NGOs, academicians and people have expressed concern over the matter. The Education Ministry through its transformational policy has taken several measures to overcome the matter. It is employing appropriate strategies to solve the problems. The focus is on learning and teaching strategies as well as the content of the language. There is no doubt that grammar is a very important component in acquiring the language in primary and secondary schools. The English teachers mostly use the communicative approach in teaching grammar. This is in line with the KBSR syllabus in mid 1980s which emphasized on the communicative method. Teachers’ training and materials such as textbooks cater for the covert method. However, some tend to ignore the structural approach which is equally effective and meaningful to increase the level of the students’ proficiency which was popular in the 1960s. The paper discusses on the two different approaches used – the covert and overt approaches – their strengths as well as weaknesses. Application of both approaches is also taken into consideration giving a better view of how grammar should be taught in schools.

Applied and computational harmonic analysis on graphs and networks

Science.gov (United States)

Irion, Jeff; Saito, Naoki

2015-09-01

In recent years, the advent of new sensor technologies and social network infrastructure has provided huge opportunities and challenges for analyzing data recorded on such networks. In the case of data on regular lattices, computational harmonic analysis tools such as the Fourier and wavelet transforms have well-developed theories and proven track records of success. It is therefore quite important to extend such tools from the classical setting of regular lattices to the more general setting of graphs and networks. In this article, we first review basics of graph Laplacian matrices, whose eigenpairs are often interpreted as the frequencies and the Fourier basis vectors on a given graph. We point out, however, that such an interpretation is misleading unless the underlying graph is either an unweighted path or cycle. We then discuss our recent effort of constructing multiscale basis dictionaries on a graph, including the Hierarchical Graph Laplacian Eigenbasis Dictionary and the Generalized Haar-Walsh Wavelet Packet Dictionary, which are viewed as generalizations of the classical hierarchical block DCTs and the Haar-Walsh wavelet packets, respectively, to the graph setting. Finally, we demonstrate the usefulness of our dictionaries by using them to simultaneously segment and denoise 1-D noisy signals sampled on regular lattices, a problem where classical tools have difficulty.

Linear grammar as a possible stepping-stone in the evolution of language.

Science.gov (United States)

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.

Explicit Grammar Instruction in L2 Learners’Writing Development:Effective or Ineffective?

Institute of Scientific and Technical Information of China (English)

田秀峰

2012-01-01

　　It has long been in dispute about whether explicit grammar teaching is more effective in second language learning or implicit grammar teaching is. However, there are more than one factor to take into consideration while discussing which way is better for L2 learners. This short essay aims at depicting three respects concerning grammar teaching, namely learning context, language learners’beliefs and needs, and grammar instruction. When educators and practitioners try to adopt grammar instruction either implicitly or explicitly in L2 learners’writing development, they probably need to consider the above three factors and to find out the best way to produce more effective teaching results among their students

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.

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.

Overlapping community detection based on link graph using distance dynamics

Science.gov (United States)

Chen, Lei; Zhang, Jing; Cai, Li-Jun

2018-01-01

The distance dynamics model was recently proposed to detect the disjoint community of a complex network. To identify the overlapping structure of a network using the distance dynamics model, an overlapping community detection algorithm, called L-Attractor, is proposed in this paper. The process of L-Attractor mainly consists of three phases. In the first phase, L-Attractor transforms the original graph to a link graph (a new edge graph) to assure that one node has multiple distances. In the second phase, using the improved distance dynamics model, a dynamic interaction process is introduced to simulate the distance dynamics (shrink or stretch). Through the dynamic interaction process, all distances converge, and the disjoint community structure of the link graph naturally manifests itself. In the third phase, a recovery method is designed to convert the disjoint community structure of the link graph to the overlapping community structure of the original graph. Extensive experiments are conducted on the LFR benchmark networks as well as real-world networks. Based on the results, our algorithm demonstrates higher accuracy and quality than other state-of-the-art algorithms.

Linearly Ordered Attribute Grammars : With Automatic Augmenting Dependency Selection

NARCIS (Netherlands)

van Binsbergen, L. Thomas; Bransen, Jeroen; Dijkstra, Atze

2015-01-01

Attribute Grammars (AGs) extend Context-Free Grammars with attributes: information gathered on the syntax tree that adds semantics to the syntax. AGs are very well suited for describing static analyses, code-generation and other phases incorporated in a compiler. AGs are divided into classes based

What is the Spirit of the English Grammar Teaching?

Institute of Scientific and Technical Information of China (English)

Haijiang Zhao

2016-01-01

In China,English is a foreign language,not a second language.Chinese students can't learn English well without learning its gram?mar first.As for English teachers,the most important is to help the students to grasp the spirit of English grammar learning.

The Effectiveness of Teaching Traditional Grammar on Writing Composition at the High School Level

Science.gov (United States)

Jaeger, Gina

2011-01-01

Traditional grammar instruction is a challenging element of the English curriculum; both students and teachers struggle with the rules and dull nature of grammar. However, understanding grammar is important because students need to understand the language they speak in order to be effective communicators, and teachers provide grammar instruction…

Graph Aggregation

NARCIS (Netherlands)

Endriss, U.; Grandi, U.

Graph aggregation is the process of computing a single output graph that constitutes a good compromise between several input graphs, each provided by a different source. One needs to perform graph aggregation in a wide variety of situations, e.g., when applying a voting rule (graphs as preference

Triumph through Texting: Restoring Learners' Interest in Grammar

Science.gov (United States)

Hedjazi Moghari, Mona; Marandi, S. Susan

2017-01-01

It is usually the case that learners of English as a foreign language (EFL) are exposed to language materials in class only, and of course in such a short space of time, they do not always find enough chance to practice English grammar features and become aware of their grammar mistakes. As a potential solution to this problem, the current study…

Theoretical Basics of the Transpositional Grammar of Russian Language

Directory of Open Access Journals (Sweden)

Victor Vasilievich Shigurov

2016-09-01

Full Text Available The article presents the theoretical basics of the transpositional grammar of the Russian language (as the special areas of the functional grammar, which serves as a mechanism for describing the subject of the transposition of the linguistic units from one class (or interclass semantic-syntactic category to another (or others. The relation to the transposition of the grammar and vocabulary (word-formation was displayed; a typology of the transpositional processes in grammatical structure of the Russian language was submitted, and above all, in the parts of the speech and inter part-of-speech classes, grammatical categories and lexical-grammatical classes; general and specific objectives of the study types of transposition of the linguistic units were defined; the fragments of the description of the transition and syncretism of the language units were offered using the technique of opposition analysis and indexation. The results can be used in the development of the theory of the transpositional grammar of the Russian language.

Access, Rank, and Select in Grammar-compressed Strings

DEFF Research Database (Denmark)

Belazzougui, Djamal; Cording, Patrick Hagge; Puglisi, Simon J.

2015-01-01

Given a string S of length N on a fixed alphabet of σ symbols, a grammar compressor produces a context-free grammar G of size n that generates S and only S. In this paper we describe data structures to support the following operations on a grammar-compressed string: access(S,i,j) (return substring...... consecutive symbols from S. Alternatively, we can achieve \\O(logτN+m/logσN) query time using \\O(nτlogτ(N/n)logN) bits of space, matching a lower bound stated by Verbin and Yu for strings where N is polynomially related to n when τ = log ε N. For rank and select we describe data structures of size \\O...

Impact of Consciousness-Raising Activities on Young English Language Learners' Grammar Performance

Science.gov (United States)

Fatemipour, Hamidreza; Hemmati, Shiva

2015-01-01

Grammar Consciousness-Raising (GCR) is an approach to teaching of grammar which learners instead of being taught the given rules, experience language data. The data challenge them to rethink, restructure their existing mental grammar and construct an explicit rule to describe the grammatical feature which the data illustrate (Ellis, 2002). And…

A Python-based Interface for Wide Coverage Lexicalized Tree-adjoining Grammars

Directory of Open Access Journals (Sweden)

Wang Ziqi

2015-04-01

Full Text Available This paper describes the design and implementation of a Python-based interface for wide coverage Lexicalized Tree-adjoining Grammars. The grammars are part of the XTAG Grammar project at the University of Pennsylvania, which were hand-written and semi-automatically curated to parse real-world corpora. We provide an interface to the wide coverage English and Korean XTAG grammars. Each XTAG grammar is lexicalized, which means at least one word selects a tree fragment (called an elementary tree or etree. Derivations for sentences are built by combining etrees using substitution (replacement of a tree node with an etree at the frontier of another etree and adjunction (replacement of an internal tree node in an etree by another etree. Each etree is associated with a feature structure representing constraints on substitution and adjunction. Feature structures are combined using unification during the combination of etrees. We plan to integrate our toolkit for XTAG grammars into the Python-based Natural Language Toolkit (NLTK: nltk.org. We have provided an API capable of searching the lexicalized etrees for a given word or multiple words, searching for a etree by name or function, display the lexicalized etrees to the user using a graphical view, display the feature structure associated with each tree node in an etree, hide or highlight features based on a regular expression, and browsing the entire tree database for each XTAG grammar.

What do animals learn in artificial grammar studies?

Science.gov (United States)

Beckers, Gabriël J L; Berwick, Robert C; Okanoya, Kazuo; Bolhuis, Johan J

2017-10-01

Artificial grammar learning is a popular paradigm to study syntactic ability in nonhuman animals. Subjects are first trained to recognize strings of tokens that are sequenced according to grammatical rules. Next, to test if recognition depends on grammaticality, subjects are presented with grammar-consistent and grammar-violating test strings, which they should discriminate between. However, simpler cues may underlie discrimination if they are available. Here, we review stimulus design in a sample of studies that use particular sounds as tokens, and that claim or suggest their results demonstrate a form of sequence rule learning. To assess the extent of acoustic similarity between training and test strings, we use four simple measures corresponding to cues that are likely salient. All stimulus sets contain biases in similarity measures such that grammatical test stimuli resemble training stimuli acoustically more than do non-grammatical test stimuli. These biases may contribute to response behaviour, reducing the strength of grammatical explanations. We conclude that acoustic confounds are a blind spot in artificial grammar learning studies in nonhuman animals. Copyright © 2016 The Author(s). Published by Elsevier Ltd.. All rights reserved.

A Theoretical Glimpse at Issues of Grammar Teaching

Institute of Scientific and Technical Information of China (English)

朱海涛

2012-01-01

When it comes to the description of the status of grammar in the field of second language teaching now,recent literature bears witness a good deal of discussion about a ’grammar revival’. More recently,theoretical perspectives on language teaching and learning have changed. The possibilities and feasibility of integrating form - focus instruction and meaningful communicative activities in the communicative language classroom have been explored.

The elements of grammar in 90 minutes

CERN Document Server

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.

The Role of Teaching Grammar in First Language Education

Science.gov (United States)

Demir, Sezgin; Erdogan, Ayse

2018-01-01

Grammar; while originating from the natural structure of the language also is the system which makes it possible for different language functions meet within the body of common rules especially communication. Having command of the language used, speaking and writing it correctly require strong grammar knowledge actually. However only knowing the…

John Ash and the Rise of the Children's Grammar

NARCIS (Netherlands)

Navest, Karlijn Marianne

2011-01-01

From the second half of the eighteenth century onwards a knowledge of grammar served as an important marker of class in England. In order to enable their children to rise in society, middle-class parents expected their sons and daughters to learn English grammar. Since England did not have an

Multiword Constructions in the Grammar.

Science.gov (United States)

Culicover, Peter W; Jackendoff, Ray; Audring, Jenny

2017-07-01

There is ample evidence that speakers' linguistic knowledge extends well beyond what can be described in terms of rules of compositional interpretation stated over combinations of single words. We explore a range of multiword constructions (MWCs) to get a handle both on the extent of the phenomenon and on the grammatical constraints that may govern it. We consider idioms of various sorts, collocations, compounds, light verbs, syntactic nuts, and assorted other constructions, as well as morphology. Our conclusion is that MWCs highlight the central role that grammar plays in licensing MWCs in the lexicon and the creation of novel MWCs, and they help to clarify how the lexicon articulates with the rest of the grammar. Copyright © 2017 Cognitive Science Society, Inc.

Proxy Graph: Visual Quality Metrics of Big Graph Sampling.

Science.gov (United States)

Nguyen, Quan Hoang; Hong, Seok-Hee; Eades, Peter; Meidiana, Amyra

2017-06-01

Data sampling has been extensively studied for large scale graph mining. Many analyses and tasks become more efficient when performed on graph samples of much smaller size. The use of proxy objects is common in software engineering for analysis and interaction with heavy objects or systems. In this paper, we coin the term 'proxy graph' and empirically investigate how well a proxy graph visualization can represent a big graph. Our investigation focuses on proxy graphs obtained by sampling; this is one of the most common proxy approaches. Despite the plethora of data sampling studies, this is the first evaluation of sampling in the context of graph visualization. For an objective evaluation, we propose a new family of quality metrics for visual quality of proxy graphs. Our experiments cover popular sampling techniques. Our experimental results lead to guidelines for using sampling-based proxy graphs in visualization.

Multiple Grammars and the Logic of Learnability in Second Language Acquisition.

Science.gov (United States)

Roeper, Tom W

2016-01-01

The core notion of modern Universal Grammar is that language ability requires abstract representation in terms of hierarchy, movement operations, abstract features on words, and fixed mapping to meaning. These mental structures are a step toward integrating representational knowledge of all kinds into a larger model of cognitive psychology. Examining first and second language at once provides clues as to how abstractly we should represent this knowledge. The abstract nature of grammar allows both the formulation of many grammars and the possibility that a rule of one grammar could apply to another grammar. We argue that every language contains Multiple Grammars which may reflect different language families. We develop numerous examples of how the same abstract rules can apply in various languages and develop a theory of how language modules (case-marking, topicalization, and quantification) interact to predict L2 acquisition paths. In particular we show in depth how Germanic Verb-second operations, based on Verb-final structure, can apply in English. The argument is built around how and where V2 from German can apply in English, seeking to explain the crucial contrast: "nothing" yelled out Bill/(*)"nothing" yelled Bill out in terms of the necessary abstractness of the V2 rule.

Vega-Lite: A Grammar of Interactive Graphics.

Science.gov (United States)

Satyanarayan, Arvind; Moritz, Dominik; Wongsuphasawat, Kanit; Heer, Jeffrey

2017-01-01

We present Vega-Lite, a high-level grammar that enables rapid specification of interactive data visualizations. Vega-Lite combines a traditional grammar of graphics, providing visual encoding rules and a composition algebra for layered and multi-view displays, with a novel grammar of interaction. Users specify interactive semantics by composing selections. In Vega-Lite, a selection is an abstraction that defines input event processing, points of interest, and a predicate function for inclusion testing. Selections parameterize visual encodings by serving as input data, defining scale extents, or by driving conditional logic. The Vega-Lite compiler automatically synthesizes requisite data flow and event handling logic, which users can override for further customization. In contrast to existing reactive specifications, Vega-Lite selections decompose an interaction design into concise, enumerable semantic units. We evaluate Vega-Lite through a range of examples, demonstrating succinct specification of both customized interaction methods and common techniques such as panning, zooming, and linked selection.

Construction Morphology and the Parallel Architecture of Grammar

Science.gov (United States)

Booij, Geert; Audring, Jenny

2017-01-01

This article presents a systematic exposition of how the basic ideas of Construction Grammar (CxG) (Goldberg, 2006) and the Parallel Architecture (PA) of grammar (Jackendoff, 2002]) provide the framework for a proper account of morphological phenomena, in particular word formation. This framework is referred to as Construction Morphology (CxM). As…

Spoken Grammar: An Urgent Necessity in the EFL Context

Science.gov (United States)

Al-wossabi, Sami A.

2014-01-01

Recent studies in corpus linguistics have revealed apparent inconsistencies between the prescriptive grammar presented in EFL textbooks and the type of grammar used in the speech of native speakers. Such variations and learning gaps deprive EFL learners of the actual use of English and delay their oral/aural developmental processes. The focus of…

Image based Monument Recognition using Graph based Visual Saliency

DEFF Research Database (Denmark)

Kalliatakis, Grigorios; Triantafyllidis, Georgios

2013-01-01

This article presents an image-based application aiming at simple image classification of well-known monuments in the area of Heraklion, Crete, Greece. This classification takes place by utilizing Graph Based Visual Saliency (GBVS) and employing Scale Invariant Feature Transform (SIFT) or Speeded......, the images have been previously processed according to the Graph Based Visual Saliency model in order to keep either SIFT or SURF features corresponding to the actual monuments while the background “noise” is minimized. The application is then able to classify these images, helping the user to better...

Designing an Intelligent Mobile Learning Tool for Grammar Learning (i-MoL

Directory of Open Access Journals (Sweden)

Munir Shuib

2015-01-01

Full Text Available English is the most important second language in most non-English speaking countries, including Malaysia. A good English proficiency comes from good grasp of grammar. To conquer the problems of low English proficiency among Malaysians, it is important to identify the key motivators that could facilitate the process of grammar learning. In this digital age, technology can play a very important role and mobile technology could be one of it. Thus, this study aims at designing a mobile learning tool, namely the Intelligent Mobile Learning Tool for Grammar Learning (i-MoL to act as the “on-the-go” grammar learning support via mobile phones. i-MoL helps reinforce grammar learning through mobile phone with game-like applications, inquiry-based activities and flashcard-like information. The intelligent part of i-MoL lies in its ability to map the mobile-based grammar learning content to individual’s preferred learning styles based on Felder-Silverman Learning Style Model (FSLSM. The instructional system design through the ADDIE model was used in this study as a systematic approach in designing a novel and comprehensive mobile learning tool for grammar learning. In terms of implications, this study provides insights on how mobile technologies can be utilized to meet the mobility demand among language learners today.

Modeling the Nature of Grammar and Vocabulary Trajectories From Prekindergarten to Third Grade.

Science.gov (United States)

Jiang, Hui; Logan, Jessica A; Jia, Rongfang

2018-04-17

This study investigated the longitudinal development of 2 important contributors to reading comprehension, grammar, and vocabulary skills. The primary interest was to examine the trajectories of the 2 skill areas from preschool to 3rd grade. The study involved a longitudinal sample of 420 children from 4 sites. Language skills, including grammar and vocabulary, were assessed annually with multiple measures. Multivariate latent growth curve modeling was used to examine the developmental trajectories of grammar and vocabulary, to test the correlation between the 2 domains, and to investigate the effects of demographic predictors on language growth. Results showed that both grammar and vocabulary exhibited decelerating growth from preschool to Grade 2. In Grade 3, grammar growth further flattened, whereas vocabulary continued to grow stably. Growth of vocabulary and grammar were positively correlated. Demographic characteristics, such as child gender and family socioeconomic status, were found to predict the intercept but not the slope of the growth trajectories. Children's growth in grammar skills is differentiated in a number of important ways from their growth in vocabulary skills. Results of this study suggest the need to differentiate these dimensions of language when seeking to closely examine growth from preschool to primary grades.

The graph representation approach to topological field theory in 2 + 1 dimensions

International Nuclear Information System (INIS)

Martin, S.P.

1991-02-01

An alternative definition of topological quantum field theory in 2+1 dimensions is discussed. The fundamental objects in this approach are not gauge fields as in the usual approach, but non-local observables associated with graphs. The classical theory of graphs is defined by postulating a simple diagrammatic rule for computing the Poisson bracket of any two graphs. The theory is quantized by exhibiting a quantum deformation of the classical Poisson bracket algebra, which is realized as a commutator algebra on a Hilbert space of states. The wavefunctions in this ''graph representation'' approach are functionals on an appropriate set of graphs. This is in contrast to the usual ''connection representation'' approach in which the theory is defined in terms of a gauge field and the wavefunctions are functionals on the space of flat spatial connections modulo gauge transformations

Where Is She? Gender Occurrences in Online Grammar Guides

Science.gov (United States)

Amare, Nicole

2007-01-01

This article examines seven online grammar guides for instances of linguistic sexism. The grammar sentences from .edu Websites were analyzed based on NCTE's "Guidelines for Gender-Fair Use of Language" (2002) using the criteria of generic he and man; titles, labels, and names; gender stereotypes; order of mention (firstness); and ratio of male to…

Linguistics deviation, a tool for teaching English grammar: evidence ...

African Journals Online (AJOL)

We have always advocated that those teaching the Use of English must seek out novel ways of teaching the grammar of English to take out the drudgery of the present approach. Here, we proposed using Linguistic deviation as a tool for teaching English grammar. This approach will produce students who are both strong in ...

Grammar and vocabulary for First and First for schools with answers

CERN Document Server

Thomas, Barbara; Matthews, Laura

2015-01-01

Grammar and Vocabulary reference and practice for the revised Cambridge English: First (FCE) and Cambridge English: First (FCE) for Schools from 2015 Cambridge Grammar and Vocabulary for First and First for Schools provides complete coverage of the grammar and vocabulary needed for the Cambridge First exams, and develops listening skills at the same time. It includes the full range of First and First for Schools exam tasks from the Reading and Use of English, Writing and Listening papers, and contains helpful grammar explanations. This edition is updated for the new exam to be introduced from 2015. It is informed by the Cambridge Learner Corpus to ensure that the language tackles real learner errors. The accompanying listening material is available online for download.

Grammar Engineering Support for Precedence Rule Recovery and Compatibility Checking

NARCIS (Netherlands)

Bouwers, E.; Bravenboer, M.; Visser, E.

2007-01-01

A wide range of parser generators are used to generate parsers for programming languages. The grammar formalisms that come with parser generators provide different approaches for defining operator precedence. Some generators (e.g. YACC) support precedence declarations, others require the grammar to

DIFFICULTIES IN TEACHING AND LEARNING GRAMMAR IN AN EFL CONTEXT

Directory of Open Access Journals (Sweden)

Abdu Mohammed Al-Mekhlafi

2011-07-01

Full Text Available The role of grammar instruction in an ESL/EFL context has been for decades a major issue for students and teachers alike. Researchers have debated whether grammar should be taught in the classroom and students, for their part, have generally looked upon grammar instruction as a necessary evil at best, and an avoidable burden at worst. The paper reports a study undertaken to investigate the difficulties teachers face in teaching grammar to EFL students as well as those faced by students in learning it, in the teachers' perception. The study aimed to find out whether there are significant differences in teachers' perceptions of difficulties in relation to their gender, qualification, teaching experience, and the level they teach in school, thus providing insights into their own and their students' difficulties. Mean scores and t-test were used to interpret the data. The main findings are reported with implications.

Chromatic graph theory

CERN Document Server

Chartrand, Gary; Rosen, Kenneth H

2008-01-01

Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, Chromatic Graph Theory explores connections between major topics in graph theory and graph colorings as well as emerging topics. This self-contained book first presents various fundamentals of graph theory that lie outside of graph colorings, including basic terminology and results, trees and connectivity, Eulerian and Hamiltonian graphs, matchings and factorizations, and graph embeddings. The remainder of the text deals exclusively with graph colorings. It covers vertex colorings and bounds for the chromatic number, vertex colorings of graphs embedded on surfaces, and a variety of restricted vertex colorings. The authors also describe edge colorings, monochromatic and rainbow edge colorings, complete vertex colorings, several distinguishing vertex and edge colorings, and many distance-related vertex coloring...

English Language Teaching Methods: State of the Art in Grammar Instruction

Directory of Open Access Journals (Sweden)

Rusdiana Junaid

2014-02-01

Full Text Available The teaching of grammar has fluctuated and shifted over years. This paper addresses issues such as different ways of teaching grammar, changes in ideas, and practices at the present stage of its development as well as the current state of the art in grammar instruction. Several grammar textbooks which were published in different years also are looked at in order to discover the extent of change in terms of the materials used to teach grammar from time to time. A considerable array of English language teaching methods is available for teacher to utilize since 1980s. Before deciding to employ a particular method, however, educational practitioners need to take several things into consideration such as the objectives of the instruction, the needs, the interests, the expectation, the age, and the level of the learners, and the available supporting facilities. Equally important, the possible constraints such as the environment where the students are learning, the time, and the expectation of the institution are also needed to be considered.

Construction and application research of knowledge graph in aviation risk field

Directory of Open Access Journals (Sweden)

Zhao Qian

2018-01-01

Full Text Available Since the causes of aviation accidents and risks are complicated, concealed, unpredictable and difficult to be investigated, in order to achieve the efficient organization and knowledge sharing of the historical cases of aviation risk events, this paper put forward the method of constructing vertical knowledge graph for aviation risk field. Firstly, the data-driven incremental construction technology is used to build aviation risk event ontology model. Secondly, the pattern-based knowledge mapping mechanism, which transform structured data into RDF (Resource Description Framework data for storage, is proposed. And then the application, update and maintenance of the knowledge graph are described. Finally, knowledge graph construction system in aviation risk field is developed; and the data from American Aviation Safety Reporting System (ASRS is used as an example to verify the rationality and validity of the knowledge graph construction method. Practice has proved that the construction of knowledge graph has a guiding significance for the case information organization and sharing on the field of aviation risk.

The Effects of Using Online Concordancers on Teaching Grammar

Science.gov (United States)

Türkmen, Yasemin; Aydin, Selami

2016-01-01

Studies conducted so far have mainly focused on the effects of online concordancers on teaching vocabulary, while there is a lack of research focusing on the effects of online concordancers on teaching and learning grammar. Thus, this study aims to review the studies on the effects of online concordancers on teaching and learning grammar and how…

Effect of Direct Grammar Instruction on Student Writing Skills

Science.gov (United States)

Robinson, Lisa; Feng, Jay

2016-01-01

Grammar Instruction has an important role to play in helping students to speak and write more effectively. The purpose of this study was to examine the effects of direct grammar instruction on the quality of student's writing skills. The participants in this study included 18 fifth grade students and two fifth grade teachers. Based on the results…

Concept-Based Grammar Teaching: An Academic Responds to Azar

Science.gov (United States)

Hill, Kent

2007-01-01

This response to Azar (this volume) intends to discuss from an academic's perspective the main points raised in her paper (i.e., grammar-based instruction and its relation to focus on form and error correction) and, to encourage a more concept-based approach to grammar instruction (CBT). A CBT approach to language development argues that the…

The Effectiveness of Grammar Learning in Impro ving Reading Comprehension of English Majors

Institute of Scientific and Technical Information of China (English)

田晓

2015-01-01

The importance of grammar knowledge has al-ways been neglected in reading comprehension. To help English teachers and learners see the value of grammar analysis, this pa-per, therefore, explores the correlation between grammar and reading comprehension. Forty-four freshmen of English majors were involved in the experiment, completing two tests of grammar and reading comprehension respectively, and it was followed by a personal interview for some exceptional cases after a week. The result of data analysis shows that grammar analysis accompanying with vocabulary, emotion, as well as other factors produce an ef-fect on learners’reading comprehension to a certain degree. It is suggested that language teachers as well as learners therefore should attach importance to learning grammatical knowledge.

Does complexity matter? Meta-analysis of learner performance in artificial grammar tasks.

Science.gov (United States)

Schiff, Rachel; Katan, Pesia

2014-01-01

Complexity has been shown to affect performance on artificial grammar learning (AGL) tasks (categorization of test items as grammatical/ungrammatical according to the implicitly trained grammar rules). However, previously published AGL experiments did not utilize consistent measures to investigate the comprehensive effect of grammar complexity on task performance. The present study focused on computerizing Bollt and Jones's (2000) technique of calculating topological entropy (TE), a quantitative measure of AGL charts' complexity, with the aim of examining associations between grammar systems' TE and learners' AGL task performance. We surveyed the literature and identified 56 previous AGL experiments based on 10 different grammars that met the sampling criteria. Using the automated matrix-lift-action method, we assigned a TE value for each of these 10 previously used AGL systems and examined its correlation with learners' task performance. The meta-regression analysis showed a significant correlation, demonstrating that the complexity effect transcended the different settings and conditions in which the categorization task was performed. The results reinforced the importance of using this new automated tool to uniformly measure grammar systems' complexity when experimenting with and evaluating the findings of AGL studies.

Automating 3D reconstruction using a probabilistic grammar

Science.gov (United States)

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.

Reconfiguring Independent Sets in Claw-Free Graphs

NARCIS (Netherlands)

Bonsma, P.S.; Kamiński, Marcin; Wrochna, Marcin; Ravi, R.; Gørtz, Inge Li

We present a polynomial-time algorithm that, given two independent sets in a claw-free graph G, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementary step is to remove a vertex v from the current independent set S and to add a new vertex w (not in

Using Webquest in Learning Grammar: Students' Perceptions in Higher Education

Directory of Open Access Journals (Sweden)

Ira Irzawati

2013-01-01

Full Text Available Webquest is an internet based learning tool that can be used by students in learning English. This study investigates students’ perceptions about the use of Webquest to support learning grammar in Higher Education. Seventy-two of second semester students were involved as participants in this study. Questionnaire and interview were used to collect the data. The data were analyzed quantitatively and qualitatively. The result of this study revealed that students had positive perceptions toward the use of Webquest in learning grammar. They believed that Webquest can be used as one of effective internet based learning tools in studying grammar.

The place of exclamatives and miratives in grammar: a functional discourse grammar view

NARCIS (Netherlands)

Olbertz, H.

2012-01-01

The concept of mirativity has come to interfere in the recently developed framework of Functional Discourse Grammar with what would be considered to be exclamative elsewhere. In addition, the concept of exclamative itself turns out to be ill-defined in various studies within the functional paradigm.

The Effects of Communicative Grammar Teaching on Students' Achievement of Grammatical Knowledge and Oral Production

Science.gov (United States)

Ho, Pham Vu Phi; The Binh, Nguyen

2014-01-01

So far the students of Le Hong Phong Junior High School have been taught grammar with GTM (Grammar-Translation Method), which just prepares learners for conventional grammar-paper tests. Despite their considerable knowledge of grammar, the students fail to use the language they have learnt to communicate in real-life situations. The purpose of…

Automated Understanding of Financial Statements Using Neural Networks and Semantic Grammars

OpenAIRE

Markovitch, J. S.

1995-01-01

This article discusses how neural networks and semantic grammars may be used to locate and understand financial statements embedded in news stories received from on-line news wires. A neural net is used to identify where in the news story a financial statement appears to begin. A grammar then is applied to this text in an effort to extract specific facts from the financial statement. Applying grammars to financial statements presents unique parsing problems since the dollar amounts of financi...

Tracking Down the Origins of Ambiguity in Context-Free Grammars

NARCIS (Netherlands)

H.J.S. Basten (Bas)

2010-01-01

htmlabstractContext-free grammars are widely used but still hindered by ambiguity. This stresses the need for detailed detection methods that point out the sources of ambiguity in a grammar. In this paper we show how the approximative Noncanonical Unambiguity Test by Schmitz can be extended to

Sensing the Sentence: An Embodied Simulation Approach to Rhetorical Grammar

Science.gov (United States)

Rule, Hannah J.

2017-01-01

This article applies the neuroscientific concept of embodied simulation--the process of understanding language through visual, motor, and spatial modalities of the body--to rhetorical grammar and sentence-style pedagogies. Embodied simulation invigorates rhetorical grammar instruction by attuning writers to the felt effects of written language,…

Information theory and artificial grammar learning: inferring grammaticality from redundancy.

Science.gov (United States)

Jamieson, Randall K; Nevzorova, Uliana; Lee, Graham; Mewhort, D J K

2016-03-01

In artificial grammar learning experiments, participants study strings of letters constructed using a grammar and then sort novel grammatical test exemplars from novel ungrammatical ones. The ability to distinguish grammatical from ungrammatical strings is often taken as evidence that the participants have induced the rules of the grammar. We show that judgements of grammaticality are predicted by the local redundancy of the test strings, not by grammaticality itself. The prediction holds in a transfer test in which test strings involve different letters than the training strings. Local redundancy is usually confounded with grammaticality in stimuli widely used in the literature. The confounding explains why the ability to distinguish grammatical from ungrammatical strings has popularized the idea that participants have induced the rules of the grammar, when they have not. We discuss the judgement of grammaticality task in terms of attribute substitution and pattern goodness. When asked to judge grammaticality (an inaccessible attribute), participants answer an easier question about pattern goodness (an accessible attribute).

Compiling a corpus-based dictionary grammar: an example for ...

African Journals Online (AJOL)

In this article it is shown how a corpus-based dictionary grammar may be compiled — that is, a mini-grammar fully based on corpus data and specifically written for use in and inte-grated with a dictionary. Such an effort is, to the best of our knowledge, a world's first. We exem-plify our approach for a Northern Sotho ...

A Grammar of Bih

Science.gov (United States)

Nguyen, Tam Thi Minh

2013-01-01

Bih is a Chamic (Austronesian) language spoken by approximately 500 people in the Southern highlands of Vietnam. This dissertation is the first descriptive grammar of the language, based on extensive fieldwork and community-based language documentation in Vietnam and written from a functional/typological perspective. The analysis in this work is…

A grammar of Lepcha

NARCIS (Netherlands)

Plaisier, Heleen

2006-01-01

This book is a descriptive grammar of Lepcha, a Tibeto-Burman language spoken in Sikkim, Darjeeling district in West Bengal in India, in Ilam district in Nepal, and in a few villages of Samtsi district in south-western Bhutan. The data for this study were collected during several sojourns amongst

Environmental Peace Education in Foreign Language Learners' English Grammar Lessons

Science.gov (United States)

Arikan, Arda

2009-01-01

English language teachers create contexts to teach grammar so that meaningful learning occurs. In this study, English grammar is contextualized through environmental peace education activities to raise students' awareness of global issues. Two sources provided data to evaluate the success of this instructional process. Fourth-year pre-service…

Graph sampling

OpenAIRE

Zhang, L.-C.; Patone, M.

2017-01-01

We synthesise the existing theory of graph sampling. We propose a formal definition of sampling in finite graphs, and provide a classification of potential graph parameters. We develop a general approach of Horvitz–Thompson estimation to T-stage snowball sampling, and present various reformulations of some common network sampling methods in the literature in terms of the outlined graph sampling theory.

Grammar Is a System That Characterizes Talk in Interaction.

Science.gov (United States)

Ginzburg, Jonathan; Poesio, Massimo

2016-01-01

Much of contemporary mainstream formal grammar theory is unable to provide analyses for language as it occurs in actual spoken interaction. Its analyses are developed for a cleaned up version of language which omits the disfluencies, non-sentential utterances, gestures, and many other phenomena that are ubiquitous in spoken language. Using evidence from linguistics, conversation analysis, multimodal communication, psychology, language acquisition, and neuroscience, we show these aspects of language use are rule governed in much the same way as phenomena captured by conventional grammars. Furthermore, we argue that over the past few years some of the tools required to provide a precise characterizations of such phenomena have begun to emerge in theoretical and computational linguistics; hence, there is no reason for treating them as "second class citizens" other than pre-theoretical assumptions about what should fall under the purview of grammar. Finally, we suggest that grammar formalisms covering such phenomena would provide a better foundation not just for linguistic analysis of face-to-face interaction, but also for sister disciplines, such as research on spoken dialogue systems and/or psychological work on language acquisition.

Inductive vs. Deductive Grammar Instruction and the Grammatical Performance of EFL Learners

Directory of Open Access Journals (Sweden)

Fatemeh Behjat

2008-02-01

Full Text Available Learning a foreign language offers a great challenge to students since it involves learning different skills and subskills. Quite a few number of researches have been done so far on the relationship between gender and learning a foreign language. On the other hand, two major approaches in teaching grammar have been offered by language experts, inductive and deductive. The present study examines which method of teaching grammar is more fruitful for Iranian male and female students. For this purpose, 150 freshman students, 110 females and 40 males, majoring in English were selected from all available students at Abadeh and Shiraz Azad universities. All the subjects took the NTC's grammar test prior to the instruction as pre-test. Then, they were divided into two groups and were taught grammar inductively and deductively in each group for one semester. At the end of the instruction, the same test was taken as post-test. The comparison between the students' pre and post-test indicated that there was a significant improvement in their knowledge of grammar. By the way, through a two-way ANOVA, it was found out that males learned grammar better when they were taught inductively and females showed a better performance when they were taught deductively.

Algorithms for Planar Graphs and Graphs in Metric Spaces

DEFF Research Database (Denmark)

Wulff-Nilsen, Christian

structural properties that can be exploited. For instance, a road network or a wire layout on a microchip is typically (near-)planar and distances in the network are often defined w.r.t. the Euclidean or the rectilinear metric. Specialized algorithms that take advantage of such properties are often orders...... of magnitude faster than the corresponding algorithms for general graphs. The first and main part of this thesis focuses on the development of efficient planar graph algorithms. The most important contributions include a faster single-source shortest path algorithm, a distance oracle with subquadratic...... for geometric graphs and graphs embedded in metric spaces. Roughly speaking, the stretch factor is a real value expressing how well a (geo-)metric graph approximates the underlying complete graph w.r.t. distances. We give improved algorithms for computing the stretch factor of a given graph and for augmenting...

Negative Transfer of L1 on English Grammar Learning in SLA

Institute of Scientific and Technical Information of China (English)

马秀琳

2015-01-01

At present,many scholars pay more attention to the positive transfer of native language on the English learning,while ignoring the negative transfer of L1 on English grammar learning.Therefore native transfer of L1 often appears on English grammar learning.This paper aims to point out that the negative transfer of L1 has a profound and vast influence on the English grammar learning,to find out the countermeasures to reduce the influence of negative transfer of L1 and finally to bring the benefits to the following relative studies.

Grammar-Lexicon Distinction in a Neurocognitive Context

DEFF Research Database (Denmark)

Ishkhanyan, Byurakn

hypotheses and testing them through using various methods. The grammar-lexicon distinction and working memory are thus central topics of this thesis. The results suggest a potential for a successful integration of the two theories. The findings further provide evidence for Boye & Harder’s (2012......) understanding of the grammar-lexicon distinction, and for the involvement of working memory in language production, as the REF-model would predict. As a starting point for integrating the two theories, the present thesis gives directions for future research on the neurocognitive underpinning of language and its...... relation to working memory....

Transfer and access to universal grammar in adult second language acquisition

NARCIS (Netherlands)

Sauter, Kim

2002-01-01

Summary This dissertation focuses on the roles of first language transfer and Universal Grammar in adult second (or foreign) language acquisition. It contributes to the ongoing debate whether second language acquisition is constrained by Universal Grammar. According to generative linguists,

The Role of Grammar in the Writing Curriculum: A Review of the Literature

Science.gov (United States)

Myhill, Debra; Watson, Annabel

2014-01-01

For most Anglophone countries, the history of grammar teaching over the past 50 years is one of contestation, debate and dissent: and 50 years on we are no closer to reaching a consensus about the role of grammar in the English/Language Arts curriculum. The debate has been described through the metaphor of battle and grammar wars (Kamler, 1995;…

A stochastic context free grammar based framework for analysis of protein sequences

Directory of Open Access Journals (Sweden)

Nebel Jean-Christophe

2009-10-01

Full Text Available Abstract Background In the last decade, there have been many applications of formal language theory in bioinformatics such as RNA structure prediction and detection of patterns in DNA. However, in the field of proteomics, the size of the protein alphabet and the complexity of relationship between amino acids have mainly limited the application of formal language theory to the production of grammars whose expressive power is not higher than stochastic regular grammars. However, these grammars, like other state of the art methods, cannot cover any higher-order dependencies such as nested and crossing relationships that are common in proteins. In order to overcome some of these limitations, we propose a Stochastic Context Free Grammar based framework for the analysis of protein sequences where grammars are induced using a genetic algorithm. Results This framework was implemented in a system aiming at the production of binding site descriptors. These descriptors not only allow detection of protein regions that are involved in these sites, but also provide insight in their structure. Grammars were induced using quantitative properties of amino acids to deal with the size of the protein alphabet. Moreover, we imposed some structural constraints on grammars to reduce the extent of the rule search space. Finally, grammars based on different properties were combined to convey as much information as possible. Evaluation was performed on sites of various sizes and complexity described either by PROSITE patterns, domain profiles or a set of patterns. Results show the produced binding site descriptors are human-readable and, hence, highlight biologically meaningful features. Moreover, they achieve good accuracy in both annotation and detection. In addition, findings suggest that, unlike current state-of-the-art methods, our system may be particularly suited to deal with patterns shared by non-homologous proteins. Conclusion A new Stochastic Context Free

Functional Orientation and Practice of Inductive and Deductive Approaches to Grammar Teaching in EFL

Institute of Scientific and Technical Information of China (English)

邵阳

2011-01-01

To solve the ambiguous understanding of Grammar Teaching position,based on explicit grammatical knowledge,this paper discusses the grammar position in EFL,compares both its pros and cons between deductive and inductive approaches,and indicates that grammar teaching by either approach alone has disadvantages,should adopt a combination technique.

Pre-Service English Teachers’ Beliefs Towards Grammar And Its Teaching At Two Turkish Universities

Directory of Open Access Journals (Sweden)

İsmail Zeki DİKİCİ

2012-07-01

Full Text Available This paper examines pre-service English teachers’ beliefs towards grammar studying at two Turkish Universities. A total of 90 pre-service English teachers, 57 of whom were studying at Muğla University and 33 of whom were studying at Onsekiz Mart University in Turkey, were involved in this study. The research participants completed two questionnaires. The aim of this paper is to look into pre-service English teachers’ beliefs towards grammar and its teaching as well as their knowledge on the metalanguage of grammar. The findings reveal that although a great majority of the participants favour the use of metalanguage in teaching grammar, and support the deductive grammar teaching practises, they themselves still have serious problems even with the most basic grammatical terminology.

REA's handbook of English grammar, style, and writing

CERN Document Server

REA, The Editors of

1992-01-01

The ability to write and speak correctly and effectively is a prerequisite for doing well in all subjects, including the physical and social sciences, math and the liberal arts. Writing and speaking skills become even more important when seeking a job and trying to succeed in a chosen career. This easy-to-understand, straightforward English handbook does not use the hard-to-understand technical jargon usually found in English grammar books. Instead, this handbook provides hundreds of examples from which it is possible to easily see what is correct and what is incorrect in all areas of English grammar and writing. Learn quickly and easily: 1. Rules and exceptions in grammar, 2. Spelling and proper punctuation, 3. Common errors in sentence structure, 4. 2,000 examples of correct usage, and 5. Effective writing skills. Complete practice exercises with answers follow each chapter.The handbook covers the following in detail: nouns, verbs, adjectives, paragraphs, composition, punctuation, spelling, and much more. A...

Regularization of EIT reconstruction based on multi-scales wavelet transforms

Directory of Open Access Journals (Sweden)

Gong Bo

2016-09-01

Full Text Available Electrical Impedance Tomography (EIT intends to obtain the conductivity distribution of a domain from the electrical boundary conditions. This is an ill-posed inverse problem usually solved on finite element meshes. Wavelet transforms are widely used for medical image reconstruction. However, because of the irregular form of the finite element meshes, the canonical wavelet transforms is impossible to perform on meshes. In this article, we present a framework that combines multi-scales wavelet transforms and finite element meshes by viewing meshes as undirected graphs and applying spectral graph wavelet transform on the meshes.

Current Issues in the Teaching of Grammar: An SLA Perspective

Science.gov (United States)

Ellis, Rod

2006-01-01

The study of how learners acquire a second language (SLA) has helped to shape thinking about how to teach the grammar of a second language. There remain, however, a number of controversial issues. This paper considers eight key questions relating to grammar pedagogy in the light of findings from SLA. As such, this article complements…

Noticing Grammar in L2 Writing and Problem-Solving Strategies

Science.gov (United States)

Geist, Monika

2017-01-01

Noticing plays an important role for second language acquisition. Since the formulation of the output hypothesis (Swain, 1985), it has been proven that producing output can lead to noticing. Studies on noticing have revealed little focus on grammar, and an in-depth investigation of grammar noticing has not been conducted so far. Studies into…

Strategies Study On Communicative Awareness-raising Approachof Grammar Teaching for English Majors

Institute of Scientific and Technical Information of China (English)

吴俊芳; 童心

2013-01-01

The traditional grammar teaching method can’t make learners communicate in real contexts accurately and luently.The author will probe the effects of communicative approach applied in grammar teaching in this essay.

Degree Associated Edge Reconstruction Number of Graphs with Regular Pruned Graph

Directory of Open Access Journals (Sweden)

P. Anusha Devi

2015-10-01

Full Text Available An ecard of a graph $G$ is a subgraph formed by deleting an edge. A da-ecard specifies the degree of the deleted edge along with the ecard. The degree associated edge reconstruction number of a graph $G,~dern(G,$ is the minimum number of da-ecards that uniquely determines $G.$  The adversary degree associated edge reconstruction number of a graph $G, adern(G,$ is the minimum number $k$ such that every collection of $k$ da-ecards of $G$ uniquely determines $G.$ The maximal subgraph without end vertices of a graph $G$ which is not a tree is the pruned graph of $G.$ It is shown that $dern$ of complete multipartite graphs and some connected graphs with regular pruned graph is $1$ or $2.$ We also determine $dern$ and $adern$ of corona product of standard graphs.

Freshman Students‟ Attitudes and Behavior towards Advanced Grammar and Composition Teaching

Directory of Open Access Journals (Sweden)

Romel M. Aceron

2015-11-01

Full Text Available Teaching English advanced grammar and composition to college students is important as it provides them with high level of understanding and competence in the language. It guides them in putting words together into sentences and makes them orally produce sounds clearly and effectively. This paper aims to determine the attitudes and behavior towards advanced grammar and composition teaching among freshman college students of Batangas State University. Descriptive method of research has been used to analyze and interpret data. The following instruments such as self-made questionnaire, focus group discussion, data analysis, interview guide, have been utilized to gather data. To analyze and interpret data, mean scores have been used. Pearson’s (r Product Moment Correlation Method has been utilized to treat the null hypothesis with regard to the attitudes and behavior of the students towards advanced grammar and composition teaching. Based on the findings of the study, the students sometimes understand and feel the subject matters, i.e., morphology, phonology, grammar and usage, and mechanics and composition writing. They are also sometimes ready in particular lesson and activity which are given to them in class. The study also reveals that there is no significant relationship between the students’ attitudes and behavior towards AGCT. In this regard, college students taking advanced grammar and composition course must be well-motivated to understand, and must have the readiness to perform the activities entail in the subject areas of morphology, phonology, grammar and usage, and mechanics and composition writing through teacher’s varied approaches, strategies, researches, and integration.

Learning of pitch and time structures in an artificial grammar setting.

Science.gov (United States)

Prince, Jon B; Stevens, Catherine J; Jones, Mari Riess; Tillmann, Barbara

2018-04-12

Despite the empirical evidence for the power of the cognitive capacity of implicit learning of structures and regularities in several modalities and materials, it remains controversial whether implicit learning extends to the learning of temporal structures and regularities. We investigated whether (a) an artificial grammar can be learned equally well when expressed in duration sequences as when expressed in pitch sequences, (b) learning of the artificial grammar in either duration or pitch (as the primary dimension) sequences can be influenced by the properties of the secondary dimension (invariant vs. randomized), and (c) learning can be boosted when the artificial grammar is expressed in both pitch and duration. After an exposure phase with grammatical sequences, learning in a subsequent test phase was assessed in a grammaticality judgment task. Participants in both the pitch and duration conditions showed incidental (not fully implicit) learning of the artificial grammar when the secondary dimension was invariant, but randomizing the pitch sequence prevented learning of the artificial grammar in duration sequences. Expressing the artificial grammar in both pitch and duration resulted in disproportionately better performance, suggesting an interaction between the learning of pitch and temporal structure. The findings are relevant to research investigating the learning of temporal structures and the learning of structures presented simultaneously in 2 dimensions (e.g., space and time, space and objects). By investigating learning, the findings provide further insight into the potential specificity of pitch and time processing, and their integrated versus independent processing, as previously debated in music cognition research. (PsycINFO Database Record (c) 2018 APA, all rights reserved).

Textual, Genre and Social Features of Spoken Grammar: A Corpus-Based Approach

Directory of Open Access Journals (Sweden)

Carmen Pérez-Llantada

2009-02-01

Full Text Available This paper describes a corpus-based approach to teaching and learning spoken grammar for English for Academic Purposes with reference to Bhatia’s (2002 multi-perspective model for discourse analysis: a textual perspective, a genre perspective and a social perspective. From a textual perspective, corpus-informed instruction helps students identify grammar items through statistical frequencies, collocational patterns, context-sensitive meanings and discoursal uses of words. From a genre perspective, corpus observation provides students with exposure to recurrent lexico-grammatical patterns across different academic text types (genres. From a social perspective, corpus models can be used to raise learners’ awareness of how speakers’ different discourse roles, discourse privileges and power statuses are enacted in their grammar choices. The paper describes corpus-based instructional procedures, gives samples of learners’ linguistic output, and provides comments on the students’ response to this method of instruction. Data resulting from the assessment process and student production suggest that corpus-informed instruction grounded in Bhatia’s multi-perspective model can constitute a pedagogical approach in order to i obtain positive student responses from input and authentic samples of grammar use, ii help students identify and understand the textual, genre and social aspects of grammar in real contexts of use, and therefore iii help develop students’ ability to use grammar accurately and appropriately.

Existential Grammar for Composition.

Science.gov (United States)

Merchant, Frank

The teaching of grammar has been in sad decline since medieval times, when it included the whole skill of creating in language. Our textbook community has moved through a series of ineffective fashions, from those of Fries to post-Chomsky. All have presumed to replace prescriptive rules with realistic explanations. But all have fallen, like the…

Introduction to graph theory

CERN Document Server

Trudeau, Richard J

1994-01-01

Preface1. Pure Mathematics Introduction; Euclidean Geometry as Pure Mathematics; Games; Why Study Pure Mathematics?; What's Coming; Suggested Reading2. Graphs Introduction; Sets; Paradox; Graphs; Graph diagrams; Cautions; Common Graphs; Discovery; Complements and Subgraphs; Isomorphism; Recognizing Isomorphic Graphs; Semantics The Number of Graphs Having a Given nu; Exercises; Suggested Reading3. Planar Graphs Introduction; UG, K subscript 5, and the Jordan Curve Theorem; Are there More Nonplanar Graphs?; Expansions; Kuratowski's Theorem; Determining Whether a Graph is Planar or

Graph Theory. 2. Vertex Descriptors and Graph Coloring

Directory of Open Access Journals (Sweden)

Lorentz JÄNTSCHI

2002-12-01

Full Text Available This original work presents the construction of a set of ten sequence matrices and their applications for ordering vertices in graphs. For every sequence matrix three ordering criteria are applied: lexicographic ordering, based on strings of numbers, corresponding to every vertex, extracted as rows from sequence matrices; ordering by the sum of path lengths from a given vertex; and ordering by the sum of paths, starting from a given vertex. We also examine a graph that has different orderings for the above criteria. We then proceed to demonstrate that every criterion induced its own partition of graph vertex. We propose the following theoretical result: both LAVS and LVDS criteria generate identical partitioning of vertices in any graph. Finally, a coloring of graph vertices according to introduced ordering criteria was proposed.

On an edge partition and root graphs of some classes of line graphs

Directory of Open Access Journals (Sweden)

K Pravas

2017-04-01

Full Text Available The Gallai and the anti-Gallai graphs of a graph $G$ are complementary pairs of spanning subgraphs of the line graph of $G$. In this paper we find some structural relations between these graph classes by finding a partition of the edge set of the line graph of a graph $G$ into the edge sets of the Gallai and anti-Gallai graphs of $G$. Based on this, an optimal algorithm to find the root graph of a line graph is obtained. Moreover, root graphs of diameter-maximal, distance-hereditary, Ptolemaic and chordal graphs are also discussed.

Graphs and matrices

CERN Document Server

Bapat, Ravindra B

2014-01-01

This new edition illustrates the power of linear algebra in the study of graphs. The emphasis on matrix techniques is greater than in other texts on algebraic graph theory. Important matrices associated with graphs (for example, incidence, adjacency and Laplacian matrices) are treated in detail. Presenting a useful overview of selected topics in algebraic graph theory, early chapters of the text focus on regular graphs, algebraic connectivity, the distance matrix of a tree, and its generalized version for arbitrary graphs, known as the resistance matrix. Coverage of later topics include Laplacian eigenvalues of threshold graphs, the positive definite completion problem and matrix games based on a graph. Such an extensive coverage of the subject area provides a welcome prompt for further exploration. The inclusion of exercises enables practical learning throughout the book. In the new edition, a new chapter is added on the line graph of a tree, while some results in Chapter 6 on Perron-Frobenius theory are reo...

Towards a Rationale for Research into Grammar Teaching in Schools

Science.gov (United States)

Fontich, Xavier; Camps, Anna

2014-01-01

This article hopes to bring new insights to the debate about the effect of grammar knowledge on language use, especially writing. It raises the question of the need to look more closely at the following three questions: (1) What is the aim of grammar teaching?; (2) How capable are students of conceptualising about language and how is their…

Functional Grammar and Its Implications for English Teaching and Learning

Science.gov (United States)

Feng, Zhiwen

2013-01-01

Functional grammar has received more and more attention from domestic scholars in the world of linguistics since 1970s, but it is still new to most EFL teachers. In spite of controversies about its applications into classroom teaching, this new grammar model has its own advantages and can facilitate EFL students to achieve academic success. This…

Linguistic grammar learning and DRD2-TAQ-IA polymorphism.

Science.gov (United States)

Wong, Patrick C M; Ettlinger, Marc; Zheng, Jing

2013-01-01

As research into the neurobiology of language has focused primarily on the systems level, fewer studies have examined the link between molecular genetics and normal variations in language functions. Because the ability to learn a language varies in adults and our genetic codes also vary, research linking the two provides a unique window into the molecular neurobiology of language. We consider a candidate association between the dopamine receptor D2 gene (DRD2) and linguistic grammar learning. DRD2-TAQ-IA polymorphism (rs1800497) is associated with dopamine receptor D2 distribution and dopamine impact in the human striatum, such that A1 allele carriers show reduction in D2 receptor binding relative to carriers who are homozygous for the A2 allele. The individual differences in grammatical rule learning that are particularly prevalent in adulthood are also associated with striatal function and its role in domain-general procedural memory. Therefore, we reasoned that procedurally-based grammar learning could be associated with DRD2-TAQ-IA polymorphism. Here, English-speaking adults learned artificial concatenative and analogical grammars, which have been respectively associated with procedural and declarative memory. Language learning capabilities were tested while learners' neural hemodynamic responses were simultaneously measured by fMRI. Behavioral learning and brain activation data were subsequently compared with the learners' DRD2 (rs1800497) genotype. Learners who were homozygous for the A2 allele were better at concatenative (but not analogical) grammar learning and had higher striatal responses relative to those who have at least one A1 allele. These results provide preliminary evidence for the neurogenetic basis of normal variations in linguistic grammar learning and its link to domain-general functions.

Graphs cospectral with a friendship graph or its complement

Directory of Open Access Journals (Sweden)

Alireza Abdollahi

2013-12-01

Full Text Available Let $n$ be any positive integer and let $F_n$ be the friendship (or Dutch windmill graph with $2n+1$ vertices and $3n$ edges. Here we study graphs with the same adjacency spectrum as the $F_n$. Two graphs are called cospectral if the eigenvalues multiset of their adjacency matrices are the same. Let $G$ be a graph cospectral with $F_n$. Here we prove that if $G$ has no cycle of length $4$ or $5$, then $Gcong F_n$. Moreover if $G$ is connected and planar then $Gcong F_n$.All but one of connected components of $G$ are isomorphic to $K_2$.The complement $overline{F_n}$ of the friendship graph is determined by its adjacency eigenvalues, that is, if $overline{F_n}$ is cospectral with a graph $H$, then $Hcong overline{F_n}$.

The Influence of Texting Language on Grammar and Executive Functions in Primary School Children.

Science.gov (United States)

van Dijk, Chantal N; van Witteloostuijn, Merel; Vasić, Nada; Avrutin, Sergey; Blom, Elma

2016-01-01

When sending text messages on their mobile phone to friends, children often use a special type of register, which is called textese. This register allows the omission of words and the use of textisms: instances of non-standard written language such as 4ever (forever). Previous studies have shown that textese has a positive effect on children's literacy abilities. In addition, it is possible that children's grammar system is affected by textese as well, as grammar rules are often transgressed in this register. Therefore, the main aim of this study was to investigate whether the use of textese influences children's grammar performance, and whether this effect is specific to grammar or language in general. Additionally, studies have not yet investigated the influence of textese on children's cognitive abilities. Consequently, the secondary aim of this study was to find out whether textese affects children's executive functions. To investigate this, 55 children between 10 and 13 years old were tested on a receptive vocabulary and grammar performance (sentence repetition) task and various tasks measuring executive functioning. In addition, text messages were elicited and the number of omissions and textisms in children's messages were calculated. Regression analyses showed that omissions were a significant predictor of children's grammar performance after various other variables were controlled for: the more words children omitted in their text messages, the better their performance on the grammar task. Although textisms correlated (marginally) significantly with vocabulary, grammar and selective attention scores and omissions marginally significantly with vocabulary scores, no other significant effects were obtained for measures of textese in the regression analyses: neither for the language outcomes, nor for the executive function tasks. Hence, our results show that textese is positively related to children's grammar performance. On the other hand, use of textese does

Using Games in Primary Schools for Effective Grammar Teaching: a Case Study from Sebha

Directory of Open Access Journals (Sweden)

Mustafa Mubarak Pathan

2014-06-01

Full Text Available Teaching and learning a foreign language like English is not easy task. The situation become more difficult when the learners are primary school children and teaching and learning focus is grammar, an activity often regarded as ‘boring, ‘uninteresting’ and ‘’tedious’. However, one’s mastery over a language is determined by the appropriate use of language by that individual following grammatical rules and failing to follow the rules of grammar marks one’s use of language as erroneous. Therefore, systematic attempt is done to teach grammatical rules and structures to the language learners from the beginning of language teaching and learning process. However, the success or failure of learning, mastering and using the grammatical rules and structures is largely determined by the technique and approach used by the grammar teacher to teach. The leaner-cantered, interesting, motivating technique of grammar teaching is believed to generate positive results whereas traditional, teacher-centered, uninteresting, uninvolving method is believed to be a cause of failure for learners to learn and master grammar rules and structures. Therefore, the grammar teaching technique, which involves language learners, to maximum, in learning in amusing and creative way, motivating, challenging and stimulating his/her mental processes, and reducing classroom anxiety and fear, is desired and recommended for fruitful language teaching and learning process. In this respect, the present paper discusses the effectiveness of using games for teaching grammar to primary school students as a technique which could easily be utilised and exploited for maximum benefits for learners. The study is based on the practical experiment done on the students of two primary schools in Sebha city of Libya using grammar games. The results, which proved to be fruitful and positive, are discussed as a basis for the argument in support of using games for teaching grammar to school

The Influence of Texting Language on Grammar and Executive Functions in Primary School Children.

Directory of Open Access Journals (Sweden)

Chantal N van Dijk

Full Text Available When sending text messages on their mobile phone to friends, children often use a special type of register, which is called textese. This register allows the omission of words and the use of textisms: instances of non-standard written language such as 4ever (forever. Previous studies have shown that textese has a positive effect on children's literacy abilities. In addition, it is possible that children's grammar system is affected by textese as well, as grammar rules are often transgressed in this register. Therefore, the main aim of this study was to investigate whether the use of textese influences children's grammar performance, and whether this effect is specific to grammar or language in general. Additionally, studies have not yet investigated the influence of textese on children's cognitive abilities. Consequently, the secondary aim of this study was to find out whether textese affects children's executive functions. To investigate this, 55 children between 10 and 13 years old were tested on a receptive vocabulary and grammar performance (sentence repetition task and various tasks measuring executive functioning. In addition, text messages were elicited and the number of omissions and textisms in children's messages were calculated. Regression analyses showed that omissions were a significant predictor of children's grammar performance after various other variables were controlled for: the more words children omitted in their text messages, the better their performance on the grammar task. Although textisms correlated (marginally significantly with vocabulary, grammar and selective attention scores and omissions marginally significantly with vocabulary scores, no other significant effects were obtained for measures of textese in the regression analyses: neither for the language outcomes, nor for the executive function tasks. Hence, our results show that textese is positively related to children's grammar performance. On the other hand

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...

Grammar Correction in the Writing Centre: Expectations and Experiences of Monolingual and Multilingual Writers

Science.gov (United States)

Eckstein, Grant

2016-01-01

Although most writing centres maintain policies against providing grammar correction during writing tutorials, it is undeniable that students expect some level of grammar intervention there. Just how much students expect and receive is a matter of speculation. This article examines the grammar-correction issue by reporting on a survey of L1, L2,…

Deriving a probabilistic syntacto-semantic grammar for biomedicine based on domain-specific terminologies.

Science.gov (United States)

Fan, Jung-Wei; Friedman, Carol

2011-10-01

Biomedical natural language processing (BioNLP) is a useful technique that unlocks valuable information stored in textual data for practice and/or research. Syntactic parsing is a critical component of BioNLP applications that rely on correctly determining the sentence and phrase structure of free text. In addition to dealing with the vast amount of domain-specific terms, a robust biomedical parser needs to model the semantic grammar to obtain viable syntactic structures. With either a rule-based or corpus-based approach, the grammar engineering process requires substantial time and knowledge from experts, and does not always yield a semantically transferable grammar. To reduce the human effort and to promote semantic transferability, we propose an automated method for deriving a probabilistic grammar based on a training corpus consisting of concept strings and semantic classes from the Unified Medical Language System (UMLS), a comprehensive terminology resource widely used by the community. The grammar is designed to specify noun phrases only due to the nominal nature of the majority of biomedical terminological concepts. Evaluated on manually parsed clinical notes, the derived grammar achieved a recall of 0.644, precision of 0.737, and average cross-bracketing of 0.61, which demonstrated better performance than a control grammar with the semantic information removed. Error analysis revealed shortcomings that could be addressed to improve performance. The results indicated the feasibility of an approach which automatically incorporates terminology semantics in the building of an operational grammar. Although the current performance of the unsupervised solution does not adequately replace manual engineering, we believe once the performance issues are addressed, it could serve as an aide in a semi-supervised solution. Copyright © 2011 Elsevier Inc. All rights reserved.

THE USE OF THE GRAMMAR-TRANSLATION METHOD IN CHINA

Institute of Scientific and Technical Information of China (English)

1994-01-01

Introduction Among the plethora of foreign language teaching methods and approaches there are the grammar-translation method, the direct method, the audiolingual method and the communicative approach to name but a few. Of the major methods, grammar-translation gets the most criticism and is thought to be obsolete. However, in my view it is suitable for China given the country’s present language learning situation, and, in practice, is not at all ineffectual.

Grammar Learning Strategies and Language Attainment: Seeking a Relationship

OpenAIRE

Pawlak Mirosław

2009-01-01

Despite major advances in research on language learning strategies, there are still areas that have received only scant attention, and one of them is undoubtedly learning grammar. The paper contributes to the paucity of empirical investigations in this domain by presenting the findings of a study which sought to investigate the relationship between the use of grammar learning strategies (GLS) reported by 142 English Department students and target language attainment, operationalized as their ...

How to describe grammar and vocabulary in ELT

CERN Document Server

Liu, Dilin

2013-01-01

Language description plays an important role in language learning/teaching because it often determines what specific language forms, features, and usages are taught and how. A good understanding of language description is vital for language teachers and material writers and should constitute an important part of their knowledge. This book provides a balanced treatment of both theory and practice. It focuses on some of the most important and challenging grammar and vocabulary usage questions. Using these questions as examples, it shows how theory can inform practice and how grammar and vocab

Systemic functional grammar in natural language generation linguistic description and computational representation

CERN Document Server

Teich, Elke

1999-01-01

This volume deals with the computational application of systemic functional grammar (SFG) for natural language generation. In particular, it describes the implementation of a fragment of the grammar of German in the computational framework of KOMET-PENMAN for multilingual generation. The text also presents a specification of explicit well-formedness constraints on syntagmatic structure which are defined in the form of typed feature structures. It thus achieves a model of systemic functional grammar that unites both the strengths of systemics, such as stratification, functional diversification

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-11-12

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most existing algorithms for graph embedding only rely on the topology information and fail to use the copious information in nodes as well as edges. As a result, their performance for many tasks may not be satisfactory. In this thesis, we proposed a novel and general framework for graph embedding with rich text information (GERI) through constructing a heterogeneous network, in which we integrate node and edge content information with graph topology. Specially, we designed a novel biased random walk to explore the constructed heterogeneous network with the notion of flexible neighborhood. Our sampling strategy can compromise between BFS and DFS local search on heterogeneous graph. To further improve our algorithm, we proposed semi-supervised GERI (SGERI), which learns graph embedding in an discriminative manner through heterogeneous network with label information. The efficacy of our method is demonstrated by extensive comparison experiments with 9 baselines over multi-label and multi-class classification on various datasets including Citeseer, Cora, DBLP and Wiki. It shows that GERI improves the Micro-F1 and Macro-F1 of node classification up to 10%, and SGERI improves GERI by 5% in Wiki.

Topics in graph theory graphs and their Cartesian product

CERN Document Server

Imrich, Wilfried; Rall, Douglas F

2008-01-01

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way, this book can be used for personal study in advanced applications of graph theory or for an advanced graph theory course.

Study of Chromatic parameters of Line, Total, Middle graphs and Graph operators of Bipartite graph

Science.gov (United States)

Nagarathinam, R.; Parvathi, N.

2018-04-01

Chromatic parameters have been explored on the basis of graph coloring process in which a couple of adjacent nodes receives different colors. But the Grundy and b-coloring executes maximum colors under certain restrictions. In this paper, Chromatic, b-chromatic and Grundy number of some graph operators of bipartite graph has been investigat

Input-Based Approaches to Teaching Grammar: A Review of Classroom-Oriented Research.

Science.gov (United States)

Ellis, Rod

1999-01-01

Examines the theoretical rationales (universal grammar, information-processing theories, skill-learning theories) for input-based grammar teaching and reviews classroom-oriented research (i.e., enriched-input studies, input-processing studies) that has integrated this option. (Author/VWL)

Connectivity of the hippocampus and Broca's area during acquisition of a novel grammar.

Science.gov (United States)

Kepinska, Olga; de Rover, Mischa; Caspers, Johanneke; Schiller, Niels O

2018-01-15

Following Opitz and Friederici (2003) suggesting interactions of the hippocampal system and the prefrontal cortex as the neural mechanism underlying novel grammar learning, the present fMRI study investigated functional connectivity of bilateral BA 44/45 and the hippocampus during an artificial grammar learning (AGL) task. Our results, contrary to the previously reported interactions, demonstrated parallel (but separate) contributions of both regions, each with their own interactions, to the process of novel grammar acquisition. The functional connectivity pattern of Broca's area pointed to the importance of coherent activity of left frontal areas around the core language processing region for successful grammar learning. Furthermore, connectivity patterns of left and right hippocampi (predominantly with occipital areas) were found to be a strong predictor of high performance on the task. Finally, increasing functional connectivity over time of both left and right BA 44/45 with the right posterior cingulate cortex and the right temporo-parietal areas points to the importance of multimodal and attentional processes supporting novel grammar acquisition. Moreover, it highlights the right-hemispheric involvement in initial stages of L2 learning. These latter interactions were found to operate irrespective of the task performance, making them an obligatory mechanism accompanying novel grammar learning. Copyright © 2017 Elsevier Inc. All rights reserved.

The Journalism Writing Course: Evaluation of Hybrid versus Online Grammar Instruction

Science.gov (United States)

Moore, Jensen; Jones, Khristen

2015-01-01

This study examined introductory journalism writing courses and compared hybrid (part online/part classroom) versus online grammar instruction. The hybrid structure allowed for grammar topics to be taught online, with a pretest following, and then reviewing missed/difficult pretest concepts in class prior to a posttest. The quasi-experimental…

Template-based generation of natural language expressions with Controlled M-Grammar

NARCIS (Netherlands)

Appelo, Lisette; Leermakers, M.C.J.; Rous, J.H.G.

1993-01-01

A method is described for the generation of related natural-language expressions. The method is based on a formal grammar of the natural language in question, specified in the Controlled M-Grammar (CMG) formalism. In the CMG framework the generation of an utterance is controlled by a derivation

Network Analysis with Stochastic Grammars

Science.gov (United States)

2015-09-17

rules N = 0 //non-terminal index clusters = cluster(W) //number of clusters drive the number S productions //cluster function described in text...Essa, “Recognizing multitasked activities from video using stochastic context-free grammar,” AAAI/IAAI, pp. 770–776, 2002. [18] R. Nevatia, T. Zhao

A Grammar of Logba (Ikpana)

NARCIS (Netherlands)

Dorvlo, Kofi

2008-01-01

This dissertation presents a comprehensive description of the grammar of Logba, one of the fourteen Ghana-Togo Mountain (GTM) languages spoken by approximately 7,500 speakers on the Southeastern frontier of the Ghana-Togo border. It is the outcome of fifteen months research in Logba speaking

Novel Ontologies-based Optical Character Recognition-error Correction Cooperating with Graph Component Extraction

Directory of Open Access Journals (Sweden)

Sarunya Kanjanawattana

2017-01-01

Full Text Available literature. Extracting graph information clearly contributes to readers, who are interested in graph information interpretation, because we can obtain significant information presenting in the graph. A typical tool used to transform image-based characters to computer editable characters is optical character recognition (OCR. Unfortunately, OCR cannot guarantee perfect results, because it is sensitive to noise and input quality. This becomes a serious problem because misrecognition provides misunderstanding information to readers and causes misleading communication. In this study, we present a novel method for OCR-error correction based on bar graphs using semantics, such as ontologies and dependency parsing. Moreover, we used a graph component extraction proposed in our previous study to omit irrelevant parts from graph components. It was applied to clean and prepare input data for this OCR-error correction. The main objectives of this paper are to extract significant information from the graph using OCR and to correct OCR errors using semantics. As a result, our method provided remarkable performance with the highest accuracies and F-measures. Moreover, we examined that our input data contained less of noise because of an efficiency of our graph component extraction. Based on the evidence, we conclude that our solution to the OCR problem achieves the objectives.

Addressing grammar in the interaction task-based learning environment

Directory of Open Access Journals (Sweden)

Davis Brent M.

2017-01-01

Full Text Available One of the major problems in language teaching is developing grammatical accuracy. This paper proposes that using error correction based on a functional grammar in a task-based learning approach may be a suitable solution. Towards this end an emic (using categories intrinsic to the language functional grammar of the verb phrase is proposed and a description of how this fits into the focus on form component of task-based learning is provided.

The Effect of MALL-Based Tasks on EFL Learners' Grammar Learning

Science.gov (United States)

Khodabandeh, Farzaneh; Alian, Jalal ed-din; Soleimani, Hassan

2017-01-01

Many studies have confirmed the importance of tasks on language learning. Nowadays, many teachers apply different kinds of tasks in their classrooms. The current study investigated the effect of mobile assisted language learning tasks (MALL) on participants' English grammar learning. The researcher administered a pre-validated grammar test to 90…

Linguistic grammar learning and DRD2-TAQ-IA polymorphism.

Directory of Open Access Journals (Sweden)

Patrick C M Wong

Full Text Available As research into the neurobiology of language has focused primarily on the systems level, fewer studies have examined the link between molecular genetics and normal variations in language functions. Because the ability to learn a language varies in adults and our genetic codes also vary, research linking the two provides a unique window into the molecular neurobiology of language. We consider a candidate association between the dopamine receptor D2 gene (DRD2 and linguistic grammar learning. DRD2-TAQ-IA polymorphism (rs1800497 is associated with dopamine receptor D2 distribution and dopamine impact in the human striatum, such that A1 allele carriers show reduction in D2 receptor binding relative to carriers who are homozygous for the A2 allele. The individual differences in grammatical rule learning that are particularly prevalent in adulthood are also associated with striatal function and its role in domain-general procedural memory. Therefore, we reasoned that procedurally-based grammar learning could be associated with DRD2-TAQ-IA polymorphism. Here, English-speaking adults learned artificial concatenative and analogical grammars, which have been respectively associated with procedural and declarative memory. Language learning capabilities were tested while learners' neural hemodynamic responses were simultaneously measured by fMRI. Behavioral learning and brain activation data were subsequently compared with the learners' DRD2 (rs1800497 genotype. Learners who were homozygous for the A2 allele were better at concatenative (but not analogical grammar learning and had higher striatal responses relative to those who have at least one A1 allele. These results provide preliminary evidence for the neurogenetic basis of normal variations in linguistic grammar learning and its link to domain-general functions.

Metrical presentation boosts implicit learning of artificial grammar.

Science.gov (United States)

Selchenkova, Tatiana; François, Clément; Schön, Daniele; Corneyllie, Alexandra; Perrin, Fabien; Tillmann, Barbara

2014-01-01

The present study investigated whether a temporal hierarchical structure favors implicit learning. An artificial pitch grammar implemented with a set of tones was presented in two different temporal contexts, notably with either a strongly metrical structure or an isochronous structure. According to the Dynamic Attending Theory, external temporal regularities can entrain internal oscillators that guide attention over time, allowing for temporal expectations that influence perception of future events. Based on this framework, it was hypothesized that the metrical structure provides a benefit for artificial grammar learning in comparison to an isochronous presentation. Our study combined behavioral and event-related potential measurements. Behavioral results demonstrated similar learning in both participant groups. By contrast, analyses of event-related potentials showed a larger P300 component and an earlier N2 component for the strongly metrical group during the exposure phase and the test phase, respectively. These findings suggests that the temporal expectations in the strongly metrical condition helped listeners to better process the pitch dimension, leading to improved learning of the artificial grammar.

DEVELOPING DIGITAL ENGLISH GRAMMAR MATERIALS FOR THE SENIOR HIGH SCHOOL STUDENTS

Directory of Open Access Journals (Sweden)

Agnes Santi Widiati

2017-04-01

Full Text Available English has become the tool for communication among the people across countries, and schools are competing to provide English for the students as early as possible. There are plenty ready-to-use digital English modules in the market today; however, they are not relevant with the English syllabus of the primary or secondary schools. The teaching is focused on the four skills directed for communication. As such, grammar is not presented as a part of the English lessons; but only when needed to support the four skills. The absence of systematic design of English grammar lesson makes their grammar mastery weak. To fix this, the writers develop grammar materials for the secondary school, specifically for the tenth graders. Young people love working with computers or other kinds of modern gadgets, so the materials developed in this research are in the digital form, both usable by teachers at school and by students independently via the Internet. Based on the needs assessment executed in high schools in Surabaya, Sidoarjo, and Malang, the researchers have obtained the inputs about the grammar topics needed and the types of exercises preferred by the students. Articulate Storyline 2 software is used to develop the materials supported by animation and voice recording. Each module covers the objectives, description, exercises equipped with feedbacks, and quizzes with scores to measure the achievement of the objectives.

Supporting intra-group social metacognitive activities with technology: A grammar learning game

NARCIS (Netherlands)

Molenaar, I.; Horvers, A.; Desain, P.W.M.

2017-01-01

This study investigates the effects of a technology enhanced collaborative grammar learning activity on students sentence parsing and formulation. These types of collaborative learning activities for grammar education are expected to support more effective learning. Yet, effective intra-group social

On restricted context-free grammars

Czech Academy of Sciences Publication Activity Database

Dassow, J.; Masopust, Tomáš

2012-01-01

Roč. 78, č. 1 (2012), s. 293-304 ISSN 0022-0000 Institutional research plan: CEZ:AV0Z10190503 Keywords : context-free grammars * derivation restriction * normal forms Subject RIV: BA - General Mathematics Impact factor: 1.000, year: 2012 http://www.sciencedirect.com/science/article/pii/S0022000011000572

Occupation times distribution for Brownian motion on graphs

CERN Document Server

Desbois, J

2002-01-01

Considering a Brownian motion on a general graph, we study the joint law for the occupation times on all the bonds. In particular, we show that the Laplace transform of this distribution can be expressed as the ratio of two determinants. We give two formulations, with arc or vertex matrices, for this result and discuss a simple example. (letter to the editor)

Perspectives on the rhythm–grammar link and its implications for typical and atypical language development

Science.gov (United States)

Gordon, Reyna L.; Jacobs, Magdalene S.; Schuele, C. Melanie; McAuley, J. Devin

2014-01-01

This paper reviews the mounting evidence for shared cognitive mechanisms and neural resources for rhythm and grammar. Evidence for a role of rhythm skills in language development and language comprehension is reviewed here in three lines of research: (a) behavioral and brain data from adults and children, showing that prosody and other aspects of timing of sentences influence online morpho-syntactic processing; (b) co-morbidity of impaired rhythm with grammatical deficits in children with language impairment; and (c) our recent work showing a strong positive association between rhythm perception skills and expressive grammatical skills in young school-age children with typical development. Our preliminary follow-up study presented here revealed that musical rhythm perception predicted variance in six-year-old children’s production of complex syntax, as well as online reorganization of grammatical information (transformation); these data provide an additional perspective on the hierarchical relations potentially shared by rhythm and grammar. A theoretical framework for shared cognitive resources for the role of rhythm in perceiving and learning grammatical structure is elaborated on in light of potential implications for using rhythm-emphasized musical training to improve language skills in children. PMID:25773612

Bits of Experience in the Oral Practice of Teaching Grammar

Institute of Scientific and Technical Information of China (English)

王敏

2002-01-01

English learners may have such experience that most of them can't be able to speak English apropriately and fluently even if they have gained a lot of grammar knowledge. The approach of teaching grammar discussed in this paper focuses on training students' communicative ability. And it is benefical to stimulating the activeness and interest of students and fostering the ability to solve the problems independently.

Normal ordering problem and the extensions of the Stirling grammar

Science.gov (United States)

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.

Assessment of tautomer distribution using the condensed reaction graph approach

Science.gov (United States)

Gimadiev, T. R.; Madzhidov, T. I.; Nugmanov, R. I.; Baskin, I. I.; Antipin, I. S.; Varnek, A.

2018-03-01

We report the first direct QSPR modeling of equilibrium constants of tautomeric transformations (logK T ) in different solvents and at different temperatures, which do not require intermediate assessment of acidity (basicity) constants for all tautomeric forms. The key step of the modeling consisted in the merging of two tautomers in one sole molecular graph ("condensed reaction graph") which enables to compute molecular descriptors characterizing entire equilibrium. The support vector regression method was used to build the models. The training set consisted of 785 transformations belonging to 11 types of tautomeric reactions with equilibrium constants measured in different solvents and at different temperatures. The models obtained perform well both in cross-validation (Q2 = 0.81 RMSE = 0.7 logK T units) and on two external test sets. Benchmarking studies demonstrate that our models outperform results obtained with DFT B3LYP/6-311 ++ G(d,p) and ChemAxon Tautomerizer applicable only in water at room temperature.

Integrated color face graphs for plant accident display

International Nuclear Information System (INIS)

Hara, Fumio

1987-01-01

This paper presents an integrated man-machine interface that uses cartoon-like colored graphs in the form of faces, that, through different facial expressions, display a plant condition. This is done by drawing the face on a CRT by nonlinearly transforming 31 variables and coloring the face. This integrated color graphics technique is applied to display the progess of events in the Three Mile Island nuclear power plant accident. Human visual perceptive characteristics are investigated in relation to the perception of the plant accident process, the naturality in face color change, and the consistency between facial expressions and colors. This paper concludes that colors used in an integrated color face graphs must be completely consistent with emotional feelings perceived from the colors. (author)

The effect of event repetition on the production of story grammar in children's event narratives.

Science.gov (United States)

Feltis, Brooke B; Powell, Martine B; Roberts, Kim P

2011-03-01

This study examined the effect of event repetition on the amount and nature of story-grammar produced by children when recalling the event. Children aged 4 years (N=50) and 7 years (N=56) participated in either 1 or 6 occurrences of a highly similar event where details varied across the occurrences. Half the children in each age and event group recalled the last/single occurrence 5-6 days later and the other half recalled the last/single occurrence after 5-6 weeks (the final and single occurrence was the same). Children's free recall responses were classified according to the number and proportion of story-grammar elements (Stein & Glenn, 1979-setting, initiating event, internal response, plan, attempt, direct consequence, and resolution) as well as the prevalence of causal links between the individual story-grammar elements. More story-grammar detail and more links between individual story-grammar elements were reported about the final compared to single occurrence. The amount of story-grammar increased with age and decreased over time. Further, an interaction was revealed such that the effect of retention interval on the production of story-grammar was negligible for older children who experienced the repeated event. Event repetition has a beneficial effect on the production of children's story-grammar content in situations where event details varied from occasion to occasion. This study highlights the importance of eliciting free recall when conducting evidential interviews with child witnesses about repeated events. Copyright © 2011 Elsevier Ltd. All rights reserved.

The relationship between grammar and the psychological ...

African Journals Online (AJOL)

The relationship between grammar and the psychological processing of language. ... manner in which speakers perceive and psycholinguistically process information. ... order, metaphorical extensions, processing constraints, end-focus theory

Developmental Constraints on Learning Artificial Grammars with Fixed, Flexible and Free Word Order

Directory of Open Access Journals (Sweden)

Iga Nowak

2017-10-01

Full Text Available Human learning, although highly flexible and efficient, is constrained in ways that facilitate or impede the acquisition of certain systems of information. Some such constraints, active during infancy and childhood, have been proposed to account for the apparent ease with which typically developing children acquire language. In a series of experiments, we investigated the role of developmental constraints on learning artificial grammars with a distinction between shorter and relatively frequent words (‘function words,’ F-words and longer and less frequent words (‘content words,’ C-words. We constructed 4 finite-state grammars, in which the order of F-words, relative to C-words, was either fixed (F-words always occupied the same positions in a string, flexible (every F-word always followed a C-word, or free. We exposed adults (N = 84 and kindergarten children (N = 100 to strings from each of these artificial grammars, and we assessed their ability to recognize strings with the same structure, but a different vocabulary. Adults were better at recognizing strings when regularities were available (i.e., fixed and flexible order grammars, while children were better at recognizing strings from the grammars consistent with the attested distribution of function and content words in natural languages (i.e., flexible and free order grammars. These results provide evidence for a link between developmental constraints on learning and linguistic typology.

Teachers' Attitudes towards Teaching English Grammar: A Scale Development Study

Science.gov (United States)

Polat, Murat

2017-01-01

In most ELT classes, the importance of grammar, how it should be taught or how much it should be integrated into language teaching are still matters of discussion. Considering this fact, learning teachers' attitudes towards teaching grammar is significantly valuable for researchers. This study thus aimed to design a scale that identifies teachers'…

Density of Visual Input Enhancement and Grammar Learning: A Research Proposal

Science.gov (United States)

Tran, Thu Hoang

2009-01-01

Research in the field of second language acquisition (SLA) has been done to ascertain the effectiveness of visual input enhancement (VIE) on grammar learning. However, one issue remains unexplored: the effects of VIE density on grammar learning. This paper presents a research proposal to investigate the effects of the density of VIE on English…

Centrosymmetric Graphs And A Lower Bound For Graph Energy Of Fullerenes

Directory of Open Access Journals (Sweden)

Katona Gyula Y.

2014-11-01

Full Text Available The energy of a molecular graph G is defined as the summation of the absolute values of the eigenvalues of adjacency matrix of a graph G. In this paper, an infinite class of fullerene graphs with 10n vertices, n ≥ 2, is considered. By proving centrosymmetricity of the adjacency matrix of these fullerene graphs, a lower bound for its energy is given. Our method is general and can be extended to other class of fullerene graphs.

Multiple Grammars and the Logic of Learnability in L2

Directory of Open Access Journals (Sweden)

Tom W Roeper

2016-02-01

Full Text Available The goal of this article is to enhance the technical description of multi-lingual speakers in terms of a theoryof Multiple Grammars where more than one language utilizes a grammar. The challenge of V2 and itsimplications for interfaces from the perspective of the L2 learner is the focus. A number of constructionsare considered including: Quotation, Topicaliation, Empty subjects and Objects, Expletives, and Subject-auxiliary inversoni.

Graphs and Homomorphisms

CERN Document Server

Hell, Pavol

2004-01-01

This is a book about graph homomorphisms. Graph theory is now an established discipline but the study of graph homomorphisms has only recently begun to gain wide acceptance and interest. The subject gives a useful perspective in areas such as graph reconstruction, products, fractional and circular colourings, and has applications in complexity theory, artificial intelligence, telecommunication, and, most recently, statistical physics.Based on the authors' lecture notes for graduate courses, this book can be used as a textbook for a second course in graph theory at 4th year or master's level an

Adiabatic graph-state quantum computation

International Nuclear Information System (INIS)

Antonio, B; Anders, J; Markham, D

2014-01-01

Measurement-based quantum computation (MBQC) and holonomic quantum computation (HQC) are two very different computational methods. The computation in MBQC is driven by adaptive measurements executed in a particular order on a large entangled state. In contrast in HQC the system starts in the ground subspace of a Hamiltonian which is slowly changed such that a transformation occurs within the subspace. Following the approach of Bacon and Flammia, we show that any MBQC on a graph state with generalized flow (gflow) can be converted into an adiabatically driven holonomic computation, which we call adiabatic graph-state quantum computation (AGQC). We then investigate how properties of AGQC relate to the properties of MBQC, such as computational depth. We identify a trade-off that can be made between the number of adiabatic steps in AGQC and the norm of H-dot as well as the degree of H, in analogy to the trade-off between the number of measurements and classical post-processing seen in MBQC. Finally the effects of performing AGQC with orderings that differ from standard MBQC are investigated. (paper)

Teaching Grammar through Task-Based Language Teaching to Young EFL Learners

Science.gov (United States)

Yildiz, Mustafa; Senel, Mufit

2017-01-01

The present study investigates the effects of Task-Based Language Teaching on students' grammar knowledge in the field of teaching grammar. It has been studied with 32 students from 8th grade during a two-and-a-half-month process. Throughout this process, students firstly are applied a pre-test to examine their level and to confirm whether there…

Contemporary Tutorial Call: Using Purpose-Built Video as a Grammar Tutor

Science.gov (United States)

Merlo, Jarrad R.; Gruba, Paul A.

2015-01-01

Despite an increased emphasis on form-focused instruction (FFI), the use of the computer as a grammar tutor has remained largely unexamined for nearly two decades. With new technologies at hand, there is a need to take a fresh look at online grammar tutors and link designs more strongly to contemporary second language acquisition (SLA) principles…

Grammar Texts and Consumerist Subtexts

Science.gov (United States)

Sokolik, M. E.

2007-01-01

While several checklists exist for the evaluation of ESL/EFL textbooks, none includes suggestions for looking for specific biases, especially those found in the content of examples and sample sentences. Growing awareness in publishing has reduced problems in the presentation of gender-based and racial biases in most ESL/EFL grammar textbooks, but…

Assessing Primary Literacy through Grammar Tests

Science.gov (United States)

Hodgson, John

2017-01-01

Originally an editorial for "English in Education," this short article summarises key issues in the imposition of a separate test for grammar, punctuation and spelling. It illustrates the poor foundations, lack of clarity and distortion of curriculum which invalidate the test.

A Tentative Analysis of the Origin of Middle Chinese Grammar and Its Historical Position

Directory of Open Access Journals (Sweden)

Liu Shizhen

2007-10-01

Full Text Available Middle Chinese is thelanguage used in the period from the Eastern Han Dynasty to the Sui Dynasty. Inrecent years researches of Middle Chinese have attracted scholars’ attention.While it inherited some characteristics from the grammar of Ancient Chinese,the morphology and syntax of Middle Chinese underwent obvious elimination andnew birth, an important content which laid the foundation for the furtherevolution of the Early Modern Chinese Grammar. Numerous grammatical phenomenonstarted to appear in Tang and Song Dynasties. The grammar was going through achange in which new forms replaced old ones, thus being the mediator ininheriting the archaic and beginning the early modern grammar, and thereforeoccupying an important position in the history of Chinese.

Mobile-Assisted Grammar Exercises: Effects on Self-Editing in L2 Writing

Science.gov (United States)

Li, Zhi; Hegelheimer, Volker

2013-01-01

In this paper, we report on the development and implementation of a web-based mobile application, "Grammar Clinic," for an ESL writing class. Drawing on insights from the interactionist approach to Second Language Acquisition (SLA), the Noticing Hypothesis, and mobile-assisted language learning (MALL), "Grammar Clinic" was…

The Role of Simple Semantics in the Process of Artificial Grammar Learning

Science.gov (United States)

Öttl, Birgit; Jäger, Gerhard; Kaup, Barbara

2017-01-01

This study investigated the effect of semantic information on artificial grammar learning (AGL). Recursive grammars of different complexity levels (regular language, mirror language, copy language) were investigated in a series of AGL experiments. In the with-semantics condition, participants acquired semantic information prior to the AGL…

TRAINING TREE ADJOINING GRAMMARS WITH HUGE TEXT CORPUS USING SPARK MAP REDUCE

Directory of Open Access Journals (Sweden)

Vijay Krishna Menon

2015-07-01

Full Text Available Tree adjoining grammars (TAGs are mildly context sensitive formalisms used mainly in modelling natural languages. Usage and research on these psycho linguistic formalisms have been erratic in the past decade, due to its demanding construction and difficulty to parse. However, they represent promising future for formalism based NLP in multilingual scenarios. In this paper we demonstrate basic synchronous Tree adjoining grammar for English-Tamil language pair that can be used readily for machine translation. We have also developed a multithreaded chart parser that gives ambiguous deep structures and a par dependency structure known as TAG derivation. Furthermore we then focus on a model for training this TAG for each language using a large corpus of text through a map reduce frequency count model in spark and estimation of various probabilistic parameters for the grammar trees thereafter; these parameters can be used to perform statistical parsing on the trained grammar.

Teachers’ Attitudes towards Teaching English Grammar: A Scale Development Study

Directory of Open Access Journals (Sweden)

Murat Polat

2017-12-01

Full Text Available In most ELT classes, the importance of grammar, how it should be taught or how much it should be integrated into language teaching are still matters of discussion. Considering this fact, learning teachers’ attitudes towards teaching grammar is significantly valuable for researchers. This study thus aimed to design a scale that identifies teachers’ attitudes towards the role of grammar in the process of teaching English, to pilot it, and to find out the psychometric qualities like reliability and validity of the scale designed. The scale was developed in two phases; it was first aimed to explore the factor structure of the scale, then to confirm the structure gained from the exploration of the items. The study was carried out in 2015 and 247 volunteer language teachers from 3 state universities in Eskişehir and Kütahya were included. The results of exploratory and confirmatory factor analyses revealed that the scale developed in this study was a considerably valid and reliable data collection tool including three factors. Finally, the analyses indicated that gender and graduate faculties did not create significant differences whereas age and the degrees obtained by the teachers created a considerable difference on language teachers’ attitudes towards grammar teaching (p<.05

Graph-Based Specification and Simulation of Featherweight Java with Around Advice

NARCIS (Netherlands)

Staijen, T.; Rensink, Arend

In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transformations. We introduce a notion of correctness of our specification with respect to an existing semantics and claim a

Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs

DEFF Research Database (Denmark)

Bensmail, Julien; Renault, Gabriel

2016-01-01

An undirected graph G is locally irregular if every two of its adjacent vertices have distinct degrees. We say that G is decomposable into k locally irregular graphs if there exists a partition E1∪E2∪⋯∪Ek of the edge set E(G) such that each Ei induces a locally irregular graph. It was recently co...

Non-heuristic reduction of the graph in graph-cut optimization

International Nuclear Information System (INIS)

Malgouyres, François; Lermé, Nicolas

2012-01-01

During the last ten years, graph cuts had a growing impact in shape optimization. In particular, they are commonly used in applications of shape optimization such as image processing, computer vision and computer graphics. Their success is due to their ability to efficiently solve (apparently) difficult shape optimization problems which typically involve the perimeter of the shape. Nevertheless, solving problems with a large number of variables remains computationally expensive and requires a high memory usage since underlying graphs sometimes involve billion of nodes and even more edges. Several strategies have been proposed in the literature to improve graph-cuts in this regards. In this paper, we give a formal statement which expresses that a simple and local test performed on every node before its construction permits to avoid the construction of useless nodes for the graphs typically encountered in image processing and vision. A useless node is such that the value of the maximum flow in the graph does not change when removing the node from the graph. Such a test therefore permits to limit the construction of the graph to a band of useful nodes surrounding the final cut.

Graph embedding with rich information through heterogeneous graph

KAUST Repository

Sun, Guolei

2017-01-01

Graph embedding, aiming to learn low-dimensional representations for nodes in graphs, has attracted increasing attention due to its critical application including node classification, link prediction and clustering in social network analysis. Most

Graph Transformation and Designing Parallel Sparse Matrix Algorithms beyond Data Dependence Analysis

Directory of Open Access Journals (Sweden)

H.X. Lin

2004-01-01

Full Text Available Algorithms are often parallelized based on data dependence analysis manually or by means of parallel compilers. Some vector/matrix computations such as the matrix-vector products with simple data dependence structures (data parallelism can be easily parallelized. For problems with more complicated data dependence structures, parallelization is less straightforward. The data dependence graph is a powerful means for designing and analyzing parallel algorithms. However, for sparse matrix computations, parallelization based on solely exploiting the existing parallelism in an algorithm does not always give satisfactory results. For example, the conventional Gaussian elimination algorithm for the solution of a tri-diagonal system is inherently sequential, so algorithms specially for parallel computation has to be designed. After briefly reviewing different parallelization approaches, a powerful graph formalism for designing parallel algorithms is introduced. This formalism will be discussed using a tri-diagonal system as an example. Its application to general matrix computations is also discussed. Its power in designing parallel algorithms beyond the ability of data dependence analysis is shown by means of a new algorithm called ACER (Alternating Cyclic Elimination and Reduction algorithm.

Learnable Classes of Categorial Grammars.

Science.gov (United States)

Kanazawa, Makoto

Learnability theory is an attempt to illuminate the concept of learnability using a mathematical model of learning. Two models of learning of categorial grammars are examined here: the standard model, in which sentences presented to the learner are flat strings of words, and one in which sentences are presented in the form of functor-argument…

The Association between Expressive Grammar Intervention and Social and Emergent Literacy Outcomes for Preschoolers with SLI

Science.gov (United States)

Washington, Karla N.

2013-01-01

Purpose: To determine whether (a) expressive grammar intervention facilitated social and emergent literacy outcomes better than no intervention and (b) expressive grammar gains and/or initial expressive grammar level predicted social and emergent literacy outcomes. Method: This investigation was a follow-up to a recently published study exploring…

Making sense of syntax – Innate or acquired? Contrasting universal grammar with other approaches to language acquisition

Directory of Open Access Journals (Sweden)

Christian Kliesch

2012-05-01

Full Text Available Proponents of a Universal Grammar argue that humans are born with a dedicated language system that shapes and restricts the number of grammars found in human languages (Chomsky, 2005. It is essentially innate and has a genetic manifestation. Such an innate system is necessary because human grammars are too complex to be passed on through social interactions and probabilistic learning alone. However, this view is contested by a combination of emergentist approaches and a number of studies suggest that many of the core assumptions of Universal Grammar are either unnecessary or do not hold. Furthermore, this review will explore theoretical criticism of the Universal Grammar research programme.

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory

Science.gov (United States)

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A.

2016-01-01

There are several applications in computational biophysics which require the optimization of discrete interacting states; e.g., amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial-time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of “maximum flow-minimum cut” graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein, and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial-time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered. PMID:27089174

Energy Minimization of Discrete Protein Titration State Models Using Graph Theory.

Science.gov (United States)

Purvine, Emilie; Monson, Kyle; Jurrus, Elizabeth; Star, Keith; Baker, Nathan A

2016-08-25

There are several applications in computational biophysics that require the optimization of discrete interacting states, for example, amino acid titration states, ligand oxidation states, or discrete rotamer angles. Such optimization can be very time-consuming as it scales exponentially in the number of sites to be optimized. In this paper, we describe a new polynomial time algorithm for optimization of discrete states in macromolecular systems. This algorithm was adapted from image processing and uses techniques from discrete mathematics and graph theory to restate the optimization problem in terms of "maximum flow-minimum cut" graph analysis. The interaction energy graph, a graph in which vertices (amino acids) and edges (interactions) are weighted with their respective energies, is transformed into a flow network in which the value of the minimum cut in the network equals the minimum free energy of the protein and the cut itself encodes the state that achieves the minimum free energy. Because of its deterministic nature and polynomial time performance, this algorithm has the potential to allow for the ionization state of larger proteins to be discovered.

Adaptive Graph Convolutional Neural Networks

OpenAIRE

Li, Ruoyu; Wang, Sheng; Zhu, Feiyun; Huang, Junzhou

2018-01-01

Graph Convolutional Neural Networks (Graph CNNs) are generalizations of classical CNNs to handle graph data such as molecular data, point could and social networks. Current filters in graph CNNs are built for fixed and shared graph structure. However, for most real data, the graph structures varies in both size and connectivity. The paper proposes a generalized and flexible graph CNN taking data of arbitrary graph structure as input. In that way a task-driven adaptive graph is learned for eac...

Dynamic Systems Theory and Universal Grammar: Holding up a Turbulent Mirror to Development in Grammars

Science.gov (United States)

Plaza-Pust, Carolina

2008-01-01

Research over the last decades has shown that language development in its multiple forms is characterized by a succession of stable and unstable states. However, the variation observed is neither expected nor can it be accounted for on the basis of traditional learning concepts conceived of within the Universal Grammar (UG) paradigm. In this…

Asymptote Misconception on Graphing Functions: Does Graphing Software Resolve It?

Directory of Open Access Journals (Sweden)

Mehmet Fatih Öçal

2017-01-01

Full Text Available Graphing function is an important issue in mathematics education due to its use in various areas of mathematics and its potential roles for students to enhance learning mathematics. The use of some graphing software assists students’ learning during graphing functions. However, the display of graphs of functions that students sketched by hand may be relatively different when compared to the correct forms sketched using graphing software. The possible misleading effects of this situation brought a discussion of a misconception (asymptote misconception on graphing functions. The purpose of this study is two- fold. First of all, this study investigated whether using graphing software (GeoGebra in this case helps students to determine and resolve this misconception in calculus classrooms. Second, the reasons for this misconception are sought. The multiple case study was utilized in this study. University students in two calculus classrooms who received instructions with (35 students or without GeoGebra assisted instructions (32 students were compared according to whether they fell into this misconception on graphing basic functions (1/x, lnx, ex. In addition, students were interviewed to reveal the reasons behind this misconception. Data were analyzed by means of descriptive and content analysis methods. The findings indicated that those who received GeoGebra assisted instruction were better in resolving it. In addition, the reasons behind this misconception were found to be teacher-based, exam-based and some other factors.

High Dimensional Spectral Graph Theory and Non-backtracking Random Walks on Graphs

Science.gov (United States)

Kempton, Mark

This thesis has two primary areas of focus. First we study connection graphs, which are weighted graphs in which each edge is associated with a d-dimensional rotation matrix for some fixed dimension d, in addition to a scalar weight. Second, we study non-backtracking random walks on graphs, which are random walks with the additional constraint that they cannot return to the immediately previous state at any given step. Our work in connection graphs is centered on the notion of consistency, that is, the product of rotations moving from one vertex to another is independent of the path taken, and a generalization called epsilon-consistency. We present higher dimensional versions of the combinatorial Laplacian matrix and normalized Laplacian matrix from spectral graph theory, and give results characterizing the consistency of a connection graph in terms of the spectra of these matrices. We generalize several tools from classical spectral graph theory, such as PageRank and effective resistance, to apply to connection graphs. We use these tools to give algorithms for sparsification, clustering, and noise reduction on connection graphs. In non-backtracking random walks, we address the question raised by Alon et. al. concerning how the mixing rate of a non-backtracking random walk to its stationary distribution compares to the mixing rate for an ordinary random walk. Alon et. al. address this question for regular graphs. We take a different approach, and use a generalization of Ihara's Theorem to give a new proof of Alon's result for regular graphs, and to extend the result to biregular graphs. Finally, we give a non-backtracking version of Polya's Random Walk Theorem for 2-dimensional grids.

The association between expressive grammar intervention and social and emergent literacy outcomes for preschoolers with SLI.

Science.gov (United States)

Washington, Karla N

2013-02-01

To determine whether (a) expressive grammar intervention facilitated social and emergent literacy outcomes better than no intervention and (b) expressive grammar gains and/or initial expressive grammar level predicted social and emergent literacy outcomes. This investigation was a follow-up to a recently published study exploring the impact of grammatical language intervention on expressive grammar outcomes for preschoolers with specific language impairment (SLI). Twenty-two 3- to 5-year-old preschoolers received ten 20-minute intervention sessions addressing primary deficits in grammatical morphology. Participants' social and emergent literacy skills were not targeted. Twelve children awaiting intervention, chosen from the same selection pool as intervention participants, served as controls. Blind assessments of social and emergent literacy outcomes were completed at preintervention, immediately postintervention, and 3 months postintervention. Only intervention participants experienced significant gains in social and emergent literacy outcomes and maintained these gains for 3 months postintervention. Expressive grammar gains was the only single significant predictor of these outcomes. Expressive grammar intervention was associated with broad impacts on social and emergent literacy outcomes that were maintained beyond the intervention period. Gains in expressive grammar predicted these outcomes. Social and emergent literacy skills were positively affected for preschoolers with SLI during a grammatical language intervention program.

Phrasal alignment in Functional Discourse Grammar

NARCIS (Netherlands)

van Rijn, M.

2011-01-01

Although the term is alignment is typically associated with morphosyntactic expression of arguments of the Clause, alignment is also relevant to units of the Phrase. In Functional Discourse Grammar a basic distinction is made between two kinds of dependency relations obtaining both within Phrases

X-Graphs: Language and Algorithms for Heterogeneous Graph Streams

Science.gov (United States)

2017-09-01

are widely used by academia and industry. 15. SUBJECT TERMS Data Analytics, Graph Analytics, High-Performance Computing 16. SECURITY CLASSIFICATION...form the core of the DeepDive Knowledge Construction System. 2 INTRODUCTION The goal of the X-Graphs project was to develop computational techniques...memory multicore machine. Ringo is based on Snap.py and SNAP, and uses Python . Ringo now allows the integration of Delite DSL Framework Graph

On the sizes of expander graphs and minimum distances of graph codes

DEFF Research Database (Denmark)

Høholdt, Tom; Justesen, Jørn

2014-01-01

We give lower bounds for the minimum distances of graph codes based on expander graphs. The bounds depend only on the second eigenvalue of the graph and the parameters of the component codes. We also give an upper bound on the size of a degree regular graph with given second eigenvalue....

Similarity Measure of Graphs

Directory of Open Access Journals (Sweden)

Amine Labriji

2017-07-01

Full Text Available The topic of identifying the similarity of graphs was considered as highly recommended research field in the Web semantic, artificial intelligence, the shape recognition and information research. One of the fundamental problems of graph databases is finding similar graphs to a graph query. Existing approaches dealing with this problem are usually based on the nodes and arcs of the two graphs, regardless of parental semantic links. For instance, a common connection is not identified as being part of the similarity of two graphs in cases like two graphs without common concepts, the measure of similarity based on the union of two graphs, or the one based on the notion of maximum common sub-graph (SCM, or the distance of edition of graphs. This leads to an inadequate situation in the context of information research. To overcome this problem, we suggest a new measure of similarity between graphs, based on the similarity measure of Wu and Palmer. We have shown that this new measure satisfies the properties of a measure of similarities and we applied this new measure on examples. The results show that our measure provides a run time with a gain of time compared to existing approaches. In addition, we compared the relevance of the similarity values obtained, it appears that this new graphs measure is advantageous and  offers a contribution to solving the problem mentioned above.

What exactly is Universal Grammar, and has anyone seen it?

Science.gov (United States)

Dąbrowska, Ewa

2015-01-01

Universal Grammar (UG) is a suspect concept. There is little agreement on what exactly is in it; and the empirical evidence for it is very weak. This paper critically examines a variety of arguments that have been put forward as evidence for UG, focussing on the three most powerful ones: universality (all human languages share a number of properties), convergence (all language learners converge on the same grammar in spite of the fact that they are exposed to different input), and poverty of the stimulus (children know things about language which they could not have learned from the input available to them). I argue that these arguments are based on premises which are either false or unsubstantiated. Languages differ from each other in profound ways, and there are very few true universals, so the fundamental crosslinguistic fact that needs explaining is diversity, not universality. A number of recent studies have demonstrated the existence of considerable differences in adult native speakers' knowledge of the grammar of their language, including aspects of inflectional morphology, passives, quantifiers, and a variety of more complex constructions, so learners do not in fact converge on the same grammar. Finally, the poverty of the stimulus argument presupposes that children acquire linguistic representations of the kind postulated by generative grammarians; constructionist grammars such as those proposed by Tomasello, Goldberg and others can be learned from the input. We are the only species that has language, so there must be something unique about humans that makes language learning possible. The extent of crosslinguistic diversity and the considerable individual differences in the rate, style and outcome of acquisition suggest that it is more promising to think in terms of a language-making capacity, i.e., a set of domain-general abilities, rather than an innate body of knowledge about the structural properties of the target system.

What exactly is Universal Grammar, and has anyone seen it?

Directory of Open Access Journals (Sweden)

Ewa eDabrowska

2015-06-01

Full Text Available Universal Grammar (UG is a suspect concept. There is little agreement on what exactly is in it; and the empirical evidence for it is very weak. This paper critically examines a variety of arguments that have been put forward as evidence for UG, focussing on the three most powerful ones: universality (all human languages share a number of properties, convergence (all language learners converge on the same grammar in spite of the fact that they are exposed to different input, and poverty of the stimulus (children know things about language which they could not have learned from the input available to them. I argue that these arguments are based on premises which are either false or unsubstantiated. Languages differ from each other in profound ways, and there are very few true universals, so the fundamental crosslinguistic fact that needs explaining is diversity, not universality. A number of recent studies have demonstrated the existence of considerable differences in adult native speakers’ knowledge of the grammar of their language, including aspects of inflectional morphology, passives, quantifiers, and a variety of more complex constructions, so learners do not in fact converge on the same grammar. Finally, the poverty of the stimulus argument presupposes that children acquire linguistic representations of the kind postulated by generative grammarians; constructionist grammars such as those proposed by Tomasello, Goldberg and others can be learned from the input. We are the only species that has language, so there must be something unique about humans that makes language learning possible. The extent of crosslinguistic diversity and the considerable individual differences in the rate, style and outcome of acquisition suggest that it is more promising to think in terms of a language-making capacity, i.e. a set of domain-general abilities, rather than an innate body of knowledge about the structural properties of the target system.

Phonological Memory and the Acquisition of Grammar in Child L2 Learners

Science.gov (United States)

Verhagen, Josje; Leseman, Paul; Messer, Marielle

2015-01-01

Previous studies show that second language (L2) learners with large phonological memory spans outperform learners with smaller memory spans on tests of L2 grammar. The current study investigated the relationship between phonological memory and L2 grammar in more detail than has been done earlier. Specifically, we asked how phonological memory…

Spectra of Graphs

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.

2012-01-01

This book gives an elementary treatment of the basic material about graph spectra, both for ordinary, and Laplace and Seidel spectra. The text progresses systematically, by covering standard topics before presenting some new material on trees, strongly regular graphs, two-graphs, association

Pattern graph rewrite systems

Directory of Open Access Journals (Sweden)

Aleks Kissinger

2014-03-01

Full Text Available String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the power of such rewrite systems can be greatly extended by introducing pattern graphs, which provide a means of expressing infinite families of rewrite rules where certain marked subgraphs, called !-boxes ("bang boxes", on both sides of a rule can be copied any number of times or removed. After reviewing the string graph formalism, we show how string graphs can be extended to pattern graphs and how pattern graphs and pattern rewrite rules can be instantiated to concrete string graphs and rewrite rules. We then provide examples demonstrating the expressive power of pattern graphs and how they can be applied to study interacting algebraic structures that are central to categorical quantum mechanics.

Parallel communicating grammar systems with context-free components are Turing complete for any communication model

Directory of Open Access Journals (Sweden)

Wilkin Mary Sarah Ruth

2016-12-01

Full Text Available Parallel Communicating Grammar Systems (PCGS were introduced as a language-theoretic treatment of concurrent systems. A PCGS extends the concept of a grammar to a structure that consists of several grammars working in parallel, communicating with each other, and so contributing to the generation of strings. PCGS are usually more powerful than a single grammar of the same type; PCGS with context-free components (CF-PCGS in particular were shown to be Turing complete. However, this result only holds when a specific type of communication (which we call broadcast communication, as opposed to one-step communication is used. We expand the original construction that showed Turing completeness so that broadcast communication is eliminated at the expense of introducing a significant number of additional, helper component grammars. We thus show that CF-PCGS with one-step communication are also Turing complete. We introduce in the process several techniques that may be usable in other constructions and may be capable of removing broadcast communication in general.

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...

The relation between receptive grammar and procedural, declarative, and working memory in specific language impairment.

Science.gov (United States)

Conti-Ramsden, Gina; Ullman, Michael T; Lum, Jarrad A G

2015-01-01

What memory systems underlie grammar in children, and do these differ between typically developing (TD) children and children with specific language impairment (SLI)? Whilst there is substantial evidence linking certain memory deficits to the language problems in children with SLI, few studies have investigated multiple memory systems simultaneously, examining not only possible memory deficits but also memory abilities that may play a compensatory role. This study examined the extent to which procedural, declarative, and working memory abilities predict receptive grammar in 45 primary school aged children with SLI (30 males, 15 females) and 46 TD children (30 males, 16 females), both on average 9;10 years of age. Regression analyses probed measures of all three memory systems simultaneously as potential predictors of receptive grammar. The model was significant, explaining 51.6% of the variance. There was a significant main effect of learning in procedural memory and a significant group × procedural learning interaction. Further investigation of the interaction revealed that procedural learning predicted grammar in TD but not in children with SLI. Indeed, procedural learning was the only predictor of grammar in TD. In contrast, only learning in declarative memory significantly predicted grammar in SLI. Thus, different memory systems are associated with receptive grammar abilities in children with SLI and their TD peers. This study is, to our knowledge, the first to demonstrate a significant group by memory system interaction in predicting grammar in children with SLI and their TD peers. In line with Ullman's Declarative/Procedural model of language and procedural deficit hypothesis of SLI, variability in understanding sentences of varying grammatical complexity appears to be associated with variability in procedural memory abilities in TD children, but with declarative memory, as an apparent compensatory mechanism, in children with SLI.

"I'll Take Commas for $200": An Instructional Intervention Using Games to Help Students Master Grammar Skills

Science.gov (United States)

Bullard, Sue Burzynski; Anderson, Nancy

2014-01-01

Effective writing requires mastering grammar. For journalists, this mastery is critical because research shows poor grammar erodes media credibility. College writing instructors say students do not understand basic grammar concepts, and greater numbers of students are enrolling in remedial writing classes. This quasi-experimental mixed methods…

On middle cube graphs

Directory of Open Access Journals (Sweden)

C. Dalfo

2015-10-01

Full Text Available We study a family of graphs related to the $n$-cube. The middle cube graph of parameter k is the subgraph of $Q_{2k-1}$ induced by the set of vertices whose binary representation has either $k-1$ or $k$ number of ones. The middle cube graphs can be obtained from the well-known odd graphs by doubling their vertex set. Here we study some of the properties of the middle cube graphs in the light of the theory of distance-regular graphs. In particular, we completely determine their spectra (eigenvalues and their multiplicities, and associated eigenvectors.

Graph visualization (Invited talk)

NARCIS (Netherlands)

Wijk, van J.J.; Kreveld, van M.J.; Speckmann, B.

2012-01-01

Black and white node link diagrams are the classic method to depict graphs, but these often fall short to give insight in large graphs or when attributes of nodes and edges play an important role. Graph visualization aims obtaining insight in such graphs using interactive graphical representations.

Adventures in graph theory

CERN Document Server

Joyner, W David

2017-01-01

This textbook acts as a pathway to higher mathematics by seeking and illuminating the connections between graph theory and diverse fields of mathematics, such as calculus on manifolds, group theory, algebraic curves, Fourier analysis, cryptography and other areas of combinatorics. An overview of graph theory definitions and polynomial invariants for graphs prepares the reader for the subsequent dive into the applications of graph theory. To pique the reader’s interest in areas of possible exploration, recent results in mathematics appear throughout the book, accompanied with examples of related graphs, how they arise, and what their valuable uses are. The consequences of graph theory covered by the authors are complicated and far-reaching, so topics are always exhibited in a user-friendly manner with copious graphs, exercises, and Sage code for the computation of equations. Samples of the book’s source code can be found at github.com/springer-math/adventures-in-graph-theory. The text is geared towards ad...

German Grammar in the Students' Words: The "Essentialization" of German Grammar by American College-Level Learners

Science.gov (United States)

Chavez, Monika

2011-01-01

This study of 134 college-level learners of German, enrolled in four years of instruction, showed them to "essentialize" German grammar when asked to describe it to a hypothetical friend. Kubota defined the term essentialization to capture learners' views of the target culture. Its main characteristic is the presupposition of "essential, stable,…

Route description in Iwaidja: grammar and conceptualisation of motion

Directory of Open Access Journals (Sweden)

Cris Edmonds-Wathen

2016-09-01

Full Text Available This study focussed on the effect of grammar of Iwaidja, an indigenous Australian language, on mathematical conceptualisation. It investigated route description in Iwaidja. Spatial concepts such as direction, height and movement in relation to another object are briefly described using examples. Differences between English and Iwaidja are used to illustrate the some of the impact of grammar on mathematical conceptualisation. The implications are discussed in terms of how understanding these grammatical features can help teachers, especially when children are not fluent in the language of instruction, as well as providing keys to cross-linguistic investigations of mathematical cognition.

On Anaphora and the Binding Principles in Categorial Grammar

Science.gov (United States)

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.

An Evaluation of Universal Grammar and the Phonological Mind.

Science.gov (United States)

Everett, Daniel L

2016-01-01

This paper argues against the hypothesis of a "phonological mind" advanced by Berent. It establishes that there is no evidence that phonology is innate and that, in fact, the simplest hypothesis seems to be that phonology is learned like other human abilities. Moreover, the paper fleshes out the original claim of Philip Lieberman that Universal Grammar predicts that not everyone should be able to learn every language, i.e., the opposite of what UG is normally thought to predict. The paper also underscores the problem that the absence of recursion in Pirahã represents for Universal Grammar proposals.

Syntactic Language Extension via an Algebra of Languages and Transformations

DEFF Research Database (Denmark)

Andersen, Jacob; Brabrand, Claus

2010-01-01

We propose an algebra of languages and transformations as a means for extending languages syntactically. The algebra provides a layer of high-level abstractions built on top of languages (captured by context-free grammars) and transformations (captured by constructive catamorphisms). The algebra...... is self-contained in that any term of the algebra specifying a transformation can be reduced to a catamorphism, before the transformation is run. Thus, the algebra comes “for free” without sacrificing the strong safety and efficiency properties of constructive catamorphisms. The entire algebra...... as presented in the paper is implemented as the Banana Algebra Tool which may be used to syntactically extend languages in an incremental and modular fashion via algebraic composition of previously defined languages and transformations. We demonstrate and evaluate the tool via several kinds of extensions....

AGM: A DSL for mobile cloud computing based on directed graph

Science.gov (United States)

Tanković, Nikola; Grbac, Tihana Galinac

2016-06-01

This paper summarizes a novel approach for consuming a domain specific language (DSL) by transforming it to a directed graph representation persisted by a graph database. Using such specialized database enables advanced navigation trough the stored model exposing only relevant subsets of meta-data to different involved services and components. We applied this approach in a mobile cloud computing system and used it to model several mobile applications in retail, supply chain management and merchandising domain. These application are distributed in a Software-as-a-Service (SaaS) fashion and used by thousands of customers in Croatia. We report on lessons learned and propose further research on this topic.

The relationship between strategic control and conscious structural knowledge in artificial grammar learning.

Science.gov (United States)

Norman, Elisabeth; Scott, Ryan B; Price, Mark C; Dienes, Zoltan

2016-05-01

We address Jacoby's (1991) proposal that strategic control over knowledge requires conscious awareness of that knowledge. In a two-grammar artificial grammar learning experiment all participants were trained on two grammars, consisting of a regularity in letter sequences, while two other dimensions (colours and fonts) varied randomly. Strategic control was measured as the ability to selectively apply the grammars during classification. For each classification, participants also made a combined judgement of (a) decision strategy and (b) relevant stimulus dimension. Strategic control was found for all types of decision strategy, including trials where participants claimed to lack conscious structural knowledge. However, strong evidence of strategic control only occurred when participants knew or guessed that the letter dimension was relevant, suggesting that strategic control might be associated with - or even causally requires - global awareness of the nature of the rules even though it does not require detailed knowledge of their content. Copyright © 2016 The Authors. Published by Elsevier Inc. All rights reserved.

Distance-regular graphs

NARCIS (Netherlands)

van Dam, Edwin R.; Koolen, Jack H.; Tanaka, Hajime

2016-01-01

This is a survey of distance-regular graphs. We present an introduction to distance-regular graphs for the reader who is unfamiliar with the subject, and then give an overview of some developments in the area of distance-regular graphs since the monograph 'BCN'[Brouwer, A.E., Cohen, A.M., Neumaier,

On the strong metric dimension of generalized butterfly graph, starbarbell graph, and {C}_{m}\\odot {P}_{n} graph

Science.gov (United States)

Yunia Mayasari, Ratih; Atmojo Kusmayadi, Tri

2018-04-01

Let G be a connected graph with vertex set V(G) and edge set E(G). For every pair of vertices u,v\\in V(G), the interval I[u, v] between u and v to be the collection of all vertices that belong to some shortest u ‑ v path. A vertex s\\in V(G) strongly resolves two vertices u and v if u belongs to a shortest v ‑ s path or v belongs to a shortest u ‑ s path. A vertex set S of G is a strong resolving set of G if every two distinct vertices of G are strongly resolved by some vertex of S. The strong metric basis of G is a strong resolving set with minimal cardinality. The strong metric dimension sdim(G) of a graph G is defined as the cardinality of strong metric basis. In this paper we determine the strong metric dimension of a generalized butterfly graph, starbarbell graph, and {C}mȯ {P}n graph. We obtain the strong metric dimension of generalized butterfly graph is sdim(BFn ) = 2n ‑ 2. The strong metric dimension of starbarbell graph is sdim(S{B}{m1,{m}2,\\ldots,{m}n})={\\sum }i=1n({m}i-1)-1. The strong metric dimension of {C}mȯ {P}n graph are sdim({C}mȯ {P}n)=2m-1 for m > 3 and n = 2, and sdim({C}mȯ {P}n)=2m-2 for m > 3 and n > 2.

The "Contextual Contact" in Grammar Microteachings in Teaching English as a Foreign Language: A Teacher Training Perspective

Science.gov (United States)

Sarigöz, Iskender Hakki

2015-01-01

The grammar microteachings carried out by trainees in teacher education is a critical issue due to the fact that the teaching of grammar has always been a controversial issue throughout the foreign language teaching (FLT) acculturation. There is always some negative reaction to isolated teaching of grammar in communicative language teaching…

A Comparative Study on Beliefs of Grammar Teaching between High School English Teachers and Students in China

Science.gov (United States)

Deng, Fangfang; Lin, Yuewu

2016-01-01

Grammar is "a system of rules governing the conventional arrangement and relationship of words in a sentence" (Brown 1994) which can facilitate the acquisition of a foreign language and is conducive for cultivating comprehensive language competence. Most teachers regard grammar as a frame of English learning. The grammar teaching beliefs…

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar

2017-03-06

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Subgraph detection using graph signals

KAUST Repository

Chepuri, Sundeep Prabhakar; Leus, Geert

2017-01-01

In this paper we develop statistical detection theory for graph signals. In particular, given two graphs, namely, a background graph that represents an usual activity and an alternative graph that represents some unusual activity, we are interested in answering the following question: To which of the two graphs does the observed graph signal fit the best? To begin with, we assume both the graphs are known, and derive an optimal Neyman-Pearson detector. Next, we derive a suboptimal detector for the case when the alternative graph is not known. The developed theory is illustrated with numerical experiments.

Graph spectrum

NARCIS (Netherlands)

Brouwer, A.E.; Haemers, W.H.; Brouwer, A.E.; Haemers, W.H.

2012-01-01

This chapter presents some simple results on graph spectra.We assume the reader is familiar with elementary linear algebra and graph theory. Throughout, J will denote the all-1 matrix, and 1 is the all-1 vector.

Spoken grammar awareness raising: Does it affect the listening ability of Iranian EFL learners?

Directory of Open Access Journals (Sweden)

Mojgan Rashtchi

2011-12-01

Full Text Available Advances in spoken corpora analysis have brought about new insights into language pedagogy and have led to an awareness of the characteristics of spoken language. Current findings have shown that grammar of spoken language is different from written language. However, most listening and speaking materials are concocted based on written grammar and lack core spoken language features. The aim of the present study was to explore the question whether awareness of spoken grammar features could affect learners’ comprehension of real-life conversations. To this end, 45 university students in two intact classes participated in a listening course employing corpus-based materials. The instruction of the spoken grammar features to the experimental group was done overtly through awareness raising tasks, whereas the control group, though exposed to the same materials, was not provided with such tasks for learning the features. The results of the independent samples t tests revealed that the learners in the experimental group comprehended everyday conversations much better than those in the control group. Additionally, the highly positive views of spoken grammar held by the learners, which was elicited by means of a retrospective questionnaire, were generally comparable to those reported in the literature.

The blue book of grammar and punctuation an easy-to-use guide with clear rules, real-world examples, and reproducible quizzes

CERN Document Server

Straus, Jane; Stern, Tom

2014-01-01

A revised and updated new edition of the bestselling workbook and grammar guide The Blue Book of Grammar and Punctuation is a concise, entertaining workbook and guide to English grammar, punctuation, and usage. This user-friendly resource includes simple explanations of grammar, punctuation, and usage; scores of helpful examples; dozens of reproducible worksheets; and pre- and post-tests to help teach grammar to students of all ages. Appropriate for virtually any age range, this authoritative guide makes learning English grammar and usage simple and fun. This updated Eleventh Edition reflects

Validity of a parent-report measure of vocabulary and grammar for Spanish-speaking toddlers.

Science.gov (United States)

Thal, D; Jackson-Maldonado, D; Acosta, D

2000-10-01

The validity of the Fundación MacArthur Inventario del Desarrollo de Habilidades Comunicativas: Palabras y Enunciados (IDHC:PE) was examined with twenty 20- and nineteen 28-month-old, typically developing, monolingual, Spanish-speaking children living in Mexico. One measure of vocabulary (number of words) and two measures of grammar (mean of the three longest utterances and grammatical complexity score) from the IDHC:PE were compared to behavioral measures of vocabulary (number of different words from a language sample and number of objects named in a confrontation naming task) and one behavioral measure of grammar (mean length of utterance from a language sample). Only vocabulary measures were assessed in the 20-month-olds because of floor effects on the grammar measures. Results indicated validity for assessing expressive vocabulary in 20-month-olds and expressive vocabulary and grammar in 28-month-olds.

Pragmatic Graph Rewriting Modifications

OpenAIRE

Rodgers, Peter; Vidal, Natalia

1999-01-01

We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match at most once with a corresponding node in the host graph. This reduces the previously common use of tags to indicate the progress of matching in the graph. The second modification controls the application of LHS graphs, where those specified a...

Simplicial complexes of graphs

CERN Document Server

Jonsson, Jakob

2008-01-01

A graph complex is a finite family of graphs closed under deletion of edges. Graph complexes show up naturally in many different areas of mathematics, including commutative algebra, geometry, and knot theory. Identifying each graph with its edge set, one may view a graph complex as a simplicial complex and hence interpret it as a geometric object. This volume examines topological properties of graph complexes, focusing on homotopy type and homology. Many of the proofs are based on Robin Forman's discrete version of Morse theory. As a byproduct, this volume also provides a loosely defined toolbox for attacking problems in topological combinatorics via discrete Morse theory. In terms of simplicity and power, arguably the most efficient tool is Forman's divide and conquer approach via decision trees; it is successfully applied to a large number of graph and digraph complexes.

The STAPL Parallel Graph Library

KAUST Repository

Harshvardhan,

2013-01-01

This paper describes the stapl Parallel Graph Library, a high-level framework that abstracts the user from data-distribution and parallelism details and allows them to concentrate on parallel graph algorithm development. It includes a customizable distributed graph container and a collection of commonly used parallel graph algorithms. The library introduces pGraph pViews that separate algorithm design from the container implementation. It supports three graph processing algorithmic paradigms, level-synchronous, asynchronous and coarse-grained, and provides common graph algorithms based on them. Experimental results demonstrate improved scalability in performance and data size over existing graph libraries on more than 16,000 cores and on internet-scale graphs containing over 16 billion vertices and 250 billion edges. © Springer-Verlag Berlin Heidelberg 2013.

Topic Model for Graph Mining.

Science.gov (United States)

Xuan, Junyu; Lu, Jie; Zhang, Guangquan; Luo, Xiangfeng

2015-12-01

Graph mining has been a popular research area because of its numerous application scenarios. Many unstructured and structured data can be represented as graphs, such as, documents, chemical molecular structures, and images. However, an issue in relation to current research on graphs is that they cannot adequately discover the topics hidden in graph-structured data which can be beneficial for both the unsupervised learning and supervised learning of the graphs. Although topic models have proved to be very successful in discovering latent topics, the standard topic models cannot be directly applied to graph-structured data due to the "bag-of-word" assumption. In this paper, an innovative graph topic model (GTM) is proposed to address this issue, which uses Bernoulli distributions to model the edges between nodes in a graph. It can, therefore, make the edges in a graph contribute to latent topic discovery and further improve the accuracy of the supervised and unsupervised learning of graphs. The experimental results on two different types of graph datasets show that the proposed GTM outperforms the latent Dirichlet allocation on classification by using the unveiled topics of these two models to represent graphs.

Modern graph theory

CERN Document Server

Bollobás, Béla

1998-01-01

The time has now come when graph theory should be part of the education of every serious student of mathematics and computer science, both for its own sake and to enhance the appreciation of mathematics as a whole. This book is an in-depth account of graph theory, written with such a student in mind; it reflects the current state of the subject and emphasizes connections with other branches of pure mathematics. The volume grew out of the author's earlier book, Graph Theory -- An Introductory Course, but its length is well over twice that of its predecessor, allowing it to reveal many exciting new developments in the subject. Recognizing that graph theory is one of several courses competing for the attention of a student, the book contains extensive descriptive passages designed to convey the flavor of the subject and to arouse interest. In addition to a modern treatment of the classical areas of graph theory such as coloring, matching, extremal theory, and algebraic graph theory, the book presents a detailed ...

A graph edit dictionary for correcting errors in roof topology graphs reconstructed from point clouds

Science.gov (United States)

Xiong, B.; Oude Elberink, S.; Vosselman, G.

2014-07-01

In the task of 3D building model reconstruction from point clouds we face the problem of recovering a roof topology graph in the presence of noise, small roof faces and low point densities. Errors in roof topology graphs will seriously affect the final modelling results. The aim of this research is to automatically correct these errors. We define the graph correction as a graph-to-graph problem, similar to the spelling correction problem (also called the string-to-string problem). The graph correction is more complex than string correction, as the graphs are 2D while strings are only 1D. We design a strategy based on a dictionary of graph edit operations to automatically identify and correct the errors in the input graph. For each type of error the graph edit dictionary stores a representative erroneous subgraph as well as the corrected version. As an erroneous roof topology graph may contain several errors, a heuristic search is applied to find the optimum sequence of graph edits to correct the errors one by one. The graph edit dictionary can be expanded to include entries needed to cope with errors that were previously not encountered. Experiments show that the dictionary with only fifteen entries already properly corrects one quarter of erroneous graphs in about 4500 buildings, and even half of the erroneous graphs in one test area, achieving as high as a 95% acceptance rate of the reconstructed models.

eLearning Mobile App for Android and Ios "English Grammar Learn & Test"

Directory of Open Access Journals (Sweden)

Anca-Georgiana FODOR

2016-11-01

Full Text Available This article is aiming to present the architecture and few elements from the developing cycle of "English Grammar Learn & Test" app. This is an e-learning tool for people who want to improve their English Grammar and Vocabulary. The app was approved by Google Play and Apple Store and it is available for free on both platforms as following: Android: https://play.google.com/store/apps/details?id=com.labsterzz.english_tests iOS: https://itunes.apple.com/us/app/english-grammar-learn-test/id1126468980 The app already reached350.000 users, it is rated at 4.43out of maximum 5.0 in Google Play Store. Since mid-June 2016, we launched the app also in the Apple Store iOS devices.

Cooperative Business Education - 7725 (Reinforcing Knowledge of Grammar): Department 48 - Course 7725.08.

Science.gov (United States)

Dade County Public Schools, Miami, FL.

The essential elements of grammar required to write business letters, memorandums, and reports are covered in this quinmester course. The course consists of a complete grammar review and the learning of proofreading skills for students in the Cooperative Business Education program in Dade County High Schools. Instruction techniques include group…

Introduction to quantum graphs

CERN Document Server

Berkolaiko, Gregory

2012-01-01

A "quantum graph" is a graph considered as a one-dimensional complex and equipped with a differential operator ("Hamiltonian"). Quantum graphs arise naturally as simplified models in mathematics, physics, chemistry, and engineering when one considers propagation of waves of various nature through a quasi-one-dimensional (e.g., "meso-" or "nano-scale") system that looks like a thin neighborhood of a graph. Works that currently would be classified as discussing quantum graphs have been appearing since at least the 1930s, and since then, quantum graphs techniques have been applied successfully in various areas of mathematical physics, mathematics in general and its applications. One can mention, for instance, dynamical systems theory, control theory, quantum chaos, Anderson localization, microelectronics, photonic crystals, physical chemistry, nano-sciences, superconductivity theory, etc. Quantum graphs present many non-trivial mathematical challenges, which makes them dear to a mathematician's heart. Work on qu...

Graph Generator Survey

Energy Technology Data Exchange (ETDEWEB)

Lothian, Joshua [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Powers, Sarah S. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Sullivan, Blair D. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Baker, Matthew B. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Schrock, Jonathan [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States); Poole, Stephen W. [Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

2013-10-01

The benchmarking effort within the Extreme Scale Systems Center at Oak Ridge National Laboratory seeks to provide High Performance Computing benchmarks and test suites of interest to the DoD sponsor. The work described in this report is a part of the effort focusing on graph generation. A previously developed benchmark, SystemBurn, allowed the emulation of different application behavior profiles within a single framework. To complement this effort, similar capabilities are desired for graph-centric problems. This report examines existing synthetic graph generator implementations in preparation for further study on the properties of their generated synthetic graphs.

Functions and graphs

CERN Document Server

Gelfand, I M; Shnol, E E

1969-01-01

The second in a series of systematic studies by a celebrated mathematician I. M. Gelfand and colleagues, this volume presents students with a well-illustrated sequence of problems and exercises designed to illuminate the properties of functions and graphs. Since readers do not have the benefit of a blackboard on which a teacher constructs a graph, the authors abandoned the customary use of diagrams in which only the final form of the graph appears; instead, the book's margins feature step-by-step diagrams for the complete construction of each graph. The first part of the book employs simple fu

Loose Graph Simulations

DEFF Research Database (Denmark)

Mansutti, Alessio; Miculan, Marino; Peressotti, Marco

2017-01-01

We introduce loose graph simulations (LGS), a new notion about labelled graphs which subsumes in an intuitive and natural way subgraph isomorphism (SGI), regular language pattern matching (RLPM) and graph simulation (GS). Being a unification of all these notions, LGS allows us to express directly...... also problems which are “mixed” instances of previous ones, and hence which would not fit easily in any of them. After the definition and some examples, we show that the problem of finding loose graph simulations is NP-complete, we provide formal translation of SGI, RLPM, and GS into LGSs, and we give...

Using dual-task methodology to dissociate automatic from nonautomatic processes involved in artificial grammar learning.

Science.gov (United States)

Hendricks, Michelle A; Conway, Christopher M; Kellogg, Ronald T

2013-09-01

Previous studies have suggested that both automatic and intentional processes contribute to the learning of grammar and fragment knowledge in artificial grammar learning (AGL) tasks. To explore the relative contribution of automatic and intentional processes to knowledge gained in AGL, we utilized dual-task methodology to dissociate automatic and intentional grammar- and fragment-based knowledge in AGL at both acquisition and at test. Both experiments used a balanced chunk strength grammar to assure an equal proportion of fragment cues (i.e., chunks) in grammatical and nongrammatical test items. In Experiment 1, participants engaged in a working memory dual-task either during acquisition, test, or both acquisition and test. The results showed that participants performing the dual-task during acquisition learned the artificial grammar as well as the single-task group, presumably by relying on automatic learning mechanisms. A working memory dual-task at test resulted in attenuated grammar performance, suggesting a role for intentional processes for the expression of grammatical learning at test. Experiment 2 explored the importance of perceptual cues by changing letters between the acquisition and test phase; unlike Experiment 1, there was no significant learning of grammatical information for participants under dual-task conditions in Experiment 2, suggesting that intentional processing is necessary for successful acquisition and expression of grammar-based knowledge under transfer conditions. In sum, it appears that some aspects of learning in AGL are indeed relatively automatic, although the expression of grammatical information and the learning of grammatical patterns when perceptual similarity is eliminated both appear to require explicit resources. PsycINFO Database Record (c) 2013 APA, all rights reserved.

Confidence and Competence among Community College Students: Self-Efficacy and Performance in Grammar

Science.gov (United States)

Collins, Steve; Bissell, Kimberly

2004-01-01

Proper grammar is crucial for effective communication. Two surveys of students in an introductory writing course sought to identify predictors of grammar ability. Students demonstrated a limited grasp of the language, struggling with such issues as the distinction between "it's" and "its." Women performed better than men at the beginning of the…

Improving language mapping in clinical fMRI through assessment of grammar.

Science.gov (United States)

Połczyńska, Monika; Japardi, Kevin; Curtiss, Susan; Moody, Teena; Benjamin, Christopher; Cho, Andrew; Vigil, Celia; Kuhn, Taylor; Jones, Michael; Bookheimer, Susan

2017-01-01

Brain surgery in the language dominant hemisphere remains challenging due to unintended post-surgical language deficits, despite using pre-surgical functional magnetic resonance (fMRI) and intraoperative cortical stimulation. Moreover, patients are often recommended not to undergo surgery if the accompanying risk to language appears to be too high. While standard fMRI language mapping protocols may have relatively good predictive value at the group level, they remain sub-optimal on an individual level. The standard tests used typically assess lexico-semantic aspects of language, and they do not accurately reflect the complexity of language either in comprehension or production at the sentence level. Among patients who had left hemisphere language dominance we assessed which tests are best at activating language areas in the brain. We compared grammar tests (items testing word order in actives and passives, wh -subject and object questions, relativized subject and object clauses and past tense marking) with standard tests (object naming, auditory and visual responsive naming), using pre-operative fMRI. Twenty-five surgical candidates (13 females) participated in this study. Sixteen patients presented with a brain tumor, and nine with epilepsy. All participants underwent two pre-operative fMRI protocols: one including CYCLE-N grammar tests (items testing word order in actives and passives, wh-subject and object questions, relativized subject and object clauses and past tense marking); and a second one with standard fMRI tests (object naming, auditory and visual responsive naming). fMRI activations during performance in both protocols were compared at the group level, as well as in individual candidates. The grammar tests generated more volume of activation in the left hemisphere (left/right angular gyrus, right anterior/posterior superior temporal gyrus) and identified additional language regions not shown by the standard tests (e.g., left anterior

LeadMine: a grammar and dictionary driven approach to entity recognition

Science.gov (United States)

2015-01-01

Background Chemical entity recognition has traditionally been performed by machine learning approaches. Here we describe an approach using grammars and dictionaries. This approach has the advantage that the entities found can be directly related to a given grammar or dictionary, which allows the type of an entity to be known and, if an entity is misannotated, indicates which resource should be corrected. As recognition is driven by what is expected, if spelling errors occur, they can be corrected. Correcting such errors is highly useful when attempting to lookup an entity in a database or, in the case of chemical names, converting them to structures. Results Our system uses a mixture of expertly curated grammars and dictionaries, as well as dictionaries automatically derived from public resources. We show that the heuristics developed to filter our dictionary of trivial chemical names (from PubChem) yields a better performing dictionary than the previously published Jochem dictionary. Our final system performs post-processing steps to modify the boundaries of entities and to detect abbreviations. These steps are shown to significantly improve performance (2.6% and 4.0% F1-score respectively). Our complete system, with incremental post-BioCreative workshop improvements, achieves 89.9% precision and 85.4% recall (87.6% F1-score) on the CHEMDNER test set. Conclusions Grammar and dictionary approaches can produce results at least as good as the current state of the art in machine learning approaches. While machine learning approaches are commonly thought of as "black box" systems, our approach directly links the output entities to the input dictionaries and grammars. Our approach also allows correction of errors in detected entities, which can assist with entity resolution. PMID:25810776

Effective intervention for expressive grammar in children with specific language impairment.

Science.gov (United States)

Smith-Lock, Karen M; Leitao, Suze; Lambert, Lara; Nickels, Lyndsey

2013-01-01

Children with specific language impairment are known to struggle with expressive grammar. While some studies have shown successful intervention under laboratory conditions, there is a paucity of evidence for the effectiveness of grammar treatment in young children in community settings. To evaluate the effectiveness of a school-based intervention programme for expressive grammar in 5-year-olds with specific language impairment. Thirty-four 5-year-old children attending a specialized school for children with language impairment participated in the study. Nineteen children received treatment for expressive grammar (experimental group) and 15 children received a control treatment. Treatment consisted of weekly 1-h sessions of small group activities in a classroom setting for 8 weeks. Techniques included direct instruction, focused stimulation, recasting and imitation. Results were analysed at the group level and as a case series with each child as their own control in a single-subject design. There was a significant difference in grammatical performance pre- and post-treatment for children who received grammar treatment (Cohen's d = 1.24), but not for a group of children who received a control treatment. Further, no difference in performance was found in the equivalent time period prior to treatment, nor for an untreated target. Treatment success was more pronounced in children without articulation difficulties which interfered with their ability to produce the grammatical targets (Cohen's d = 1.66). Individual analyses indicated the treatment effect was significant for the majority of children. Individually targeted intervention delivered in small groups in a classroom setting was effective in improving production of expressive grammatical targets in 5-year-old children with specific language impairment. © 2013 Royal College of Speech and Language Therapists.

(In)Flexibility of Constituency in Japanese in Multi-Modal Categorial Grammar with Structured Phonology

Science.gov (United States)

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…

Autoregressive Moving Average Graph Filtering

OpenAIRE

Isufi, Elvin; Loukas, Andreas; Simonetto, Andrea; Leus, Geert

2016-01-01

One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions, which (i) are able to approximate any desired graph frequency response, and (ii) give exact solutions for tasks such as graph signal denoising and interpolation. The design phi...

Grammar of Binding in the languages of the world: Innate or learned?

Science.gov (United States)

Cole, Peter; Hermon, Gabriella; Yanti

2015-08-01

Languages around the world often appear to manifest nearly identical grammatical properties, but, at the same time, the grammatical differences can also be great, sometimes even seeming to support Joos's (1958) claim that "languages can differ from each other without limit and in unpredictable way" (p. 96). This state of affairs provides a puzzle for both nativist approaches to language like Generative Grammar that posit a fixed "Universal Grammar", and for approaches that minimize the contribution of innate grammatical structure. We approach this puzzling state of affairs by looking at one area of grammar, "Binding", the system of local and long distance anaphoric elements in a language. This is an area of grammar that has long been central to the Generative approach to language structure. We compare the anaphoric systems found in "familiar" (European-like) languages that contain dedicated classes of bound and free anaphors (pronouns and reflexives) with the anaphoric systems in endangered Austronesian languages of Indonesia, languages in which there is overlap or no distinction between pronouns and reflexives (Peranakan Javanese and Jambi Malay). What is of special interest about Jambi anaphora is not only that conservative dialects of Jambi Malay do not distinguish between pronouns and reflexives, but that Jambi anaphora appear to constitute a live snapshot of a unitary class of anaphora in the process of grammaticalization as a distinct system of pronouns and reflexives. We argue that the facts of Jambi anaphora cannot be explained by theories positing a Universal Grammar of Binding. Thus, these facts provide evidence that complex grammatical systems like Binding cannot be innate. Our results from Austronesian languages are confirmed by data from signed and creole languages. Our conclusion is that the human language learning capacity must include the ability to model the full complexity found in the syntax of the world's languages. From the perspective of child

On cyclic orthogonal double covers of circulant graphs by special infinite graphs

Directory of Open Access Journals (Sweden)

R. El-Shanawany

2017-12-01

Full Text Available In this article, a technique to construct cyclic orthogonal double covers (CODCs of regular circulant graphs by certain infinite graph classes such as complete bipartite and tripartite graphs and disjoint union of butterfly and K1,2n−10 is introduced.

Artificial grammar learning in individuals with severe aphasia.

Science.gov (United States)

Zimmerer, Vitor C; Cowell, Patricia E; Varley, Rosemary A

2014-01-01

One factor in syntactic impairment in aphasia might be damage to general structure processing systems. In such a case, deficits would be evident in the processing of syntactically structured non-linguistic information. To explore this hypothesis, we examined performances on artificial grammar learning (AGL) tasks in which the grammar was expressed in non-linguistic visual forms. In the first experiment, AGL behavior of four aphasic participants with severe syntactic impairment, five aphasic participants without syntactic impairment, and healthy controls was examined. Participants were trained on sequences of nonsense stimuli with the structure A(n)B(n). Data were analyzed at an individual level to identify different behavioral profiles and account for heterogeneity in aphasic as well as healthy groups. Healthy controls and patients without syntactic impairment were more likely to learn configurational (item order) than quantitative (counting) regularities. Quantitative regularities were only detected by individuals who also detected the configurational properties of the stimulus sequences. By contrast, two individuals with syntactic impairment learned quantitative regularities, but showed no sensitivity towards configurational structure. They also failed to detect configurational structure in a second experiment in which sequences were structured by the grammar A(+)B(+). We discuss the potential relationship between AGL and processing of word order as well as the potential of AGL in clinical practice. © 2013 Published by Elsevier Ltd.

TEACHING GRAMMAR-IN-CONTEXT AND ITS IMPACT IN MINIMIZING STUDENTS’ GRAMMATICAL ERRORS

Directory of Open Access Journals (Sweden)

Yadhi Nur Amin

2015-11-01

Full Text Available This study is conducted to determine the effectiveness of teaching grammar-in-context to minimize students‘ grammatical errors in writing. The design of the study was a quasi-experimental with a non-randomized pretest-posttest control group. The samples of the study were taken from the population of the tenth-grade students. The control group was taught by conventional grammar which was separately given with writing skills. Likewise, the experimental one was treated by teaching grammar-in-context. The results of the study showed that the mean score in the post-test was higher than that in the pretest; and the mean score of experimental group increased 16.20 point after the treatment. This result indicated that teaching grammarin-context is considered to be effective in minimizing students‘ grammatical errors in writing.