International Business Machines Corporation

Newisys, Inc.

David A Garrison

Robert John Urquhart

Mary Susan Neff

Susan C Williams

James K Landis

Veronica A Bonebrake

Vance R Bass

Richard Ormond Simpson

Yiqin Zhao

One embodiment of the disclosures made herein is a data processing system adapted for enabling at least one of presence and operating condition of system components installed in the data processing system to be monitored. Examples of presence include installed and uninstalled. Examples of operating conditions include temperature, voltage, current, duty-cycle, etc. The data processing system includes provides a user interface adapted for displaying a 1:1 mapped representation of the data processing system. Operating conditions of installed system components may be assessed via the user interface. A system component that is installed in its respective location in the data processing system (e.g., in a particular socket) is depicted in the 1:1 mapped representation of the data processing system as being installed in a corresponding location of the data processing system. After performing an operation for installing a particular system component in its respective location of the data processing system (e.g., adding additional memory in an empty memory slot), the user interface is updated automatically to depict the particular system component as being installed in a corresponding location in the 1:1 mapped representation of the data processing system. A displayed system component representation of a failed or failing system component may be highlighted in the user interface for aiding in identifying the failed of failing system component.

Method and equipment adapted for monitoring system components of a data processing system

A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During attempted verfication of a text word, all initial substrings of the word found in the dictionary are saved in a list. If the entire word is not found in the dictionary, the longest substring in the substring list is subtracted from the entire word to be verified to yield a 'remainder' portion of the input text word. The dictionary words are then compared with this remainder portion to determine if a match occurs. If so, then both portions of the word are found in the dictionary and spelling of the word is considered correct. If the remainder is not found in the dictionary, successively shorter initial substrings are accessed to yield successively longer remainders. The word is considered correctly spelled if both a substring and a remainder are found in the dictionary. This techinque is applied recursively so that multiple-piece compounds can also be found.

Compound word spelling verification

A compound word spelling verification technique is described for use with a dictionary which does not include all verifiable compounds. During verification of a text word, an attempt is made to find a pair of words in the dictionary of which the text word consists. A table associated with the dictionary includes compound class information relative to each of the words stored therein. The compound class of each of the pair of words of which the input text word consists are tested for compatibility to determine if each of the pair of words may acceptably be used in a compound word in the physical position in which it is found in the input text word.

Compound word suitability for spelling verification

Growing community of inventors

Austin, TX, United States of America

David A Garrison