Abstract: A resilient classifier for using with a rule-based system is provided. A system for classifying data for a rule-based system, may include: a system(s) for generating two training data sets, one data set is generated from input data while the second data set is generated from disturbed data; a system for merging the two training data sets; and a system for training a data classifier with the merged training data sets. As a result, the classification of data becomes more accurate, including when disturbed data is encountered.

Abstract: An unknown annotator and its annotation type system are compared against a reference annotation type system. The comparison is done by providing a plurality of documents, and annotating each document using the reference set of document annotators, producing instances of reference annotation types, to generate a pre-annotated reference document set, and using the subject annotator and its subject annotation type system to generate a pre-annotated evaluation document set. Documents in the pre-annotated evaluation document set are compared to documents in the pre-annotated reference document set, and matches in location, within the compared documents, of instances of the subject annotation types and the reference annotation types are identified. Based on the matching data, reference document annotation types are selected that sufficiently correlate with the subject annotation type system.

Abstract: Systems and methods are provided for building and implementing ontology-based information resources. More specifically, multi-user collaborative, semi-automatic systems and methods are provided for constructing ontology-based information resources that are shared by a community of users, wherein ontology categories evolve over time based on categorization rules that are specified by the community of users as well as categorization rules that are automatically learned from knowledge obtained as a result of multi-user interactions and categorization decisions.

Abstract: A system and method for processing data includes organizing medical information in a concept frame data structure, which is adapted to include medical measurements and related metadata. The medical information is analyzed to extract further information using information extractors and to store extracted medical information in the concept frame data structure. References are stored to appropriate visualization methods along with an associated concept in the concept frame data structure.

Abstract: Disclosed is a method and apparatus for operating a search system for searching a search space containing domains each representing a collection of related documents. The method includes establishing a domain characterization model (DCM) that includes a DCM index containing keywords and, for each keyword, an identification of a domain where the keyword is found. In response to an original search query, the method forms one or a plurality of enhanced search queries in accordance with the DCM for searching a plurality of domains. Each enhanced search query is formed for searching a particular targeted domain and contains the original search query and at least one keyword associated with the particular domain. The search results are clustered and are displayed so as to be organized by the domains that were searched. The top search results returned in response to each enhanced search query belong to one of the targeted domains.

Abstract: Under the present invention, a best practice violation (BPV) engine resource is first built. This typically occurs by: receiving sets of source code from a plurality of sources; detecting a programming language of each of the sets of source code; extracting code patterns from the sets of source code; defining meta data for each code pattern that indicates a quality; classifying each code pattern; and assigning a rank to each of the code pattern based on its corresponding meta data as well as a skill level and an experience level of the developer. Once the BPV engine resource is built, it will be used to detect best practice violations in other sets of source code.

Abstract: Under the present invention, a best practice violation (BPV) engine resource is first built. This typically occurs by: receiving sets of source code from a plurality of sources; detecting a programming language of each of the sets of source code; extracting code patterns from the sets of source code; defining meta data for each code pattern that indicates a quality thereof, classifying each code pattern; and assigning a rank to each of the code pattern based on it's corresponding meta data as well as a skill level and an experience level of the developer thereof. Once the BPV engine resource is built, it will be used to detect best practice violations in other sets of source code.

Abstract: A resilient classifier for using with a rule-based system is provided. A system for classifying data for a rule-based system, may include: a system(s) for generating two training data sets, one data set is generated from input data while the second data set is generated from disturbed data; a system for merging the two training data sets; and a system for training a data classifier with the merged training data sets. As a result, the classification of data becomes more accurate, including when disturbed data is encountered.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: A random document is stripped of the relevant search terms to generate a non-relevant document. The relevant search terms are formed into grammatically correct but not necessarily technically correct sentences. The grammatically correct sentences are placed at the beginning of the random document in one pass through the system in the middle of a document in a second pass through the system and at the end of the document in a third pass through the system. A relevancy vector chart is computed using the references documents and a known relevancy algorithm relating to position of search terms. The results obtained from search engines are compared to the relevancy vector chart to determine the relative relevancy of the returned search results from the search engines.

Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.

Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.

Abstract: Techniques are presented for automatically selecting information sources that are most relevant to user queries. Results of searches returned by information sources for queries are analyzed and the information sources are ranked based on this analysis. The information sources that have high rankings for a query are subsequently used to search for relevant results. This process can be adaptive, as the returned results of old queries can be analyzed at a later date to update the ranking of the information sources, automatic searches can be performed to update the ranking of the information sources, new queries can be used for analysis and stored, new information sources added, and old information sources deleted. A linguistic library is used to store personal categories for one or more users and general categories. Each category is associated with keywords and ranked lists of information sources. The library also contains general categories, taxonomies, and dictionaries.

Abstract: A system and method of searching a database in which documents of different languages are included. The system includes a synonym or keyword dictionary which is bi-directional and allows for translation of keywords between a first language and other languages. The translated words keywords for the document are stored in an inverted index which is then used for searching, either in a selected language, a second language or in all languages, as determined by the user. This use of multiple searching and a translated synonym dictionary avoids the need for translation of the entire document and avoids inaccuracies which may result from translations.

Abstract: An unknown annotator and its annotation type system are compared against a reference annotation type system. The comparison is done by providing a plurality of documents, and annotating each document using the reference set of document annotators, producing instances of reference annotation types, to generate a pre-annotated reference document set, and using the subject annotator and its subject annotation type system to generate a pre-annotated evaluation document set. Documents in the pre-annotated evaluation document set are compared to documents in the pre-annotated reference document set, and matches in location, within the compared documents, of instances of the subject annotation types and the reference annotation types are identified. Based on the matching data, reference document annotation types are selected that sufficiently correlate with the subject annotation type system.

Abstract: A document search and retrieval system and program product therefor. Search requests are provided to the system through a user interface. A document decomposer decomposes documents into individual document components. Document components and corresponding searchable indices for each are stored in a Component Library. A search unit searches stored document components responsive to search queries. A results validator compares document hitlists with a document type identified in a search query to select valid hitlists entries for a final hitlist. A document view assembly module collects identified document components and assembles them into a document for view at the user interface.

Abstract: Under the present invention source code can be shared among nodes in a peer-to-peer network. Specifically, source code to be shared will first be analyzed to identify a set of code patterns, assigned one or more predetermined categories based on the set of code patterns, and then selectively indexed. A developer desiring to use previously created source code when creating a new program can perform a context dependent search based on his/her working code to identify and retrieve relevant source code.

Abstract: Search time is reduced with a search engine that includes a bi-directional inverted index facility which can be accessed with a keyword search in one of a number of languages and provide a listing of documents contained in all of those languages. The keywords in all supported languages are preferably stored in an inverted index lookup table cross referenced to documents in those language containing the keywords. Keywords with the same meaning in different languages are accessible together when that keyword in one of the languages is queried. The search engine containing the table can identify pertinent documents either in a selected language, a second language or in all supported languages, as determined by the user. Information about each document can include not only the identity of the document but also information used in ranking the documents such as the number of times that a keyword appears in that document, and the keywords proximity to other keywords.

Abstract: A document search and retrieval system and program product therefor. Search requests are provided to the system through a user interface. A document decomposer decomposes documents into individual document components. Document components and corresponding searchable indices for each are stored in a Component Library. A search unit searches stored document components responsive to search queries. A results validator compares document hitlists with a document type identified in a search query to select valid hitlists entries for a final hitlist. A document view assembly module collects identified document components and assembles them into a document for view at the user interface.