Systems and methods are provided herein for using a trained knowledge graph to accurately determine whether two phrases are conversationally connected. To this end, three phrases are received. The phrases are translated to strings of word types by determining what type of word each word of each phrase represents, and replacing each word of the first phrase with its respective type. A knowledge graph is then accessed to determine strengths of association between a combinations of each string of word types and any conversational category of a plurality of conversational categories. If any of the strengths of association exceed a threshold, the corresponding strings may be determined to be part of a conversation.