# Patent

## Title
Analysis alternates in context trees

## Abstract

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

## Background
BACKGROUND OF THE INVENTION
1. Field of the Invention
Aspects of the present invention relate to computing systems. More particularly, aspects of the present invention relate to handling alternates from recognition systems.
2. Description of Related Art
In addition to working with text, computers now have the ability to record and modify electronic ink. The electronic ink may be kept in its native form or may be recognized as text. Recognition of electronic ink is not always perfect. The recognition process may vary based on the legibility of a person's handwriting in addition to the context in which the person is writing.
Computing systems provide alternates to users such that a user may select which recognition result is correct for received handwriting. However, conventional representations of alternates do not address complex representations of electronic ink. For instance, conventional representations of alternates are limited to parsing a single line of electronic ink. Computing systems did not account for contextual value of electronic ink extending beyond any given line.
An improved parsing system and process for representing alternates and relating them to an overall tree structure of the ink are needed.
BRIEF SUMMARY OF THE INVENTION
Aspects of the present invention address one or more of the problems described above, thereby providing a way of handling alternates from recognition systems.



BRIEF DESCRIPTION OF THE DRAWINGS
The present invention is illustrated by way of example and not limited in the accompanying figures in which like reference numerals indicate similar elements and in which:
FIG. 1 illustrates a schematic diagram of a general-purpose digital computing environment in which certain aspects of the present invention may be implemented;
FIGS. 1B through 1M show a general-purpose computer environment supporting one or more aspects of the present invention.
FIG. 2 shows an illustrative example of a tablet computer in accordance with aspects of the present invention.
FIG. 3 shows an example of electronic ink in accordance with aspects of the present invention.
FIG. 4 shows an illustrative example of a context tree in accordance with aspects of the present invention.
FIG. 5 shows an example of a lattice in accordance with aspects of the present invention.
FIGS. 6-7 show selection lattices in accordance with aspects of the present invention.
FIGS. 8-9 show lattices in accordance with aspects of the present invention.
FIG. 10 shows object relationships in accordance with aspects of the present invention.
FIG. 11 shows illustrative processes for creating a lattice in accordance with aspects of the present invention.
FIGS. 12A-16 and 18 show context trees and alternates in accordance with aspects of the present invention.
FIG. 17 shows electronic ink in accordance with aspects of the present invention.



DETAILED DESCRIPTION OF THE INVENTION
Aspects of the present invention relate to recognizing and handling alternate representations of electronic ink. Aspects include representing alternate analysis results as part of a tree.
This document is divided into sections to assist the reader. These sections include: overview, characteristics of ink, terms, general-purpose computing environment, representation of alternates, objects and object relationships, application programming interfaces, lattice creation, and examples.
It is noted that various connections are set forth between elements in the following description. It is noted that these connections in general and, unless specified otherwise, may be direct or indirect and that this specification is not intended to be limiting in this respect.
Overview
According to various examples of the invention, contents of a document may be arranged into a tree structure. The tree structure may include both electronic ink and textual representations of the ink. The tree may also contain non-ink content, including but not limited to native text, text recognized from ink, text recognized from speech, drawings, pictures, charts, presentations, spreadsheets, mathematical equations, musical notations, audio and/or video clips, and other information. As the textual representations may vary based on context and legibility of a person's handwriting, alternate representations of the textual information may also be included in the tree structure. Aspects of the present invention include representation of the tree structure through the use of one or more lattices with alternate recognition results.
Using the tree structure, a software operating system or application may readily traverse the tree structure and obtain alternates when needed. The tree structure may define various elements in a document. For instance a node in the data structure may correspond to an ink stroke, and may further classify that ink stroke as either a text ink stroke or a drawing ink stroke.
This type of data structure may also associate document elements into meaningful groups, such as words, lines and paragraphs. Thus, if a software application maintains a tree structure that describes a paragraph of handwritten electronic ink, the leaf nodes may associate individual strokes of electronic ink with word nodes corresponding to the words in the paragraph. The tree structure may then associate the word nodes with line nodes corresponding to lines in the paragraph. Each line node may then be associated with a node corresponding to the paragraph. Further, a software operating system or application may maintain a tree or other data structure that associates a node corresponding to an electronic ink stroke with a recognition result. These data structures thus can be used to both define relationships between associated electronic ink strokes and improve the handling of alternate recognition results of the ink.
As described below, these data structures can be used with an ink analysis tool according to various examples of the invention to analyze electronic ink in a document. According to various examples of the invention, a software operating system or application may obtain an analysis of electronic ink within a document by first creating a data structure for a document. The data structure describes the relationship between document elements that have already been analyzed, and thus provides the context in which the new electronic ink will analyzed. This data structure or “ink analyzer object” also includes the new electronic ink that has not been analyzed. That is, the ink analyzer object also includes electronic ink for which a relationship with other documents elements has not been established.
At least two operations may be performed on received ink. The first operation is a parsing process that analyzes the received ink and creates a tree structure. The second operation is a recognition process that recognizes electronic ink and creates a lattice from the tree structure, with the lattice including alternate recognitions of the electronic ink. Other operations may be performed on the received ink as well and are not limited to the parsing and recognizing processes described here. For example, parsing determines a local grouping of strokes. Recognition determines what words in a language (or shapes or other types of data) the strokes represent.
Recognition alternates may be associated with the lattice and forwarded along with parent documents or other files. Alternatively, the lattice and alternative recognition results may be created anew on each computing system. One advantage for allowing exchange of the lattice and recognition results between machines is the persistence of ink and previously obtained information from one machine to another. Here, the second machine does not need to request new results from a recognizer as the alternate recognition results have been associated with the lattice. Thus, the lattice and alternates, once in existence, may be used on machines with and without recognizers. This ability may further support the extensibility of recognition results to all machines, irrespective of whether downstream machines have the ability to recognize ink or other inputs.
Lattice elements may be entities within the lattice that store (or at least reference) data. The data in the lattice elements are not limited to text. Lattice elements may include or reference any number of recognizable entities including but not limited to recognized ink, unrecognized ink, typed-in text, a mathematical equation, musical notations, and the like. For instance, if one was using a math recognizer, each one of the elements may have math XML (or the like) as the value of each element. Different elements may still reverence specific strokes and the next column, but the data is not limited to plain text.
Characteristics of Ink
As known to users who use ink pens, physical ink (the kind laid down on paper using a pen with an ink reservoir) may convey more information than a series of coordinates connected by line segments. For example, physical ink can reflect pen pressure (by the thickness of the ink), pen angle (by the shape of the line or curve segments and the behavior of the ink around discreet points), and the speed of the nib of the pen (by the straightness, line width, and line width changes over the course of a line or curve). Further examples include the way ink is absorbed into the fibers of paper or other surface it is deposited on. These subtle characteristics also aid in conveying the above listed properties. Because of these additional properties, emotion, personality, emphasis and so forth can be more instantaneously conveyed than with uniform line width between points.
Electronic ink (or ink) relates to the capture and display of electronic information captured when a user uses a stylus-based input device. Electronic ink refers to a sequence or any arbitrary collection of strokes, where each stroke is comprised of a sequence of points. The strokes may have been drawn or collected at the same time or may have been drawn or collected at independent times and locations and for independent reasons. The points may be represented using a variety of known techniques including Cartesian coordinates (X, Y), polar coordinates (r, Θ), and other techniques as known in the art. Electronic ink may include representations of properties of real ink including pressure, angle, speed, color, stylus size, and ink opacity. Electronic ink may further include other properties including the order of how ink was deposited on a page (a raster pattern of left to right then down for most western languages), a timestamp (indicating when the ink was deposited), indication of the author of the ink, and the originating device (at least one of an identification of a machine upon which the ink was drawn or an identification of the pen used to deposit the ink) among other information.
Among the characteristics described above, the temporal order of strokes and a stroke being a series of coordinates are primarily used. All these characteristics can be used as well.
Terms











