5 found
Order:
See also
  1.  4
    Mixed Computation.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 3 (2):215-244.
    Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recursive enumeration is carried out by a procedure which strongly generates a set of structural descriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  2.  14
    Implicit Learning, Bilingualism, and Dyslexia: Insights From a Study Assessing AGL With a Modified Simon Task.Maria Vender, Diego Gabriel Krivochen, Beth Phillips, Douglas Saddy & Denis Delfitto - 2019 - Frontiers in Psychology 10.
    This paper presents an experimental study investigating artificial grammar learning (AGL) in monolingual and bilingual children, with and without dyslexia, using an original methodology. We administered a serial reaction time (SRT) task, in the form of a modified Simon task, in which the sequence of the stimuli was manipulated according to the rules of a simple Lindenmayer grammar (more specifically, a Fibonacci grammar). By ensuring that the subjects focused on the correct response execution at the motor stage in presence of (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  3.  1
    Introduction.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 3 (2):123-128.
  4. Mixed Computation: Grammar Up and Down the Chomsky Hierarchy.Diego Gabriel Krivochen - 2021 - Evolutionary Linguistic Theory 2 (3):215-244.
    Proof-theoretic models of grammar are based on the view that an explicit characterization of a language comes in the form of the recursive enumeration of strings in that language. That recur-sive enumeration is carried out by a procedure which strongly generates a set of structural de-scriptions Σ and weakly generates a set of strings S; a grammar is thus a function that pairs an element of Σ with elements of S. Structural descriptions are obtained by means of Context-Free phrase structure (...)
     
    Export citation  
     
    Bookmark  
  5. Lexicalised Locality: Local Domains and Non-Local Dependencies in a Lexicalised Tree Adjoining Grammar.Diego Gabriel Krivochen & Andrea Padovan - 2021 - Philosophies 6 (70):70.
    Contemporary generative grammar assumes that syntactic structure is best described in terms of sets, and that locality conditions, as well as cross-linguistic variation, is determined at the level of designated functional heads. Syntactic operations build a structure by deriving sets from lexical atoms and recursively yielding sets of sets. Additional restrictions over the format of structural descriptions limit the number of elements involved in each operation to two at each derivational step, a head and a non-head. In this paper, we (...)
    Direct download  
     
    Export citation  
     
    Bookmark