Monday, June 26, 2006
Tuesday, June 20, 2006
The Inside-outside Algorithm
README for inside-outside
(c) Mark Johnson, Brown University, 21st August 2000
Email: Mark_Johnson@Brown.edu
This is an implementation of the inside-outside algorithm for estimating the probabilities of PCFG productions. While there are several places where better indexing might improve performance, I have paid attention to ensuring that the algorithm runs in n^3 time and in time linear in grammar size. I have used this program with grammars with tens of thousands of productions, trained using tens of thousands of sentences (it may take a week).
......
http://www.cog.brown.edu/~mj/code/inside-outside-README.html
Monday, June 19, 2006
MaxEnt
The opennlp.maxent package is a mature Java package for training and using maximum entropy models.
This web page contains some details about maximum entropy and using the opennlp.maxent package. It is updated only periodically, so check out the Sourceforge page for Maxent for the latest news. You can also ask questions and join in discussions on the forums.
Download the latest version of maxent.
http://maxent.sourceforge.net/
Friday, June 16, 2006
Statistical Machine Translation Tutorial Reading
The following is a list of papers that I think are worth reading for our
discussion of machine translation. I've tried to give a short blurb about
each of the papers to put them in context. I've included a number of papers
that I marked "OPTIONAL" that I think are interesting, but are either
supplementary or the material is more or less covered in the other papers.
... ...
http://www.cse.ucsd.edu/~dkauchak/mt-tutorial/
Kevin Knight
Kevin Knight
USC/Information Sciences Institute, 4676 Admiralty Way, Marina del Rey, CA 90292, (310) 448-8716, e-mail: knight@isi.edu
Senior Research Scientist and Fellow, Information Sciences Institute (ISI).
Research Associate Professor at the University of Southern California, Department of Computer Science.
...
http://www.isi.edu/~knight/
Monday, June 12, 2006
Coutable Set
In mathematics, a countable set is a set with the same cardinality (i.e., number of elements) as some subset of the set of natural numbers. The term was originated by Georg Cantor; it stems from the fact that the natural numbers are often called counting numbers. A set that is not countable is called uncountable.
...
http://en.wikipedia.org/wiki/Countability#Further_theorems_about_uncountable_sets
