Switch to: Citations

Add references

You must login to add references.
  1. Three Models for the Description of Language.N. Chomsky - 1956 - IRE Transactions on Information Theory 2:113-124.
    Download  
     
    Export citation  
     
    Bookmark   78 citations  
  • Elements of the Theory of Computation.Harry R. Lewis & Christos H. Papadimitriou - 1984 - Journal of Symbolic Logic 49 (3):989-990.
    Download  
     
    Export citation  
     
    Bookmark   40 citations  
  • Lectures on Government and Binding.Noam Chomsky - 1981 - Foris.
    A more extensive discussion of certain of the more technical notions appears in my paper "On Binding" (Chomsky,; henceforth, OB). ...
    Download  
     
    Export citation  
     
    Bookmark   644 citations  
  • The complexity of the vocabulary of bambara.Christopher Culy - 1985 - Linguistics and Philosophy 8 (3):345 - 351.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • The Interpretatin of Ellipsis.Shalom Lappin - 1996 - In The handbook of contemporary semantic theory. Cambridge, Mass., USA: Blackwell Reference. pp. 145--176.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • (1 other version)The handbook of contemporary semantic theory.Shalom Lappin (ed.) - 1996 - Cambridge, Mass., USA: Blackwell Reference.
    1. Formal semantics in linguistics -- 2. Generalized quantifier theory -- 3. The interface between syntax and semantics -- 4. Anaphora, discourse, and modality -- 5. Focus, presupposition, and negation -- 6. Tense -- 7. Questions -- 8. Plurals -- 9. Computational semantics -- 10. Lexical semantics -- 11. Semantics and related domains.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Ellipsis and higher-order unification.Mary Dalrymple, Stuart M. Shieber & Fernando C. N. Pereira - 1991 - Linguistics and Philosophy 14 (4):399 - 452.
    We present a new method for characterizing the interpretive possibilities generated by elliptical constructions in natural language. Unlike previous analyses, which postulate ambiguity of interpretation or derivation in the full clause source of the ellipsis, our analysis requires no such hidden ambiguity. Further, the analysis follows relatively directly from an abstract statement of the ellipsis interpretation problem. It predicts correctly a wide range of interactions between ellipsis and other semantic phenomena such as quantifier scope and bound anaphora. Finally, although the (...)
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • What VP ellipsis can do, and what it can't, but not why.Kyle Johnson - 2001 - In Mark Baltin & Chris Collins (eds.), The Handbook of Contemporary Syntactic Theory. Blackwell. pp. 439--479.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Evidence against the context-freeness of natural language.Stuart M. Shieber - 1985 - Linguistics and Philosophy 8 (3):333 - 343.
    Download  
     
    Export citation  
     
    Bookmark   68 citations  
  • Human Behavior and the Principle of Least Effort. An Introduction to Human Ecology. George K. Zipf.Svend Riemer - 1950 - Philosophy of Science 17 (2):204-205.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • (2 other versions)Review on "Three Models for the Description of Language" by Noam Chomsky. [REVIEW]Lars Svenonius - 1956 - Journal of Symbolic Logic 23 (1):71-72.
    Download  
     
    Export citation  
     
    Bookmark   66 citations  
  • D‐LTAG: extending lexicalized TAG to discourse.Bonnie Webber - 2004 - Cognitive Science 28 (5):751-779.
    This paper surveys work on applying the insights of lexicalized grammars to low‐level discourse, to show the value of positing an autonomous grammar for low‐level discourse in which words (or idiomatic phrases) are associated with discourse‐level predicate–argument structures or modification structures that convey their syntactic‐semantic meaning and scope. It starts by describing a lexicalized Tree Adjoining Grammar for discourse (D‐LTAG). It then reviews an initial experiment in parsing text automatically, using both a lexicalized TAG and D‐LTAG, and then touches upon (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Mild context-sensitivity and tuple-based generalizations of context-grammar.Annius V. Groenink - 1997 - Linguistics and Philosophy 20 (6):607-636.
    This paper classifies a family of grammar formalisms that extendcontext-free grammar by talking about tuples of terminal strings, ratherthan independently combining single terminal words into larger singlephrases. These include a number of well-known formalisms, such as headgrammar and linear context-free rewriting systems, but also a new formalism,(simple) literal movement grammar, which strictly extends the previouslyknown formalisms, while preserving polynomial time recognizability.The descriptive capacity of simple literal movement grammars isillustrated both formally through a weak generative capacity argument and ina more practical (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Attribute-Value Logic and the Theory of Grammar.Mark Johnson - 1989 - Center for the Study of Language and Information Publications.
    Because of the ease of their implementation, attribute-value based theories of grammar are becoming increasingly popular in theoretical linguistics as an alternative to transformational accounts and in computational linguistics. This book provides a formal analysis of attribute-value structures, their use in a theory of grammar and the representation of grammatical relations in such theories of grammar. It provides a classical treatment of disjunction and negation, and explores the linguistic implications of different representations of grammatical relations. Mark Johnson is assistant professor (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Unbounded syntactic copying in mandarin chinese.Daniel Radzinski - 1990 - Linguistics and Philosophy 13 (1):113 - 127.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Review: S.-Y. Kuroda, Classes of Languages and Linear-Bounded Automata. [REVIEW]Peter S. Landweber - 1967 - Journal of Symbolic Logic 32 (1):116-117.
    Download  
     
    Export citation  
     
    Bookmark   2 citations