default search action
Graph-based Methods for Natural Language Processing 2009: Singapore
- Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing, August 7, 2009, Singapore. The Association for Computer Linguistics 2009, ISBN 978-1-932432-54-1
- David Ellis:
Social (distributed) language modeling, clustering and dialectometry. 1-4 - Sitabhra Sinha, Raj Kumar Pan, Nisha Yadav, Mayank N. Vahia, Iravatham Mahadevan:
Network analysis reveals structure indicative of syntax in the corpus of undeciphered Indus civilization inscriptions. 5-13 - Martijn Wieling, John Nerbonne:
Bipartite spectral graph partitioning to co-cluster varieties and sound correspondences in dialectology. 14-22 - Daniel Ramage, Anna N. Rafferty, Christopher D. Manning:
Random Walks for Text Semantic Similarity. 23-31 - Yoshimi Suzuki, Fumiyo Fukumoto:
Classifying Japanese Polysemous Verbs based on Fuzzy C-means Clustering. 32-40 - Eric Yeh, Daniel Ramage, Christopher D. Manning, Eneko Agirre, Aitor Soroa:
WikiWalk: Random walks on Wikipedia for Semantic Relatedness. 41-49 - Amac Herdagdelen, Katrin Erk, Marco Baroni:
Measuring semantic relatedness with vector space models and random walks. 50-53 - Zheng Chen, Heng Ji:
Graph-based Event Coreference Resolution. 54-57 - Delip Rao, David Yarowsky:
Ranking and Semi-supervised Classification on Large Scale Graphs Using Map-Reduce. 58-65 - Swapna Somasundaran, Galileo Namata, Lise Getoor, Janyce Wiebe:
Opinion Graphs for Polarity and Discourse Classification. 66-74 - Linlin Li, Caroline Sporleder:
A Cohesion Graph Based Approach for Unsupervised Recognition of Literal and Non-literal Use of Multiword Expressions. 75-83 - Scott Martens:
Quantitative analysis of treebanks using frequent subtree mining methods. 84-92
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.