Term
Definition







Ink
A sequence or set of strokes with properties.



A sequence of strokes may include strokes in



an ordered form. The sequence may be



ordered by the time captured or by where the



strokes appear on a page or in collaborative



situations by the author of the ink. Other



orders are possible. A set of strokes may



include sequences of strokes or unordered



strokes or any combination thereof. Further,



some properties may be unique to each stroke



or point in the stroke (for example, pressure,



speed, angle, and the like). These properties



may be stored at the stroke or point level, and



not at the ink level.


Ink object
A data structure storing ink with or without



properties.


Stroke
A sequence or set of captured points. For



example, when rendered, the sequence of



points may be connected with lines.



Alternatively, the stroke may be represented



as a point and a vector in the direction of the



next point. In short, a stroke is intended to



encompass any representation of points or



segments relating to ink, irrespective of the



underlying representation of points and/or



what connects the points.


Document
Any electronic file that has a viewable



representation and content. A document may



include a web page, a word processing



document, a note page or pad, a spreadsheet,



a visual presentation, a database record,



image files, and combinations thereof.


Tree of Context Nodes
A data structure that describes the



relationship between document elements that



have already been analyzed and document



elements that have yet to be analyzed. The



data structure may optionally further include



non-ink information (e.g., typed text, images,



charts, and the like). This non-ink



information may be used to aid in the



recognition parsing of the ink content.



Further, the non-ink content may be



annotated by the ink when an annotation



engine is used. Because new content is



availed to existing content, the existing



content provides a context for the new



information.


Render or Rendered or
The process of determining how information


Rendering
(including text, graphics, and/or electronic



ink) is to be displayed, whether on a screen,



printed, or output in some other manner.


Computer-readable
Any available media that can be accessed by


medium
a user on a computer system. By way of



example, and not limitation, “computer-



readable media” may include computer



storage media and communication media.



“Computer storage media” includes volatile



and nonvolatile, removable and non-



removable media implemented in any method



or technology for storage of information,



such as computer-readable instructions, data



structures, program modules or other data.



“Computer storage media” includes, but is



not limited to, RAM, ROM, EEPROM, flash



memory or other memory technology; CD-



ROM, digital versatile disks (DVD) or other



optical storage devices; magnetic cassettes,



magnetic tape, magnetic disk storage or other



magnetic storage devices; or any other



medium that can be used to store the desired



information and that can be accessed by a



computer. “Communication media” typically



embodies computer-readable instructions,



data structures, program modules or other



data in a modulated data signal, such as a



carrier wave or other transport mechanism,



and includes any information delivery media.



The term “modulated data signal” means a



signal that has one or more of its



characteristics set or changed in such a



manner as to encode information in the



signal. By way of example, and not



limitation, communication media includes



wired media, such as a wired network or



direct-wired connection, and wireless media,



such as acoustic, RF, infrared and other



wireless media. Combinations of any of the



above should also be included within the



scope of “computer-readable media.”









General-Purpose Computing Environment

