Triangular line graphs and word sense disambiguation

Linguists often represent the relationships between words in a collection of text as an undirected graph G=(V,E)G=(V,E), where VV is the vocabulary and vertices are adjacent in GG if and only if the words that they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph. However, many words have several distinct meanings, preventing components from characterizing distinct semantic fields. This paper examines how the structural properties of triangular line graphs motivate the use of a clustering coefficient on the triangular line graph, thereby helping to identify polysemous words. The triangular line graph   of GG, denoted by T(G)T(G), is the subgraph of the line graph of GG where two vertices are adjacent if the corresponding edges in GG belong to a K3K3.