NLP Reading Group

The Natural Language Processing reading group attempts to keep abreast of interesting research ideas and results that may be useful to us. We typically read and discuss one paper per week. All our past papers are listed below.

The reading group is listed every semester as a 1-credit course, 600.765. Contact the instructor (Jason Eisner) to get on the mailing list. At the first course meeting, we brainstorm a bunch of topics for the semester, and vote on which ones to pursue. We then spend about 4 weeks per topic. Although some topics are within NLP, many of them explore potentially relevant work from related fields such as machine learning and linguistics.

During the summer we usually catch up on the latest NLP papers.

Note: Chris Callison-Burch leads another weekly reading group devoted entirely to machine translation.

Spring 2009

We meet Thursdays 12-1:15 in CSEB 306.

Domain adaptation across text genres

Mar 12 (Delip Rao)

Schweikert G, Widmer C, Scholkopf B, Ratsch G (2008) An empirical analysis of domain adaptation algorithms for genomic sequence analysis. In Proceedings of Advances in Neural Information Processing Systems (NIPS)

Optional Reading:

Marx Z, Rosenstein MT, Dietterich TG, Kaelbling LP (2008) Two algorithms for transfer learning. In: Inductive Transfer: 10 years later

Mar 5 (Omar F. Zaidan)

Su-In Lee, Vassil Chatalbashev, David Vickrey, and Daphne Koller (2007). Learning a Meta-Level Prior for Feature Relevance from Multiple Related Tasks. ICML 2007.

Recent good papers

Feb 26 (Zhifei Li)

John DeNero, Alex Bouchard, and Dan Klein (2008). Sampling Alignment Structure under a Bayesian Translation Model. EMNLP 2008.

Feb 19 (Jason Eisner)

Impromptu lecture on Dirichlet distributions, Dirichlet processes, etc.

Feb 12 (Markus Dreyer)

Tom Minka (2005). Divergence measures and message passing. Microsoft Research Technical Report. (slides: pdf slides ppt)

Feb 5 (Delip Rao)

David J. Hand (2006). Classifier Technology and The Illusion of Progress. Statistical Science.

Fall 2008

Programming languages for AI

Dec 13-14

NIPS workshop on probabilistic programming (see probabilistic-programming.org), which mentioned a number of other languages and libraries.

Dec 4 (Omar F. Zaidan)

Jeff Bilmes (~2002). The Graphical Models Toolkit (GMTK).

The above link includes a draft of the documentation and a tutorial, as well as the binaries.

Nov 20 (Wren Thornton)

Avi Pfeffer (2006). IBAL Tutorial.

Installed in masters*:~wren/local/bin (linux only, so not masters01 or masters02) and clsp:~wren/local/bin. Add this directory to your PATH.

See also other materials, including this paper: Avi Pfeffer (2007). The design and implementation of IBAL: A general-purpose probabilistic language. In Lise Getoor and Ben Taskar (eds.), Introduction to Statistical Relational Learning.

Nov 13 (Nathaniel Filardo)

Marc Sumner and Pedro Domingos (2007). The Alchemy Tutorial. (slides)

System is installed in masters*:~nwf/public/alchemy. There is a tutorial subdirectory. You should be able to follow along in the tutorial by running commands like

~nwf/public/alchemy/bin/infer \
   -i ~nwf/public/alchemy/tutorial/basics/uniform.mln \
   -e ~nwf/public/alchemy/tutorial/empty.db \
   -r uniform.results \
   -q Heads

Miscellaneous

Oct 30, Nov 6

Discussion of the EMNLP 2008 papers.

Oct 23 (Damianos Karakos)

I. Csiszar and G. Tusnady (1984). Information geometry and alternating minimization procedures. Statistics and Decisions, Suppl. Issue 1, pp. 205-237.

The paper is not online, but there are online course notes from Sanjeev Khudanpur.

Probabilistic relational models

Oct 16 (Nathaniel Filardo)

Pedro Domingos et al. (2008). Markov Logic. In L. De Raedt, P. Frasconi, K. Kersting and S. Muggleton (eds.), Probabilistic Inductive Logic Programming (pp. 92-117). New York: Springer.

Oct 1 (Balakrishnan Varadarajan?)

Nir Friedman, Lise Getoor, Daphne Koller, and Avi Pfeffer (1999). Learning Probabilistic Relational Models. In IJCAI.

A longer book chapter version is linked from here, but the link is dead.

Sep 25 (Zhifei Li)

David Smith and Jason Eisner (2008). Dependency Parsing by Belief Propagation. In EMNLP.

Creative uses of classifiers in NLP

Sep 18 (Markus Dreyer)

D. Rosenberg, D. Klein and B. Taskar (2007). Mixture-of-Parents Maximum Entropy Markov Models. Uncertainty in Artificial Intelligence (UAI), Vancouver, BC, July.

Sep 11 (Nikesh Garera)

Yoav Goldberg and Michael Elhadad (2007). SVM Model Tampering and Anchored Learning: A Case Study in Hebrew NP Chunking. In ACL 2007.

Libin Shen; Aravind K. Joshi (2003) An SVM-based voting algorithm with application to parse reranking. In HLT-NAACL 2003.

Summer 2008

Good current papers

August 19 (Zhifei Li)

Ahmad Emami and Frederick Jelinek (2006). A neural syntactic language model. Journal of machine learning, volume 60, numbers 1-3, September, 2005.

August 5 (Zhifei Li)

Libin Shen, Jinxi Xu and Ralph Weischedel (2008). A New String-to-Dependency Machine Translation Algorithm with a Target Dependency Language Model. In ACL 2008.

July 29 (David Smith)

Ronan Collobert and Jason Weston (2008). A Unified Architecture for Natural Language Processing: Deep Neural Networks with Multitask Learning. ICML 2008: Helsinki, Finland.

July 22 (Nikesh Garera)

Zornitsa Kozareva, Ellen Riloff and Eduard Hovy (2008). Semantic Class Learning from the Web with Hyponym Pattern Linkage Graphs. Proc. of ACL-08: HLT, Columbus, OH.

July 15 (Markus Dreyer)

