Abstract: A method is provided for forming a reconstructed parse structure for an initial parse structure. Under the method, at least one rule used to form the initial parse structure and at least one additional rule are executed to form the reconstructed parse structure. In many embodiments, the reconstructed parse structure differs from the initial parse structure in that a node is located in a different position in the reconstructed parse structure than in the initial parse structure.

Abstract: A natural language parse ranker of a natural language processing (NLP) system employs a goodness function to rank the possible grammatically valid parses of an utterance. The goodness function generates a statistical goodness measure (SGM) for each valid parse The parse ranker orders the parses based upon their SGM values. It presents the parse with the greatest SGM value as the one that most likely represents the intended meaning of the speaker. The goodness function of this parse ranker is highly accurate in representing the intended meaning of a speaker. It also has reasonable training data requirements. With this parse ranker, the SGM of a particular parse is the combination of all of the probabilities of each node within the parse tree of such parse. The probability at a given node is the probability of taking a transition (“grammar rule”) at that point.

Abstract: A method and parser are provided that generate a score for a node identified during a parse of a text segment. The score is based on a mutual information score that measures the mutual information between a phrase level for the node and a word class of at least one word in the text segment.

Abstract: A natural language parse ranker of a natural language processing (NLP) system employs a goodness function to rank the possible grammatically valid parses of an utterance. The goodness function generates a statistical goodness measure (SGM) for each valid parse. The parse ranker orders the parses based upon their SGM values. It presents the parse with the greatest SGM value as the one that most likely represents the intended meaning of the speaker. The goodness function of this parse ranker is highly accurate in representing the intended meaning of a speaker. It also has reasonable training data requirements. With this parse ranker, the SGM of a particular parse is the combination of all of the probabilities of each node within the parse tree of such parse. The probability at a given node is the probability of taking a transition (“grammar rule”) at that point.

Abstract: The present invention is a named entity (NE) interface to a linguistic analysis layer. The interface exposes each input sentence to the NE recognizers of all applications and returns all recognized NEs. Thus, the present invention can accommodate NEs which dynamically change in the applications, because each input string will be handed to the applications for NE recognition. The present invention also includes a data structure which is a normalized form of recognized NEs.

Abstract: A system for developing semantic schema for natural language processing has a semantic runtime engine and a semantic authoring tool. The semantic runtime engine is adapted to map a natural language input to a semantic schema and to return the mapped results to an application domain. The semantic authoring tool is adapted to receive user input for defining the semantic schema and to interact with the semantic runtime engine to test the semantic schema against a query.

Abstract: A natural language parse ranker of a natural language processing (NLP) system employs a goodness function to rank the possible grammatically valid parses of an utterance. The goodness function generates a statistical goodness measure (SGM) for each valid parse. The parse ranker orders the parses based upon their SGM values. It presents the parse with the greatest SGM value as the one that most likely represents the intended meaning of the speaker. The goodness function of this parse ranker is highly accurate in representing the intended meaning of a speaker. It also has reasonable training data requirements. With this parse ranker, the SGM of a particular parse is the combination of all of the probabilities of each node within the parse tree of such parse. The probability at a given node is the probability of taking a transition (“grammar rule”) at that point.

Abstract: A natural language parse ranker of a natural language processing (NLP) system employs a goodness function to rank the possible grammatically valid parses of an utterance. The goodness function generates a statistical goodness measure (SGM) for each valid parse. The parse ranker orders the parses based upon their SGM values. It presents the parse with the greatest SGM values as the one that most likely represents the intended meaning of the speaker. The goodness function of this parse ranker is highly accurate in representing the intended meaning of a speaker. It also has reasonable training data requirements. With the parse ranker, the SGM of a particular parse is the combination of all of the probabilities of each node within the parse tree of such parse. The probability at a given node is the probability of taking a transition (“grammar rule”) at that point.

Abstract: A method is provided for forming a reconstructed parse structure for an initial parse structure. Under the method, at least one rule used to form the initial parse structure and at least one additional rule are executed to form the reconstructed parse structure. In many embodiments, the reconstructed parse structure differs from the initial parse structure in that a node is located in a different position in the reconstructed parse structure than in the initial parse structure.

Abstract: The present invention is a named entity (NE) interface to a linguistic analysis layer. The interface exposes each input sentence to the NE recognizers of all applications and returns all recognized NEs. Thus, the present invention can accommodate NEs which dynamically change in the applications, because each input string will be handed to the applications for NE recognition. The present invention also includes a data structure which is a normalized form of recognized NEs.

Abstract: A method and parser are provided that generate a score for a node identified during a parse of a text segment. The score is based on a mutual information score that measures the mutual information between a phrase level for the node and a word class of at least one word in the text segment.

Abstract: An improved natural language parser uses a template set to identify predefined parse conditions and to implement responsive actions, thus reducing processing time while increasing parse tree accuracy. The template set is used to identify predefined conditions of the current parse state, an input span, and the history of the parse process. Once a template has been matched, the improved parser implements associated responsive actions to reduce the parse time typically associated with parsing an input span under the identified conditions. This on-the-fly implementation of responsive actions permits the parser to focus the parse process on the portions of the input span most likely to generate the complete and accurate parse in the shortest amount of time.

Abstract: The stack pointer register in a computer is made available for general purpose use by programs executing at lower privilege levels than interrupt handlers. A set of instructions in such programs, excluding stack operations, stores data other than the stack pointer, such as operands, and the like, in the stack pointer register. When switching execution to an interrupt handler on an interrupt, return address data for the currently executing program is pushed onto a stack at the interrupt handler's privilege level. Thus, storing other data in the stack pointer register does not result in stack corruption. Also, these instructions can store data in a scratch portion of a stack segment beyond the current stack pointer.

Abstract: A method and system for operating a server with a plurality of clients is provided. In a preferred embodiment of the present invention, the server is designed to provide a service to an activated client. The service provided is comprised of both common steps and a behavior group. The behavior group includes alternative behaviors, each of which corresponds to a series of steps that are only a portion of the steps designed to be executed when the service is requested by a single group of clients. The common steps are steps designed to be executed for all of the clients. An indicium is associated with the activated client. The indicium indicates which of the alternative behaviors is to be provided to the activated client. When the activated client requests the service from the server, the indicium associated with the activated client is checked. The series of steps corresponding to the alternative behavior indicated by the checked indicium are then executed. The common steps are also executed.

Abstract: A user of a host computer creates a document and embeds in the document a font file used to create the document. The user then transfers the document, along with the embedded font file, to a remote computer. The remote computer processes the document using the embedded font file. If the embedded font file contains a preview and print type of font, then the remote computer allows users to preview the document on a display screen and to print the document on a printer using the embedded font. However, the preview and print type of font does not allow the user to modify the document. If the embedded font file contains an editable type of font, then the remote computer allows the user to modify the document, save the modified document to an original file name, and print the modified document on the printer. However, the editable type of font does not allow the user to save the document under a file name different from the original file name.

Abstract: A method and system for generating a dither pattern for a specified color is provided. In a preferred embodiment of the present invention, a system generates a dither pattern corresponding to a specified RGB value. The dither pattern contains a specified number of pels, each pel capable of being set to each color in a set of active colors. Each active color has a corresponding RGB value. Each RGB value is defined as a point in a three dimensional coordinate system having a red, green, and blue component. The coordinate system has a plurality of non-overlapping, spaces with each vertex representing an active color. One space is designated as a mapping space. The system maps the specified RGB value to the mapping space from an original space containing the specified RGB value. The system then determines the four active colors whose corresponding RGB values are closest to the mapped RGB value.