Fork me on GitHub
Browse by Topic

More Output

  1. Relative Clauses as a Benchmark for Minimalist Parsing

    Graf, Thomas, James Monette, and Chong Zhang

    Abstract Minimalist grammars have been used recently in a series of papers to explain well-known contrasts in human sentence processing in terms of subtle structural differences. These proposals combine a top-down parser with complexity metrics that relate parsing …

    read more
  2. Computational Parallels Across Language Modules

    Graf, Thomas

    Abstract Linguists study a variety of aspects of language, including phonology, morphology, and syntax. It is commonly believed that those are distinct modules of language, governed by very different principles and consequently studied with very different tools. While there have been attempts at …

    read more
  3. Morphotactics as Tier-Based Strictly Local Dependencies

    Aksënova, Alëna, Thomas Graf, and Sedigheh Moradi

    Abstract It is commonly accepted that morphological dependencies are finite-state in nature. We argue that the upper bound on morphological expressivity is much lower. Drawing on technical results from computational phonology, we show that a variety of morphotactic …

    read more
  4. Morphotactics as Tier-Based Strictly Local Dependencies

    Aksënova, Alëna, Thomas Graf, and Sedigheh Moradi

    Abstract It is commonly accepted that morphological dependencies are finite-state in nature. We argue that the upper bound on morphological expressivity is much lower. Drawing on technical results from computational phonology, we show that a variety of morphotactic …

    read more
  5. A Computational Guide to the Dichotomy of Features and Constraints

    Graf, Thomas

    Abstract A contentious issue in the Minimalist literature is whether certain phenomena are best described in terms of features or constraints. Building on recent work in mathematical linguistics, I argue that constraints and features are interchangeable in Minimalist syntax. This does not invalidate …

    read more
  6. A Computational Guide to the Dichotomy of Features and Constraints

    Graf, Thomas

    Abstract A contentious issue in the Minimalist literature is whether certain phenomena are best described in terms of features or constraints. Building on recent work in mathematical linguistics, I argue that constraints and features are interchangeable in Minimalist syntax. This does not invalidate …

    read more
  7. Memory Usage Predicts Relative Difficulty in Human Sentence Processing

    Graf, Thomas, James Monette, Robert Pasternak, and Chong Zhang

    Files [pdf] [code]

    @Misc{GrafEtAl16IACSposter,
      author    = {Graf, Thomas and Monette, James and Pasternak, Robert and Zhang, Chong},
      title     = {Memory Usage Predicts Relative Difficulty in Human Sentence Processing},
      year      = {2016},
      note      = {Poster presented at the {IACS} {R …
    read more
  8. Adjuncts, Conjuncts, Ojuncts: Deriving Strong Island Constraints

    Graf, Thomas

    Abstract Adjuncts differ from arguments by a number of properties, in particular i) optionality and ii) their island status, which renders them opaque for extraction of subconstituents. Conjuncts, too, are optional and forbid extraction. Starting from this basic observation, I demonstrate that islandhood …

    read more
  9. A Refined Notion of Memory Usage for Minimalist Parsing

    Graf, Thomas, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, and Chong Zhang

    Abstract Recently there has been a lot of interest in testing the processing predictions of a specific top-down parser for Minimalist grammars (Stabler 2012). Most of this work relies on memory-based difficulty …

    read more
  10. A Refined Notion of Memory Usage for Minimalist Parsing

    Graf, Thomas, Brigitta Fodor, James Monette, Gianpaul Rachiele, Aunika Warren, and Chong Zhang

    Abstract Recently there has been a lot of interest in testing the processing predictions of a specific top-down parser for Minimalist grammars (Stabler 2012). Most of this work relies on memory-based difficulty …

    read more
  11. A Hidden Consensus: Computational Invariants of Minimalist Syntax

    Graf, Thomas

    Abstract A common sentiment among linguists is that the Minimalist literature features a dazzling array of competing proposals that seem to share little common ground in their technical assumptions. While differences certainly do exist between accounts, a computationally informed perspective reveals a set …

    read more
  12. Commonality in Disparity: The Computational View of Syntax and Phonology

    Graf, Thomas, and Jeffrey Heinz

    Abstract Heinz and Idsardi (2013) draw attention to a computational difference between syntax and phonology established by earlier research: phonology only requires regular computations over strings (Johnson 1972, Kaplan and Kay 1995), whereas syntax involves non-regular computations over strings (Chomsky …

    read more
  13. A Computational Guide to the Dichotomy of Features and Constraints

    Graf, Thomas

    Abstract I draw on various result from mathematical linguistics to argue that feature-based accounts and constraint-based ones should not be viewed as competing with each other but rather as complementing each other. In particular, recent results on Minimalist grammars show that features and …

    read more
  14. Models of Adjunction in Minimalist Grammars

    Graf, Thomas

    Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational …

    read more
  15. Models of Adjunction in Minimalist Grammars

    Graf, Thomas

    Abstract Three closely related proposals for adding (cyclic) adjunction to Minimalist grammars are given model-theoretic definitions and investigated with respect to their linguistic and formal properties. While they differ with respect to their linguistic adequacy, they behave largely the same on a computational …

    read more
  16. Beyond the Apparent: Cognitive Parallels Between Syntax and Phonology

    Graf, Thomas

    Abstract One of the central changes in 20th century linguistics was the reconceptualization of language as a cognitive ability rather than merely an abstract relational system of signs —- in the terminology of Chomsky (1986), the move from E-language to I-language. This shift entails …

    read more
  17. Local and Transderivational Constraints in Syntax and Semantics

    Graf, Thomas

    Abstract A long-standing tension in Minimalist syntax is that between the structure-building operations Merge and Move on the one hand and the constraints restricting the shape of the structures built by said operations on the other. Proposals differ vastly in how much weight …

    read more
  18. The Syntactic Algebra of Adjuncts

    Graf, Thomas

    Abstract I argue that the special behavior of adjuncts is a consequence of two properties that set them apart from arguments: optionality and independence.

    • Optionality Adjuncts can be omitted.
    • Independence Independently well-formed adjuncts can be combined.

    These properties yield several grammaticality inferences that …

    read more
  19. Of Tops and Bottom: The Algebra of Person Case Constraints

    Graf, Thomas

    Abstract The Person Case Constraint blocks certain combinations of clitics and weak pronouns in a variety of languages. Out of the numerous logical possibilities, only four variants of the Person Case Constraint are attested. I show that these four variants form a natural …

    read more
  20. Movement-Generalized Minimalist Grammars

    Graf, Thomas

    Abstract A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating …

    read more
  21. Movement-Generalized Minimalist Grammars

    Graf, Thomas

    Abstract A general framework is presented that allows for Minimalist grammars to use arbitrary movement operations under the proviso that they are all definable by monadic second-order formulas over derivation trees. Lowering, sidewards movement, and clustering, among others, are the result of instantiating …

    read more
  22. Concealed Reference-Set Computation: How Syntax Escapes the Parser’s Clutches

    Graf, Thomas

    Abstract It has been conjectured that all properties of language beyond recursion can be motivated by interface requirements. One component in this setup is the parser, which is thought to give rise to a preference for computational parsimony. I discuss a mathematical result …

    read more
  23. Theories of Everything. in Honor of Ed Keenan

    Graf, Thomas, Denis Paperno, Anna Szabolcsi, and Jos Tellings [eds.]

    Abstract A festschrift for Ed Keenan, containing 49 contributions from a variety of areas (syntax, semantics, typology, computational).

    Files [pdf]

    @Proceedings{GrafEtAl12Festschrift,
      title     = {Theories of Everything. In Honor of Ed Keenan},
      year      = {2012},
      editor    = {Graf …
    read more
  24. Locality and the Complexity of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Minimalist grammars provide a formalization of Minimalist syntax which allows us to study how the components of said theory affect its expressivity. A central concern of Minimalist syntax is the locality of the displacement operation Move. In Minimalist grammars, however, Move is …

    read more
  25. Locality and the Complexity of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Minimalist grammars provide a formalization of Minimalist syntax which allows us to study how the components of said theory affect its expressivity. A central concern of Minimalist syntax is the locality of the displacement operation Move. In Minimalist grammars, however, Move is …

    read more
  26. Closure Properties of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; Stabler 1997, Stabler & Keenan 2003) are closed under intersection with regular tree languages (Graf 2010). Using a variation of a proof technique devised by Thatcher (1967), I …

    read more
  27. Closure Properties of Minimalist Derivation Tree Languages

    Graf, Thomas

    Abstract Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; Stabler 1997, Stabler & Keenan 2003) are closed under intersection with regular tree languages (Graf 2010). Using a variation of a proof technique devised by Thatcher (1967), I …

    read more
  28. Optimality Is Not a Race: Against a Performance-Based View of Reference-Set Computation

    Graf, Thomas

    Abstract Reference-set constraints (RCs; also known as transderivational constraints) differ from standard well-formedness conditions in that for every tree, they compute a set of output candidates called its reference set and pick from said set the optimal candidate(s) according to some economy …

    read more
  29. Lost in Translation: A Formal Model of Merge-over-Move and Its Implications for the Language Faculty

    Graf, Thomas

    Abstract I demonstrate that Merge-over-Move (MOM), a transderivational constraint (TC) put forward in Chomsky (1995, 2000), can be modeled by linear tree transducers, i.e.\ machines that take a tree as input and traverse it from the leaves towards the root while at …

    read more
  30. Syntax, Semantics, Pragmatics: Where Do We Find Optimality?

    Graf, Thomas

    Files [pdf] [code]

    @Misc{Graf10Goettingentalk,
      author    = {Graf, Thomas},
      title     = {Syntax, Semantics, Pragmatics: Where do we Find
              Optimality?},
      year      = {2010},
      note      = {Invited talk, December 15, Institut für Anglistik,
              Universität Göttingen, Göttingen, Germany}
    }
    
    read more
  31. Reference-Set Computation = Minimalism + Transformational Rules?

    Graf, Thomas

    Abstract Transderivational constraints (TC) formed an integral part of the early Minimalist Program. I develop a formal model of TCs firmly rooted in automata theory and subsequently argue that

    • in general, TCs aren’t computationally intractable, nor does their complexity exceed that of …
    read more
  32. Efficient Computation at the Interfaces

    Graf, Thomas

    Files [pdf] [code]

    @Misc{Graf10ONLIposter,
      author    = {Graf, Thomas},
      title     = {Efficient Computation at the Interfaces},
      year      = {2010},
      note      = {Poster presented at On Linguistic Interfaces II (OnLI II),
              December 2--4, 2010, University of Ulster, Belfast, United
              Kingdom}
    }
    
    read more
  33. Logics of Phonological Reasoning

    Graf, Thomas

    Abstract Inspired by Kracht (2003) and Potts and Pullum (2002), who use tools from mathematical logic in their investigation of phonological theories, I develop an extendable modal logic over string structures, which in turn is used to formalize a specific phonological theory, Government …

    read more
  34. Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems

    Graf, Thomas

    Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

    read more
  35. Reference-Set Constraints as Linear Tree Transductions via Controlled Optimality Systems

    Graf, Thomas

    Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

    read more
  36. Concealed Reference-Set Computation or How Syntax Escapes the Parser’s Clutches

    Graf, Thomas

    Abstract A core assumption of the biolinguistic program is that all properties of language beyond recursion can be motivated by requirements imposed by other cognitive modules. One component in this setup is the parser, which is thought to give rise to a preference …

    read more
  37. Some Interdefinability Results for Syntactic Constraint Classes

    Graf, Thomas

    Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …

    read more
  38. Comparing Incomparable Frameworks: A Model Theoretic Approach to Phonology

    Graf, Thomas

    Abstract In previous work, we used techniques from mathematical logic and model theory to study and compare two phonological theories, SPE and Government Phonology. The surprising result was that Government Phonology corresponds to a very weak fragment of SPE, yet it can attain …

    read more
  39. A Tree Transducer Model of Reference-Set Computation

    Graf, Thomas

    Abstract Reference-set constraints are a special class of constraints used in Minimalist syntax. They extend the notion of well-formedness beyond the level of single trees: When presented with some phrase structure tree, they compute its set of competing output candidates and determine the …

    read more
  40. Papers in Mathematical Linguistics 1

    Graf, Thomas [ed.]

    Abstract A collection of articles in mathematical linguistics.

    Files [pdf]

    @Proceedings{Graf10WPLissue,
      title     = {Papers in Mathematical Linguistics 1},
      year      = {2010},
      editor    = {Thomas Graf},
      volume    = {15},
      series    = {UCLA Working Papers in Linguistics}
    }
    
    read more
  41. Locality in Flux — Reducibility Results for Syntactic Constraints

    Graf, Thomas

    Abstract Müller and Sternefeld (2000) propose a locality hierarchy of syntactic constraints such that {representational, derivational} < global < translocal < transderivational. We use formal methods to demonstrate that their hierarchy correctly assumes that higher constraint classes are more powerful, but we also show that for …

    read more
  42. Some Interdefinability Results for Syntactic Constraint Classes

    Graf, Thomas

    Abstract Choosing as my vantage point the linguistically motivated Müller-Sternefeld hierarchy (Müller and Sternefeld 2000), which classifies constraints according to their locality properties, I investigate the interplay of various syntactic constraint classes on a formal level. For non-comparative constraints, I use Rogers’ (2003 …

    read more
  43. Towards a Factorization of String-Based Phonology

    Graf, Thomas

    Abstract Inspired by the model-theoretic approach to phonology deployed by Kracht (2003) and Potts and Pullum (2002), I develop an extendible modal logic for the investigation of phonological theories operating on (richly annotated) string structures. In contrast to previous research in this vein …

    read more
  44. Towards a Factorization of String-Based Phonology

    Graf, Thomas

    Abstract Inspired by the model-theoretic approach to phonology deployed by Kracht (2003) and Potts and Pullum (2002), I develop an extendible modal logic for the investigation of phonological theories operating on (richly annotated) string structures. In contrast to previous research in this vein …

    read more
  45. Comparing Incomparable Frameworks — a Model Theoretic Approach to Phonology

    Graf, Thomas

    Abstract In previous work, we used techniques from mathematical logic and model theory to study and compare two phonological theories, SPE and Government Phonology. The surprising result was that Government Phonology corresponds to a very weak fragment of SPE, yet it can attain …

    read more
  46. Agreement with Hybrid Nouns in Icelandic

    Graf, Thomas

    Abstract A short squib on the special gender agreement properties exhibited by Icelandic nouns when their semantic gender is different from their syntactic gender.

    Files [pdf]

    @Article{Graf07Snippets,
      author    = {Graf, Thomas},
      title     = {Agreement with Hybrid Nouns in {I}celandic},
      year      = {2007},
      journal   = {Snippets …
    read more

links

contact