Sittichai Jiampojamarn, Colin Cherry, and Grzegorz Kondrak (2008). Joint Processing and Discriminative Training for Letter-to-Phoneme Conversion. Proc. of ACL-08: HLT, Columbus, OH.

July 8 (Delip Rao)

Liang Sun, Shuiwang Ji, and Jieping Ye (2008). A Least Squares formulation for Canonical Correlation Analysis. Proc. of ICML-08, Helsinki

Hotelling, in 1936, proposed a method to characterize the relationship between two variables which widely became known as "Canonical Correlation Analysis" (CCA). This involves solving the generalized eigenvalue problem of the kind Ax = \lambda Bx, which can further be reduced to the symmetric eigenvalue problem (via Cholesky decomposition) in the CCA case. It is a general interest in statistics literature to connect different statistical models to the least squares problem not only to exploit the simpler solutions for solving such problems but also to relate with other methods. The least squares formulation also allows extending the different models using the regularization framework. The least squares formulation for the CCA model involves tying together an older result showing the equivalence of CCA and the Fisher LDA, and a recent least squares formulation of multi-class LDA.

CCA has been applied traditionally in social sciences and more recently in IR. There is literature applying CCA for problems in cross-lingual IR, image retrieval, and learning lexicons. Interestingly, the ACL'08 paper by Haghighi et. al. on learning bilingual lexicons using CCA is not the first paper to do that. There is at least one paper as early as 2004 by Cancedda & friends from XRCE that does something similar and does not get cited in the ACL paper.

June 12 (Zhifei Li)

Hao Zhang, Chris Quirk, Robert C. Moore and Daniel Gildea (2008). Bayesian Learning of Non-compositional Phrases with Synchronous Parsing. Proc. of ACL-08: HLT, Columbus, OH.

June 5 (Markus Dreyer)

Kuzman Ganchev, João Graça and Ben Taskar (2008). Better Alignments = Better Translations? Proc. of ACL-08: HLT, Columbus, OH.

May 29 (Nikesh Garera)

Aria Haghighi, Percy Liang, Taylor Berg-Kirkpatrick and Dan Klein (2008). Learning Bilingual Lexicons from Monolingual Corpora. Proc. of ACL-08: HLT, Columbus, OH.

Spring 2008

Dynamic programming speedups

May 15 (David Smith)

Geoffrey Zweig and Mukund Padmanabhan (2000). Exact Alpha-Beta Computation in Logarithmic Space with Application to MAP Word Graph Construction. Proc. of ICSLP, Beijing.

This is a specialization to HMMs of the DBN version given earlier by Binder, Murphy & Russell (1997). See also section 3.7.1 of Kevin Murphy's thesis.

Related work: This kind of trick was really pioneered by D. S. Hirschberg (1975), who cut the space requirements of longest common subsequence from quadratic all the way down to linear. Hirschberg's version can be nicely adapted to edit distance. Now, edit distance (and more generally, multiple sequence alignment) is really just a special case of shortest path in a graph. Hirschberg (1975), above, was generalized by Korf (1999)'s "Divide and Conquer Bidirectional Search, which Korf & Zhang (2000) (who discuss all these algorithms) further improved to "Divide and Conquer Frontier Search." Edelkamp & Meyer (2001) give log-space methods for improving A* search for the shortest path in a graph. (Note that A* search often fits in memory for our DP problems; reducing its memory requirements becomes paramount when we are searching trees that branch without rejoining, e.g., chess.) Bidirectional search, which is distantly related to A*, is also pretty well studied, including recent work at JHU's AMS Dept.

May 1 (John Blatz)

Pedro Felzenswalb and David McAllester (2006). The Generalized A* Architecture. To appear in the Journal of Artificial Intelligence Research.

Apr. 24 (Zhifei Li)

Liang Huang (2008). Forest Reranking: Discriminative Parsing with Non-Local Features. To appear in Proceedings of ACL 2008, Columbus, OH.

Apr. 17 (Arnab Ghoshal)

Liang Huang and David Chiang (2005). Better k-best parsing. Proceedings International Workshop on Parsing Technologies.

Grammatical inference

Apr. 10 (Wren Thornton)

Carl de Marcken (1996), Linguistic structure as composition and perturbation. ACL.

Also see thesis version.

Apr. 3 (Nathaniel Filardo)

A. Clark (2006). Learning Deterministic Context Free Grammars: The Omphalos Competition.

Mar. 27 (Nikesh Garera)

Stolcke, A. and Omohundro, S. (1993). Hidden Markov model induction by Bayesian model merging. Advances in Neural Information Processing Systems (Morgan Kaufmann, San Mateo, CA), 5, 11-18.

Inference in graphical models

Mar. 20 (Delip Rao)

Jonathan Yedidia, William Freeman, and Yair Weiss (2001). Bethe free energy, Kikuchi approximations and belief propagation algorithms. MERL TR-2001-16.

Mar. 6&13 (Markus Dreyer)

M. J. Wainwright, T. Jaakkola and A. S. Willsky (2005). A new class of upper bounds on the log partition function. IEEE Trans. on Information Theory, 51, 2313--2335.

Feb. 28 (David Smith)

David MacKay (2003). Variational methods. Chapter 33 of Information Theory, Inference, and Learning Algorithms.

Feb. 21 (David Smith)

Michael I. Jordan et al. (1999). An Introduction to Variational Methods for Graphical Models Machine Learning, 37, 183–233.

Feb. 7&14 (Delip Rao)

M. I. Jordan and Y. Weiss (2002). Probabilistic Inference in Graphical Models, The Handbook of Brain Theory and Neural Networks (MIT Press).

Fall 2007

Semisupervised learning

Dec. 12 (Delip Rao)

M. Belkin, P. Niyogi, Laplacian Eigenmaps for Dimensionality Reduction and Data Representation, TechReport, UChicago, TR-2002-01

Mikhail Belkin, Partha Niyogi, Vikas Sindhwani, On Manifold Regularization, AISTATS 2005

Nov. 17 (David Smith)

X. Zhu, Semi-Supervised Learning Literature Survey

Recent parsing papers

Nov. 3 (Christo Kirov)

I. Titov, J. Henderson, Constituent Parsing with Incremental Sigmoid Belief Networks, ACL 2007

