A Life in Language
.
A speech given in acknowledgement of the Life-time Achievement Award at
the 43rd Annual Meeting of the Association for Compuational
Linguistics, Ann Arbor, Michigan, 27th June, 2005.
String Alignment Using Suffix Trees. A paper about the possible use of suffix trees for aligning texts and their translations.
Here are some unfinished musings on the nature of translation.
Here are some half-baked thoughts on language models in statistical NLP on which I need some help.
My 1994 paper on "Regular Models of Phonological Rule Systems". Computational Linguistics 20(3):331-378" with Ronald Kaplan is here.
Here is a more complete bibliography.
In the autumn, I generally teach 182/282 "Human and Machine Translation" described in the catalog as follows:
The process of translation by professional and amateur translators, and by existing and proposed machine-translation systems; what each might learn from the other.
Prerequisite: advanced knowledge of a foreign language.
Recently, I have been teaching a similar course in the first ten weeks of the summer quarter at the University of the Saarland.
In the winter, at Stanford, I teach 183/283 "Programming and Algorithms for Natural Language Processing". It is describes as follows:
Construction of computer programs for linguistic processes such as string search, morphological, syntactic, and semantic analysis and generation, and simple machine translation. Emphasis is on the algorithms that have proved most useful for solving such problems.
Course readings:
Disjunctive Unification Functional Uncertainty
Algorithms Class Slides: Suffix Arrays Suffix Trees
Margaret Jacks Hall,
Room 119
Stanford University
Stanford, CA 94305-2150
Phone: +1.650.725.7401
Fax: +1.650.723.5666
925 Peninsula Way
Menlo Park
CA 94025
Phone: +1.650.323.5925
Cell: +1.650.740.3243
5, rue de Pont du Lodi 75006 Paris France
Phone: +33.1.43.29.24.09
Cell: +49.171.950.9231
Fax: +1.866.416.9509