LING 289: History of Computational Linguistics
Winter 2011
Intellectual history of computational linguistics and natural language processing,
together with related aspects of dialogue and speech processing, using primary sources.
Leading Class Discussion: One or to three times during the quarter
you will run the discussion (for a half-session).
Readings:
Before class, read the papers and write 3 "questions or comments" on each reading. This means on weeks with 3 readings we expect 9 question/comments. The questions or comments can be short but should be substantive and suggestive, not just a summary of the paper. Since they are due before class, we will use them to inform our discussion of the papers. Comments should be posted to the class discussion site: http://www.piazzza.com/stanford/linguist289
Final Project: The final project should be a historical
investigation of some topic in the history of computational linguistics.
This can include interviewing primary figures, investigating other primary sources (letters, notebooks, eamil), or a computational project using online data.
Grade determination:
25% comments on readings
25% leading class discussion
10% class participation
40% final project
SCHEDULE
Wk
Date
Discussants
Slides
Topic and Readings
1
Jan 4
Martin and Dan
Introduction to the Course and Brief Overview of the History of the Field
2
Jan 11
Everyone
Computational History in Computational Linguistics: the ACL Anthology
Tom L. Griffiths and Mark Steyvers. 2004. Finding scientific topics. PNAS, 101 Suppl 1:5228-5235, April.
Christian G. Specht. 2010.
Opinion: Mutations of citations. The Scientist, 16 September 2010.
http://www.the-scientist.com/news/display/57689/
Dragomir R. Radev, Pradeep Muthukrishnan, and Vahed Qazvinian. The ACL anthology network corpus. In Proceedings, ACL Workshop on Natural Language Processing and Information Retrieval for Digital Libraries, Singapore, 2009
Robert K. Merton. 1961. Singletons and Multiples in Scientific Discovery. Proceedings of the American Philosophical Society 105:5, 470-486.
You need to read only from section II, starting at page 475.
History of Science: Relevant Theories and Examples
Aravind K. Joshi and Phil Hopely. 1996.
A parser from antiquity. Natural Language Engineering 2 (4) 291-294.
Fernando C. N. Pereira and Michael D. Riley. 1997. Speech Recognition by Composition of Weighted Finite Automata.
In Finite State Language Processing, edited by Emmanuel Roche and Yves Schabes.
read pages 431-434 only.
Fernando Pereira. 1990.
Finite-State Approximations of Grammars.
Speech and Natural Language: Proceedings of a Workshop Held at Hidden Valley, Pennsylvania, June 24-27,1990
Just skim this:
Mehryar Mohri.
Weighted Finite-State Transducer Algorithms: An Overview.
In Carlos MartÃn-Vide, Victor Mitrana, and Gheorghe Paun, editors, Formal Languages and Applications. volume 148, VIII, 620 p., pages 551-564. Springer, Berlin, 2004.
Extra: Related papers on Finite-State models for further research
Kaplan, Ronald M. and Martin Kay. 1981. Phonological rules and finite-state transducers. In Linguistic Society of America Meeting Handbook, Fifty-Sixth Annual Meeting. New York. Abstract.
Koskenniemi, Kimmo. 1986. Compilation of automata from morphological two-level rules. In F. Karlsson, ed., Papers from the Fifth Scandinavian Conference on Computational Linguistics, pages 143-149.
Karttunen, Lauri, Kimmo Koskenniemi, and Ronald M. Kaplan. 1987. A compiler for two-level phonological rules. In M. Dalrymple, R. Kaplan, L. Karttunen, K. Koskenniemi, S. Shaio, and M. Wescoat, eds., Tools for Morphological Analysis, vol. 87-108 of CSLI Reports, pages 1-61. Palo Alto, CA: Center for the Study of Language and Information, Stanford University.
Martin Kay. 1979. Functional Grammar. Proceedings of the Berkeley Linguistics Society, 142-158.
Ivan A. Sag, Ronald M. Kaplan, Lauri Karttunen, Martin Kay, Carl Pollard, Stuart Shieber, and Annie Zaenen. 1986.
Unification and Grammatical Theory.
Proceedings of the Fifth West Coast Conference on Formal Linguistics.
Alain Colmerauer and Philippe Roussel. 1993.
The birth of Prolog.
Proceeding of HOPL-II: The second ACM SIGPLAN conference on History of programming languages.
ACM New York, NY, USA 1993.
Bert F. Green, Jr.,
Alice K. Wolf,
Carol Chomsky,
and Kenneth Laughery. 1961.
Baseball: An Automatic Question-Answerer
Proceedings of the IRE-AIEE-ACM '61 (Western); Papers presented at the May 9-11, 1961, western joint IRE-AIEE-ACM computer conference
Alain Colmerauer. 1970.
Les systèmes-q ou un formalisme pour analyser et synthétiser des phrase sur ordinateur.
Internal publication 43, Département d'informatique de l'Université de Montréal",
Alain Colmerauer. 1975. Les grammaires de métamorphose GIA.
Internal publication, Groupe Intelligence artificielle, Facult\'{e} des Sciences de Luminy, Universit\'{e} Aix-Marseille II, France, Nov 1975. English version, Metamorphosis grammars. In L. Bolc, (Ed.). 1978.
Natural Language Communication with Computers, Lecture Notes in Computer Science 63,
Springer Verlag, pp. 133-189",
Daniel G. Bobrow, Ronald M. Kaplan, Martin Kay, Donald A. Norman, Henry Thompson and Terry Winograd.
GUS, A Frame-Driven Dialog System. Artificial Intelligence, Volume 8, Issue 2, April 1977, Pages 155-173
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K. and Harshman, R. (1990), Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41: 391-407.
David M. Blei, Andrew Y. Ng, and Michael I. Jordan. 2003. Latent dirichlet allocation. Journal of Machine Learning Research 3 (March 2003), 993-1022.
John R. Pierce. 1969.
Whither Speech Recognition?.
J. Acoust. Soc. Am. Volume 46, Issue 4B, pp. 1049-1051 (October 1969)
Warren Weaver. 1955. Translation. In William N. Locke and A. D. Booth (eds).
Machine Translation of Languages: Fourteen Essays. Reprinted from a memorandum written
by Weaver in 1949.
Extra: More Influential Papers in Machine Translation
Panini and the role of the Indian Grammarians in Mathematical Linguistics
Paul Kiparsky. 1993.
Paninian Linguistics. Encyclopedia of Languages and Linguistics,.
R E Asher (ed). Oxford: Pergamon, 1993.
Kiparsky, Paul (2009).
On the Architecture of Panini's Grammar.
Proceedings of the First and Second Sanskrit Computational Linguistics Symposia, Springer LNCS 5402, pp. 33-94.