MDST 311-1 (Schedule # 40410)
University of Virginia
Spring 2006
MWF 11:00-11:50am :: Ruffner Hall G004B
Mr. David Golumbia
Office: 304B Bryan
Spring 2006 Office Hours: MW 9:30-10:30am, W 1:30-2:30pm

Computers and Languages

Topics and Reading Lists for Additional Units

These topics are intended primarily for study by Cognitive Science and Linguistics majors. However, all students are free to work with these materials.

• Context-Free Grammars and Natural Languages
  1. Bresnan, Joan, R. M. Kaplan, S. Peters, and A. Zeanen. 1982. "Cross-Serial Dependencies in Dutch." Linguistic Inquiry 13. 613-635.
  2. Chomsky, Noam. 1959. "On Certain Formal Properties of Grammars." Information and Control 2. 137-167.
  3. Postal, Paul and Terrence Langendoen. 1985. "English and the Class of Context-Free Languages." Computational Linguistics 10. 177-181.
  4. Shieber, Stuart M. 1985. "Evidence Against the Context-Freeness of Natural Language." Linguistics and Philosophy 8:3 (August 1985). 333-343.
• Probabilistic Analysis and Linguistic Structure
  1. Bybee, Joan. 2005. "The Impact of Use on Representation: Grammar Is Usage and Usage Is Grammar." LSA Plenary Address (January 8, 2005).
  2. Gahl, Susanne, and Susan M. Garnsey. 2004. "Knowledge of Grammar, Knowledge of Usage: Syntactic Probabilities Affect Pronunciation Variation." Language 80:4 (Dec 2004). 748-775.
  3. Newmeyer, Frederick J. 2003. "Grammar Is Grammar and Usage is Usage." Language 79:4 (Dec 2003). 682-707, & Language response to this essay in March 2005:
  • Clark, Brady. 2005. "On Stochastic Grammar." Language 81:1 (Mar 2005). 207-217.
  • Laury, Ritva, and Tsuyoshi Ono. 2005. "Data Is Data and Model Is Model: You Don't Discard the Data that Doesn't Fit Your Model!" Language 81:1 (Mar 2005). 218-225
  • Meyer, Charles F. and Hongyin Tao. 2005. "Response to Newmeyer's 'Grammar Is Grammar and Usage is Usage.'" Language 81:1 (Mar 2005). 226-228.
  • Newmeyer, Frederick J. 2005. "A Reply to the Critiques of 'Grammar Is Grammar and Usage is Usage.'" Language 81:1 (Mar 2005). 229-236.
• Generative Grammar as a Computational Theory
  1. Berwick, Robert C. 1984. "Strong Generative Capacity, Weak Generative Capacity, and Modern Linguistic Theories." Computational Linguistics 10:3-4 (July-Dec 1984). 189-202.
  2. Berwick, Robert C., and Sandiway Fong. 1995. "A Quarter-Century of Computation with Transformational Grammar." In Jennifer Cole, Georgia M. Green, and Jerry L. Morgan, eds. Linguistics and Computation. Stanford: CSLI. 103-144.
  3. Goldsmith, John. 2004. "From Algorithms to Generative Grammar and Back Again." Delivered at Chicago Linguistics Society, 2004.
  4. Vermaat, Willemijn. 2003. "The Minimalist MOVE Operation in a Deductive Perspective." Research on Language and Computation 2. 69-85.
• Computing Anaphora Resolution
  1. Markert, Katja, and Malvina Nissim. 2005. "Comparing Knowledge Sources for Nominal Anaphora Resolution." Computational Linguistics 31:3 (Sep 2005). 367-401.
  2. Palomar, Manuel, Lidia Moreno, Jesús Peral, Rafael Muñoz, Antonio Ferrández, Patricio Martínez-Barco, and Maximiliano Saiz-Noedalomar. 2001. "An Algorithm for Anaphora Resolution in Spanish Texts." Computational Linguistics 27:4 (Dec 2001). 545-567.
  3. Stuckardt, Roland. "Design and Enhanced Evaluation of a Robust Anaphor Resolution Algorithm." Computational Linguistics 27:4 (Dec 2001). 521-544.
  4. Soon, Wee Meng, Hwee Tou Ng, and Daniel Chung Yong Lim. 2001. "A Machine-Learning Approach to Coreference Resolution of Noun Phrases." Computational Linguistics 27:4 (Dec 2001). 479-506.
  5. Webber, Bonnie, Matthew Stone, Aravind Joshi, and Alistair Knott. 2003. "Anaphora and Discourse Structure." Computational Linguistics 29:4 (Dec 2003). 545-587.

Last updated March 14, 2006.