Oct. 26 (Christo Kirov)

Seginer, Yoav, Fast Unsupervised Incremental Parsing (syntax induction), ACL 2007

Oct. 17 (Markus Dreyer)

Nakagawa, Tetsuji, Multilingual Dependency Parsing Using Global Features, EMNLP-CoNLL 2007

Text compression

Oct. 10 (Nathaniel W Filardo)

Mahoney, Matthew, Adaptive Weighting of Context Models for Lossless Data Compression, Florida Institute of Technology, CS Department, Technical report CS-2005-16, EMNLP-CoNLL 2007

Some other possible papers that we didn't read (not vetted):

• Approaches that consider recursive text structure
  • Charikar et al. (2005), The smallest grammar problem
  • de Marcken (1996), Linguistic structure as composition and perturbation (thesis version) - read later on 4/10/08
  • Katajainen et al. (1986), Syntax-Directed Compression of Program Files

• Approaches that learn hidden state
  • Cormack & Horspool (1987), Data Compression Using Dynamic Markov Modelling
  • Hu et al. (year?), Language Modeling with Stochastic Automata

• Approaches that allow searches inside the compressed text
  • Antonio Farina Martinez (2005), New Compression Codes for Text Databases (dissertation)
  • Culpepper & Moffat (2006), Phrase-Based Pattern Matching in Compressed Text
  • Shibata et al. (2000), A Boyer-Moore type algorithm for compressed pattern matching
  • Shibata et al. (1999), Byte Pair Encoding: A Text Compression Scheme That Accelerates Pattern Matching
  • Udi Manber (1997), A text compression scheme that allows fast searching directly in the compressed file

Domain adaptation

Oct. 3 (David Smith)

Shai Ben-David, John Blitzer, Koby Crammer, Fernando Pereira, Analysis of Representations for Domain Adaptation

Sep. 26 (Omar F Zaidan)

J. Blitzer, R. McDonald, F. Pereira, Domain Adaptation with Structural Correspondence Learning, EMNLP 2006

Summer 2007

Good current papers

Aug. 30 (Delip Rao)

Gideon S. Mann, Simple, Robust, Scalable Semi-supervised Learning via Expectation Regularization, Proceedings of the 24 th International Conference on Machine Learning 2007

Aug. 18 (Markus Dreyer)

D. Talbot, M. Osborne, Randomised Language Modelling for Statistical Machine Translation, ACL 2007

They use a space-efficient randomized data structure (Bloom Filter) to store very large n-gram models. There is a companion paper that people might want to have a quick look at as well, for comparison:

D. Talbot, M. Osborne, Smoothed Bloom Filter Language Models: Tera-Scale LMs on the Cheap, ACL 2007

Aug. 11 (Nikesh Garera)

L. Shen, G. Satta, A. Joshi., Guided learning for bidirectional sequence classification, ACL 2007

Aug. 3 (Yi Su)

M. Galley, K. McKeown, Lexicalized Markov Grammars for Sentence Compression, NAACL-HLT 2007

Jul. 18 (David Smith)

P. Liang, S. Petrov, M. Jordan, D. Klein, The Infinite PCFG Using Hierarchical Dirichlet Processes, EMNLP-CoNLL 2007

Jul. 6 (Christopher White)

A. Braunstein, M. Mezard, R. Zecchina., Survey propagation: an algorithm for satisfiability, Random Structures and Algorithms, 2005.

We sent some questions to Zecchina.

Lukas Kroc, Ashish Sabharwal and Bart Selman. Survey propagation revisited: An empirical study. 23rd UAI, 2007.

Jun. 21 (Christopher White)

K. Murphy, Y. Weiss, M. Jordan, Loopy belief propagation for approximate inference: An empirical study, 15th UAI, pages 467-?75, 1999

... discussing (loopy) belief propagation as background for survey propagation, a topic which has been getting more attention lately for its ability to "solve very large hard combinatorial problems, such as determining the satisfiability of Boolean formulas. Chapter 8 of Chris Bishop's textbook is supposed to be a good treatment of graphical models overall. He covers BP in section 8.4.4 after first presenting factor graphs in 8.4.3., David MacKay's treatment of BP, also in terms of factor graphs, is in chapter 26 of his book [1]. It's worth reading this chapter in full, perhaps first reading chapter 16. ... the update equations are given as (26.11) and (26.12) ... [substantial further discussion by Jason was here] Some people may prefer Bishop's style, others MacKay's.

Jun. 14 (David Smith)

X. Zhu, Z. Ghahramani,J. Lafferty, Semi-supervised learning using Gaussian fields and harmonic functions, ICML 2003

Jun. 6 (Nikesh Garera)

A. Alexandrescu, K. Kirchhoff, Data-Driven Graph Construction for Semi-Supervised Graph-Based Learning in NLP, HLT/NAACL 2007

Jun. 2 (Erin Fitzgerald)

J. Jiang, C. Zhai, A Systematic Exploration of the Feature Space for Relation Extraction, HLT/NAACL 2007

May 17 (Markus Dreyer)

M. Galley, K. McKeown, Lexicalized Markov Grammars for Sentence Compression, HLT/NAACL 2007

May 10 (David Smith )

M. Johnson, T. Griffiths, and S. Goldwater, Bayesian Inference for PCFGs via Markov Chain Monte Carlo, HLT/NAACL 2007

Spring 2007

Integrating search and learning

Apr. 19 (John Blatz)

A. Prieditis, Machine discovery of Effective Admissible Heuristics , Machine Learning Journal, 1993

Apr. 12 (Markus Dreyer)

A. Haghighi, J. DeNero and D. Klein, Approximate Factoring for A* Search, NAACL-HLT 2007

Mar. 29 & Apr. 5 (Zhifei Li)

H. Daume III, J. Langford, and D. Marcu, Search-based structured prediction, Machine Learning Journal, forthcoming

Mar. 8 (David Smith)

H. Daume III & D. Marcu, Learning as search optimization: approximate large margin methods for structured prediction, ICML 2005

Recent IR/QA papers (with an NLP or multilingual focus)

Mar. 1 (Wei Chen)

