Difference between revisions of "NLP Reading Group"

From CLSP Wiki
Jump to navigation Jump to search
Line 26: Line 26:
 
|A. Prieditis
 
|A. Prieditis
  
[http://www.cs.jhu.edu/~jblatz/nlp-reading-group/prieditis93.pdf  Machine discovery of Effective Admissible Heuristics ]
+
[http://www.cs.jhu.edu/~jblatz/nlp-reading-group/prieditis93.pdf  Machine discovery of Effective Admissible Heuristics ]
  
Machine Learning Journal, 1993
+
Machine Learning Journal, 1993
  
 
|-
 
|-
Line 35: Line 35:
 
|A. Haghighi, J. DeNero and D. Klein
 
|A. Haghighi, J. DeNero and D. Klein
  
[http://www.eecs.berkeley.edu/~aria42/pubs/factor-astar-naacl07.pdf  Approximate Factoring for A* Search]
+
[http://www.eecs.berkeley.edu/~aria42/pubs/factor-astar-naacl07.pdf  Approximate Factoring for A* Search]
  
NAACL-HLT 2007
+
NAACL-HLT 2007
  
 
|-
 
|-
Line 44: Line 44:
 
|H. Daume III, J. Langford, and D. Marcu
 
|H. Daume III, J. Langford, and D. Marcu
  
[http://pub.hal3.name/daume06searn.pdf    Search-based structured prediction.]
+
[http://pub.hal3.name/daume06searn.pdf    Search-based structured prediction.]
  
Machine Learning Journal, forthcoming
+
Machine Learning Journal, forthcoming
  
 
|-
 
|-
Line 53: Line 53:
 
|H. Daume III & D. Marcu
 
|H. Daume III & D. Marcu
  
[http://pub.hal3.name/daume05laso.pdf    Learning as search optimization: approximate large margin methods for structured prediction.]
+
[http://pub.hal3.name/daume05laso.pdf    Learning as search optimization: approximate large margin methods for structured prediction.]
  
ICML 2005
+
ICML 2005
  
 
|-
 
|-
Line 62: Line 62:
 
|M. Kaisser, S. Scheible, and B. Webber
 
|M. Kaisser, S. Scheible, and B. Webber
  
[http://trec.nist.gov/pubs/trec15/papers/udeinburgh.qa.final.pdf    Experiments at the University of Edinburgh for the TREC 2006 QA track.]
+
[http://trec.nist.gov/pubs/trec15/papers/udeinburgh.qa.final.pdf    Experiments at the University of Edinburgh for the TREC 2006 QA track.]
  
TREC-15
+
TREC-15
  
 +
|They do some fairly deep interpretation of sentences, extracting their predicate-argument structure.
 +
 +
|-
 +
|Feb. 22
 +
|Eric Harley
 +
|K. Kan Lo & W. Lam
 +
 +
[http://trec.nist.gov/pubs/trec15/papers/cuhk.qa.final.pdf    Using Semantic Relations with World Knowledge for Question Answering]
 +
 +
TREC-15
 +
 +
|-
 +
|Feb. 15
 +
|Nikhil Bojja
 +
|C. Monson et. al.
 +
 +
[http://acl.ldc.upenn.edu/acl2004/studentws/pdf/monson.pdf      Unsupervised Induction of Natural Language Morphology Inflection Classes]
 +
 +
ACL Student Workshop '04
 +
 +
|-
 +
|Feb. 8
 +
|Delip Rao
 +
|P. Schone and D. Jurafsky 
 +
 +
[http://acl.ldc.upenn.edu/W/W00/W00-0712.pdf      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.
 +
[http://www.stanford.edu/people/jurafsky/NAACL2001_Morphology_final.pdf]
 +
 +
 +
|-
 +
|Feb. 1
 +
|Nikesh Garera
 +
|D. Yarowsky and R. Wicentowski 
 +
 +
[http://www.cs.swarthmore.edu/~richardw/pubs/acl2000.ps      Minimally supervised morphological analysis by multimodal alignment ]
 +
 +
ACL 2000
 +
 +
|For more details refer to  [http://www.cs.swarthmore.edu/~richardw/pubs/thesis.pdf Chapter 4]  of Wicentowski's thesis.
  
 
|}
 
|}

Revision as of 04:21, 19 January 2008

The reading group attempts to keep abreast of current trends in natural language processing research. We typically read one or two recent NLP conference papers each week, and occasionally look at material from the machine learning, statistics, and linguistics communities as well.

Starting in 2008, we will be posting the weekly readings here. Past readings since 2001 will be posted shortly.

Summer 2007

Date/Time Presenter Paper(s) Supporting Papers/Notes
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

Date/Time Presenter Paper(s) Supporting Papers/Notes
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

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

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.

[1]


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.