Method and system for semantically labeling strings and providing actions based on semantically labeled strings

Information

  • Patent Grant
  • 7770102
  • Patent Number
    7,770,102
  • Date Filed
    Tuesday, June 6, 2000
    24 years ago
  • Date Issued
    Tuesday, August 3, 2010
    14 years ago
Abstract
A method for recognizing strings and annotating, or labeling, the strings with a type label. After the strings are annotated with a type label, application program modules may use the type label to provide users with a choice of actions. If the user's computer does not have any actions associated with a type label, the user may be provided with the option to surf to a download Uniform Resource Locator (URL) and download action plug-ins for that type label. One or more recognizer plug-ins perform the recognition of particular strings in an electronic document. The recognizer plug-ins may be packaged with an application program module or they may be written by third parties to recognize particular strings that are of interest. One or more action plug-ins provide possible actions to be presented to the user based upon the type label associated with the string.
Description
TECHNICAL FIELD

This invention relates to document creation program modules. More particularly, this invention relates to a method and system for semantically labeling strings of text during creation of an electronic document and providing a selection of actions that may be performed based on the semantically labeled strings.


BACKGROUND OF THE INVENTION

Electronic documents such as word processing documents and spreadsheet documents typically include semantic information that would be helpful if the information was recognized as such. Recognition and use of this semantic information could result in increased interoperability between desktop software applications and other desktop applications and/or web-based applications.


The ability to recognize strings of text, such as in search engines, is well-known. Additionally, various information retrieval systems have capabilities to label documents. For example, the LEXIS-NEXIS service provides links in some of its documents for company names, famous people and stock ticker symbols.


However, none of the services described above allow strings of text to be labeled with semantic information on-the-fly, i.e., as a user is typing text into a document and creating a document. Thus, there is a need for a method and system for semantically labeling strings while a user is creating a document and providing user actions based on the type of semantic label applied to the string.


In addition to the need described above, there are other needs associated with electronic document program modules such as word processing program modules and spreadsheet program modules. There is the need for tighter integration between electronic document program modules and personal information manager program modules. For example, a user often wants to insert an address stored in a contacts folder of a personal information manager into a word processing document, such as when writing a letter. This insertion may be time-consuming. Typically, the insertion requires the user to switch from a word processing program module to the personal information manager program module, open the contacts folder, find the appropriate person in the contacts folder, copy the address from the contacts folder, switch back to the word processing program module and paste the address into the document at the appropriate place. Thus, there is a need for a tighter integration between information stored in personal information manager program modules and information needed by electronic document program modules.


There is also the need for tighter integration between web properties and the content of electronic documents. For example, sales people sometimes need directions to a client's site. The address of the client's site may be included in an e-mail message or electronic document. However, getting directions to the client's site via an Internet mapping service requires navigating to a website, entering the elements of the address into the appropriate search fields (e.g. street address, city, state, zip) and executing a search for the correct map. Thus, there is the need for tighter integration between web properties and the content of electronic documents.


There is also the need for integration between information on an Intranet and the content of electronic documents because different organizations have different types of data they deem important. Certain industries, services and professions may have words which are commonly found in documents. For instance, in drug companies, chemical names are extremely important and there's likely to be a myriad of information about a particular chemical name on a drug company's Intranet. For car companies, the important data might be model names or part numbers. For universities, the important data might be names of professors, students or courses. The prior art services do not allow customization of strings that may be recognized. None of the prior art services allow third parties to provide a recognition program module so that these customized words may be recognized and an action program module so that appropriate actions may be taken based upon these recognized words. Thus, there is the need for integration between important data on an Intranet and the content of electronic documents.


Thus, there is a need for a method and system for semantically labeling strings while a user is creating a document and providing user actions based on the type of semantic label. There is a further need for a tighter integration between information stored in personal information manager program modules and information needed by other program modules. There is also the need for tighter integration between web properties and the content of electronic documents. There is the further need for integration between important data on an Intranet and the content of electronic documents.


SUMMARY OF THE INVENTION

The present invention satisfies the above described needs by providing a method and system for semantically labeling strings of text during creation of an electronic document and providing a selection of actions that may be performed based on the semantically labeled strings.


In one aspect, the present invention provides a computer-implemented method for semantically labeling strings during creation of an electronic document. When an application program module receives a new string, such as when the user enters a new paragraph or cell value into an electronic document or edits a previously entered paragraph, the paragraph containing the new string is passed from the application program module to a recognizer DLL. The recognizer DLL is responsible for communicating with the application program module, managing the jobs that need to be performed by the recognizer plug-ins, receiving results from the recognizer plug-ins and sending semantic category information to the application program module.


During idle time, the paragraph is passed to the recognizer plug-ins. The recognizer plug-ins are executed on the paragraph to recognize keywords or perform other actions defined by the recognizer plug-in. As part of executing the recognizer plug-in, the paragraph or cell value may be broken into sentences by the recognizer plug-in. However, each recognizer plug-in is responsible for its own sentence-breaking. After the keywords are found, the results from each of the recognizer plug-ins are received by the recognizer DLL. The results from the recognizer plug-ins are compiled into semantic categories by the recognizer DLL and the semantic categories are sent to the application program module. The application program module displays the semantic categories to the user in the electronic document.


These and other features, advantages, and aspects of the present invention may be more clearly understood and appreciated from a review of the following detailed description of the disclosed embodiments and by reference to the appended drawings and claims.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram of a computer that provides the exemplary operating environment for the present invention.



FIG. 2 is a block diagram illustrating an exemplary architecture for use in conjunction with an embodiment of the present invention.



FIG. 3 is a flow chart illustrating a method for semantically labeling strings during creation of an electronic document in accordance with an exemplary embodiment of the present invention.



FIG. 4A is an illustration of a display of a preferred embodiment of a semantic category and its associated dropdown menu.



FIGS. 4B and 4C are illustrations of a display of a preferred embodiment of a semantic category and its associated cascade menu.





DETAILED DESCRIPTION

The present invention is directed toward a method and system for semantically labeling strings of text during creation of an electronic document and providing a selection of actions that may be performed based on the semantically labeled strings. A string is defined as a data structure composed of a sequence of characters usually representing human-readable text.


In one embodiment, the invention is incorporated into a suite of application programs referred to as “OFFICE”, and more particularly is incorporated into a preferred word processing application program entitled “WORD 10.0” and a preferred spreadsheet application program entitled “EXCEL 10.0”, both marketed by Microsoft Corporation of Redmond, Wash. Briefly described, the preferred application programs allow a user to create and edit electronic documents by entering characters, symbols, graphical objects, and commands.


In one embodiment, the invention comprises recognizing strings and annotating, or labeling, the strings with a type label. After the strings are annotated with a type label, application program modules may use the type label to provide users with a choice of actions. If the user's computer does not have any actions associated with that type label, the user may be provided with the option to surf to a download Uniform Resource Locator (URL) and download action plug-ins for that type label.


Having briefly described an embodiment of the present invention, an exemplary operating environment for the present invention is described below.


Exemplary Operating Environment


Referring now to the drawings, in which like numerals represent like elements throughout the several figures, aspects of the present invention and the exemplary operating environment will be described.



FIG. 1 and the following discussion are intended to provide a brief, general description of a suitable computing environment in which the invention may be implemented. While the invention will be described in the general context of an application program that runs on an operating system in conjunction with a personal computer, those skilled in the art will recognize that the invention also may be implemented in combination with other program modules. Generally, program modules include routines, programs, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, multiprocessor systems, microprocessor-based or programmable consumer electronics, minicomputers, mainframe computers, and the like. 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 memory storage devices.


With reference to FIG. 1, an exemplary system for implementing the invention includes a conventional personal computer 20, including a processing unit 21, a system memory 22, and a system bus 23 that couples the system memory to the processing unit 21. The system memory 22 includes read only memory (ROM) 24 and random access memory (RAM) 25. A basic input/output system 26 (BIOS), containing the basic routines that help to transfer information between elements within the personal computer 20, such as during start-up, is stored in ROM 24. The personal computer 20 further includes a hard disk drive 27, a magnetic disk drive 28, e.g., to read from or write to a removable disk 29, and an optical disk drive 30, e.g., for reading a CD-ROM disk 31 or to read from or write to other optical media. The hard disk drive 27, magnetic disk drive 28, and optical disk drive 30 are connected to the system bus 23 by a hard disk drive interface 32, a magnetic disk drive interface 33, and an optical drive interface 34, respectively. The drives and their associated computer-readable media provide nonvolatile storage for the personal computer 20. Although the description of computer-readable media above refers to a hard disk, a removable magnetic disk and a CD-ROM disk, it should be appreciated by those skilled in the art that other types of media which are readable by a computer, such as magnetic cassettes, flash memory cards, digital video disks, Bernoulli cartridges, and the like, may also be used in the exemplary operating environment.