M. Kaisser, S. Scheible, and B. Webber, Experiments at the University of Edinburgh for the TREC 2006 QA track, TREC-15

They do some fairly deep interpretation of sentences, extracting their predicate-argument structure.

Feb. 22 (Eric Harley)

K. Kan Lo & W. Lam, Using Semantic Relations with World Knowledge for Question Answering, TREC-15

Unsupervised learning of morphology

Feb. 15 (Nikhil Bojja)

C. Monson et. al., Unsupervised Induction of Natural Language Morphology Inflection Classes, ACL Student Workshop '04

Feb. 8 (Delip Rao)

P. Schone and D. Jurafsky, Knowledge-free induction of morphology using latent semantic analysis , CoNLL 2000

However, there was an extension of this work reported in NAACL-2001 that looks at circumfixes and prefix/affix combinations. [2]

Feb. 1 (Nikesh Garera)

D. Yarowsky and R. Wicentowski, Minimally supervised morphological analysis by multimodal alignment,ACL 2000

For more details refer to Chapter 4 of Wicentowski's thesis.

Fall 2006

Syntax-based MT

Dec. 13 (Delip Rao)

J. Carbonell et. al., Context-based machine translation, AMTA 2006

Dec. 6 (Jason Smith)

M. Galley et. al., Scalable Inference and Training of Context-Rich Syntactic Translation Models, ACL 2006

It may also be helpful to look at:

M. Galley et. al., What's in a translation rule?, HLT/NAACL 2004

Nov. 29 (Balakrishnan V)

D. Marcu et. al., SPMT: Statistical Machine Translation with Syntactified Target Language Phrases , EMNLP 2006

Nov. 15 (Eric Harley)

D. Chiang, An introduction to synchronous grammars, ACL 2006 Tutorial

Slides from the talk are also available. [3]

Linguistics: Syntactic formalisms

Nov. 8 (Elliott Drabek)

K.Shklovsky, A Grammatical Sketch of Petalcingo Tzeltal, Undergraduate Thesis, Reed College, 2005

It is 77 pages long, but not dense, and I will be skipping the following sections: Pages

• 01-14 Phonetics and phonology
• 18-18 Polyvalence
• 21-21 Inherent possession and ...
• 46-55 Tense and aspect and other sections

Nov. 1 (Yi Su)

M. Steedman, Gapping as Constituent Coordination, Linguistics and Philosophy, Vol. 13, 1990, pp.207-264.

See Yi for photocopies.

Oct. 25 (Markus Dreyer)

S. Reizler et. al., Parsing the Wall Street Journal using a Lexical-Functional Grammar and Discriminative Estimation Techniques, ACL 2002

Oct. 18 (Erin Fitzgerald)

J. Bresnan & R.M. Kaplan, Lexical-Functional Grammar: A Formal System for Grammatical Representation , The Mental Representation of Grammatical Relations, MIT Press, 1982

The edited collection that this appears in is generally interesting. Bresnan defends and develops lexicalized grammars in general; the idea of separate surface and semantic roles; and Bresnan & Kaplan's LFG in particular. You should know that she originated (in 1978) the extremely influential idea of lexicalized syntax -- the idea that a grammar is simply a collection of lexical entries to be assembled in standard language-independent ways, but that there are also "lexical redundancy rules" that relate, e.g., active and passive entries for the same verb. Some chapters address morphological and cognitive issues pertaining to lexicalization, including an essay by Pinker on lexicalist learning., Slides from Erin's presentation can be found here.

Machine learning: Margin methods and structured classification

Oct. 11 (John Blatz)

L.Xu, D. Wilkinson, F. Southey, & D. Schuurmans, Discriminative Unsupervised Learning of Structured Predictors , ICML 2006

Oct. 4 (Nikesh Garera)

A. Culotta & J. Sorensen, Dependency Tree Kernels for Relation Extraction , ACL 2004

D. Zelenko, C. Aone, & A. Richardella, Kernel Methods for Relation Extraction, JMLR, Volume 3, 2003

Sep. 27 (David Smith)

C. Cortes, P. Haffner, & M. Mohri, Rational Kernels , NIPS 2003

Papers extending rational kernels, including results on positive semidefinite cases, are at: [4], For the record, and not to be read, is an interesting parallel line of research in Fisher Kernels over strings, e.g. this paper by Saunders, Shawe-Taylor and Vinokourov: [5]

Sep. 20 (Elliot Drabek)

K.Q. Weinberger, F. Sha, & L.K. Saul, Learning a kernel matrix for nonlinear dimensionality reduction , ICML 2004

S.T. Roweis & L.K. Saul, Nonlinear Dimensionality Reduction by Locally Linear Embedding , Science, 22 December 2000

J.B. Tenenbaum, V. De Silva, & J.C. Langford, A global geometric framework for nonlinear dimensionality reduction , Science, 22 December 2000

Sep. 13 (Roy Tromble)

L. Xu, J. Neufeld, B. Larson, & D. Schuurmans, Maximum Margin Clustering , NIPS 2004

Summer 2006

Recent HLT-NAACL papers

Aug. 4 (David Smith)

Sharon Goldwater, Thomas L. Griffiths, Mark Johnson, Contextual Dependencies in Unsupervised Word Segmentation, ACL 2006

Anyone looking for a more straight-up language modeling discussion can compare:

• Yee Whye Teh, A Hierarchical Bayesian Language Model Based On Pitman-Yor Processes, ACL 2006

More resources:

• Machine Learning MLPedia page on Dirichlet Processes
• Michael Jordan's NIPS 2005 tutorial: Nonparametric Bayesian Methods: Dirichlet Processes, Chinese Restaurant Processes and All That
• Y. Teh, M. Jordan, M. Beal, and D. Blei, Hierarchical Dirichlet processes, Journal of the American Statistical Association, 2006

Jul. 20 (Roy Tromble)

Mehryar Mohri, Brian Roark, Probabilistic Context-Free Grammar Induction Based on Structural Zeros, HLT-NAACL, 2006

Jul. 6 (Keith Hall)

Charles Sutton, Michael Sindelar, Andrew McCallum, Reducing Weight Undertraining in Structured Discriminative Learning, HLT-NAACL, 2006

