Abstract: In some implementations, a user device can coordinate adjustments to a composite GUI generated in cooperation with an accessory device that presents the composite graphical user interface. For example, the user device can receive configuration data that defines the maximum GUI display area (e.g., size, dimensions) of the accessory device, various view areas within the GUI display area of the accessory device into which the user device can render GUIs, and/or transitions between the various view areas. The user device can generate a display buffer based on the maximum GUI display area, generate a graphical user interface in an area of the buffer corresponding to a current view area specified by the accessory device, and send to the accessory device video frames corresponding to the display buffer. The accessory device can generate a composite GUI based on the received video frames that include the user device generated GUI.

Abstract: Techniques for automatic proofing of textual data is described. In one embodiment, these techniques are directed towards producing proofed textual data for various operational environments via logic operative on a logic circuit to access information comprising a set of n-grams, at least one mapping between at least one replacement n-gram and a corresponding n-gram in the set of n-grams, and a corresponding confidence score for each mapping being determined by user activity while producing text for various applications; process input to a productivity application comprising textual data and identify a portion thereof to replace based upon the accessed information; and automatically modify the portion of the textual data using a replacement n-gram selected from the replacement n-grams based upon a corresponding confidence score between the portion of the textual data and the replacement n-gram. Other embodiments are described and claimed.

Abstract: Techniques for automatic proofing of textual data is described. In one embodiment, these techniques are directed towards producing proofed textual data for various operational environments via logic operative on a logic circuit to access information comprising a set of n-grams, at least one mapping between at least one replacement n-gram and a corresponding n-gram in the set of n-grams, and a corresponding confidence score for each mapping being determined by user activity while producing text for various applications; process input to a productivity application comprising textual data and identify a portion thereof to replace based upon the accessed information; and automatically modify the portion of the textual data using a replacement n-gram selected from the replacement n-grams based upon a corresponding confidence score between the portion of the textual data and the replacement n-gram. Other embodiments are described and claimed.

Abstract: A system and methods of language identification of natural language text are presented. The system includes stored expected character counts and variances for a list of characters found in a natural language. Expected character counts and variances are stored for multiple languages to be considered during language identification. At run-time, one or more languages are identified for a text sample based on comparing actual and expected character counts. The present methods can be combined with upstream analyzing of Unicode ranges for characters in the text sample to limit the number of languages considered. Further, n-gram methods can be used in downstream processing to select the most probable language from among the languages identified by the present system and methods.

Abstract: A data structure for a word lexicon includes a plurality of separate data sections for storing information related to word entries. An indices section includes pointers indicating the location of the information. The location of the associated pointers for each word entry is obtained as a function of a list of the word entries.

Abstract: A method of determining the component words of a compound word is disclosed. The method identifies the component words, by comparing the word with a list of words found in a lexicon. If the word is not found in the lexicon the method proceeds to analyze the word on a character-by-character basis. After each character the method identifies any potential matches to the selected characters in the lexicon. If a match is found, it is added to a hypothesis trace in a lattice. Next, the method checks to see whether the remaining characters form a valid entry in the lexicon, and whether the entry is allowed to be a final segment.

Abstract: A lexicon stored on a computer readable medium and used by language processing systems. The lexicon can store word information in a plurality of data fields associated with each entered word. The data fields can include information on spelling and grammar, parts of speech, steps that the entered word can be transformed into another word, a word description, and a segmentation for a compound word. Information that cannot be stored in the lexicon can be stored in an intermediate indexes table. Associated methods of constructing, updating and using the lexicon are introduced.

Abstract: The present invention provides an interface and associated object model that exposes a comprehensive set of natural language processing features to an application developer. In one embodiment, the features include lexicon management services and proofing services.

Abstract: A computer-readable medium stores a first lexicon data structure for lexicon words. The first data structure includes a host form variant field containing a host form variant such as a clitic host form variant, a host form field containing the host form of the host form variant (only present if the forms differ) such as a clitic host verbal form, and a verification field indicative of whether the host form variant is a valid word. The first data structure also includes a segment association field containing data or segmentation bits associating the host form variant with certain types of attachment entries in the lexicon, which also contain data or segmentation bits, to define valid combinations between the host form variant and at least one of the attachment entries in the lexicon. A second lexicon data structure for each of the attachment entries in the lexicon is also stored.

Abstract: A method of identifying definitions in documents includes receiving text units as an input. Which of the text units includes a cue phrase is then identified. For text units identified as including a cue phrase, localized parsing is performed around the cue phrase to determine whether the text unit including the cue phrase contains a definition.

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 computer implemented method of analyzing input text includes comparing transitions in the input text and the transition in a rule engine. The method also includes determining whether the transition in the input text is found in the rule engine based on a character found in a morpheme in the rule engine and at least one of the input texts being associated with an inflected variation as a function of rules and a word boundary as a function of rules.

Abstract: A data structure for a word lexicon includes a plurality of separate data sections for storing information related to word entries. An indices section includes pointers indicating the location of the information. The location of the associated pointers for each word entry is obtained as a function of a list of the word entries.

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.