A number of program modules may be stored in the drives and RAM 25, including an operating system 35, one or more application programs 36, a word processor program module 37 (or a spreadsheet program module), program data 38, and other program modules (not shown).


A user may enter commands and information into the personal computer 20 through a keyboard 40 and pointing device, such as a mouse 42. 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 21 through a serial port interface 46 that is coupled to the system bus, but may be connected by other interfaces, such as a game port or a universal serial bus (USB). A monitor 47 or other type of display device is also connected to the system bus 23 via an interface, such as a video adapter 48. In addition to the monitor, personal computers typically include other peripheral output devices (not shown), such as speakers or printers.


The personal computer 20 may operate in a networked environment using logical connections to one or more remote computers, such as a remote computer 49. The remote computer 49 may be a server, a router, a peer device or other common network node, and typically includes many or all of the elements described relative to the personal computer 20, although only a memory storage device 50 has been illustrated in FIG. 1. The logical connections depicted in FIG. 1 include a local area network (LAN) 51 and a wide area network (WAN) 52. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets and the Internet.


When used in a LAN networking environment, the personal computer 20 is connected to the LAN 51 through a network interface 53. When used in a WAN networking environment, the personal computer 20 typically includes a modem 54 or other means for establishing communications over the WAN 52, such as the Internet. The modem 54, which may be internal or external, is connected to the system bus 23 via the serial port interface 46. In a networked environment, program modules depicted relative to the personal computer 20, or portions thereof, may be stored in the remote memory storage device. 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.



FIG. 2 is a block diagram illustrating an exemplary architecture 200 for use in conjunction with an embodiment of the present invention. The architecture includes an application program module 205, such as word processor program module 37 (FIG. 1). The application program module 205 is able to communicate with a recognizer dynamic-link library 210 (hereinafter recognizer DLL) and an action dynamic-link library 215 (hereinafter action DLL) as a user is creating or editing an electronic document. The recognizer DLL 210 controls a number of recognizer plug-ins 220. The action DLL 215 controls a number of action plug-ins 225. The action DLL also controls a type-action database 230.


In a preferred embodiment, the action plug-ins and recognizer plug-ins are Automation Servers. Automation Servers are well-known software components which are assembled into programs or add functionality to existing programs running on the Microsoft WINDOWS® operating system. Automation Servers may be written in a variety of computing languages and can be un-plugged from a program at run time without having to recompile the program.


The recognizer DLL 210 handles the distribution of strings from the electronic document running on the application program module 205 to the individual recognizer plug-ins 220. The recognizer plug-ins 220 recognize particular strings in an electronic document, such as a word processing document or a spreadsheet document. The recognizer plug-ins 220 may be packaged with the application program module 205 or they may be written by third parties to recognize particular strings that are of interest. Typically, the recognizer DLL 210 passes strings to the recognizer plug-ins 220 in one paragraph or cell value increments.


As part of recognizing certain strings as including semantic information, the recognizer plug-ins 220 determine which strings are to be labeled and how they are to be labeled. After receiving these results from the various recognizer plug-ins 220, the recognizer DLL 210 sends semantic categories to the application program module. In a preferred embodiment, a semantic category comprises the recognized string, a type label, and a download URL. A semantic category may also comprise metadata. The recognizer plug-ins 220 each run separately and the recognizer DLL 210 is responsible for handling the asynchronicity that results from different recognizer plug-ins returning results with different delays.


After a string is labeled by a recognizer plug-in 220 and a semantic category is sent to the application program module 205, the user of the application program module 205 will be able to execute actions that are associated with the type label of the semantic category. The action DLL 215 manages the action plug-ins 225 that are run to execute the actions. As with the recognizer plug-ins 220, the action plug-ins 225 may be packaged with the application program module 205 or written by third parties to perform particular actions that are of interest to the third party. The action plug-ins provide possible actions to be presented to the user based upon the type label associated with the string. The action DLL 215 determines what type label the semantic category is and cross-references the type label in the type-action database 230 with a list of actions to determine what actions to present to the user. It should be understood that, in a preferred embodiment, the type-action database is not used. Instead, the list of actions is dynamically generated for each type by looking in the registry to determine which actions are installed and then querying the action DLLs to determine which types they apply to.


After the user chooses an action, the action DLL 215 manages the appropriate action plug-ins 225 and passes the necessary information between the action plug-ins and the application program module 205 so that the action plug-in may execute the desired action. Typically, the application program module sends the action DLL an automation request to invoke the action the user has selected.


As described above, the combination of the recognized string, type label, metadata and download URL is referred to herein as a semantic category. The type label is a semantic information label. The semantic category may also comprise metadata, which are hidden properties of the semantic category. An example of a semantic category may clarify the definition. Suppose a user enters the text “Gone With the Wind” into an electronic document. The string “Gone With the Wind” may be identified as a semantic category of type label “Book Title” and of type label “Movie Title”. In addition, metadata such as the ISBN number may be returned by the recognizer plug-in to the application program module as part of the semantic category. A download URL may be provided with the type labels “Book Title” and “Movie Title” in case the user's machine has not stored action plug-ins for these type labels. For example, an action for the type label “Book Title” may be “Buy this Book” from an online retailer. If the user does not have the action plug-in DLL 225 corresponding to “Buy this book”, then the download URL may be used to navigate the user's web browser to an appropriate website to download this action plug-in.


It should also be understood that the present invention, in a preferred embodiment, also recognizes sequences of capitalized words that contain function words, and which are likely to be special, but for which there is no type label information. These strings are typically labeled by a grammar checker program module.


The actions provided for a semantic category may utilize both the type label and the text of the recognized string. For example, a word processor program module may use a grammar checker as a recognizer plug-in to label strings that are person names. After a string has been labeled as a person's name, the word processor program module may, through a standard user interface mechanism, allow users to execute pertinent actions, such as looking up the person's name in the contacts folder in a personal information manager program module, sending electronic mail, or searching for the person's name in an HR database.


Having described an exemplary architecture, an exemplary method 300 for semantically labeling strings during document creation will be described below in reference to FIGS. 2 and 3.


Method for Semantically Labeling Strings During Document Creation



FIG. 3 is a flow chart illustrating a method 300 for semantically labeling strings during creation of an electronic document in accordance with an exemplary embodiment of the present invention. Those skilled in the art will appreciate that this exemplary embodiment is a computer-implemented process that is carried out by the computer in response to input from the user and instructions provided by a program module.


Referring to FIG. 3, the method 300 begins at start step 305 and proceeds to step 310 when a user opens an electronic document in application program module 205. In a preferred embodiment, the electronic document is a word processing document or a spreadsheet document. However, the invention is not limited to either of these specific types of electronic document.


At step 310, the application program module 205 receives a new string, such as when the user enters a new paragraph into the electronic document or edits a previously entered paragraph. The method 300 then proceeds to step 315.


At step 315, the paragraph containing the new string is passed from the application program module 205 to the recognizer DLL 210. The recognizer DLL is responsible for communicating with the application program module, managing the jobs that need to be performed by the recognizer plug-ins, receiving results from the recognizer plug-ins and sending semantic category information to the application program module. At boot time, the recognizer DLL communicates with its recognizer plug-ins to determine what languages it supports, what types it can apply, etc. It should be understood that, in a preferred embodiment, a paragraph is passed to the recognizer DLL at step 315. However, in alternative embodiments, a sentence, the contents of a spreadsheet cell, a section of the document, the entire document, etc. may be passed to the recognizer DLL. In other words, the present invention is not limited to simply passing a paragraph to the recognizer DLL. The method 300 then proceeds to step 320.


