Greetings all,
We will be meeting today at 2pm in HH 321. Yanbo will be presenting
her project work to date, which is generally based on finding lexical
semantic relatedness using Random Walk approaches. Yanbo has been
focusing in particular on the following two papers and will discuss
these as well as her own ideas on the topic.
@InProceedings{hughes-ramage:2007:EMNLP-CoNLL2007,
author = {Hughes, Thad and Ramage, Daniel},
title = {Lexical Semantic Relatedness with Random Graph Walks},
booktitle = {Proceedings of the 2007 Joint Conference on Empirical
Methods in Natural Language Processing and Computational Natural
Language Learning (EMNLP-CoNLL)},
month = {June},
year = {2007},
address = {Prague, Czech Republic},
publisher = {Association for Computational Linguistics},
pages = {581--589},
url = {http://www.aclweb.org/anthology/D/D07/D07-1061}
}
@InProceedings{rao-yarowsky-callisonburch:2008:TG3,
author = {Rao, Delip and Yarowsky, David and Callison-Burch, Chris},
title = {Affinity Measures Based on the Graph {L}aplacian},
booktitle = {Coling 2008: Proceedings of the 3rd Textgraphs workshop
on Graph-based Algorithms for Natural Language Processing},
month = {August},
year = {2008},
address = {Manchester, UK},
publisher = {Coling 2008 Organizing Committee},
pages = {41--48},
url = {http://www.aclweb.org/anthology/W08-2006}
}
Enjoy,
Ted
--
Ted Pedersen
http://www.d.umn.edu/~tpederse
