18. The non-transitory computer-readable storage medium of claim 16 , further comprising instructions for: constructing, based on a set of data, the bipartite representation; wherein the bipartite representation represents a bipartite graph including a first partition and a second partition; wherein the first partition comprises the first set of nodes; wherein the second partition comprises a second set of nodes; wherein each node in the second set of nodes represents a visual word representing visual content in the set of visual words; wherein the instructions for identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words, further comprises instructions for: for each linguistic word in the one or more other linguistic words in the set of linguistic words, for the first node of the bipartite graph that represents the linguistic word, which is associated with the at least one query term and the second node of the bipartite graph, which represents one or more other linguistic words associated with one or more other query terms, deriving, based on the bipartite graph, the association score between the first node and the second node.
18. The non-transitory computer-readable storage medium of claim 16 , further comprising instructions for: constructing, based on a set of data, the bipartite representation; wherein the bipartite representation represents a bipartite graph including a first partition and a second partition; wherein the first partition comprises the first set of nodes; wherein the second partition comprises a second set of nodes; wherein each node in the second set of nodes represents a visual word representing visual content in the set of visual words; wherein the instructions for identifying association scores between a linguistic word that is equivalent to the at least one query term and one or more other linguistic words in the set of linguistic words, further comprises instructions for: for each linguistic word in the one or more other linguistic words in the set of linguistic words, for the first node of the bipartite graph that represents the linguistic word, which is associated with the at least one query term and the second node of the bipartite graph, which represents one or more other linguistic words associated with one or more other query terms, deriving, based on the bipartite graph, the association score between the first node and the second node. 19. The non-transitory computer-readable storage medium of claim 18 wherein the instructions for deriving the association score between the first node and the second node includes: generating a first set of scores based on a random walk through the bipartite graph; generating a second set of scores based on a random walk, with restart from the first node, through the bipartite graph; and deriving the association score based on the first set of scores and the second set of scores.