FIG. 1 illustrates an example of a suitable computing system environment 100 on which the invention may be implemented. The computing system environment 100 is only one example of a suitable computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Neither should the computing environment 100 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the exemplary operating environment 100.
The invention is operational with numerous other general purpose or special purpose computing system environments or configurations. Examples of well known computing systems, environments, and/or configurations that may be suitable for use with the invention include, but are not limited to, personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.
The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc., that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
With reference to FIG. 1, an exemplary system for implementing the invention includes a general purpose computing device in the form of a computer 110. Components of computer 110 may include, but are not limited to, a processing unit 120, a system memory 130, and a system bus 121 that couples various system components including the system memory to the processing unit 120. The system bus 121 may be any of several types of bus structures including a memory bus or memory controller, a peripheral bus, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, Micro Channel Architecture (MCA) bus, Enhanced ISA (EISA) bus, Video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus also known as Mezzanine bus.
Computer 110 typically includes a variety of computer readable media. Computer readable media can be any available media that can be accessed by computer 110 and includes both volatile and nonvolatile media, removable and non-removable media. By way of example, and not limitation, computer readable media may comprise computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, and removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can accessed by computer 110. Communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media. The term “modulated data signal” means a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media includes wired media such as a wired network or direct-wired connection, and wireless media such as acoustic, RF, infrared and other wireless media. Combinations of the any of the above should also be included within the scope of computer readable media.
The system memory 130 includes computer storage media in the form of volatile and/or nonvolatile memory such as read only memory (ROM) 131 and random access memory (RAM) 132. A basic input/output system 133 (BIOS), containing the basic routines that help to transfer information between elements within computer 110, such as during start-up, is typically stored in ROM 131. RAM 132 typically contains data and/or program modules that are immediately accessible to and/or presently being operated on by processing unit 120. By way of example, and not limitation, FIG. 1 illustrates operating system 134, application programs 135, other program modules 136, and program data 137.
The computer 110 may also include other removable/non-removable, volatile/nonvolatile computer storage media. By way of example only, FIG. 1 illustrates a hard disk drive 141 that reads from or writes to non-removable, nonvolatile magnetic media, a magnetic disk drive 151 that reads from or writes to a removable, nonvolatile magnetic disk 152, and an optical disk drive 155 that reads from or writes to a removable, nonvolatile optical disk 156 such as a CD ROM or other optical media. Other removable/non-removable, volatile/nonvolatile computer storage media that can be used in the exemplary operating environment include, but are not limited to, magnetic tape cassettes, flash memory cards, digital versatile disks, digital video tape, solid state RAM, solid state ROM, and the like. The hard disk drive 141 is typically connected to the system bus 121 through a non-removable memory interface such as interface 140, and magnetic disk drive 151 and optical disk drive 155 are typically connected to the system bus 121 by a removable memory interface, such as interface 150.
The drives and their associated computer storage media discussed above and illustrated in FIG. 1, provide storage of computer readable instructions, data structures, program modules and other data for the computer 110. In FIG. 1, for example, hard disk drive 141 is illustrated as storing operating system 144, application programs 145, other program modules 146, and program data 147. Note that these components can either be the same as or different from operating system 134, application programs 135, other program modules 136, and program data 137. Operating system 144, application programs 145, other program modules 146, and program data 147 are given different numbers here to illustrate that, at a minimum, they are different copies. A user may enter commands and information into the computer 20 through input devices such as a keyboard 162 and pointing device 161, commonly referred to as a mouse, trackball or touch pad. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are often connected to the processing unit 120 through a user input interface 160 that is coupled to the system bus, but may be connected by other interface and bus structures, such as a parallel port, game port or a universal serial bus (USB). A monitor 191 or other type of display device is also connected to the system bus 121 via an interface, such as a video interface 190. In addition to the monitor, computers may also include other peripheral output devices such as speakers 197 and printer 196, which may be connected through an output peripheral interface 195.
The computer 110 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 180. The remote computer 180 may be a personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to the computer 110, although only a memory storage device 181 has been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 171 and a wide area network (WAN) 173, but may also include other networks. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.
When used in a LAN networking environment, the computer 110 is connected to the LAN 171 through a network interface or adapter 170. When used in a WAN networking environment, the computer 110 typically includes a modem 172 or other means for establishing communications over the WAN 173, such as the Internet. The modem 172, which may be internal or external, may be connected to the system bus 121 via the user input interface 160, or other appropriate mechanism. In a networked environment, program modules depicted relative to the computer 110, or portions thereof, may be stored in the remote memory storage device. By way of example, and not limitation, FIG. 1 illustrates remote application programs 185 as residing on memory device 181. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
In some aspects, a pen digitizer 165 and accompanying pen or stylus 166 are provided in order to digitally capture freehand input. Although a direct connection between the pen digitizer 165 and the user input interface 160 is shown, in practice, the pen digitizer 165 may be coupled to the processing unit 110 directly, parallel port or other interface and the system bus 130 by any technique including wirelessly. Also, the pen 166 may have a camera associated with it and a transceiver for wirelessly transmitting image information captured by the camera to an interface interacting with bus 130. Further, the pen may have other sensing systems in addition to or in place of the camera for determining strokes of electronic ink including accelerometers, magnetometers, and gyroscopes.
It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers can be used. The existence of any of various well-known protocols such as TCP/IP, Ethernet, FTP, HTTP and the like is presumed, and the system can be operated in a client-server configuration to permit a user to retrieve web pages from a web-based server. Any of various conventional web browsers can be used to display and manipulate data on web pages.
A programming interface (or more simply, interface) may be viewed as any mechanism, process, protocol for enabling one or more segment(s) of code to communicate with or access the functionality provided by one or more other segment(s) of code. Alternatively, a programming interface may be viewed as one or more mechanism(s), method(s), function call(s), module(s), object(s), etc. of a component of a system capable of communicative coupling to one or more mechanism(s), method(s), function call(s), module(s), etc. of other component(s). The term “segment of code” in the preceding sentence is intended to include one or more instructions or lines of code, and includes, e.g., code modules, objects, subroutines, functions, and so on, regardless of the terminology applied or whether the code segments are separately compiled, or whether the code segments are provided as source, intermediate, or object code, whether the code segments are utilized in a runtime system or process, or whether they are located on the same or different machines or distributed across multiple machines, or whether the functionality represented by the segments of code are implemented wholly in software, wholly in hardware, or a combination of hardware and software.
Notionally, a programming interface may be viewed generically, as shown in FIG. 1B or FIG. 1C. FIG. 1B illustrates an interface Interface1 as a conduit through which first and second code segments communicate. FIG. 1C illustrates an interface as comprising interface objects I1 and I2 (which may or may not be part of the first and second code segments), which enable first and second code segments of a system to communicate via medium M. In the view of FIG. 1C, one may consider interface objects I1 and I2 as separate interfaces of the same system and one may also consider that objects I1 and I2 plus medium M comprise the interface. Although FIGS. 1B and 1C show bi-directional flow and interfaces on each side of the flow, certain implementations may only have information flow in one direction (or no information flow as described below) or may only have an interface object on one side. By way of example, and not limitation, terms such as application programming interface (API), entry point, method, function, subroutine, remote procedure call, and component object model (COM) interface, are encompassed within the definition of programming interface.
Aspects of such a programming interface may include the method whereby the first code segment transmits information (where “information” is used in its broadest sense and includes data, commands, requests, etc.) to the second code segment; the method whereby the second code segment receives the information; and the structure, sequence, syntax, organization, schema, timing and content of the information. In this regard, the underlying transport medium itself may be unimportant to the operation of the interface, whether the medium be wired or wireless, or a combination of both, as long as the information is transported in the manner defined by the interface. In certain situations, information may not be passed in one or both directions in the conventional sense, as the information transfer may be either via another mechanism (e.g. information placed in a buffer, file, etc. separate from information flow between the code segments) or non-existent, as when one code segment simply accesses functionality performed by a second code segment. Any or all of these aspects may be important in a given situation, e.g., depending on whether the code segments are part of a system in a loosely coupled or tightly coupled configuration, and so this list should be considered illustrative and non-limiting.
This notion of a programming interface is known to those skilled in the art and is clear from the foregoing detailed description of the invention. There are, however, other ways to implement a programming interface, and, unless expressly excluded, these too are intended to be encompassed by the claims set forth at the end of this specification. Such other ways may appear to be more sophisticated or complex than the simplistic view of FIGS. 1B and 1C, but they nonetheless perform a similar function to accomplish the same overall result. We will now briefly describe some illustrative alternative implementations of a programming interface.
A. Factoring
A communication from one code segment to another may be accomplished indirectly by breaking the communication into multiple discrete communications. This is depicted schematically in FIGS. 1D and 1E. As shown, some interfaces can be described in terms of divisible sets of functionality. Thus, the interface functionality of FIGS. 1B and 1C may be factored to achieve the same result, just as one may mathematically provide 24, or 2 times 2 times 3 times 2. Accordingly, as illustrated in FIG. 1D, the function provided by interface Interface1 may be subdivided to convert the communications of the interface into multiple interfaces Interface1A, Interface1B, Interface1C, etc. while achieving the same result. As illustrated in FIG. 1E, the function provided by interface I1 may be subdivided into multiple interfaces I1a, I1b, I1c, etc. while achieving the same result. Similarly, interface I2 of the second code segment which receives information from the first code segment may be factored into multiple interfaces I2a, I2b, I2c, etc. When factoring, the number of interfaces included with the 1st code segment need not match the number of interfaces included with the 2nd code segment. In either of the cases of FIGS. 1D and 1E, the functional spirit of interfaces Interface1 and I1 remain the same as with FIGS. 1B and 1C, respectively. The factoring of interfaces may also follow associative, commutative, and other mathematical properties such that the factoring may be difficult to recognize. For instance, ordering of operations may be unimportant, and consequently, a function carried out by an interface may be carried out well in advance of reaching the interface, by another piece of code or interface, or performed by a separate component of the system. Moreover, one of ordinary skill in the programming arts can appreciate that there are a variety of ways of making different function calls that achieve the same result.
B. Redefinition
In some cases, it may be possible to ignore, add or redefine certain aspects (e.g., parameters) of a programming interface while still accomplishing the intended result. This is illustrated in FIGS. 1F and 1G. For example, assume interface Interface1 of FIG. 1B includes a function call Square (input, precision, output), a call that includes three parameters, input, precision and output, and which is issued from the 1st Code Segment to the 2nd Code Segment. If the middle parameter precision is of no concern in a given scenario, as shown in FIG. 1F, it could just as well be ignored or even replaced with a meaningless (in this situation) parameter. One may also add an additional parameter of no concern. In either event, the functionality of square can be achieved, so long as output is returned after input is squared by the second code segment. Precision may very well be a meaningful parameter to some downstream or other portion of the computing system; however, once it is recognized that precision is not necessary for the narrow purpose of calculating the square, it may be replaced or ignored. For example, instead of passing a valid precision value, a meaningless value such as a birth date could be passed without adversely affecting the result. Similarly, as shown in FIG. 1G, interface I1 is replaced by interface I1′, redefined to ignore or add parameters to the interface. Interface I2 may similarly be redefined as interface I2′, redefined to ignore unnecessary parameters, or parameters that may be processed elsewhere. The point here is that in some cases a programming interface may include aspects, such as parameters, which are not needed for some purpose, and so they may be ignored or redefined, or processed elsewhere for other purposes.
C. Inline Coding
It may also be feasible to merge some or all of the functionality of two separate code modules such that the “interface” between them changes form. For example, the functionality of FIGS. 1B and 1C may be converted to the functionality of FIGS. 1H and 1I, respectively. In FIG. 1H, the previous 1st and 2nd Code Segments of FIG. 1B are merged into a module containing both of them. In this case, the code segments may still be communicating with each other but the interface may be adapted to a form which is more suitable to the single module. Thus, for example, formal Call and Return statements may no longer be necessary, but similar processing or response(s) pursuant to interface Interface1 may still be in effect. Similarly, shown in FIG. 1I, part (or all) of interface I2 from FIG. 1C may be written inline into interface I1 to form interface I1′′. As illustrated, interface I2 is divided into I2a and I2b, and interface portion I2a has been coded in-line with interface I1 to form interface I1′′. For a concrete example, consider that the interface I1 from FIG. 1C performs a function call square (input, output), which is received by interface I2, which after processing the value passed with input (to calculate the square of an input) by the second code segment, passes back the squared result with output. In such a case, the processing performed by the second code segment (squaring input) can be performed by the first code segment without a call to the interface.
D. Divorce
A communication from one code segment to another may be accomplished indirectly by breaking the communication into multiple discrete communications. This is depicted schematically in FIGS. 1J and 1K. As shown in FIG. 1J, one or more piece(s) of code (Divorce Interface(s), since they divorce functionality and/or interface functions from the original interface) are provided to convert the communications on the first interface, Interface1, to conform them to a different interface, in this case interfaces Interface2A, Interface2B and Interface2C. This might be done, e.g., where there is an installed base of applications designed to communicate with, say, an operating system in accordance with an Interface1 protocol, but then the operating system is changed to use a different interface, in this case interfaces Interface2A, Interface2B and Interface2C. The point is that the original interface used by the 2nd Code Segment is changed such that it is no longer compatible with the interface used by the 1st Code Segment, and so an intermediary is used to make the old and new interfaces compatible. Similarly, as shown in FIG. 1K, a third code segment can be introduced with divorce interface DI1 to receive the communications from interface I1 and with divorce interface DI2 to transmit the interface functionality to, for example, interfaces I2a and I2b, redesigned to work with DI2, but to provide the same functional result. Similarly, DI1 and DI2 may work together to translate the functionality of interfaces I1 and I2 of FIG. 1C to a new operating system, while providing the same or similar functional result.
E. Rewriting
Yet another possible variant is to dynamically rewrite the code to replace the interface functionality with something else but which achieves the same overall result. For example, there may be a system in which a code segment presented in an intermediate language (e.g. Microsoft IL, Java ByteCode, etc.) is provided to a Just-in-Time (JIT) compiler or interpreter in an execution environment (such as that provided by the .Net framework, the Java runtime environment, or other similar runtime type environments). The JIT compiler may be written so as to dynamically convert the communications from the 1st Code Segment to the 2nd Code Segment, i.e., to conform them to a different interface as may be required by the 2nd Code Segment (either the original or a different 2nd Code Segment). This is depicted in FIGS. 1L and 1M. As can be seen in FIG. 1L, this approach is similar to the Divorce scenario described above. It might be done, e.g., where an installed base of applications are designed to communicate with an operating system in accordance with an Interface1 protocol, but then the operating system is changed to use a different interface. The JIT Compiler could be used to conform the communications on the fly from the installed-base applications to the new interface of the operating system. As depicted in FIG. 1M, this approach of dynamically rewriting the interface(s) may be applied to dynamically factor, or otherwise alter the interface(s) as well.
It is also noted that the above-described scenarios for achieving the same or similar result as an interface via alternative embodiments may also be combined in various ways, serially and/or in parallel, or with other intervening code. Thus, the alternative embodiments presented above are not mutually exclusive and may be mixed, matched and combined to produce the same or equivalent scenarios to the generic scenarios presented in FIGS. 1B and 1C. It is also noted that, as with most programming constructs, there are other similar ways of achieving the same or similar functionality of an interface which may not be described herein, but nonetheless are represented by the spirit and scope of the invention, i.e., it is noted that it is at least partly the functionality represented by, and the advantageous results enabled by, an interface that underlie the value of an interface.
FIG. 2 illustrates an illustrative tablet PC 201 that can be used in accordance with various aspects of the present invention. Any or all of the features, subsystems, and functions in the system of FIG. 1 can be included in the computer of FIG. 2. Tablet PC 201 includes a large display surface 202, e.g., a digitizing flat panel display, preferably, a liquid crystal display (LCD) screen, on which a plurality of windows 203 is displayed. Using stylus 204, a user can select, highlight, and/or write on the digitizing display surface 202. Examples of suitable digitizing display surfaces 202 include electromagnetic pen digitizers, such as Mutoh or Wacom pen digitizers. Other types of pen digitizers, e.g., optical digitizers, may also be used. Tablet PC 201 interprets gestures made using stylus 204 in order to manipulate data, enter text, create drawings, and/or execute conventional computer application tasks such as spreadsheets, word processing programs, and the like.
The stylus 204 may be equipped with one or more buttons or other features to augment its selection capabilities. In one embodiment, the stylus 204 could be implemented as a “pencil” or “pen”, in which one end constitutes a writing portion and the other end constitutes an “eraser” end, and which, when moved across the display, indicates portions of the display are to be erased. Other types of input devices, such as a mouse, trackball, or the like could be used. Additionally, a user's own finger could be the stylus 204 and used for selecting or indicating portions of the displayed image on a touch-sensitive or proximity-sensitive display. Consequently, the term “user input device”, as used herein, is intended to have a broad definition and encompasses many variations on well-known input devices such as stylus 204. Region 205 shows a feedback region or contact region permitting the user to determine where the stylus 204 as contacted the display surface 202.
In various embodiments, the system provides an ink platform as a set of COM (component object model) services that an application can use to capture, manipulate, and store ink. One service enables an application to read and write ink using the disclosed representations of ink. The ink platform may also include a mark-up language including a language like the extensible markup language (XML). Further, the system may use DCOM as another implementation. Yet further implementations may be used including the Win32 programming model and the .Net programming model from Microsoft Corporation.
Representation of Alternates
FIG. 3 shows electronic ink that is parsed and represented as a tree in FIG. 4. The electronic ink of FIG. 3 is the phrase “hello, this is a test”, with the five words of the phrase represented by labels A-E. The word “hello,” A includes two strokes 301 and 311. The word “this” B includes three strokes 302-304. The word “is” C includes two strokes 305-306. The word “a” D includes one-stroke 307. The word “test” E includes strokes 308-309. The phrase occupies two lines F (“hello, this is”) and G (“a test”). These lines together form paragraph H.
FIG. 4 represents a parsing of the electronic ink from FIG. 3. Root node 401 has a paragraph node H stemming from it. Paragraph node H includes line nodes F and G. Line node F includes word nodes A-C. Line node G includes word nodes D and E. each word node includes the strokes as described in FIG. 3. Each node A-H may be referred to as a context node. Each context node provides context for the other nodes for analysis, recognition, or other purposes. For instance, recognition of the strokes in node B may have one collection of results when the strokes are analyzed individually or with respect to all strokes of node B. However, the recognition results or ordering of the results may be different when an analysis of the strokes in node B includes an analysis (or previous analysis results) of the strokes from nodes A and C. Likewise, the recognition results may improve with the greater number of context nodes D-H that are included in the analysis of node B.
It is appreciated that various nodes may be used in addition (or replacing those above) including a sentence node (that contains an entire sentence), a list node (that contains a list), and a list item node (that contains an element of a list).
FIG. 5 represents a lattice with alternates derived from the tree of FIG. 4. The lattice is a representation of a tree from a node level. For instance, the lattice may represent the tree from the line node level, from the word node level, from the paragraph node level and the like. In FIG. 5, a lattice exists for each line node. Each lattice includes columns (referred to as lattice columns). The columns represent the words associated with each line node (with each alternate referred to as a lattice element in the lattice column). Also, place holding columns (also referred to as spacing or null columns) may be placed between the words so as to help define relationships between the words.
The lattice at F includes five columns. Each column includes alternates that represent alternate recognition results from a recognition engine. Column F0 represents the word “hello,” as appearing in FIG. 3. Here, “hello” may be referred to as the top alternate. The lattice column includes reference to the strokes that make up the word (here, strokes S301 and S311). The lattice column F0 also includes additional alternates (here, “hellos” and “hello.”). Lattice column F2 references strokes S302-S306 and includes entries for “this” and alternates “thesis” and “This”. Lattice column F4 references strokes S305 and S306 and includes entries for “is” and alternate “i5”. Lattice columns F1 and F3 are separator (or spacer) columns. The lattice at G includes three columns. Lattice column G0 references strokes S307-S310 and includes “a” and alternates {an, or, aw, An, attest, detest}. Lattice column G2 references strokes S308-S310 and includes recognition result “test” and no alternates. Lattice column G1 is a separator column.
A tree structure may contain one or more lattices. With respect to FIG. 5, the lattice at F and the lattice at G may be combined together into a larger lattice. The lattice as a combination of the lattice at F and the lattice at G may include a total of nine columns, with the ninth column being a separator column between the lattice at F and the lattice at G. Specifically, this new separator column may be added as separator column F5. Likewise, one may separate lattices into smaller lattices. The separate lattices may be sent individually or in a group to a recognizer or queried for information. If a separator column starts or ends a smaller lattice, the separator column may be removed so that columns with content remain. Of course, separator columns may remain as an alternative approach.
The recognition results and alternates stored in each lattice column may be referred to as lattice elements. Each lattice element may include a designation of how many strokes were used to produce a recognition results. For instance, the second entry in lattice column F0 “hellos” includes a designation (here, “2”) that represents how many strokes were used to form the recognition result. For column F2, the recognition result “this” used three strokes to form this result. However, the recognition result “thesis” used five strokes to form this result. Next, each lattice element includes a pointer to the next column. Here, the lattice elements of column F0 point to column F1. Similarly, the “this” lattice element of column F2 points to column F3 has the next column. However, the “thesis” lattice element of column F2 points to no existing column (here, represented as column 5). Of course, the pointer of each lattice element to a nonexistent column may instead be a pointer to a predetermined column that represents the end of a lattice.
A designation of lattice elements among the columns may be referred to as a lattice path. The lattice path indicates a particular alternate recognition value (e.g., a storing a particular interpretation of ink).
The lattice arrangement supports a representation of operations on selection across multiple words. FIG. 6 shows an example where a user has selected the words in line F. the resulting selection may be represented as a selection lattice (namely, a collection of selected nodes in the lattice). Here, the selection lattice includes columns F0-F4. FIG. 7 shows an alternate selection of words from two lines. Here, the selection includes {this is test} and the resulting selection lattice may include columns F2, F3, F4, G1, and G2. Separator column G1 may or may not be added in automatically to properly space columns F4 and G2 from each other.
The lattices of FIG. 5 was created based on the line level nodes of FIG. 4. Lattices may be formed at any of the levels of FIG. 4. FIG. 8 shows a lattice corresponding to paragraph node H. Here, a total of nine columns are shown. The lattice columns represent the word nodes of FIG. 4 and their alternates. The lattice of FIG. 9 shows a lattice corresponding to word node A.
FIG. 8 may or may not include separator column H8 that separates the two lines. This is because in some languages a separator string is not used between lines. For instance, in character-based languages (e.g., Chinese), spaces may not be used. In these situations, an empty character may be used in place of the separator column. A recognizer may provide the separator column or empty character as needed. For instance, in an ink sentence with English words followed by Japanese characters followed by more English words, one may parse and direct the various portions to appropriate recognizers (for instance, by identifying the ink with a language or recognizer). The English recognizer may return alternates bounded by separator spaces. The Japanese recognizer may return alternates bounded by empty characters. The outputs may be merged so as to produce a single lattice with the combination of separator columns and empty characters separating the results from different recognizers. Of course, using recognizers that produce the same type of separating space/empty character (for instance, English and French recognizers) may result in only one separating space/empty character being stored, not two, as the same type of linguistic pattern is used.
Further, the separating spaces/empty characters are not required to be directional as in left and right. Rather, their location is dictated by the direction of the language used (horizontal rastering, vertical rastering, and other direct ions).
Objects and Object Relationships
This section and the following section (Application Programming Interfaces) describe the objects, their relationships between each other, and interface for interacting with the various models.
Various relationships exist between the lattice objects described above. FIG. 10 shows illustrative examples of these relationships. Some, all, or additional information may be included in each object described below.
Lattice 1001 is an object that may be created by a parser or recognizer. The lattice may be serialized so as to be easily accessed from a single node. One may access the entire lattice by requesting the lattice from the given node. One may obtain recognition data at different levels within the lattice by requesting information from the lattice object. One may create a lattice at any node by merging or splitting existing lattices. The lattice returned for a node may only reference strokes found under that node. To see all recognition data in a tree in a single lattice, one may request a lattice associated with a root node of a tree.
The lattice 1001 may include:

    
    
        an indication of whether separators are present and optionally their identifications (the separators may be used when merging one lattice with another lattice. Merging lattices with separators may depend on the language—for instance, in English words are separated by a space but in Japanese, spaces do not need to be used);
        a list of lattice columns (or a pointer to the first column);
        a context node (that indicates where in a document lattice 1001 exists);
        a property collection;
        a lattice path top alternate;
        strokes contained within the lattice, identifying a stroke by its identification value (or an index value of the stroke), or both; and
        the size of the lattice.
    
    


