Automated building and sequencing of a storyline and scenes, or sections, included therein
AssigneeInternational Business Machines Corporation
InventorsHarish Bharti, Sanjib Choudhury, Kshitij K. Raval, Rajesh K. Saxena
Life of this patent
Estimating the term…
Abstract
A method uses random walk traversal(s) (for example, Lévy's flight algorithm) of a story data graph to help select and/or order nodes for automated story writing purposes. Dialogue metadata (for example, inverted quotation marks) is added, to indicate natural language dialogue in nodes of the story data graph. A cyclic, non-directed story data graph is partitioned into non-cyclic tree(s) (also called tree logical data structures) using nodes and connections from the story data graph.
Claims9
A computer-implemented method for composing an automated story, the computer-implemented method comprising:
- receiving a story data graph comprising a plurality of nodes including content and a plurality of connections among and between the nodes;
- selecting a starting node from the plurality of nodes;
- performing, using a content curator algorithm, a first random walk according to a first random walk algorithm, with the first random walk:
- (i) starting with the starting node, (ii) traversing a plurality of first-random-walk-traversed nodes of the plurality of nodes, and (iii) following connections of the plurality of connections of the story data graph on the first random walk;
- and
- outputting a first-random-walk-traversed data set that indicates an identity and order of traversal of the first-random-walk-traversed nodes to further stages of an automated story writing program.
9-20. (canceled)
Dependencies are inferred from the claim text.