Abstract: The different advantageous embodiments provide a system for text discrimination comprising a word recognizer and control logic. The word recognizer has language data compiled using a number of finite state automata. The control logic is configured to operate the word recognizer to accept or reject a number of characters as a word.

Abstract: Methods, apparatus and computer program products are provided in order to assess a translation following performance of the translation. The methods, apparatus and computer program products may determine input segments of a source language document that may prove to be problematic from a translatability standpoint, such as the input segments of the source language document that may have multiple output variants. As such, methods, apparatus and computer program products may provide feedback to the author or owner of the source language document that may influence the generation of subsequent source language documents so as to have improved translatability.

Abstract: The different advantageous embodiments provide a system for text discrimination comprising a word recognizer and control logic. The word recognizer has language data compiled using a number of finite state automata. The control logic is configured to operate the word recognizer to accept or reject a number of characters as a word.

Abstract: Systems and methods for examining text, such as incident reports, are disclosed. In one embodiment, a method includes specifying a client profile including at least one scenario of interest, the scenario of interest being formulated in an event calculus formalism; analyzing a portion of text for relevant information at least partially described by the scenario of interest; detecting relevant information including detecting a positive match between at least part of information relevant to the scenario of interest and at least part of the portion of text being analyzed; upon detecting such relevant information, extracting the relevant information; representing the extracted relevant information in the event calculus formalism; and performing an inference process on the extracted relevant information represented in the event calculus formalism.

Abstract: Systems and methods for performing schema matching of multiple data dictionaries. Lexical graphs are generated for two or more data dictionaries. The lexical graphs include terms with definitions and identified links between terms. A data processing device determines if matches occur between the generated lexical graphs and outputs the result of the determination.

Abstract: A system and method are provided for viewing a data dictionary's structure. The system includes a processor coupled to a database and a display. The processor determines all lexical nodes of a retrieved data dictionary that includes terms and term definitions, then parses each term's definition. Next, the processor determines dependencies of each lexical node based on the parsed definitions and the terms associated with the other lexical nodes, and generates a lexical graph based on the determined lexical nodes and the determined dependencies. Then, at least a portion of the generated lexical graph is presented on the display.

Abstract: Systems and methods for examining text, such as incident reports, are disclosed. In one embodiment, a method includes specifying a client profile including at least one scenario of interest, the scenario of interest being formulated in an event calculus formalism; analyzing a portion of text for relevant information at least partially described by the scenario of interest; detecting relevant information including detecting a positive match between at least part of information relevant to the scenario of interest and at least part of the portion of text being analyzed; upon detecting such relevant information, extracting the relevant information; representing the extracted relevant information in the event calculus formalism; and performing an inference process on the extracted relevant information represented in the event calculus formalism.

Abstract: Systems and methods for performing schema matching of multiple data dictionaries. Lexical graphs are generated for two or more data dictionaries. The lexical graphs include terms with definitions and identified links between terms. A data processing device determines if matches occur between the generated lexical graphs and outputs the result of the determination.

Abstract: A system and method are provided for viewing a data dictionary's structure. The system includes a processor coupled to a database and a display. The processor determines all lexical nodes of a retrieved data dictionary that includes terms and term definitions, then parses each term's definition. Next, the processor determines dependencies of each lexical node based on the parsed definitions and the terms associated with the other lexical nodes, and generates a lexical graph based on the determined lexical nodes and the determined dependencies. Then, at least a portion of the generated lexical graph is presented on the display.