Separators (left and right, up and down, and others) may be stored as part of a column or as disconnected columns within the lattice. These left and right separators generally only have a single element with the string data for the separator. These left and right separators are marked as the top alternate for these columns. However, they are not returned as an alternate when requesting alternates from the lattice. This allows for easier merging of alternates in the lattice. Alternatively, these separator columns may be returned or removed as needed.
Various methods may be performed on the lattice. These include:

    
    
        requesting the strokes associated with the lattice;
        requesting that the segmentation of the tree be updated based on interaction with the lattice (for instance, combining words);
        requesting the lattice be serialized into a persistable format
        requesting the left or right separators; and
        requesting the columns associated with specified strokes.
    
    


Lattice column 1004 is a column in the lattice. The lattice column generally corresponds to the segmentations in the lattice. Alternates are referenced by storing a pointer to the various lattice elements in each column. If the lattice element is the top alternate, then the column will reference the lattice element as the top alternate.
The lattice column may include:

    
    
        an identification of strokes in the lattice column;
        lattice elements contained within each column;
        a top alternate element of the alternates within each column;
        a property collection; and
        a reference to the parent lattice.
    
    


The following methods may be performed on the lattice column:

    
    
        requesting the strokes associated with the lattice column;
        requesting the lattice associated with a lattice column;
        requesting the elements associated with a lattice column; and
        requesting or designating the top alternate element for the lattice column.
    
    


