Abstract: Systems and methods for processing data transform a first data structure (e.g., a hierarchical data structure) into a second data structure (e.g., using a parsing system), wherein the second data structure includes a first set of leaf nodes under a first ancestor node (additional sets of leaf nodes and/or ancestor nodes also may be defined in the second data structure). One or more potential candidate nodes for the ancestor nodes may be identified based, at least in part, on the ancestor nodes from the first data structure associated with the leaf nodes grouped under the new ancestor nodes. In at least some examples, the leaf nodes grouped under a new ancestor node will “vote” for their original ancestor node, and the node receiving the most “votes,” in at least some instances, will be reused as the corresponding ancestor node in the second data structure.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: Systems, methods, and computer-readable media for making rich, flexible, and more natural electronic ink annotations in an electronic document include creating a first context node associated with a first portion of a base portion of an electronic document; creating a second context node associated with an annotation to the base portion; and linking the second context node with the first context node.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.

Abstract: A method of analyzing electronic ink, in which document data for a document containing electronic ink content is received from a software application running on a first processing thread. The first processing thread is employed to provide the document data to an electronic ink analysis process for analyzing on a second processing thread. Control of the first processing thread is then returned to the software application. After the results of the analysis are received, the results are reconciled with the current document data for the document.

Abstract: A system and method for storing document data in a serialized binary format recognition lattice structure so that the data is accessible to other applications. The lattice structure is generated that includes root node data. Child nodes correspond to columns of the recognition lattice. Each node includes a descriptor that is a collection of flags indicating presence of specific components of the node. The child nodes may include grandchild nodes with similar structure corresponding to elements within the columns. Each node further includes property information associated with the node. The recognition lattice is stored in a serial binary data format.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: A system and process for enabling updates of an ink analysis document model are described.

Abstract: A system and method for assisting with analysis and recognition of ink is described. Analysis hints may be associated with a field. The field may receive electronic ink. Based on the identity of the field and the analysis hint associated with it, at least one of analysis and recognition of ink may be assisted.

Abstract: A computer-readable medium having a data structure for storing document data in a serialized binary format so that the document data is accessible to other applications. A document structure is generated that includes root node data. The document is stored in a serial binary data format. The serial binary format includes storing size data associated with the document structure in a first data field. The serial binary format also includes storing document structure descriptor data in a second data field, wherein the document structure descriptor data includes at least one flag for indicating data expectancy. The serial binary format further includes storing root node data in a third data filed, wherein the root node data is indicated by at least one of the flags.

Abstract: An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.

Abstract: A system, method, data structure, and application programming interface is described that stores alternate recognition results in an ink tree lattice.

Abstract: Systems and methods for processing data transform a first data structure (e.g., a hierarchical data structure) into a second data structure (e.g., using a parsing system), wherein the second data structure includes a first set of leaf nodes under a first ancestor node (additional sets of leaf nodes and/or ancestor nodes also may be defined in the second data structure). One or more potential candidate nodes for the ancestor nodes may be identified based, at least in part, on the ancestor nodes from the first data structure associated with the leaf nodes grouped under the new ancestor nodes. In at least some examples, the leaf nodes grouped under a new ancestor node will “vote” for their original ancestor node, and the node receiving the most “votes,” in at least some instances, will be reused as the corresponding ancestor node in the second data structure.

Abstract: A space tool that inserts space into or deletes space from a document is described. The space tool provides the user with feedback as to which objects will be moved when space is inserted into or deleted from a document. To provide the user with this feedback, the space tool identifies the objects that will be moved when space is inserted or deleted, and changes the appearance of these objects. For example, the space tool may gray out or fade identified electronic ink objects that will be moved. Alternatively, or additionally, the space tool may move identified objects in real time, so that their location continually corresponds with what their location will be after space has been inserted or deleted.

Abstract: A method of reconciling a first data structure with a second data structure that is a subsequently modified version of the first data structure. Initially, each node in the first data structure for which a change has been made to a corresponding node in the second data structure is accessed. For each accessed node, a determination is made as to whether the change made to the corresponding node in the second data structure creates a collision with the first data structure. If the change made to the corresponding node in the second data structure does not create a collision with the first data structure, then the change is made to the accessed node in the first data structure.

Abstract: Systems, methods, and computer-readable media for making rich, flexible, and more natural electronic ink annotations in an electronic document include creating a first context node associated with a first portion of a base portion of an electronic document; creating a second context node associated with an annotation to the base portion; and linking the second context node with the first context node.

Abstract: An application programming interface instantiates an ink analyzer object that receives document data for a document containing electronic ink content from a software application hosting the document and running on a first processing thread. The ink analyzer object then employs the first thread to make a copy of the document data, provides the copy of the document data to an electronic ink analysis process, and returns control of the first processing thread to the analysis process. After the analysis process has analyzed the electronic ink, the ink analyzer object reconciles the results of the analysis process with current document data for the document.