Still referring to step 315, the application program module 205 typically sends one paragraph at a time to the recognizer DLL. In addition, in a preferred embodiment, a grammar checker program module sends all semantic categories (without type labels) to the recognizer DLL that have been identified by the grammar checker program module. Passing these semantic categories (without type labels) to the recognizer DLL is important because doing so saves each recognizer plug-in from needing to decide whether something is a capitalized string interspersed with function words (a task that would require writing a number of regular expressions: Cap Cap Unc Cap; Cap Unc Cap; etc.). If a label is applied by a recognizer plug-in to a string the grammar checker program module labeled, the grammar checker label will then be removed.


At step 320, during idle time, the paragraph (and information from the grammar checker program module) is passed to the recognizer plug-ins. The method then proceeds to step 325.


It should be understood that, in a preferred embodiment, the recognizer DLL 210 maintains a job queue. If before the recognizer DLL 210 sends the paragraph to the recognizer plug-ins 220 the user edits the paragraph, then the job containing the edited paragraph is deleted and is not sent to the recognizer plug-ins. Then, a new job enters the queue at step 315 after the edited paragraph is received at step 310. This job deletion is necessary to prevent the recognizer plug-ins from performing unnecessary work on a paragraph that has been edited.


At step 325, the recognizer plug-ins are executed on the paragraph to recognize keywords or perform other actions defined by the recognizer plug-in. As part of executing the recognizer plug-in, the paragraph may be broken into sentences by the recognizer plug-in. However, each recognizer plug-in is responsible for its own sentence-breaking. After the keywords are found at step 325, then the method proceeds to step 330.


At step 330, the results from each of the recognizer plug-ins are received by the recognizer DLL. The method then proceeds to decision step 335.


At decision step 335, it is determined whether the paragraph that has been reviewed by the recognizer plug-ins has been edited after the paragraph was sent to the recognizer DLL. If so, then the method 300 returns to step 315 and the edited paragraph is received by the recognizer DLL from the application program module. If not, then the method proceeds to step 340.


At step 340, the results from the recognizer plug-ins are compiled into semantic categories by the recognizer DLL and the semantic categories are sent to the application program module. At step 345, the application program module displays the semantic categories to the user in the electronic document. The method 300 then ends at step 399.


As understood from the above description, the present invention comprises an architecture for recognizing semantic categories that permits third parties to develop recognizer plug-ins to identify strings of one or more particular types. The recognizer plug-ins communicate with the application program module and receive a string from the application program module. The recognizer plug-ins may apply recognition algorithms to the string and communicate the identity of recognized strings back to the application program module.


After a string is labeled with a particular type label, the user will be able to execute action plug-ins that pertain to that type label. The action plug-ins preferably are COM objects that are executed via communication between the application program module and the action DLL. Parameters necessary to execute the action (the html of the string labeled as being of a particular type, the html of the string representing the current selection) will be passed from the application program module to the action DLL and, in turn, passed to the action plug-in.


Actions Assigned to Type Labels in a Preferred Embodiment


The present invention further comprises an architecture for identifying and executing a set of actions associated with a semantic category. This architecture comprises actions that apply to a particular type label (e.g. an action for book titles may be “Buy this book from shop.Microsoft.com”) and executing those actions when the user so desires. An action is a user-initiated function applied to a typed string. For example, adding a name to the contacts folder is one action possible for a type label “Person name”.


It should be understood that a significant aspect of the present invention is the power and flexibility that results from allowing third party vendors, such as IT professionals, to design and write recognizer plug-ins and action plug-ins for deployment within an organization or for deployment on the World Wide Web. Some example actions that may be executed include:

    • Schedule a meeting
    • Create task
    • Display calendar
    • Add to contacts folder
    • Look up in contacts folder, address book, Windows Address Book (WAB), Global Address List (GAL), etc.
    • Insert address into document
    • Send mail to
    • Display EXPEDIA map
    • Stock quote lookup
    • Send instant message to


In a preferred embodiment, different actions are assigned to different type labels and these type label-action assignments are stored in the type-action database 230. Table 1 below illustrates some possible type label-action pairings.












TABLE 1







Type Labels
Actions









Person name
Show contact info




Add to contacts




E-mail




Insert address into document




Send instant message to



Date
Show calendar for that day




New task with that due date




Schedule meeting that day



Place
Display EXPEDIA map




Add to contacts



Address
Add to contacts



Phone number
Add to contacts



E-mail
Add to contacts



Date
Schedule a meeting



Task
Schedule a task



Meeting
Schedule a meeting










For each type label, the type-action database 230 will store a download URL specified by the creator of the type label that users who do not have action-plug-ins or recognizer plug-ins for that semantic category type can go to in order to get action plug-ins and/or recognizer plug-ins. For example, the download URL for the type label “Book Title” might be microsoft.com/semanticcategories.asp. Once at that web page, a user may be offered downloads of various action plug-ins and recognizer plug-ins. There may also be an option on the user interface to navigate to the download URL so that recipients of documents with semantic categories can easily get the action plug-ins for those semantic categories.


Storing Semantic Categories


In a preferred embodiment, semantic categories are stored as part of the electronic document along with other document information and are available when a document is transmitted from one computer to another computer. In a preferred embodiment, storing semantic categories in an electronic document is controlled by an “Embed semantic categories” checkbox. The checkbox is on by default. Turning it off will prevent semantic categories in the document from being saved. The state of the checkbox is per document. The same checkbox controls saving for both .htm and .doc documents.


Checking a “Save semantic categories as XML properties” checkbox (off by default) will write out the text of all of the semantic categories in the document and their labels in the header of the html file in XML (that is using the same tags as are used inline, but surrounded by <xml> And </xml>) for easy identification and parsing by search engines and knowledge management systems.


In a preferred embodiment, semantic categories are saved as a unique namespace plus a tag name. A namespace is an XML construct for uniquely identifying a group of XML tags that belong to a logical category. Thus, every semantic category is uniquely identified by its nametag (e.g., “streetname”) in addition to its namespace (e.g., “schemas-microsoft-com:outlook:contact”)


Although the method 300 described above is one method for identifying semantic categories, in a preferred embodiment of the present invention, there are two other mechanisms for identifying semantic categories. One mechanism is a grammar checker program module (not shown) connected to word processor program module 37. Another mechanism is receiving a semantic category from another electronic document. For example, when text containing a semantic category is copied from one electronic document and pasted into another electronic document of the word processor program module 37, the information identifying the semantic category is preserved and copied along with the copied text. These two additional mechanisms are described in more detail below.


Using a Grammar Checker Program Module to Identify Semantic Categories


In a preferred embodiment of the present invention, a grammar checker program module may be used to identify semantic categories of the following types:

    • Person names (Example: Bill Smith)
    • Complete dates (Example: May 1, 1999)
    • Partial dates (Examples: May 1999; May 1)
    • A limited subset of temporal expressions (Examples: today, tomorrow, next Tuesday)
    • Times (Examples: 4:00 PM; 17:30)
    • Addresses (Example: 1053 Church Street Abington, Pa. 19001)
    • Places (Example: Trafalger Square)
    • Cities (Example: Pittsburgh)
    • Phone Numbers (Example: 215-887-9093)
    • E-mail addresses (Example: bob@xyz.com)
    • Web addresses


In a preferred embodiment, the grammar checker program module will sometimes send a normalized form of the string to the word processor program module along with the other semantic category information. For example, for the strings May 11, 1999 and May 11, 1999, the grammar checker program module sends the normalized form “May 11, 1999” to the word processor program module. The word processor program module stores this normalized form of the string to make it easier to query a personal information manager program module, web properties and other program modules. For example, the grammar checker program module may return normalized forms for the following strings:

    • Dates (Example: “today” normalized to “10/15/99”)
    • Times (Examples: “4 pm” normalized to “4:00 pm”)
    • Telephone numbers (to normalize for variants involving parentheses and hyphens)


      It should be understood that the normalized forms for dates and times will typically be determined at write time of a document rather than read time.


      Identifying Semantic Categories Via Cut and Paste


In a preferred embodiment, copying or cutting a semantic category from one application program module and pasting the semantic category into a second application program module that recognizes semantic categories will preserve the semantic category. In other words, copying and pasting (or dragging and dropping) a string labeled with semantic category information will copy the string and the string's semantic category information. Moreover, it follows that complete documents sent from one application program module (or computer) to another application program module (or computer) will also typically preserve the semantic categories.


