Browse by Topic

More Output

  1. Typological Implications of Tier-Based Strictly Local Movement

    Graf, Thomas

    Abstract Earlier work has shown that movement, which forms the backbone of Minimalist syntax, belongs in the subregular class of TSL-2 dependencies over trees. The central idea is that movement, albeit unbounded, boils down to local mother-daughter dependencies on a specific substructure …

    read more
  2. Abstract Semantic automata theory studies the complexity of generalized quantifiers in terms of the string languages that describe their truth conditions. An important point has gone unnoticed so far: for most quantifiers that are determiners, these string languages are subregular. Whereas quantifier phrases such as …

    read more
  3. Abstract Semantic automata theory studies the complexity of generalized quantifiers in terms of the string languages that describe their truth conditions. An important point has gone unnoticed so far: for most quantifiers that are determiners, these string languages are subregular. Whereas quantifier phrases such as …

    read more
  4. Abstract Even though languages are capable of expressing very complex generalized quantifiers such as all but seven and an even number of, the range of possible meanings for monomorphemic determiners seems to be limited to every, no, some, and numerals. In this talk, I argue …

    read more
  5. Abstract Semantic automata were developed to compare the complexity of generalized quantifiers based on the complexity of the string languages that describe their truth conditions. An important point that has gone unnoticed so far is that the generated string languages are remarkably simple for monomorphemic …

    read more
  6. 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 phenomena are tier-based strictly local and do …

    read more
  7. 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 phenomena are tier-based strictly local and do …

    read more
  8. Abstract Recent results show that both TAG and Minimalist grammars can be enriched with rational constraints without increasing their strong generative capacity, where a constraint is rational iff it can be computed by a bottom-up tree automaton. This raises the question which aspects of syntax …

    read more
  9. Abstract Recent results show that both TAG and Minimalist grammars can be enriched with rational constraints without increasing their strong generative capacity, where a constraint is rational iff it can be computed by a bottom-up tree automaton. This raises the question which aspects of syntax …

    read more
  10. Abstract It is a well-known fact that pronouns can sometimes be locally bound in English, for instance in picture-phrases and certain adjuncts. Even though many different analyses have been developed over the years, it is still unclear why English exhibits this behavior, and more …

    read more
  11. Abstract Recent Minimalist thinking has been strongly influenced by the idea that some universals may be due to factors outside the language faculty, in particular limited computational resources (Chomsky 2005). In combination with recent results on Stablerian Minimalist grammars (Stabler 1997, Graf 2011, Kobele 2011 …

    read more

links

contact