Learning Graph Walk Based Similarity Measures for Parsed Text

We consider a parsed text corpus as an instance of a labelled directed graph, where nodes represent words and weighted directed edges represent the syntactic relations between them. We show that graph walks, combined with existing techniques of supervised learning, can be used to derive a task-specific word similarity measure in this graph. We also propose a new path-constrained graph walk method, in which the graph walk process is guided by high-level knowledge about meaningful edge sequences (paths). Empirical evaluation on the task of named entity coordinate term extraction shows that this framework is preferable to vector-based models for smallsized corpora. It is also shown that the pathconstrained graph walk algorithm yields both performance and scalability gains.

• Type: Conference
• Year: 2008
• Where: EMNLP
• Authors: Einat Minkov, William W. Cohen
• Keywords: EMNLP 2008, Graph Walk, Graph Walk Method, Labelled Directed Graph, Natural Language Processing