In a preferred embodiment, semantic categories are placed in the clipboard in CF_HTML. CF_HTML, or clipboard format HTML, is essentially HTML with some clipboard specific properties such as the length of the HTML string. However, application program modules that do not recognize semantic categories may make a special effort to persist pasted semantic categories. For example, pasted semantic categories may be preserved as unknown HTML. semantic categories


Displaying Semantic Categories to the User


Referring now to FIG. 4A, an illustration of a display of a preferred embodiment of a semantic category 400 and its associated dropdown menu 405 will be described. It should be understood that FIG. 4A is an illustration of a semantic category 400 and dropdown menu 405 as displayed to a user by the application program module 205.


The string 410 associated with semantic category 400 is the string “Bob Smith”. As shown in FIG. 4A, the string 410 of a semantic category 400 may be identified to the user by brackets 415. Of course, many other devices such as coloring, underlining, icons, etc. may be used to indicate to the user that a particular string is a semantic category.


In a preferred embodiment, when the user hovers a cursor over the string 410 or places the insertion point within string 410, then dropdown menu 405 is displayed to the user. The dropdown menu typically displays a list of actions associated with a semantic category. The dropdown menu typically appears above and to the left of the semantic category string.


Typically, the first line of the dropdown menu indicates which string is the semantic category string (Bob Smith in FIG. 4A) and what type the semantic category is (Person name in FIG. 4A). Listed below the first line are actions 420 available for the semantic category type, such as “Send mail to . . . ”, “Insert Adress”, and “Display contact information . . . ”.


The first item on the drop down menu below the seperator line is “Check for new actions . . . ” 425. “Check for new actions . . . ” 425 will appear only for semantic categories whose download URL is available to the application program module. If selected, “Check for new actions . . . ” 425 uses the semantic category download URL to navigate the user's web browser to the homepage for the semantic category type applied to the string. For example, suppose new actions have been defined for the semantic category type “person name”. If so, then new actions will be downloaded to the user's computer after selecting “Check for new actions . . . ” 425. “Check for new actions . . . ” 425 will be grayed out if a download URL is unavailable for the semantic category.


If selected, the “Remove this semantic category” item 430 deletes the semantic category label from the string. If selected, the “Semantic categories” item 435 navigates the user to the semantic categories tab of the autocorrect dialog.


It should be understood that the application program module sends a request to the action DLL to determine which actions are shown with each semantic category type.


Actions Performed in Association with Semantic Categories


There are a number of functions that users perform on typed data that preferred word processor program module 37 and semantic categories will make easier. The functions fall into two primary categories:

    • 1) interacting with personal information manager contacts, tasks, meetings, and mail
    • 2) interacting with properties on the World Wide Web or a corporate intranet


A single string may be associated with multiple semantic categories. Every semantic category has a type label with one or more action plug-ins defined for the type label. For example, the “Address” type label may have the “Open in Mappoint”, “Find with Expedia Maps” and “Add to my Address Book” actions associated with it and each of these actions may have a different action plug-in to execute the action.


The actions assigned to a semantic category are assigned on a per type label basis, not on a per semantic category basis. For example, all semantic categories of type label “Address” will have the same actions assigned to them. The actions assigned to type labels also depends on the computer that the application program module is running on. Thus, if a computer has three actions registered for the type label “Address”, then all strings with an “Address” type label will be assigned to three actions. However, if one of these semantic categories is sent to a computer which has only two actions registered for the “Address” type label, then the user will only be exposed to two actions for this semantic category.


Nesting of Semantic categories


In an embodiment of the present invention, semantic categories may be nested inside each other. For example, the string “George Washington” may include a semantic category with type label “Person Name” for the span “George Washington State” and a semantic category with type label “State” for the span “Washington”. Moreover, two semantic categories may cover exactly the same span. For example, the string “George Washington” may include a semantic category with type label “Person Name” and a semantic category with type label “President”.


Because the preferred application program module 37 will support labeling a single string with multiple type labels (e.g. Bob Smith could be a semantic category labeled as a “Person Name” and labeled as a “Microsoft employee”), the preferred application program module 37 will use cascade menus on the dropdown menu if multiple semantic category types are assigned. Referring now to FIGS. 4B and 4C, cascade menu 437 is illustrated.


The cascade menu 437 includes a list of the type labels included in string 412. This list includes a type label “Person Name” 445 and a type label “Microsoft employee” 450. The cascade menu further comprises the “Semantic categories . . . ” item 435.


As illustrated in FIG. 4B, by selecting the type label “Person Name” 445, the user is presented with the actions associated with the type label “Person Name”. These actions are similar to those described above with regard to FIG. 4A.


As illustrated in FIG. 4C, by selecting the type label “Microsoft employee” 450, the user is presented with the actions associated with the type label “Microsoft employee”. These actions are associated with the string “Bob Smith 42859455, whereas the actions illustrated in FIG. 4B are associated with the string “Bob Smith”. The only action shown in FIG. 4C is the action 460 to “Look up in HeadTrax . . . ”.


It should be understood that FIGS. 4B-4C illustrate how a cascade menu may be used to allow the user to select which type label the user is interested in and to further select an action after selecting the type label.


In-Document User Interface to Indicate Semantic Categories


As described above with reference to FIGS. 4A-4C, in a preferred embodiment, the application program module includes the option to display an in-document user interface to indicate the location of semantic categories. This in-document user interface may use a colored indication to indicate the location of a semantic category, such as the brackets 415 in FIGS. 4A-4C. The in-document user interface will also be able to show nesting of semantic categories. For example, if Michael Jordan is labeled as a semantic category with type label “Person Name”, Michael is a semantic category with type label “First Name” and Jordan is a semantic category with type label “Last Name”, the document may look like this with the brackets indicating semantic categories:

    • [[Michael] [Jordan]]


Of course, the in-document user interface may be any sort of indication. For example, in the “EXCEL” spreadsheet application program, the interface comprises a triangle in the lower right hand portion of a cell to indicate that one or more semantic categories are present in the cell.


Invalidating the Semantic Categories of a Paragraph of Text


Whenever the user edits a paragraph of text or a cell value in a document of the application program module, that text is flagged as dirty and the recognizer plug-ins and the grammar checker program module (if used) will need to be consulted again to identify semantic categories. The concept of dirtying text is well-known in the art.


In a preferred embodiment, only semantic categories recognized by the grammar checker program module are discarded when a paragraph of text is dirtied. That is, the application program module retains semantic categories identified by recognizer plug-ins as well as those pasted into the document even though the text has been dirtied.


Turning Off Annotation/Managing Recognizer Plug-Ins


In a preferred embodiment, there is a check box in the application program module 37 that turns off all annotation of semantic categories. The radio switch is labeled “Label text with semantic categories as you type”. It appears on the semantic categories tab of the autocorrect dialog. In this same dialog box, there will be a user interface to manage which recognizer plug-ins (including the grammar checker program module) are active.


The present invention allows tighter integration between names, dates, times, places, addresses, e-mail addresses and the information stored in e-mail and personal information managers. For example, using the present invention, the user can type a contact name into their document, select “Insert address” from the user interface and the contact's address will be identified in the personal information manager and inserted directly into the document.


As another example of the flexibility of the invention's architecture, suppose a user wants to find a map to a client's business. With the architecture of the present invention, an address will be recognized as such and the user may select “Show map” from a user interface to automatically open the appropriate web page in the web browser and automatically communicate with the mapping service, such as by sending address information automatically to the mapping service without nay user input. The invention saves the user the step of entering the address information into the appropriate fields, thus saving the user time and eliminating potential transcription errors.


It should be understood that an important aspect of the present invention is that the identification of semantic categories is performed at write time rather than read time. That is, semantic categories are identified, or recognized, by recognizer plug-ins as the user enters information into the document. One reason this is important is that the recognition relies on the writer's computer rather than the reader's computer. This is important because the writer's computer may contain recognizer plug-ins that are not included in the reader's computer. The reader may be presented with the option of downloading an action plug-in or a recognizer plug-in when they receive the document from writer.


The present invention satisfies the need for a system capable of recognizing strings of text in documents on-the-fly and labeling the strings with semantic information. After this string is labeled, then a list of actions may be displayed to the user based upon the label associated with the string.