Jun. 31 (Markus Dreyer)

Joakim Nivre, Johan Hall et al, Labeled Pseudo-Projective Dependency Parsing with Support Vector Machines, CoNLL 2006

J. Nivre, J. Nilsson, Pseudo-Projective Dependency Parsing, ACL 2005

Jun. 24 (David Smith)

Percy Liang, Ben Taskar, Dan Klein, Alignment by Agreement, HLT-NAACL 2006

Spring 2006

Algorithms for NLP (mostly)

May 18 (Markus Dreyer)

Jonathan May, Kevin Knight, A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata, Proc. NAACL-HLT, 2006

May 11 (John Blatz)

M. Gengler, An introduction to parallel dynamic programming, Lecture Notes in Computer Science, 1996

May 4 (David Smith)

C. E. R. Alves, E. N. C′aceres F. Dehne, Parallel dynamic programming for solving the string editing problem on a CGM/BSP, SPAA 2002

Apr. 20 (Balakrishnan V)

Richard M. Karp, Michael 0. Rabin, Efficient randomized Pattern matching Algorithms, IBM Journal of Research and Development, 1987

Mar. 31, Apr. 6 (Eric Harley)

Ben Taskar, Lacoste-Julien Simon, Klein Dan, A Discriminative Matching Approach to Word Alignment, ACL 2005

A related paper is

Ryan McDonald, Fernando Pereira, Kiril Ribarov, Jan Hajic, Non-projective Dependency Parsing using Spanning Tree Algorithms, HLT-EMNLP 2005

Mar.17 (Elliott Franco Drabek)

Necip Fazil Ayan, Bonnie J. Dorr, Christof Monz, Alignment Link Projection Using Transformation-Based Learning, HLT-EMNLP 2005

Mar.10 (Roy Tromble)

Terry Koo, Michael Collins, Hidden-Variable Models for Discriminative Reranking, HLT-EMNLP 2005

Mar.3 (Jason Riesa)

Hal Daume III, Daniel Marcu, Domain Adaptation for Statistical Classifiers, Journal of Artificial Intelligence Research, 2006

J. Gorman, J. Curran, Approximate Searching for Distributional Similarity, Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition, 2005

Feb. 23 (Omar F. Zaidan)

Ravichandran, Pantel, Hovy, Randomized Algorithms and NLP: Using Locality Sensitive Hash Function for High Speed Noun Clustering, ACL 2005

Consensus decoding

Feb. 16 (Noah A Smith)

Khalil Sima'an, Computational Complexity of Probabilistic Disambiguation by means of Tree-Grammars, COLING 1996

Francisco Casacuberta, Colin de la Higuera, Computational complexity of problems on probabilistic grammars and transducers, LNAI 1981

For a longer and more HMM/compbio view and extended results, see

Rune B. Lyngsoe, Christian N. S. Pederson, The Consensus String Problem and the Complexity of Comparing Hidden Markov Models, Journal of Computer and System Sciences 65:545-69, 2002

Extracting idioms

Feb. 9 (John Blatz)

Dominic Widdows, Beate Dorow, Automatic Extraction of Idioms using Graph Analysis and Asymmetric Lexicosyntactic Patterns, Proceedings of the ACL-SIGLEX Workshop on Deep Lexical Acquisition, 2005

Afsaneh Fazly, Suzanne Stevenson, Automatic Acquisition of Knowledge about Multiword Predicates, Proceedings of the 19th Pacific Asia Conference on Language, Information, and Computation (PACLIC 2005).

Fall 2005

Good recent papers

Nov. 23 (Roy Tromble)

Sutton, Charles and McCallum, Andrew, Composition of Conditional Random Fields for Transfer Learning, HLT-EMNLP 2005

Nov. 16 (Safiullah Shareef)

Hassan Sawaf, Jörg Zaplo, Hermann Ney, Statistical Classification Methods for Arabic News Articles

Nov. 4 (Jason Riesa)

Luke S. Zettlemoyer, Michael Collins., Learning to Map Sentences to Logical Form: Structured Classification with Probabilistic Categorial, UAI 2005

Oct. 27 (Markus Dreyer)

D. Roth and W. Yih, Integer Linear Programming Inference for Conditional Random Fields, ICML 2005

Oct. 20 (Roy Tromble)

Sheila M. Reynolds, Jeff A. Bilmes, Part-of-Speech Tagging using Virtual Evidence and Negative Training, HLT-EMNLP 2005

Statistical learning theory

Sep. 21 (Arnab Ghoshal)

M. Jordan,Statistical Learning Theory, Chapters 2-3

Sep. 14 (Nikesh Garera)

M. Jordan,Statistical Learning Theory, Chapter 8 (Exponential family and Generalized linear models)

Summer 2005

Gibbs sampling

Sep. 1 (John, Markus, & Nikesh)

B. Walsh, Markov Chain Monte Carlo and Gibbs Sampling, Lecture Notes for EEB 581, version 26 April 2004

Aug. 26 (Roy Tromble)

Jenny Rose Finkel, Trond Grenager, Christopher Manning, Incorporating Non-local Information into Information Extraction Systems by Gibbs Sampling, ACL 2005

AI

Aug. 19 (John Blatz)

Niyogi, Sourabh, Steps Toward Deep Lexical Acquisition, ACL 2005

Unsupervised or semi-supervised EM

Aug. 5 (Adam)

Duh, Kevin and Kirchhoff, Katrin, Tagging of Dialectal Arabic: A Minimally Supervised Approach, ACL 2005

Jul. 28 (Zak)

Takuya Matsuzaki, Yusuke Miyao, Jun'ichi Tsujii, Probabilistic CFG with Latent Annotations, ACL 2005

Jul. 21 (Keith)

Sharon Goldwater and Mark Johnson, Representational Bias in Unsupervised Learning of Syllable Structure, ACL 2005

Jul. 21 (Damianos)

Ando, Rie and Zhang, Tong, A High-Performance Semi-Supervised Learning Method for Text Chunking, ACL 2005

Learning optimality-theoretic grammars

Jul. 14 (John Blatz)

Ying Lin, Learning Stochastic OT Grammars: A Bayesian Approach using Data Augmentation and Gibbs Sampling, ACL 2005

