Results 261 to 270 of about 182,764 (317)
Some of the next articles are maybe not open access.
2008
To acquire competence with a natural language, young children must master the grammatical constructions of their language(s). In this chapter we outline the main theoretical issues in the field and trace the developmental path children follow from talking in single unit ‘holophrases’ to using complex, abstract constructions. We describe the development
Matthews, D, Tomasello, M.
openaire +3 more sources
To acquire competence with a natural language, young children must master the grammatical constructions of their language(s). In this chapter we outline the main theoretical issues in the field and trace the developmental path children follow from talking in single unit ‘holophrases’ to using complex, abstract constructions. We describe the development
Matthews, D, Tomasello, M.
openaire +3 more sources
1996
Journal of Automata, Languages and Combinatorics, Volume 1, Number 3, 1996, 219 ...
Păun, Gheorghe +2 more
openaire +2 more sources
Journal of Automata, Languages and Combinatorics, Volume 1, Number 3, 1996, 219 ...
Păun, Gheorghe +2 more
openaire +2 more sources
International Journal of Foundations of Computer Science, 2015
This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings.
Křivka, Zbyněk, Meduna, Alexander
openaire +1 more source
This paper introduces and studies jumping grammars, which represent a grammatical counterpart to the recently introduced jumping automata. These grammars are conceptualized just like classical grammars except that during the applications of their productions, they can jump over symbols in either direction within the rewritten strings.
Křivka, Zbyněk, Meduna, Alexander
openaire +1 more source
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