It should be understood that the recognizer DLL may distribute any amount of text to the recognizer plug-ins. The invention has been described above in the context of the recognizer DLL sending a paragraph to a recognizer plug-in. However, any amount of text may be sent such as a sentence, a cell, a slide, etc.


Although the present invention has been described above as implemented in a word processing program module, it should be understood that the present invention may be implemented in other program modules, including, but not limited to, HTML authoring programs and programs such as the “POWERPOINT”® presentation graphics programand the “OFFICE” program module, both marketed by Microsoft Corporation of Redmond, Wash.


It should be understood that the recognizer DLL keeps track of pending work, such as the starting and ending position of the paragraph that is to be examined. During idle time, the recognizer DLL sends the paragraph to the recognizer plug-ins. If the user dirties a paragraph that has been sent to the recognizer plug-ins before the recognizer plug-ins return results, then the recognizer DLL marks the results as invalid. If the user dirties a paragraph after it has been checked for semantic categories, then the paragraph is re-checked by the recognizer plug-ins.


As described above, the semantic category may also include metadata returned by the recognizer plug-ins. For example, a recognizer plug-in that recognizes the titles of books may return as metadata an ISDN book number when it recognizes the title of a book. The ISDN book number metadata may then be used to provide actions. Metadata may also be used to disambiguate for actions and searches. For example, suppose a recognizer DLL is linked to a corporate employee database to recognize names. When the recognizer DLL recognizes “Bob Smith”, it may store “employeeID=12345” as metadata in the background. Then, when an action is fired, the text in question will be known to reference Bob Smith, employee no. 12345 rather than Bob Smith, employee no. 45678. Also, the metadata may allow searches to be performed independent of the actual text in a document. So, a search may be conducted on “Robert Smith” by looking for employee 12345 in the employee databases and by performing a search on the metadata for employee number 12345 to find documents with “Bob Smith” in them. There are also numerous other functions for metadata. For instance, DHTML could be inserted so special tricks may be performed within a web browser. Additionally, data used by other actions may be inserted such as someone's e-mail address that could be used by the send-mail-to action, a normalized version of the date could be stored to easily interact with a personal information manager, etc.


It should also be understood that limited semantic category information may be sent from the application program module to the recognizer plug-ins. For example, a grammar checker program module may be able to recognize a person's name to create a type label “Person Names”. This type label information may be sent to recognizer plug-in for them to use. For example, a recognizer plug-ins that recognizes the names of famous people may not need to search every paragraph that is sent to it. The famous people recognizer plug-in may only need to search strings that have been recognized and labeled as “Person Names” and then determine whether any of these strings is the name of a famous person.


It should be understood that in a preferred embodiment the semantic categories are stored in the native file format, in XML, and in HTML. Of course, the semantic categories may be stored in any file format without departing from the spirit and scope of the present invention.


In one embodiment, the invention comprises annotating strings in documents with semantic information as the document is created. After a string is annotated with semantic information, a range of actions that utilize both the semantic information and the text of the string-so-labeled may be provided to the user. For example, a word processor program module may use a grammar checker program module to label person names. After a string has been labeled as a person's name, the word processor program module may, through a standard user interface mechanism, allow users to execute actions pertinent to a person's name. For example, the actions may be searching for the person's name in a contacts folder, sending electronic mail to the person's e-mail address or looking up the person's name in a human resources database. Of course, the examples provided above are simply examples and should not be construed as limiting the present invention.


The architecture of the present invention is designed to allow IT departments or independent vendors to build recognizers for any of these things, which could be deployed within an organization to label these strings in documents. The IT department or service vendor could also create actions specific to these data types (such as checking the store room for a particular chemical or displaying a spec sheet for it; checking the order backlog for a particular car or the quantity on hand for a particular part; checking the schedule to see when a course is being taught or which department a faculty member is in.) It should be understood that recognizer plug-ins can be designed to perform arbitrary computation. For example, a recognizer plug-in could be designed to annotate words found on a list with a particular property (e.g. in order to recognize names of companies). Another recognizer plug-in may annotate stock ticker symbols (by looking for 3 to 5 letter words that are all capitalized). Another recognizer plug-in may query a database to see whether a particular string is a book title. The book title database may be on a local machine, on the corporate Intranet or halfway around the world and accessible via the Internet. The possibilities for different plug-in designs is endless. As a result of the possible differences between recognizer plug-ins, the recognizer plug-ins will run in a separate thread and the recognizer DLL will be responsible for handling the asynchronicity that will result from different recognizer plug-ins returning their results with different delays.


It should be understood that the present invention is designed to be able to function without any recognizer plug-in DLLs and any action plug-in DLLs. For example, if there are no recognizer plug-in DLLs, semantic categories may still be recognized by a grammar checker program module. If there are no action plug-in DLLs, then the user may be presented with a menu item that allows them to go to a download site to install an action plug-in DLL. The action plug-in DLL and recognizer plug-in DLL may also be combined together into one plug-in DLL.


In alternative embodiments, the recognizer plug-ins may be able to modify the content of a document upon recognition of a semantic category, such as bolding a company's name.


In alternative embodiments, the application program module may fire an event within its object model so that a plug-in that uses the object model could execute a piece of code when a semantic category is recognized (such as to display a special user interface when a semantic category is labeled).


In an alternative embodiment, the language of the text may be passed to the recognizer DLL or recognizer plug-ins so that analysis of the text may be skipped if the text is an unsupported language.


In alternative embodiments, word-breaking or sentence-breaking may be done outside of the recognizer plug-ins.


In alternative embodiments, the recognizer plug-ins may be able to examine the content of the document beyond the paragraph of text it was given. For example, the preceding line in a document may be used to determine whether something is really an address.


It should be understood that a recognizer plug-in is not limited to simply applying labels to text. Once a recognizer plug-in identifies a string as being of a particular type, it may enter the string into a database, send e-mail, start another application, etc.


Although the present invention has been described above as implemented in a preferred application program module, it will be understood that alternative embodiments will become apparent to those skilled in the art to which the present invention pertains without departing from its spirit and scope. Accordingly, the scope of the present invention is defined by the appended claims rather than the foregoing description.

