Xerox Corporation

Jean-Pierre Chanod

Jean-Yves Vion-Dury

Eric Gaussier

Gregory T Grefenstette

Thierry Jacquin

Salah Ait-Mokhtar

Jean-Luc Meunier

Marc Dymetman

Claude Roux

Christopher Thompson

Fr&eacute;d&eacute;rique Segond

A system and method generate an ontology of linked resources. The method includes providing a policy comprising at least one logical rule which is to hold across an ontology of linked resources and initializing a set of resources with an initial subset of the set of resources, each resource in the initial subset being identified by a respective link. Each of the resources in the subset is processed, which includes populating the ontology with a corresponding member of a resource class, for a resource that is valid against a schema, asserting the member's class as a class specific to the schema of the validated resource in the ontology and providing a dependency specification for extracting links within the resource, each extracted link identifying one of the set of resources. A link property is asserted in the ontology for a link between the resource of the subset containing an extracted link and the resource identified by the extracted link and the ontology populated with a member of the resource class for each newly identified resource. A verification that the at least one logical rule holds across the set of resources in the ontology is performed.

Enforcing policies over linked XML resources

A computer-based method and system for processing links in a markup language document are provided. The method includes providing a specification in computer memory, the specification including at least one link description rule and at least one link processing rule for processing links which satisfy the link description rule. A markup language document is input to computer memory and links in the markup language document are processed in accordance with the link description rule(s) and link processing rule(s) of the specification to generate processed data. The processed data includes at least one of a modified markup language document and data derived from the markup language document.

Method and system for handling references in markup language documents

Systems and methods are described that facilitate validating electronic document conversion chain design in real time, as a designer edits a conversion chain that converts a document collection between formats. Waypoints are inserted into the document conversion chain by associating validation specifications with selected conversion components in the chain. AS the conversion chain is executed on a document collection, the validation specification is executed on all documents in the collection when a selected conversion component is executed. Validation results are returned to indicate to the designer which documents were successfully converted by the component and which were not. The designer can then modify the conversion chain, which is re-executed, and validation results are again presented to the designer for comparison to the pre-modification validation results. The designer can then approve or reject the modification(s) depending on whether document validation is improved thereby.

Validation assisted document conversion design

An SGML validation system comprises: an XML validation engine; a translator configured to convert an SGML document to a translated XML document; a set of XML schemas against which the XML validation engine validates the translated XML document, the XML schema set configured such that errors detected by the validation of the translated XML document correspond to SGML errors in the SGML document; and a report generator configured to generate an error report identifying SGML errors corresponding with errors detected by the validation and linking the identified SGML errors with corresponding locations in the SGML document.

SGML document validation using XML-based technologies

In a document annotator (), a document converter () is configured to convert a source document () with a layout to a deterministic format () including content and layout metadata. At least one annotation pipeline () is configured to generate document annotations respective to received content. A merger () is configured to associate the generated document annotations with positional tags based on the layout metadata, which locate the document annotations in the layout. A document visualizer () is configured to render at least some content of the deterministic format and one or more selected annotations () in substantial conformance with the layout based on the layout metadata and the positional tags associated with the selected one or more annotations ().

Visualizing document annotations in the context of the source document

A document rendering system includes a standard schema and a graphical user interface configured to receive graphically represented presentation constraints. A translation engine is configured to translate the graphically represented presentation constraints into a presentation schema conforming with a syntax of the standard schema. A validation engine is configured to validate a document respective to the standard schema and respective to the presentation schema. A rendering engine is configured to render a document conditional upon validation by the validation engine.

Method for generating presentation oriented XML schemas through a graphical user interface

The present invention provides a method and a parser for syntactically analyzing an input string. The parser applies a plurality of rules which describe syntactic properties of the language of the input strings. The plurality of rules comprise two types of rules. A first type of rules comprises immediate dominance rules and linear precedence rules. A second type of rules being sequence rules. All rules of the plurality of rules are applied according to a predefined order to the input string. This new incremental parsing architecture has advantages with respect to grammar engineering and allows a more efficient parsing.