Lattice element 1005 may reside in each column. The lattice element is a portion of a lattice path. The lattice element stores the string data associated with a stroke or word. Strokes associated with a lattice element are generally taken from the beginning of the list of strokes associated with a lattice column. This allows another lattice column to contain a subset of strokes and have separate lattice elements associated with the subset. A lattice element may be designated by the lattice column as the top alternate for the column.
The lattice element may include:

    
    
        a stroke count;
        the data or string associated with the lattice element;
        a reference to the lattice column that contains the lattice element;
        a reference to a previous lattice column;
        a reference to the next lattice column;
        a property collection; and
        a recognition confidence level indicating how confident a recognition result is from a recognition engine.
    
    


Methods operable on the lattice element may include:

    
    
        requesting the strokes associated with a lattice element;
        requesting the parent lattice column for a current lattice column;
        requesting a recognition confidence score associated with the lattice element (namely, how confident is a recognizer that ink was properly recognized);
        requesting a next lattice column;
        requesting a previous lattice column; and
        requesting the recognized string data from the lattice element.
    
    


Lattice path 1002 is a path through the lattice columns and includes a collection of lattice elements across multiple lattices. The lattice path may include:

    
    
        a collection of lattice elements that make up the lattice path;
        an indication whether the path extends over a single lattice;
        strokes associated with the lattice path;
        the recognition data or string associated with the lattice path; and
        a recognition confidence level indicating how confident a recognition result is from a recognition engine.
    
    


