1. A method comprising: creating, using a computer, a sentence comprising a plurality of label words and at least one relationship word, wherein the sentence describes a walk of a graph, wherein the graph is stored in semiconductor memory and comprises a set of nodes and a set of edges, wherein the edges are incident to the nodes, wherein the label words describe the nodes, wherein the relationship words describe the edges; wherein the walk comprises an alternating sequence of a subset of the nodes and of the edges, and wherein each of the edges in the alternating sequence is incident to two of the nodes that precede and follow the respective edge in the alternating sequence, wherein the alternating sequence begins with a first-node and ends with a last-node, wherein the creating further comprises: determining a parent node associated with a selected label word; determining child nodes of the parent node that is associated with the selected label word; determining the edges that are incident to the parent nodes and the child nodes; determining the relationship words that describe the edges that are incident to the parent nodes and the child nodes; determining child label words that describe the child nodes; presenting the child label words and the relationship words that describe the edges that are incident to the parent node and the child nodes; and adding a selected relationship word and a selected child label word to the selected label word to form the sentence; and presenting the sentence via a display.