Natural language parser

A method generates normalized representations of strings, in particular sentences. The method, which can be used for translation, receives an input string. The input string is subjected to a first operation out of a plurality of operating functions for linguistically processing the input string to generate a first normalized representation of the input string that includes linguistic information. The first normalized representation is then subjected to a second operation for replacing linguistic information in the first normalized representation by abstract variables and to generate a second normalized representation.

Method and apparatus for generating normalized representations of strings

The present invention provides a method and system that utilize a collection of predefined core sentences in a source language, that may be initially accessed through a thematic hierarchy or through key words. New sentences may be recursively elaborated through transformations of a selected core sentence, that comprise substitution and expansion. In accordance With the present invention, the method and system automatically handle syntactic modifications of an interlingual structure, that are implied by a selected transformation. Each transformation establishes a valid new sentence in the source language. The method and system further generate a corresponding translation into any available target language.

Interactive translation system and method

A query word is used to identify one of a number of word groups, by first determining whether the query word is in any of the word groups. If not, attempts to modify the query word are made in accordance with successive suffix relationships in a sequence until a modified query word is obtained that is in one of the word groups. The sequence of suffix relationships, which can be pairwise relationships, can be defined by a list ordered according to the frequencies of occurrence of the suffix relationships in a natural language. If a modified query word is obtained that is in one of the word groups, information identifying the word group can be provided, such as a representative of the group or a list of words in the group.

Identifying a group of words using modified query words obtained from successive suffix relationships

To provide information about the meaning of a multi-token expression in a first language, where the information is understandable in a second language, subexpressions are obtained, such as tokens, chunks, and sentences. The multi-token expression could, for example, be a sentence or an input text with more than one sentence. Translation choices are obtained in the second language for a set of the subexpressions. A subset of the translation choices of a subexpression are ranked, and the ranked translation choices are used to produce a sequence of translation choices for the multi-token expression as a whole. Information is then presented to a user about the sequence of translation choices, indicating in the second language the meaning of the multi-token expression. Translation choices can be ranked based on syntactic or semantic context, based on translation source, based on confidence levels, based on how each was obtained, in accordance with a user-selected process, and so forth. Information about the sequence can be presented through a paper or display-based user interface. In response to user signals, additional translation choices can be presented or other modifications can be made. A user-requested change in ranking can propagate to similar subexpressions in the multi-word expression or, through rules or weighted confidence levels, to similar subexpressions in subsequent multi-word expressions.

Using ranked translation choices to obtain sequences indicating meaning of multi-token expressions

A set of words of a natural language is grouped by automatically obtaining suffix relation data that indicate a relation value for each of a set of relationships between suffixes that occur in the natural language, and, then, by automatically clustering the words in the set using the relation values from the suffix relation data, to obtain group data indicating groups of words. Two or more words in a group have suffixes as in one of the relationships and, preceding the suffixes, equivalent substrings. The relationships can be pairwise relationships, and the relation value can indicate the number of occurrences of a suffix pair. The suffix relation data can be obtained using an inflectional lexicon. Complete link clustering can be used.

Grouping words with equivalent substrings by automatic clustering based on suffix relationships

Selected character strings are automatically found by performing an automatic search of a text to find character strings that match any of a list of selected strings. The automatic search includes a series of iterations, each with a starting point in the text. Each iteration determines whether its starting point is followed by a character string that matches any of the list of selected strings and that ends at a probable string ending. Each iteration also finds a starting point for the next iteration that is a probable string beginning. The selected strings can be words and multiple word expressions, in which case probable string endings and beginnings are word boundaries. A finite state lexicon, such as a finite state transducer or a finite state automation, can be used to determine whether character strings match the list of selected strings. A tokenizing automation can be used to find starting points.

Growing community of inventors

Grenoble, France

Jean-Pierre Chanod