Claims
  • 1. For an electronic system stored on a computer medium for creating and editing an electronic document, a method for semantically labeling a string of text in the electronic document created in an application program module, the method comprising: automatically receiving the string of text in a recognizer dynamic-link library after the entire string of text has been entered in the electronic document, wherein receiving the string of text comprises maintaining a job queue, the job queue storing the string of text before transmitting the string of text to at least one recognizer plug-in;determining if the string of text has been edited before transmitting the string of text from the recognizer dynamic-link library to the at least one recognizer plug-in;in response to determining if the string of text has been edited, deleting the edited string of text from the job queue;in response to determining if the string of text has not been edited, transmitting the string of text, from the job queue, to the at least one recognizer plug-in during an idle time;in each of the at least one recognizer plug-in, annotating the string of text to determine at least one label, wherein annotating the string of text comprises breaking the string of text by each of the at least one recognizer plug-in;transmitting the at least one label from the at least one recognizer plug-in to the recognizer dynamic-link library, wherein transmitting the at least one label from the at least one recognizer plug-in comprises determining if the string of text annotated by the at least one recognizer plug-in has been edited after the string of text was transmitted to the recognizer dynamic-link library;in response to determining the string of text has been edited after the string of text was transmitted to the recognizer dynamic-link library, transmitting the string of text from the application program module to the recognizer dynamic-link library;compiling the at least one label into at least one semantic category at the recognizer dynamic-link library;transmitting the at least one semantic category to the application program module such that each of the at least one label is associated with the string of text; andembedding the at least one semantic category in the electronic document.
  • 2. The method of claim 1 further comprising synchronizing the at least one label received from the at least one recognizer plug-in before transmitting the at least one label to the application program module.
  • 3. The method of claim 1 further comprising: receiving the at least one label in an action dynamic link library;transmitting the at least one label to at least one of action plug-in; anddetermining, in the at least one action plug-in, at least one action based on each of the at least one label and displaying at least one action received from the at least one action plug-in.
  • 4. The method of claim 1 further comprising: causing the application program module to fire an event within an object model of the application program module; andcausing a piece of code associated with the event to be executed when at least one of the at least one label is determined.
  • 5. The method of claim 1 further comprising: before the step of receiving the string of text in the recognizer dynamic-link library, determining a language of the string of text and if the language is not recognized by the recognizer dynamic-link library, then ending the method.
  • 6. The method of claim 1 wherein annotating the string of text to determine the at least one label further comprises comparing the string of text with at least one stored string to determine a match.
  • 7. A method for labeling a string of text in an electronic document as the electronic document is created in an application program module, the method comprising: as the string of text is entered into the electronic document, automatically receiving the string of text in a recognizer dynamic link library during an idle time after the string of text has been entered in the electronic document and determining whether the string of text matches at least one stored string according to semantic categories, wherein receiving the string of text comprises: maintaining a job queue, the job queue storing the string of text before transmitting the string of text to at least one recognizer plug-in,determining if the string of text has been edited,in response to determining if the string of text has been edited, deleting the edit string of text from the job queue; andin response to determining if the string of text has not been edited, transmitting the string of text, from the job queue, to the at least one recognizer plug-in during an idle time;if so, then determining a label associated with the matched stored string, wherein determining the label associated with the matched stored string comprises breaking the string of text by each of the at least one recognizer plug-in;associating the label with the string of text;transmitting the semantic categories to the application program module, wherein transmitting the semantic categories to the application module comprises determining if the string of text associated with the label has been edited after the string of text was transmitted to the recognizer dynamic-link library;in response to determining if the string of text associated with the label has been edited after the string of text was transmitted to the recognizer dynamic-link library, transmitting the string of text from the application program module to the recognizer dynamic-link library; andembedding the semantic categories in the electronic document.
  • 8. The method recited in claim 7 further comprising determining at least one action associated with the label.
  • 9. The method recited in claim 8 further comprising displaying an indication indicating that the label has been found for the string of text.
  • 10. The method recited in claim 9 further comprising: determining that a user has selected the string of text; andin response, displaying the at least one action to the user.
  • 11. The method recited in claim 10 further comprising: receiving an indication that one of the at least one action has been selected; andin response to receiving the indication that one of the at least one action has been selected, then causing the selected one of the at least one action to execute.
  • 12. The method recited in claim 11 wherein causing the selected one of the at least one action to execute comprises determining whether an action plug-in dynamic link library assigned to the selected action is available; and if so, then receiving instructions from the action dynamic link library assigned to the selected action.
  • 13. The method recited in claim 12 further comprising: if the action plug-in dynamic link library is not available, then using a Uniform Resource Locator assigned to the action to navigate to a Web site and download the action plug-in dynamic link library.
  • 14. The method recited in claim 13 further comprising determining metadata associated with the string of text.
  • 15. A system, stored on a computer medium, for labeling a string in an electronic document as the string is entered into the electronic document, the system comprising: an application program module for creating the electronic document;a recognizer dynamic link library connected to the application program module, wherein the recognizer dynamic link library automatically receives the string during an idle time after the string has been entered in the electronic document; andat least one recognizer plug-in connected to the recognizer dynamic link library, wherein the at least one recognizer plug-in receives the string, annotates the string to determine a label according to semantic categories embedded in the electronic document, wherein the string annotated to determine the label comprises break the string by each of the at least one recognizer plug-in, and associates the label with the string, wherein the at least one recognizer plug-in receiving the string comprises: maintain a job queue, the job queue storing the string before transmitting the string to at least one recognizer plug-in,determine if the string has been edited before transmitting the string to the at least one recognizer plug-in,in response to the determination if the string has been edited before transmitting the string to the at least one recognizer plug-in, delete the edited string from the job queue,in response to the determination if the string has not been edited before transmitting the string to the at least one recognizer plug-in, transmit the string, from the job queue, to the at least one recognizer plug-in during an idle time,determine if the string of text associated with the label has been edited after the string of text was transmitted to the recognizer dynamic-link library;in response to determining if the string of text associated with the label has been edited after the string of text was transmitted to the dynamic-link library, transmit the string of text from the application program module to the recognizer dynamic-link library, andan action dynamic link library connected to the application program module.
  • 16. The system of claim 15 further comprising at least one action plug-in connected to the action dynamic link library.
  • 17. The system of claim 15 wherein the at least one recognizer plug-in compares the string to at least one stored string to determine whether the string matches any of the stored strings according to the semantic categories embedded in the electronic document.
  • 18. The system of claim 17 wherein the label is associated with the matched stored string.
  • 19. For an electronic system for creating and editing an electronic document, a computer-readable storage medium with instructions stored thereon for semantically labeling a string of text in the electronic document created in an application program module, the instructions comprising: automatically receiving the string of text in a recognizer dynamic-link library after the entire string of text has been entered in the electronic document, wherein receiving the string of text comprises maintaining a job queue, the job queue storing the string of text before transmitting the string of text to at least one recognizer plug-in;determining if the string of text has been edited;in response to determining if the string of text has been edited, deleting the edited string of text from the job queue;in response to determining if the string of text has not been edited, transmitting the string of text, from the job queue, to the at least one recognizer plug-in during an idle time;in each of the at least one recognizer plug-in, annotating the string of text to determine a label according to semantic categories embedded in the electronic document, wherein annotating the string of text comprises breaking the string of text by each of the at least one recognizer plug-in;associating each label with the string of text;transmitting the labels from the at least one recognizer plug-ins to the recognizer dynamic-link library;transmitting the labels to the application program module, wherein transmitting the labels to the application module comprises determining if the string of text associated with each label has been edited after the string of text was transmitted to the recognizer dynamic-link library;in response to determining if the string of text associated with each label has been edited after the string of text was transmitted to the recognizer dynamic-link library, transmitting the string of text from the application program module to the recognizer dynamic-link library;receiving the labels in the action dynamic link library;transmitting the labels to at least one action plug-in; anddetermining, in the at least one action plug-in, at least one action based on each of the labels and displaying at least one action received from the at least one action plug-in.