Jul. 14 (Roy Tromble)

Sharon Goldwater and Mark Johnson, Learning OT Constraint Rankings Using a Maximum Entropy Model, Proceedings of the Workshop on Variation within Optimality Theory, 2003

Spring 2005

May 7 (Markus Dreyer)

M. Diligenti, F.M. Coetzee, S. Lawrence, C.L. Giles, M. Gori, Focused Crawling Using Context Graphs, 26th International Conference on Very Large Databases, VLDB 2000

Adam Kilgarriff, Gregory Grefenstette, Introduction to the Special Issue on the Web as Corpus, Computational Lingustics, 2003

Apr. 28 (Damianos Karakos)

Alessandro Moschitti and Roberto Basili, Complex Linguistic Features for Text Classification: A comprehensive study, Proceedings of the 26th European Conference on Information Retrieval Research (ECIR 2004)

Apr. 21 (Omar F. Zaidan)

Tin Kam Ho, Jonathan J. Hull, Sargur N. Stihari, Decision Combination in Multiple Classifier Systems, IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol.16. No I. Jan. 1994

Dan Klein, Kristina Toutanova, H. Tolga Ilhan, Sepandar D. Kamvar and Christopher D. Manning, Combining Heterogeneous Classifiers for Word-Sense Disambiguation, ACL 2002

Apr. 16 (Brock Pytlik)

V. Lavrenko, S.L Feng, R. Manmatha, Statistical models for automatic video annotation and retrieval, ICASSP 2004

S.L Feng, R. Manmatha, V. Lavrenko, Multiple Bernoulli Relevance Models for Image and Video Annotation

The first is a short paper about the relevance model. The second is a follow up paper that details a subsequent model based on the CRM.

Apr. 9 (Noah A Smith)

G. Elidan, N. Friedman., The Information Bottleneck EM Algorithm, UAI 2003

G. Elidan, N. Friedman, Learning Hidden Variable Networks, JMLR 2005

Feb. 25, Mar. 4, Mar. 11, Apr. 2 (David Smith)

M. I. Jordan, Z. Ghahramani, T. S. Jaakkola, and L. K. Saul, Learning in Graphical Models, MIT Press, 1999

Fall 2004

Nov. 27 (Jia Cui)

David M. Blei, Andrew Y. Ng, Michael I. Jordan, Latent Dirichlet Allocation, JMLR 2003

Other papers on LDA: [www.cs.toronto.edu/~ywteh/research/npbayes/report.pdf], [6]

Nov. 20 (David Smith)

Olle Häggström and Karin Nelander, On Exact Simulation of Markov Random Fields Using Coupling from the Past, Foundation of the Scandinavian Journal of Statistics, 1999

James Fill and Mark Huber, The Randomness Recycler: A New Technique for erfect Sampling, FOCS 2000

Nov. 13 (Charles Schafer)

Endika Bengoextea, Inexact Graph Matching Using Estimation of Distribution Algorithms, Chapter 2: The graph matching problem, Ph.D dissertation, 2002

This chapter is general to the field although pretty sweeping and unspecific as a result. It probably makes a good introduction, since it gives an idea of the scope and diversity of the problem and proposed techniques ...

Yakov Keselman, Ali Shokoufandeh, M. Fatih Demirci, Sven Dickinson, Many-to-Many Graph Matching via Metric Embedding, Computer Vision and Pattern Recognition, 2003. Proceedings. 2003 IEEE

This is a state of the art paper which is quite dense but quite interesting. solves a very general formulation of inexact graph matching by first imbedding graphs into a normed space ...

Nov. 5 (Michelle Vanni)

Robert S. Swier and Suzanne Stevenson, Unsupervised Semantic Role Labelling, EMNLP 2004

Nianwen Xue and Martha Palmer, Calibrating Features for Semantic Role Labelling, EMNLP 2004

Oct. 29 (Eric Goldlust)

Stephen Clark and James Curran, Parsing the WSJ using CCG and Log-Linear Models, ACL 2004

Oct. 22 (Michelle Vanni)

Dekang Lin and Franz Och, Automatic Evaluation of Machine Translation Quality Using Longest Common Subsequence, ACL 2004

Babych and Hartley, Extending the BLEU MT Evaluation Method with Frequency Weightings, ACL 2004

Oct. 15 (John Blatz)

Daichi Mochihashi, Genichiro Kikui, Kenji Kita, Learning Nonstructural Distance Metric by Minimum Cluster Distortions, EMNLP 2004

Oct. 2 (Nguyen Bach)

Background knowledge on SVM and Graphical Models:

• Intro SVM
• Intro Graphical Models

Sep. 24, Oct. 7 (Roy Tromble)

B. Taskar, C. Guestrin and D. Koller, Max-Margin Markov Networks, Neural Information Processing Systems Conference (NIPS03), 2003

B. Taskar, D. Klein, M. Collins, D. Koller and C. Manning, Max-Margin Parsing, EMNLP 2004

Sep. 9 (John Blatz)

Pascale Fung and Percy Cheung, Mining Very-Non-Parallel Corpora: Parallel Sentence and Lexicon Extraction via Bootstrapping and EM, ACL 2004

Dragos Stefan Munteanu, Alexander Fraser and Daniel Marcu, Improved Machine Translation Performance via Parallel Sentence Extraction from Comparable Corpora, ACL 2004

Sep. 2 (Gideon Mann)

Xin Li, Paul Morie, and Dan Roth, Robust Reading: Identification and Tracing of Ambiguous Names, ACL 2004

Cheng Niu, Wei Li, Rohini K. Srihari, Weakly Supervised Learning for Cross-Document Person-Name Disambiguation Supported by Information Extraction, ACL 2004

Aug. 27 (David Smith)

I. Dan Melamed, Statistical Machine Translation by Parsing, ACL 2004

Daniel Gildea, Dependencies vs. Constituents for Tree-Based Alignment, ACL 2004

Aug. 20 (Damianos Karakos, Charles Schafer)

P. Pantel and D. Lin, Discovering word senses from text, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, 2002

