Microsoft Technology Licensing, LLC

Microsoft Corporation

Jerome J Turner

Timothy H Kannapel

Subha Bhattacharyay

Jamie N Wakeam

Zoltan C Szilagyi

Bodin Dresevic

Sashi Raghupathy

Richard Jennings Duncan

Steve Dodge

Haiyong Wang

Todd M Landstad

Sebastian Poulose

Alexander G Gounares

Robert L Chambers

Arin J Goldberg

Herry Sutanto

Rudolph Balaz

Manoj Kumar Biswas

Gregory Nicholas Hullender

Gavin M Gear

Andrew L Silverman

Brigette Krantz

Todd A Torset

Shiraz M Somji

Stephen Alan Fisher

Roman Snytsar

Alex Jacob Simmons

Peter Loren Engrav

David Bargeron

Matthew P Rhoten

Kevin Phillip Paulson

Michael Shilman

Tobiasz Alexander Zielinski

Jennifer A Teed

Thomas R Wick

Kentaro Urata

Benoit Jules Jurion

Terri L Chudzik

Erin Devoy

Roman Snystar

Amber P Race

Lidia Schwarz

Matthew Paul Rhoten

Tobiasz Zielinski

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.

System and method for binary persistence format for a recognition result lattice

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.

Voting based scheme for electronic document node reuse

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

On demand data proxy

The present invention relates to interfacing with electronic ink. Ink is stored in a data structure that permits later retrieval by applications. The ink includes stroke information and may include property information. Through various programming interfaces, one may interact with the ink through methods and setting or retrieving properties. Other objects and collections may be used as well in conjunction with the ink objects.

Interfacing with ink

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.

Analysis hints

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.

Electronic ink processing and application programming interfaces

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.

Electronic ink processing

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

Analysis alternates in context trees

Methods for communicating between an application and an ink divider object (which stores ink strokes to be divided into groups) may include: (a) issuing a divide request to the ink divider object, optionally by the application; (b) in response to the divide request, calling a divide method, which groups the stored ink strokes into one or more groupings of strokes having a first predetermined granularity (e.g., words, lines, paragraphs, sentences, drawings, etc.); and (c) making information regarding the one or more groupings of strokes available to the application. This 'information' made available to the application may include, for example, the actual groupings of the strokes, the number of stroke groupings having the first predetermined granularity, machine generated text corresponding to the stroke groupings, or the like. The results of the divide method may be stored in an ink division result object. In some examples, the ink division result object may include the originally divided strokes and allow retrieval of groupings of strokes of various different granularities. This invention also relates to systems for performing the above methods and various data structures used in performing these methods.

Ink divider and associated application program interface

Growing community of inventors

Redmond, WA, United States of America

Jerome J Turner