US Referenced Citations (354)
Number Name Date Kind
4674065 Lange et al. Jun 1987 A
4868750 Kucera et al. Sep 1989 A
5020019 Ogawa May 1991 A
5128865 Sadler Jul 1992 A
5159552 van Gasteren et al. Oct 1992 A
5267155 Buchanan et al. Nov 1993 A
5287448 Nicol et al. Feb 1994 A
5297039 Kanaegami et al. Mar 1994 A
5317546 Balch et al. May 1994 A
5337233 Hofert et al. Aug 1994 A
5341293 Vertelney et al. Aug 1994 A
5351190 Kondo Sep 1994 A
5386564 Shearer et al. Jan 1995 A
5392386 Chalas Feb 1995 A
5418902 West et al. May 1995 A
5446891 Kaplan et al. Aug 1995 A
5522089 Kikinis et al. May 1996 A
5535323 Miller et al. Jul 1996 A
5541836 Church et al. Jul 1996 A
5546521 Martinez Aug 1996 A
5581684 Dudzik et al. Dec 1996 A
5596700 Darnell et al. Jan 1997 A
5617565 Augenbraun et al. Apr 1997 A
5625783 Ezekiel et al. Apr 1997 A
5627567 Davidson May 1997 A
5627958 Potts et al. May 1997 A
5634019 Koppolu et al. May 1997 A
5640560 Smith Jun 1997 A
5657259 Davis et al. Aug 1997 A
5685000 Cox Nov 1997 A
5708825 Sotomayor Jan 1998 A
5715415 Dazey et al. Feb 1998 A
5717923 Dedrick Feb 1998 A
5752022 Chiu et al. May 1998 A
5761689 Rayson et al. Jun 1998 A
5764794 Perlin Jun 1998 A
5765156 Guzak et al. Jun 1998 A
5781189 Holleran et al. Jul 1998 A
5781904 Oren et al. Jul 1998 A
5794257 Liu et al. Aug 1998 A
5799068 Kikinis et al. Aug 1998 A
5802253 Gross et al. Sep 1998 A
5802262 Van De Vanter Sep 1998 A
5802299 Logan et al. Sep 1998 A
5802530 van Hoff Sep 1998 A
5805911 Miller Sep 1998 A
5809318 Rivette et al. Sep 1998 A
5815830 Anthony Sep 1998 A
5818447 Wolf et al. Oct 1998 A
5821931 Berquist et al. Oct 1998 A
5822539 van Hoff Oct 1998 A
5822720 Bookman et al. Oct 1998 A
5826025 Gramlich Oct 1998 A
5832100 Lawton et al. Nov 1998 A
5845077 Fawcett Dec 1998 A
5855007 Jovicic et al. Dec 1998 A
5859636 Pandit Jan 1999 A
5872973 Mitchell et al. Feb 1999 A
5875443 Nielsen Feb 1999 A
5877757 Baldwin et al. Mar 1999 A
5884266 Dvorak Mar 1999 A
5892919 Nielsen Apr 1999 A
5893073 Kasso et al. Apr 1999 A
5893132 Huffman et al. Apr 1999 A
5895461 De La Huerga et al. Apr 1999 A
5896321 Miller et al. Apr 1999 A
5900004 Gipson May 1999 A
5907852 Yamada May 1999 A
5913214 Madnick et al. Jun 1999 A
5920859 Li Jul 1999 A
5924099 Guzak et al. Jul 1999 A
5933139 Feigner et al. Aug 1999 A
5933140 Strahorn et al. Aug 1999 A
5933498 Schneck et al. Aug 1999 A
5940614 Allen et al. Aug 1999 A
5944787 Zoken Aug 1999 A
5946647 Miller et al. Aug 1999 A
5948061 Merriman et al. Sep 1999 A
5956681 Yamakita Sep 1999 A
5974413 Beauregard et al. Oct 1999 A
5987480 Donohue et al. Nov 1999 A
5991719 Yazaki et al. Nov 1999 A
5995756 Herrmann Nov 1999 A
6006265 Rangan et al. Dec 1999 A
6006279 Hayes Dec 1999 A
6014616 Kim Jan 2000 A
6018761 Uomini Jan 2000 A
6028605 Conrad et al. Feb 2000 A
6029135 Krasle Feb 2000 A
6029171 Smiga et al. Feb 2000 A
6031525 Perlin Feb 2000 A
6052531 Waldin et al. Apr 2000 A
6061516 Yoshikawa et al. May 2000 A
6067087 Krauss et al. May 2000 A
6072475 Van Ketwich Jun 2000 A
6073090 Fortune et al. Jun 2000 A
6085201 Tso Jul 2000 A
6088711 Fein et al. Jul 2000 A
6092074 Rodkin et al. Jul 2000 A
6108640 Slotznick Aug 2000 A
6108674 Murakami et al. Aug 2000 A
6112209 Gusack Aug 2000 A
6121968 Arcuri et al. Sep 2000 A
6122647 Horowitz et al. Sep 2000 A
6126306 Ando Oct 2000 A
6137911 Zhilyaev Oct 2000 A
6141005 Hetherington et al. Oct 2000 A
6151643 Cheng et al. Nov 2000 A
6154738 Call Nov 2000 A
6167469 Safai et al. Dec 2000 A
6167523 Strong Dec 2000 A
6167568 Gandel et al. Dec 2000 A
6173316 De Boor et al. Jan 2001 B1
6182029 Friedman Jan 2001 B1
6185550 Snow et al. Feb 2001 B1
6185576 McIntosh Feb 2001 B1
6199046 Heinzle et al. Mar 2001 B1
6199081 Meyerzon et al. Mar 2001 B1
6208338 Fischer et al. Mar 2001 B1
6219698 Iannucci et al. Apr 2001 B1
6246404 Feigner et al. Jun 2001 B1
6262728 Alexander Jul 2001 B1
6272074 Winner Aug 2001 B1
6272505 De La Huerga Aug 2001 B1
6282489 Bellesfield et al. Aug 2001 B1
6291785 Koga et al. Sep 2001 B1
6292768 Chan Sep 2001 B1
6295061 Park et al. Sep 2001 B1
6297822 Feldman Oct 2001 B1
6300950 Clark et al. Oct 2001 B1
6308171 De La Huerga Oct 2001 B1
6311152 Bai et al. Oct 2001 B1
6311177 Dauerer et al. Oct 2001 B1
6311194 Sheth et al. Oct 2001 B1
6320496 Sokoler et al. Nov 2001 B1
6323853 Hedloy Nov 2001 B1
6336125 Noda et al. Jan 2002 B2
6336131 Wolfe Jan 2002 B1
6338059 Field et al. Jan 2002 B1
6339436 Amro et al. Jan 2002 B1
6339755 Hetherington et al. Jan 2002 B1
6347398 Parthasarathy et al. Feb 2002 B1
6349295 Tedesco et al. Feb 2002 B1
6353926 Parthesarathy et al. Mar 2002 B1
6381742 Forbes et al. Apr 2002 B2
6382350 Jezewski et al. May 2002 B1
6392668 Murray May 2002 B1
6396515 Hetherington et al. May 2002 B1
6401067 Lewis et al. Jun 2002 B2
6408323 Kobayashi et al. Jun 2002 B1
6413100 Dickmeyer et al. Jul 2002 B1
6415304 Horvitz Jul 2002 B1
6421678 Smiga et al. Jul 2002 B2
6424979 Livingston et al. Jul 2002 B1
6434567 De La Huerga Aug 2002 B1
6438545 Beauregard et al. Aug 2002 B1
6441753 Montgomery Aug 2002 B1
6442545 Feldman et al. Aug 2002 B1
6442591 Haynes et al. Aug 2002 B1
6456304 Angiulo et al. Sep 2002 B1
6470091 Koga et al. Oct 2002 B2
6473069 Gerpheide Oct 2002 B1
6477510 Johnson Nov 2002 B1
6480860 Monday Nov 2002 B1
6493006 Gourdol et al. Dec 2002 B1
6498982 Bellesfield et al. Dec 2002 B2
6510504 Satyanarayanan Jan 2003 B2
6516321 De La Huerga Feb 2003 B1
6519557 Emens et al. Feb 2003 B1
6519603 Bays et al. Feb 2003 B1
6546433 Matheson Apr 2003 B1
6553385 Johnson et al. Apr 2003 B2
6556972 Bakis et al. Apr 2003 B1
6556984 Zien Apr 2003 B1
6564264 Creswell et al. May 2003 B1
6571241 Nosohara May 2003 B1
6571253 Thompson et al. May 2003 B1
6591260 Schwarzhoff et al. Jul 2003 B1
6595342 Maritzen et al. Jul 2003 B1
6601075 Huang et al. Jul 2003 B1
6604099 Chung et al. Aug 2003 B1
6615131 Rennard et al. Sep 2003 B1
6618733 White et al. Sep 2003 B1
6622140 Kantrowitz Sep 2003 B1
6623527 Hamzy Sep 2003 B1
6625581 Perkowski Sep 2003 B1
6629079 Spiegel et al. Sep 2003 B1
6631519 Nicholson et al. Oct 2003 B1
6636880 Bera Oct 2003 B1
6643650 Slaughter et al. Nov 2003 B1
6654734 Mani et al. Nov 2003 B1
6654932 Bahrs et al. Nov 2003 B1
6658623 Schilit et al. Dec 2003 B1
6687485 Hopkins et al. Feb 2004 B2
6694307 Julien Feb 2004 B2
6697824 Bowman-Amuah Feb 2004 B1
6697837 Rodov Feb 2004 B1
6708189 Fitzsimons et al. Mar 2004 B1
6715144 Daynes et al. Mar 2004 B2
6717593 Jennings Apr 2004 B1
6718516 Claussen et al. Apr 2004 B1
6728679 Strubbe et al. Apr 2004 B1
6732090 Shanahan et al. May 2004 B2
6732361 Andreoli et al. May 2004 B1
6741994 Kang et al. May 2004 B1
6742054 Upton, IV May 2004 B1
6745208 Berg et al. Jun 2004 B2
6766326 Cena Jul 2004 B1
6795808 Strubbe et al. Sep 2004 B1
6802061 Parthasarathy et al. Oct 2004 B1
6826726 Hsing et al. Nov 2004 B2
6829631 Forman et al. Dec 2004 B1
6845499 Srivastava et al. Jan 2005 B2
6857103 Wason Feb 2005 B1
6859908 Clapper Feb 2005 B1
6868625 Szabo Mar 2005 B2
6874125 Carroll et al. Mar 2005 B1
6874143 Murray et al. Mar 2005 B1
6880129 Lee et al. Apr 2005 B1
6883137 Girardot et al. Apr 2005 B1
6898604 Ballinger et al. May 2005 B1
6901402 Corston-Oliver et al. May 2005 B1
6904560 Panda Jun 2005 B1
6925457 Britton et al. Aug 2005 B2
6925470 Sangudi et al. Aug 2005 B1
6944857 Glaser et al. Sep 2005 B1
6948133 Haley Sep 2005 B2
6950831 Haley Sep 2005 B2
6950982 Dourish Sep 2005 B1
6957385 Chan et al. Oct 2005 B2
6963867 Ford et al. Nov 2005 B2
6964010 Sharp Nov 2005 B1
6975983 Fortescue et al. Dec 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6976209 Storisteanu et al. Dec 2005 B1
6981212 Claussen et al. Dec 2005 B1
6986104 Green et al. Jan 2006 B2
6990654 Carroll, Jr. Jan 2006 B2
7003522 Reynar et al. Feb 2006 B1
7013289 Horn et al. Mar 2006 B2
7024658 Cohen et al. Apr 2006 B1
7028312 Merrick et al. Apr 2006 B1
7032174 Montero et al. Apr 2006 B2
7039859 Sundaresan May 2006 B1
7051076 Tsuchiya May 2006 B2
7082392 Butler et al. Jul 2006 B1
7100115 Yennaco Aug 2006 B1
7113976 Watanabe Sep 2006 B2
7146564 Kim et al. Dec 2006 B2
7216351 Maes May 2007 B1
7237190 Rollins et al. Jun 2007 B2
7281245 Reynar et al. Oct 2007 B2
7302634 Lucovsky et al. Nov 2007 B2
7305354 Rodriguez et al. Dec 2007 B2
7392479 Jones et al. Jun 2008 B2
7421645 Reynar Sep 2008 B2
7454459 Kapoor et al. Nov 2008 B1
20010029605 Forbes et al. Oct 2001 A1
20010041328 Fisher Nov 2001 A1
20010042098 Gupta et al. Nov 2001 A1
20010049702 Najmi Dec 2001 A1
20010056461 Kampe et al. Dec 2001 A1
20020002590 King et al. Jan 2002 A1
20020003469 Gupta Jan 2002 A1
20020003898 Wu Jan 2002 A1
20020004803 Serebrennikov Jan 2002 A1
20020007309 Reynar Jan 2002 A1
20020023113 Hsing et al. Feb 2002 A1
20020023136 Silver et al. Feb 2002 A1
20020026450 Kuramochi Feb 2002 A1
20020029304 Reynar et al. Mar 2002 A1
20020035581 Reynar et al. Mar 2002 A1
20020038180 Bellesfield et al. Mar 2002 A1
20020065110 Enns et al. May 2002 A1
20020065891 Malik May 2002 A1
20020066073 Lienhard et al. May 2002 A1
20020078222 Compas et al. Jun 2002 A1
20020091803 Imamura et al. Jul 2002 A1
20020099687 Krishnaprasad et al. Jul 2002 A1
20020100036 Moshir et al. Jul 2002 A1
20020103829 Manning et al. Aug 2002 A1
20020104080 Woodard et al. Aug 2002 A1
20020110225 Cullis Aug 2002 A1
20020111928 Haddad Aug 2002 A1
20020120685 Srivastava et al. Aug 2002 A1
20020129107 Loughran et al. Sep 2002 A1
20020133523 Ambler et al. Sep 2002 A1
20020149601 Rajarajan et al. Oct 2002 A1
20020156774 Beauregard et al. Oct 2002 A1
20020156792 Gombocz et al. Oct 2002 A1
20020169802 Brewer et al. Nov 2002 A1
20020175955 Gourdol et al. Nov 2002 A1
20020178008 Reynar Nov 2002 A1
20020178182 Wang et al. Nov 2002 A1
20020184247 Jokela et al. Dec 2002 A1
20020188941 Cicciarelli et al. Dec 2002 A1
20020196281 Audleman et al. Dec 2002 A1
20020198909 Huynh et al. Dec 2002 A1
20030002391 Biggs Jan 2003 A1
20030005411 Gerken Jan 2003 A1
20030009489 Griffin Jan 2003 A1
20030014745 Mah et al. Jan 2003 A1
20030025728 Ebbo et al. Feb 2003 A1
20030046316 Gergic et al. Mar 2003 A1
20030050911 Lucovsky et al. Mar 2003 A1
20030051236 Pace et al. Mar 2003 A1
20030056207 Fischer et al. Mar 2003 A1
20030081791 Erickson et al. May 2003 A1
20030083910 Sayal et al. May 2003 A1
20030084138 Tavis et al. May 2003 A1
20030097318 Yu et al. May 2003 A1
20030101190 Horvitz et al. May 2003 A1
20030101204 Watson May 2003 A1
20030101416 McInnes et al. May 2003 A1
20030106040 Rubin et al. Jun 2003 A1
20030115039 Wang Jun 2003 A1
20030121033 Peev et al. Jun 2003 A1
20030126136 Omoigui Jul 2003 A1
20030140308 Murthy et al. Jul 2003 A1
20030154144 Pokorny et al. Aug 2003 A1
20030158841 Britton et al. Aug 2003 A1
20030158851 Britton et al. Aug 2003 A1
20030167445 Su et al. Sep 2003 A1
20030172343 Leymaster et al. Sep 2003 A1
20030177341 Devillers Sep 2003 A1
20030182391 Leber et al. Sep 2003 A1
20030192040 Vaughan Oct 2003 A1
20030195937 Kircher et al. Oct 2003 A1
20030212527 Moore et al. Nov 2003 A1
20030220795 Aryasantiparb et al. Nov 2003 A1
20030229593 Raley et al. Dec 2003 A1
20030233330 Raley et al. Dec 2003 A1
20040002939 Arora et al. Jan 2004 A1
20040003389 Reynar et al. Jan 2004 A1
20040006564 Lucovsky et al. Jan 2004 A1
20040006741 Radja et al. Jan 2004 A1
20040024875 Horvitz et al. Feb 2004 A1
20040039990 Bakar et al. Feb 2004 A1
20040044959 Shanmugasundaram et al. Mar 2004 A1
20040068694 Kaler et al. Apr 2004 A1
20040083218 Feng Apr 2004 A1
20040133846 Khoshatefeh et al. Jul 2004 A1
20040143581 Bohannon et al. Jul 2004 A1
20040165007 Shafron Aug 2004 A1
20040199861 Lucovksy Oct 2004 A1
20040201867 Katano Oct 2004 A1
20040236717 Demartini et al. Nov 2004 A1
20050050164 Burd et al. Mar 2005 A1
20050055330 Britton et al. Mar 2005 A1
20050094850 Nakao May 2005 A1
20050108195 Yalovsky et al. May 2005 A1
20050120313 Rudd et al. Jun 2005 A1
20050187926 Britton et al. Aug 2005 A1
20060173674 Nakajima et al. Aug 2006 A1
Foreign Referenced Citations (36)
Number Date Country
2 246 920 Mar 2000 CA
ZL 200410005390.8 Oct 2008 CN
0 364 180 Apr 1990 EP
0481784 Apr 1992 EP
0598511 May 1994 EP
0872827 Oct 1998 EP
0810520 Dec 1998 EP
1093058 Apr 2001 EP
1280068 Jan 2003 EP
1361523 Nov 2003 EP
1376392 Jan 2004 EP
1 447 754 Aug 2004 EP
1 452 966 Sep 2004 EP
05-174013 Jul 1993 JP
08-272662 Oct 1996 JP
09-138636 May 1997 JP
10-171827 Jun 1998 JP
2000-222394 Aug 2000 JP
2000-231566 Aug 2000 JP
2001-014303 Jan 2001 JP
2001-125994 May 2001 JP
2001-522112 Nov 2001 JP
2001-0350464 Dec 2001 JP
2002-041353 Feb 2002 JP
2002-222181 Aug 2002 JP
2003-141174 May 2003 JP
WO 9507510 Mar 1995 WO
WO 9917240 Apr 1999 WO
WO 0067117 Nov 2000 WO
WO 0073949 Dec 2000 WO
WO 0118687 Mar 2001 WO
WO 0137170 May 2001 WO
WO 0186390 Nov 2001 WO
WO 0299627 Jan 2002 WO
WO 0215518 Feb 2002 WO
WO 0242928 May 2002 WO