Results 251 to 260 of about 950,611 (302)
Some of the next articles are maybe not open access.
Checking Grammar — Teaching Grammar
Computer Assisted Language Learning, 1998This paper discusses selected theories of Second Language Acquisition and their implications for developing a CALL tool for learners of German — ‘Textana’. Textana was planned as a generic text production tool, i.e. it was meant to provide help to learners in outlining, editing and post-editing texts in their foreign language, German (Schulze, 1997 ...
openaire +1 more source
Journal of Mathematical Physics, 2000
We consider quantum (unitary) continuous time evolution of spins on a lattice together with quantum evolution of the lattice itself. In physics such evolution was discussed in connection with quantum gravity. It is also related to what is called quantum circuits, one of the incarnations of a quantum computer.
openaire +1 more source
We consider quantum (unitary) continuous time evolution of spins on a lattice together with quantum evolution of the lattice itself. In physics such evolution was discussed in connection with quantum gravity. It is also related to what is called quantum circuits, one of the incarnations of a quantum computer.
openaire +1 more source
The Modern Language Journal, 1932
Author's Summary.— A plea for the graphic presentation of grammar to aid the average student, who, being visual‐minded, remembers better what he sees than what he hears; and also, graphic explanations of three difficult French grammatical constructions, to show possible methods of procedure.
openaire +1 more source
Author's Summary.— A plea for the graphic presentation of grammar to aid the average student, who, being visual‐minded, remembers better what he sees than what he hears; and also, graphic explanations of three difficult French grammatical constructions, to show possible methods of procedure.
openaire +1 more source
Journal of the ACM, 1974
A solution is presented for the following problem: Determine a procedure that produces, for each full trio L of context-free languages (more generally, each trio of r.e. languages), a family of context-free (phrase structure) grammars which (a) defines L, (b) is simple enough for practical and theoretical purposes, and (c) in most cases is a subfamily ...
Gabrielian, Armen, Ginsburg, Seymour
openaire +1 more source
A solution is presented for the following problem: Determine a procedure that produces, for each full trio L of context-free languages (more generally, each trio of r.e. languages), a family of context-free (phrase structure) grammars which (a) defines L, (b) is simple enough for practical and theoretical purposes, and (c) in most cases is a subfamily ...
Gabrielian, Armen, Ginsburg, Seymour
openaire +1 more source
WIREs Cognitive Science, 2010
AbstractConstruction grammar, or constructionist approaches more generally, emphasize the function of particular constructions as well as their formal properties. Constructions vary in their degree of generality, from words to idioms to more abstract patterns such as argument structure constructions, topicalization, and passive.
Adele, Goldberg, Laura, Suttle
openaire +2 more sources
AbstractConstruction grammar, or constructionist approaches more generally, emphasize the function of particular constructions as well as their formal properties. Constructions vary in their degree of generality, from words to idioms to more abstract patterns such as argument structure constructions, topicalization, and passive.
Adele, Goldberg, Laura, Suttle
openaire +2 more sources
The Modern Language Journal, 1930
Author's summary.— Some of the infelicities in current grammar terminology, and insidious inaccuracies in analysis of grammatical phenomena, which the writer's teaching experience leads him to consider among the most prejudicial to effective pedagogy in the modern languages.
openaire +1 more source
Author's summary.— Some of the infelicities in current grammar terminology, and insidious inaccuracies in analysis of grammatical phenomena, which the writer's teaching experience leads him to consider among the most prejudicial to effective pedagogy in the modern languages.
openaire +1 more source
Grammar and Contrastive Grammar
1987A person who speaks a language may be said to have mastered the grammar of that language. Knowing a language can be equated with knowing its grammar. The word ‘grammar’, as used here, refers to the set of rules that the speakers of a language carry around in their heads and that they employ in producing and interpreting sentences.
Flor G. A. M. Aarts, Herman Chr. Wekker
openaire +1 more source
2023
Journal of Automata, Languages and Combinatorics, Volume 28, Number 4, 2023, 279 ...
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 28, Number 4, 2023, 279 ...
openaire +2 more sources
Journal of the ACM, 1967
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
openaire +2 more sources
A decision procedure is given which determines whether the languages defined by two parenthesis grammars are equal.
openaire +2 more sources
Fundamenta Informaticae, 1985
In the paper we define the notions of the best lower and the best upper approximations of grammar, which are based on the concept of rough set introduced by Pawlak in [4]. Furthermore we give the properties of languages generated by the best lower and the best upper approximations of grammar.
openaire +2 more sources
In the paper we define the notions of the best lower and the best upper approximations of grammar, which are based on the concept of rough set introduced by Pawlak in [4]. Furthermore we give the properties of languages generated by the best lower and the best upper approximations of grammar.
openaire +2 more sources