Basic poetry generation

• US 20030036040A1
• Filed: 05/10/2002
• Published: 02/20/2003
• Est. Priority Date: 11/01/1999
• Status: Active Grant

• Current Assignee: Kurzweil Cyberart Technologies Incorporated
• Original Assignee: Kurzweil Cyberart Technologies Incorporated
• Inventors: Kurzweil, Raymond, Keklak, John A.
• Granted Patent: US 7,184,949 B2
• Time in Patent Office: Days
• US Class Current: 434/169
• CPC Class Codes: G06F 40/20 Natural language analysis semantic analysis of natural language G06F40/30
• CPC Class Codes: G06F 40/211 Syntactic parsing, e.g. based on context-free grammar [CFG] or unification grammars
• CPC Class Codes: G06F 40/216 using statistical methods
• CPC Class Codes: G06F 40/284 Lexical analysis, e.g. tokenisation or collocates
• CPC Class Codes: G06F 40/35 Discourse or dialogue representation
• CPC Class Codes: G06F 40/56 Natural language generation
• CPC Class Codes: Y10S 707/99943 Generating database or data structure, e.g. via user interface

Abstract

A method of analyzing an author'"'"'s work, including reading a text file, generating an analysis model from the text file and storing the analysis model. The text file may be a poem, the poem containing ASCII text. The analysis model is a linked data structure. The linked data structure includes n-gram data structures, the n-gram structures including combinations of 1-gram data structures, bigram data structures, trigram data structures and quadrigram data structures.

Claims

1. A computer-implemented method of analyzing an author'"'"'s work, comprising:

reading a text file;

generating an analysis model from the text file; and

storing the analysis model.

2. The computer-implemented method of claim 1 wherein the text file is a poem, the poem containing a plurality of ASCII text.

3. The computer-implemented method of claim 1 wherein the analysis model is a linked data structure.

4. The computer-implemented method of claim 3 wherein the linked data structure comprises a plurality of n-gram data structures.

5. The computer-implemented method of claim 4 wherein each of the plurality of n-gram data structures comprises:

a plurality of 1-gram data structures;

a plurality of bigram data structures;

a plurality of trigram data structures; and

a plurality of quadrigram data structures.