| a graph model for unsupervised lexical acquisition this paper presents an unsupervised method for assembling semantic knowledge from a part-of-speech tagged corpus using graph algorithms. the graph model is built by linking pairs of words which participate in particular syntactic relationships. we focus on the symmetric relationship between pairs of nouns which occur together in lists. an incremental cluster-building algorithm using this part of the graph achieves 82% accuracy at a lexical acquisition task, evaluated against wordnet classes. the model naturally realises domain and corpus specific ambiguities as distinct components in the graph surrounding an ambiguous word. we try to find graph regions that are more connected internally than externally. |