The following methods may be performed with the lattice path:

    
    
        determine whether the lattice path extends beyond a single lattice;
        request a collection of lattice elements;
        requesting strokes associated with the lattice path;
        request text based on a collection of strokes;
        request information to be pushed to a specified string;
        request strokes corresponding to a text range;
        request strokes corresponding to nodes;
        request a text range corresponding to strokes; and
        a recognition confidence level indicating how confident a recognition result is from a recognition engine.
    
    


Selection lattice 1003 is a logical entity that acts like a lattice but need not correspond to a single node. If the lattice object is stored at the line level, one can create a selection lattice object for some of the words on a single line, some strokes on one or more lines, all of the words on a single line, or some words from multiple lines, and the like. The selection lattice stores a list of lattice columns, which do not have to be from the same lattice object. Selection of a stroke may be expanded to include the ink word or segment referencing the selected ink. When two lattice objects are merged together into a selection lattice object, the right and left separator columns may be inserted as appropriate into the list of columns. The selection lattice object may include:

    
    
        a lattice column or columns that comprise the selection lattice;
        the lattice or lattices spanned by the selection lattice; and
        the top alternate for each column in the selection lattice.
    
    


The selection lattice object may support the following methods:

    
    
        request the top alternate based on the lattice path; and
        request lattice columns associated with the selection lattice;
    
    


Alternate Collection 1006 is an object that references the selection lattice. The alternate collection may include:

    
    
        a selection lattice.
    
    


The following provides a sample of methods that may be useable with an alternate collection. Other methods are described below in the following sections:

    
    
        request alternates from a lattice path; and
        request alternates for a context node.
    
    


