To regularize LDA with FQG, we form the word network where a word is connected to the words in the same or adjacent fragments.
if word w i ∈ f rag x and word w j ∈ f rag y (w i = w j ), we create a link (w i , w j ) if x = y or (x, y) ∈ E, where E is the set of edges of the FQG.