Patent Document ID: 8977538
Application ID: 13230643

Base Claim:
1. A method for constructing a word graph, the method comprising: obtaining a subject text; dividing the subject text into one or more units; dividing the units into one or more sub-units; and recording each of the one or more sub-units, wherein recording each of the one or more sub-units includes: determining whether each sub-unit has been previously encountered; storing the sub-unit as a node if the sub-unit has not been previously encountered; proceeding with an existing node if the sub-unit has been previously encountered; preserving a relationship of each of the one or more units to one another; and preserving a relationship of each of the one or more sub-units to one another; storing a repeat factor, wherein the repeat factor indicates a number of instances in which one or more repeated sub-units have been encountered since some prior point in each of the one or more units; incrementing the repeat factor each time a repeated sub-unit is encountered since some prior point in each of the one or more units; and preserving and analyzing the relationship of each of the one or more sub-units to one another to perform a function as directed by a user, wherein the function includes comparing the constructed word graph to a user input; and outputting a result of the function to the user.

---

Claim 9:
9. The method of claim 1 further comprising: identifying the first sub-unit in at least one of the units; navigating through each of the sub-units of the unit.