The various objects may have methods associated with them as well. These methods may be called by an application programming interface (API). The following classes may be used to better handle information in a tree.
First, a method may be used to obtain alternates from an ink analysis engine. A first method on the ink analysis object includes a “get alternate” method which returns a collection of alternative objects for the entire tree, specified nodes, or specified strokes. Here, this method requests context nodes referencing supplied nodes. So, for instance, one may request alternates from a given line node. The system will respond with the collection of alternates, or at least a top-level alternate, for the given node.
A new class of objects (an analysis alternate class) may be provided. A method operable on the analysis alternate class may return a text recognition confidence level. Here, one may determine the level of confidence data in a lattice element. Also, another method operable on the analysis alternate class includes a “get recognized string” method. Here, this method obtains a recognition result associated with the lattice elements in this alternate's lattice path.
Second, an analysis alternate collection class of objects may also be used. This class includes a number of methods including a “get this analysis alternate”, which may be the result of a returned value in the “get alternates” method on the ink analyzer above.
The following methods may be used with an analysis context tree. First, a “get alternates” method may be applied to the analysis alternate collection. This method may include a specification of the context nodes for which alternates are sought. Second, another “get alternates” method may be applied to the analysis alternate collection, but here the maximum number of alternates may also be specified. For instance, referring to lattice column G0 of FIG. 5, one may request a few alternates as compared to the entire alternate collection associated with the lattice column.
A third “get alternates” method may request alternates for specified strokes to be and alternates for specified strokes to be returned.
Another method may include a “modify top alternate” method in which one may modify which alternate should be specified as the top alternate. For instance, if the user selected one alternate over another, the selected alternate may be considered the top alternate for future selections. Yet another method may include a “modify top alternate” method that automatically confirms the alternate selection so that it remains as the top alternate while other ink analyses occur around it. For instance, a user may select a new top alternate. The new top alternate may have a different segmentation of the tree. This new segmentation is taken as the preferred segmentation of the tree based on the selection of this alternate. The preferred segmentation alters the shape of the tree by altering the grouping of strokes and/or words. In this regard, each selection of a new alternate may ripple into a completely new tree.
Alternates may be obtained by passing nodes or strokes to the analysis context. These strokes need not be from contiguous portions of the context tree (see, for instance, FIG. 7 above). The ink analyzer object may return an array of leaf context nodes where the strokes in the nodes match the strokes or nodes passed via the GetAlternates( ) method. From these leaf nodes, the client can move its focus as it obtains parent or children nodes or strokes to explore the complete tree structure as if these nodes were in the top alternate.
A lattice alternate is a collection of string data for words and the strokes corresponding to those words, along with properties (recognition confidence, etc.). The leaf nodes may be created one per word. To create parent nodes, one may consider multiple leaf nodes that may or may not stem from the same stroke collection. Non-leaf nodes may be further applied as alternates.
Application Programming Interfaces
Various application programming interfaces may be used with aspects of the invention. The following lists application programming interfaces and their functions.
The analysis context may be a root node in a tree. A set of methods directed to analyzing the ink in the analysis context may be exposed. The analysis context is the root node in the context trees described herein. The ink analyzer object that relates to the analysis context may expose at least two sets of methods.
First, a “get alternates” set of methods may be exposed. Here, the “get alternates” set may include a variety of definitions of which four are described here. GetAlternates(Context Node [ ] nodes) requests alternates from a context node or nodes (for instance, line, word, paragraph, or other nodes) and specifies the nodes for which the alternates are to be obtained. For example, as applied to FIG. 5, GetAlternates applied to node A would return the collection of “hello,”, “hellos”, and “hello.” GetAlternates may also be applied based on specification of one or more strokes. For instance, GetAlternates applied to strokes S302-S304 may return the collection of “this”, “thesis”, and “This”. The text returned may or may not include additional strokes. In the instance of “thesis”, additional strokes S305-S306 may also be used.
The GetAlternates method may or may not include an indication of the maximum number of alternates to be returned. So, if the maximum number of alternates was set to two, then GetAlternates(node A) would return “hello,” and “hellos”. but not “hello.”.
Further, if no context node or stroke is specified, GetAlternates may return alternates for the entire analysis context.
Second, another method may include Modify Top Alternate. Here, the modify top alternate represents what the analysis context will look like if a selected alternate is applied. In the example of FIG. 5, if the alternate “thesis” is chosen, then the result from modify top alternate may include “hello, thesis a test”. For each alternate returned in GetAlternates above, a different yet fully complete analysis context tree may be viewed. The get alternates and modify top alternates are views into the lattice described above. Further, modify top alternates can also modify the tree structure to match the segmentation of the newly selected alternate.
The alternate modification may include the ability to specify whether the alternate selection should prevent future analysis from replacing the current selection of an alternate. This specification may be, for instance, a Boolean argument specified in the call to the “modify top alternate” method as confirmation that the top alternate should be replaced.
Each alternate object returned from get alternates may reference an array of leaf context nodes for the set of strokes or nodes passed into the get alternates method. Using the get alternates method and other methods for obtaining strokes and nodes, a user may obtain parent and child nodes and strokes and evaluate how the tree will look if an alternate is applied.
The alternate trees may be created ahead of time or may be dynamically created once requested by the get alternates method. One advantage of waiting until after one has requested the alternates is that this approach minimizes unneeded creation of unwanted trees. In this latter approach, once the alternate object is created, it may only reference the relevant leaf ContextNodes. If the tree is further explored by the user, (by asking for the parent of a leaf node), each parent node may be dynamically created as requested.
The following methods may be used with the ink analyzer object. These methods aid finding nodes and converting between context nodes and strokes. StrokesToContextNodes takes a collection of strokes and returns an array of context nodes that reference the stroke. In a first approach, each stroke may be referenced by only one node (while parent and grandparent nodes may in turn reference the one node). Here, only a top alternate references a stroke. In an alternative approach, the combination of alternates in a reference a single stroke. In particular, more than one context node may reference a stroke (for instance, strokes S305 and S306 may be referenced by lattice columns F2 and F4, corresponding to nodes B and C). In these cases, StrokesToContextNodes may return the context nodes that reference the stroke. In responding to a StrokesToContextNodes method, the set of returned context nodes may or may not include nodes that contain strokes outside of passed strokes.
Alternatively and optionally, in some cases, multiple nodes may include higher nodes (including paragraph nodes). This optional approach may be performed to provide a complete picture of the context nodes that reference supplied strokes.
For instance, in FIG. 5, one may request nodes associated with strokes then all strokes associated with the returned nodes. If one started with stroke S301, the result may include strokes S301 and S311. Likewise, if one started with strokes S301 and S306, the result may yield strokes S301, S311, S305, and S306.
The next method, ContextNodesToStrokes passes context nodes and returns a collection of strokes contained in the referenced context nodes. Word, line, and paragraph, and root nodes may be passed with this method. Other types of nodes may be included as well including music notation nodes, math nodes, drawing nodes, picture nodes, chart nodes, and nodes that define a writing region, an alignment level, and the like.
With respect to the analysis alternate class, three methods may be associated with the class. First, RecognitionConfidence allows one to retrieve the confidence of a recognizer with a result. Second, RecognizedString specifies the string value of an alternate. Using RecognizedString, one may request values of alternates associated with nodes without having to incrementally traverse the context nodes as described above. Third, GetProperty allows one to obtain any properties set on the lattice object by a recognizer of an object in the analysis alternate class (for instance, a recognition confidence). Here, one may specify a GUID or other identifying information and obtain the value of the property.
Two methods may be used to obtain information related to text ranges. First, a GetNodesFromTextRange allows one to obtain specific context nodes based on a text range. The text range may be the start and stop positions, the start and length information, or other representations of text ranges. Using the ink in FIG. 3 and the lattice at F in FIG. 4, one can map between a text range (7, 4) to obtain strokes 302,303,304. Where 7 means skip over the first 6 characters “hello,” and 4 means take the next 4 characters. (716) would yield 302-306. The system may prevent the splitting of a word from the recognizer, so (0,1), (0,2), (0,3), (0,4), (0,5), and (0,6) will all yield s301, s311.
The second method GetTextRangeFromNodes allows one to obtain specific text ranges from supplied context nodes. From the supplied context nodes, one may receive start and stop positions, the start and length information, or other representations of text ranges. This method may expand a set of strokes to ensure that only complete words are included.
The context node objects may be the same. Alternatively, they may be different based on what node they reference. For instance, word and line-specific context nodes may have additional properties including values associate with strokes (for instance information relating to ascender, descender, midline, and baseline characteristics of the ink). The return values of these properties may include various points. For instance, a first point may describe the x,y coordinates of the start of the line. The second point may describe the x,y coordinates of the end point. The values may be calculated at the line level by using the start and end values of contained ink words or may be an average for the contained ink words. This may apply to line nodes, paragraph nodes, list nodes, and list item nodes, among others.
The system may support additional classes that relate to the status of an analysis of ink. For instance, the system may include an analysis status class. Here, an application may want to know if an analysis run was successful, without any errors. The results of the analysis operations may return an analysis status object that summarizes the state of the run. The object may include information regarding the success of the analysis. For instance, the object may include a simple Boolean representing the success of the analysis (for instance, “true” if the analysis run did not have any warnings or errors). If the run was not successful, the object may include a list of warnings and the impact of the warnings. The object may include a list of regions changed by the analysis.
Lattice Creation
FIG. 11 shows various processes for creation of a lattice. In step 1101, the system receives ink. The ink may be received from storage (local or remote) or a user entering information on digitizer. Next, in step 1102, the system may parse the ink. The result from the parsing of the ink is tree 1103. Optionally, as shown by a broken path to lattice 1104, the system may create the lattice based on information from the parsed ink. After tree 1103 is created, the system in step 1105 may recognize the ink using a handwriting recognition engine. If lattice 1104 had been previously created, the system may update the lattice with alternates from the recognition step 1105. Alternatively, if not created above, lattice 1104 may be created after ink recognition step 1105.
EXAMPLES
The following relates to examples of providing alternates for ink information. FIGS. 12A-19 shows various examples of how alternates may be applied to an analysis context tree. FIG. 12A shows an analysis context tree with alternates. The ink information found in the analysis context tree is the phrase “Today is Monday”. The analysis context tree has a top node analysis context A, a paragraph node B, a line node C, and three ink word nodes D-F corresponding to the three ink words.
Here, the user has selected to word “Monday”. Calling one of the “get alternates” methods described above, the system returns several alternates. The first alternate, represented by F′, is “Monolog”. The second alternate, represented by F′′ is “Monolay”. If the user requests to see a line node associated with the ink word “Monolog”, the system generates the line node C′ as associated with “Monolog” F′ in FIG. 12B. If the user then asks for the children of line node C′, the system further expands the tree of alternate 1 to include ink words D′ and E′ and alternate line node C′ (same values, but parts of different trees) as shown in FIG. 12C. Furthermore, if a user asks the line node C′ for its parent, the paragraph node B′ may be dynamically included. If the user continues and asks for the parent of the paragraph node B′, the root node A′ may be included as shown in FIG. 12D.
As described with respect to FIGS. 12A-12D, the generation of trees based on alternates may be done only when requested by a user. Alternatively, the system may attempt to generate all alternate trees and store them within the lattice. One benefit of delaying the generation of alternate trees until actually requested by a user includes minimizing processing time consumed for the creation of non-relevant trees.
FIGS. 13A and 13B show the phrase “the quick brown fox” spread over two lines. Here, FIG. 13A includes analysis context A, paragraph B, line C with words E and F, and line D with words G and H. The selection includes the words “quick” F and “fox” H. FIG. 13B shows alternates 1 and 2 for the selected words. Here, alternate 1 includes alternates “brick” F′ for F and “box” H′ for H. Alternate 2 includes alternates “brick” F′′ and “lox” H′′.
FIG. 14 shows alternate segmentation modification. Using the analysis context tree has an analysis context A, paragraph B, line C, and ink words “the” D, “quick” E, “brown” F, and “fox” G. The selected words are “brown” F and “fox” G. Alternate 1 shows a new segmentation for ink words F and G. Here, the new ink word “Boonton” is represented as F′. Alternate 2 shows the original segmentation with alternates “browne” F′′ and “for” G′′.
FIG. 15 shows another example of segmentation and alternates. Here, the analysis context tree includes analysis context node A, paragraph node B, line node C, and ink word “together”. Alternate 1 shows ink word “together” D as separated into two words “Tog” D′ and “ether” E′. Alternate 2 shows ink words “To” D′′, “get” E′′, and “her” F′′. Because of the new alternates, line and paragraph nodes in alternate 1 are represented as C′ and B′, respectively, and in alternate 2 are represented as C′′ and B′′, respectively.
FIG. 16 shows an analysis context tree that includes alternates that include drawings as well as ink words. Parsing the phrase “O Canada”, the analysis context tree of FIG. 16 includes analysis context A, paragraph B, line C, ink word “O” D, and “Canada” E. Alternate 1 includes paragraph B′, line C′, and ink word “OCanada” D′. Alternate 2 includes a different analysis of ink word “O” D. Instead of considering it an ink word, one of the alternates created by the recognizer is the possibility that the “O” is a drawing (specifically recognized here as a circle) D′′. Here, alternate 2 includes paragraph B′′, line C′′, and ink word “Canada” E′′. It also includes drawing group F′′ with circle “O” D′′.
In some aspects of the present invention, the user may modify the lattice to precisely indicate what the recognition of a word should be. FIG. 17 shows handwritten ink including the phrase “Hi. How are you?” FIG. 18, shows a resulting set of analysis context trees in which the ink word “are” has been indicated by the user as properly recognized as the word “are”. The resulting set of analysis context trees may be separated into the precisely identified word (here, “are”) having its own context tree with other analysis context trees bracketing it.
FIG. 18 shows three analysis context trees. In the first analysis context tree, five nodes are shown include analysis context A, paragraph B, line C, ink word “Hi.”, and Ink word “How” E. An alternate is shown as alternate 1 having paragraph node B′, line C′, and an alternate recognition of all strokes used to form ink words D and E as “Hello” D′.
Next, FIG. 18 includes a second analysis context tree having analysis context F, paragraph G, line H, and ink word “are” I. Here, the user has precisely identified (or “pinned”) the ink word “are” I.
Finally, FIG. 18 includes a third analysis context tree having analysis context J, paragraph K, line L, and ink word “you?” M. Alternate 1 off of this analysis context tree includes paragraph K′, line L′, and ink word “yon” M′.
Alternatively, the three trees shown in FIG. 18 may be combined or remain as a single tree. For instance, if a user selects one alternate, that alternate may be fixed while the other alternates for other nodes may still be modified based on subsequent selections of alternates. Here, the nodes may remain as a single tree, as compared to separating the nodes into separate trees.
The present invention has been described in terms of preferred and exemplary embodiments thereof. Numerous other embodiments, modifications and variations within the scope and spirit of the appended claims will occur to persons of ordinary skill in the art from a review of this disclosure.