Diana McCarthy, Rob Koeling, Julie Weeds, John Carroll, Finding Predominant Word Senses in Untagged Text, 2004

Spring 2004

Information extraction

May 15 (Roy Tromble)

Fuchun Peng, Andrew McCallum, Accurate Information Extraction from Research Papers using Conditional Random Fields,2004

May 1 (Izhak Shafran)

Eric J. Friedman, Strong Monotonicity in Surplus Sharing, 1999

Used Tom Dietterich has a web page on probabilistic relational models:, [7]

Apr. 24 (David Smith)

McCallum and Jensen, Extraction and Data Mining using Conditional-Probability Relational Models, IJCAI'03 Workshop on Learning Statistical Models from Relational Data, 2003

The paper is a survey of recent trends in IE and data mining (biased of course towards the authors' work) and a proposal to unify them with conditional random fields.

Combinatorial optimization

Apr. 17 (Elliott Franco Drabek)

Rina Dechter, Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning, 2001

Apr. 10 (Noah Ashton Smith)

Denys Duchier, Axiomatizing Dependency Parsing Using Set Constraints, Sixth Meeting on Mathematics of Language, 2000

Apr. 10 (Noah Ashton Smith)

Denys Duchier, Axiomatizing Dependency Parsing Using Set Constraints, Sixth Meeting on Mathematics of Language, 2000

Apr. 3 (Roy Tromble)

Roman Bartak, Constraint Programming: In Pursuit of the Holy Grail, 1999

Learning how to search

Mar. 25 (Eric Goldlust)

Boyan and Moore, Learning Evaluation Functions to Improve Optimization by Local Search, Journal of Machine Learning Research, 2000

Discourse, summarization, paraphrase

Mar. 18 (Markus Dreyer)

Eugene Charniak, Niyu Ge, John Hale, A Statistical Approach to Anaphora Resolution, Proceedings of the Sixth Workshop on Very Large Corpora, 1998

Mar. 5 (Charles Schafer)

Daniel Marcu, Theory and Practice of Discourse Parsing and Summarization, Chapters 2 & 3, The MIT Press, 2000

Feb. 19 (David Smith)

Barzilay and Lee, Learning to Paraphrase: An Unsupervise Approach Using Multiple-Sequence Alignment, HLT 2003

Optimality theory

Feb. 12 (Brock Pytlik)

Bob Frank, Giorgio Satta, Optimality theory and the Generative Complexity of Constraint Violability, MIT Press

Feb. 5 (Brock Pytlik)

Jessica A. Barlow and Judith A. Gierut, Optimality theory in phonological acquisition, Journal of Speech, Language and Hearing 42, 1999

Paul Boersma, Joost Dekkers and Jeroen van de WeijerIntroduction. In Optimality Theory: Phonology, Syntax and Acquisition, Oxford University Press 2000

Fall 2003

Dec. 12 (Paola Virga)

Kamal Nigam and Rayid Ghani, Analyzing the Effectiveness and Applicability of Co-training, Ninth International Conference on Information and Knowledge Management 2000

Nov. 20 (Noah A. Smith)

Rebecca Hwa, Miles Osborne, Anoop Sarkar, Mark Steedman, Corrected Co-training for Statistical Parsers, ICML 2003

Nov. 13 (Markus Dreyer)

Goldman and Zhou, Enhancing Supervised Learning with Unlabeled Data, ICML 2000

An additional paper with some experiments:

Clark, Curran and Osborne, Bootstrapping POS taggers using Unlabelled Data, CoNLL 2003

Nov. 6 (Brock Pytlik)

Stuart M. Shieber, Transducers as a Substrate for Natural Language Processing

Oct. 31 (Roy Tromble)

Dekai Wu, An algorithm for simultaneously bracketing parallel texts by aligning words, ACL 1995

Oct. 24 (Markus Dreyer)

Stuart M. Shieber, Yves Schabes, Synchronous Tree-Adjoining Grammars, Coling 1990

An additional closely related paper: Stuart M. Shieber, Yves Schabes, Generation and Synchronous Tree-Adjoining Grammars, Fifth International Workshop on Natural Language Generation

Oct. 10 (David Smith)

Bernard Comrie, Language Universals Linguistic Typology: Syntax and Morphology Language Universals, Chapters 6-7, Blackwell (1989)

Oct. 3 (Michelle Vanni)

Bernard Comrie, Language Universals Linguistic Typology: Syntax and Morphology Language Universals, Chapters 4-6, Blackwell (1989)

Sep. 18 (David Smith)

Bernard Comrie, Language Universals Linguistic Typology: Syntax and Morphology Language Universals, Chapters 2-3, Blackwell (1989)

Sep. 11 (Elliott Franco Drabek)

Bernard Comrie, Language Universals Linguistic Typology: Syntax and Morphology Language Universals, Chapters 1, Blackwell (1989)

Spring 2003

May 15 (Chal Haithaidharm)

V. N. Vapnik, The Nature of Statistical Learning Theory, Chapters 7B, 8, 9

May 8 (Noah Smith)

V. N. Vapnik, The Nature of Statistical Learning Theory, Chapters 6B - 7A

May 1 (Noah Smith)

V. N. Vapnik, The Nature of Statistical Learning Theory, Chapters 5B - 6A

Apr. 24 (Paola Virga)

V. N. Vapnik, The Nature of Statistical Learning Theory, Chapters 4B - 5A

Apr. 17 (Roy Tromble)

V. N. Vapnik, The Nature of Statistical Learning Theory,Chapters 2B - 4A

Apr. 10

V. N. Vapnik, The Nature of Statistical Learning Theory, Intro and Chapters 1, 2A

Mar.20 (Roy Tromble)

Nikita Schmid, Ahmed Patel, Using Tree Automata and Regular Expressions to Manipulate Hierarchically Structured Data

Mar.6 (Paola Virga)

Carl M. Kadie, Christopher Meek, David Heckerman, A Collaborative Filtering System Using Posteriors Over Weights of Evidence, Proceedings of the Eighteenth Conference on Uncertainty in Artificial Intelligence, 2002.

Feb. 26 (Elliott Drabek)

Steven Abney, Bootstrapping, ACL'02

Feb. 19 (Elliott Drabek)

A. Lopez, M. Nossal, R. Hwa, P. Resnik, Word-level Alignment for Multilingual Resource Acquisition, Proceedings of the 2002 LREC Workshop on Linguistic Knowledge Acquisition and Representation: Bootstrapping Annotated Language Data

Feb. 13 (David Smith)

K. Church, Empirical Estimates of Adaptation: The chance of Two Noriega's is closer to p/2 than p², COLING 2000, pp. 173-179

Fall 2002

Jul. 31 (Paola Virga)

Kenji Yamada, Kevin Knight, A decoder for Syntax-based Statistical MT, ACL 2002

Jul. 24 (Michelle Vanni)

Paola Merlo, A Multilingual Paradigm for Automatic Verb Classification, ACL 2002

Dec. 5 (Silviu Cucerzan)

Darren Pearce, A Comparative Evaluation of Collocation Extraction Techniques, LREC 2002

D. Lin, Automatic identification of non-compositional phrases, ACL 1999

Nov. 21 (Silviu Cucerzan)

Ueda, Nakano, Ghahramani, Hinton, SMEM Algorithm for Mixture Models, Neural Information Processing Systems 1998

Nov. 14 (Michelle Vanni)

Marti Hearst, Untangling Text Data Mining, ACL 1999

Nov. 7 (Neda Khalili)

Yamamoto, Church, Using Suffix Arrays to Compute Term Frequency and Document Frequency for All Substrings in a Corpus, Computational Linguistics 2001

A related paper: Kageura, Bigram Statistics Revisited A Comparative Examination of Some Statistical Measures in Morphological Analysis of Japanese Kanji Sequences

Nov. 1 (Chalaporn Hathaidharm)

J. Gao, J. Goodman, M. Li, K. Lee, Toward A Unified Approach To Statistical Language Modeling For Chinese, ACM Transactions on Asian Language Information Processing, Vol. 1, No. 1, pp 3-33. 2002.

Oct. 24 (Roy Tromble)

Han, Benjamin, Building a Bilingual Dictionary with Scarce Resources: A Genetic Algorithm Approach

Oct. 17 (David Smith)

Cotton, Bird, An Integrated Framework for Treebanks and Multilayer Annotations, LREC 2002

Oct. 8 (Elliott Franco Drabek)

Ravichandran, Hovy, Learning Surface Text Patterns for a Question Answering System, ACL 2001

A similar paper: Lin, Pantel, Discovery of Inference Rules for Question Answering, KDD 2001

Oct. 2 (Gideon Mann)

Gildea, Jurafsky, Automatic Labeling of Semantics Roles, ACL 2001

Sep. 26 (Paul Ruhlen)

Hwa, Resnik, Weinberg, Kolak, Evaluating Translational Correspondence using Annotation Projection, ACL 2002

Sep. 19 (Paola Virga)

Yamada, Knight, A decoder for Syntax-based Statistical MT, ACL 2002

Sep. 10 (Noah A. Smith)

Collins, Duffy., New Ranking Algorithms for Parsing and Tagging: Kernels over Discrete Structures, and the Voted Perceptron, ACL 2002

Spring 2002

Apr. 25 (Paul Ruhlen)

H. Al-Adhaileh, Kong, Melamed, Malay-English Bitext Mapping and Alignment Using SIMR/GSA Algorithms, Malaysian National Conference on Research and Development on Lingustics 2001

Apr. 18 (Paul Ruhlen)

N. A. Rao, K. Rose, Deterministically annealed design of hidden Markov model speech recognizers, IEEE Trans. on Speech and Audio Processing, vol. 9, (no. 2), Feb. 2001

Apr. 11 (Paola Virga)

Neal, Hinton, A view of the EM algorithm that justifies incremental, sparse, and other variants, Learning in Graphical Models, 1999

And this article builds on the above. It tests an incremental version of EM (carefully choosing how incremental it will be), as well as a "lazy EM" version that visits "significant" cases more often.

Mar. 28 (Swapna Somasundaran)

Crestan, El-Beze, Improving supervised WSD by including rough semantic features in a Multilevel view of the Context, SEMPRO Workshop, Edinburgh, 2001.

Mar. 14 (Noah A. Smith)

Ratnaparkhi, A Simple Introduction to Maximum Entropy Models for NLP, Institute for Research in Cognitive Science, Univ. of Penn.

Feb. 28 (Silviu Cucerzan)

Marcu, Towards a Unified Approach to Memory- and Statistical-Based Machine Translation, Annual Meeting of the ACL, Proceedings of the 39th Annual Meeting on Association for Computational Linguistics '2001

Feb. 21 (Jia Cui)

Barzilay, McKeown, Extracting Paraphrases from a Parallel Corpus, Computer Science Department, Columbia Univ.

Feb. 14 (Charles Schafer)

Yaser, Germann, Translating with Scarce Resources, American Association for Artificial Intelligence 2000

Feb. 7 (Paola Virga)

Knight, Graehl, Machine Transliteration, ACL-EACL 1997

Fall 2001

Dec. 14 (Jia Cui)

Jerome Bellegarda, Exploiting latent semantic information in statistical language models, Proceedings of the IEEE, 88:8, Aug. 2000

Nov. 29 (Silviu Cucerzan)

Mike Collins, Yoram Singer, Unsupervised Models for Named Entity Classification, EMNLP/VLC'99

Nov. 20 (Radu Florian)

Blum, Mitchell, Combining Labeled and Unlabeled Data with Co-Training, COLT 1998

Nov. 16 (Richard Wicentowski)

Eisner, Satta, Efficient parsing for bilexical context-free grammars and head automaton grammars, ACL 1999

Plagiarism detection systems might be relevant to bitext alignment. A message to the Corpora list yesterday announced the following review paper: [8]

Nov. 2 (Paul Ruhlen)

Manning, Schuetze, Foundations of Statistical Natural Language Processing, Section 14 (clustering), pp. 495-527, MIT Press

Oct. 26 (Gideon Mann)

Tishby, Pereira, Bialek, The information bottleneck method

The paper describes a clustering method which is a generalization of their earlier work on "Distributional Clustering of English Words" (Pereira, Tishby and Lee '93).