## Claims

1. A method for interacting with a tree structure that results from parsing electronic ink, said tree structure including information relating to said electronic ink comprising at least one of a paragraph node, line node, sentence node, word node, list node and list item node and also including alternate recognition results relating to the electronic ink, said method comprising the steps of:
sending a request to said tree structure to obtain alternate recognition results from said tree, said request specifying at least one of one or more nodes and one or more strokes in said tree structure; and
receiving said alternate recognition results from at least one of said one or more nodes, one or more strokes, or a collection of nodes or strokes that reference said at least one of one or more nodes and one or more strokes said tree structure.

2. The method according to claim 1, wherein said sending step includes an indication of the maximum number of alternate recognition results that are to be retrieved and wherein the number of alternate recognition results received is equal to or less than said number of alternate recognition results indicated.

3. The method according to claim 1, wherein said method permits a user to view more of said tree structure by requesting alternate recognition results of said nodes in said tree structure.

4. A method according to claim 1, wherein said method permits a user to walk up and down said tree structure by requesting alternate recognition results of nodes in said tree structure.

5. The method according to claim 1, wherein said request specifies strokes and said collection includes all nodes that reference said specified strokes.

6. The method according to claim 1, wherein said request specifies strokes and said collection includes only those nodes that reference all of said specified strokes.

7. The method according to claim 1, wherein said request specifies nodes and said collection includes all strokes that reference said specified nodes.

8. The method according to claim 1, wherein said request specifies nodes and said collection includes only those strokes that reference all of said specified nodes.

9. One or more computer-storage media having computer executable instructions embodied thereon for performing a method for interacting with a tree structure that results from parsing electronic ink, said tree structure including information relating to said electronic ink comprising at least one of a paragraph node, line node, sentence node, word node, list node and list item node and also including alternate recognition results relating to the electronic ink, said method comprising the steps of:
sending a request to said tree structure with a specification of an alternate recognition result; and
modifying said tree structure to set said specified alternate recognition result as a top alternate recognition result.

10. The media of claim 9, wherein said sending said request step further comprises:
sending an indication to said tree structure to keep said specified alternate recognition result as said top alternate recognition result despite subsequent modifications of said tree structure.

11. The media of claim 9, wherein said sending said request step further comprises:
preventing said specified alternate recognition result from subsequently being sent to a recognizer.

12. One or more computer-storage media having computer executable instructions embodied thereon for performing a method for interacting with a tree structure that results from parsing electronic ink, said tree structure including information relating to said electronic ink comprising at least one of a paragraph node, line node, sentence node, word node, list node and list item node and also including alternate recognition results relating to the electronic ink, said tree structure containing one or more lattices, wherein a lattice includes columns, each column including alternates that represent said alternate recognition results, said method comprising the steps of:
sending a request to said tree structure to obtain one or more alternate recognition results from said tree structure, said request specifying one or more context nodes;
receiving said one or more alternate recognition results from said one or more context nodes in said tree structure; and
creating dynamically alternate tree structures upon said request for alternate recognition results.