Abstract: An alignment of attributes is extracted from a pair of mentions in an annotated corpus. An annotated document is read from the annotated corpus. Three character string arrays (A, B, and C) are stored into a first TRIE. The character string arrays include character string representations of attributes of one or more first tokens, second tokens, and neighborhood tokens of mentions of the annotated document, respectively. The storing into the first TRIE obtains partial integer arrays (K, L, and M) that include identifiers corresponding to the attributes of the mentions. The partial integer arrays are stored into a second TRIE. The storing into the second TRIE obtains an identifier array (X) that includes three identifiers. The identifier array is stored into a third TRIE. The storing into the TRIE obtains one identifier of the alignment of attributes.

Abstract: A system and method to hardware-accelerate finite state transducer libraries and their compilation toolchains. In an embodiment, a computer-implemented method for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components may comprise creating a data-flow graph representation of the UIMA-PEAR-file, flattening hierarchies of the data-flow graph representation, and selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.

Abstract: A cascaded finite-state-transducer array includes a plurality of finite-state-transducers, the finite-state-transducers being distributed in space. The finite-state-transducer array is configured with dedicated data transfer channels between the finite-state-transducers to transfer specific data types. Each data stream on a dedicated data transfer channel may transmit a particular data type, which may be sorted in increasing order of start offsets or token IDs.

Abstract: A system and method to hardware-accelerate finite state transducer libraries and their compilation toolchains. In an embodiment, a computer-implemented method for partitioning an UIMA-PEAR file into software-based and hardware-accelerated components may comprise creating a data-flow graph representation of the UIMA-PEAR-file, flattening hierarchies of the data-flow graph representation, and selecting the components to be hardware accelerated from the flattened hierarchies of the data-flow graph representation based on data dependencies of data types produced and consumed by each component of the flattened data-flow graph.

Abstract: A method for evaluating annotation quality is provided. The method may include obtaining annotation information associated with a plurality of annotators and a plurality of data elements including a plurality of annotation entries corresponding to at least one data element and entered based on an annotation guideline, determining a quality rating for the annotation guideline based on a comparison between a first value associated with the plurality of annotators and the plurality of data elements and a second value associated with any disparity among the plurality of annotation entries, determining a proficiency rating for an annotator from the plurality of annotators based on a comparison between a third value associated with annotation entries by the annotator and the second value, and generating a report based on the quality rating and the proficiency rating.

Abstract: A method for evaluating annotation quality is provided. The method may include obtaining annotation information associated with a plurality of annotators and a plurality of data elements including a plurality of annotation entries corresponding to at least one data element and entered based on an annotation guideline, determining a quality rating for the annotation guideline based on a comparison between a first value associated with the plurality of annotators and the plurality of data elements and a second value associated with any disparity among the plurality of annotation entries, determining a proficiency rating for an annotator from the plurality of annotators based on a comparison between a third value associated with annotation entries by the annotator and the second value, and generating a report based on the quality rating and the proficiency rating.

Abstract: An alignment of attributes is extracted from a pair of mentions in an annotated corpus. An annotated document is read from the annotated corpus. Three character string arrays (A, B, and C) are stored into a first TRIE. The character string arrays include character string representations of attributes of one or more first tokens, second tokens, and neighborhood tokens of mentions of the annotated document, respectively. The storing into the first TRIE obtains partial integer arrays (K, L, and M) that include identifiers corresponding to the attributes of the mentions. The partial integer arrays are stored into a second TRIE. The storing into the second TRIE obtains an identifier array (X) that includes three identifiers. The identifier array is stored into a third TRIE. The storing into the TRIE obtains one identifier of the alignment of attributes.

Abstract: An image forming apparatus, which executes printing according to a print request based on an instruction by a user of a client terminal, includes a print time calculation unit that calculates a required time for printing according to the print request; and a display unit that displays a plurality of contents on a display device during an execution of printing in accordance with a content list including the plurality of contents for the user, the content list being generated based on the calculated required time for printing.

Abstract: An image forming apparatus, which executes printing according to a print request based on an instruction by a user of a client terminal, includes a print time calculation unit that calculates a required time for printing according to the print request; and a display unit that displays a plurality of contents on a display device during an execution of printing in accordance with a content list including the plurality of contents for the user, the content list being generated based on the calculated required time for printing.

Abstract: To improve the processing speed of a morphological analysis system, an analysis processing part retrieves words constituting a natural language sentence from a word dictionary, retrieves concatenation rules from a grammar dictionary, creates an automaton based on the words and the concatenation rules, and obtains a morphological analysis. The grammar dictionary stores rules integrating concatenation rules representing non-null transitions and concatenation rules representing null transitions in which transition sources of the first concatenation rule are their transition destinations. To create the automaton, an optimal solution searching part of the analysis processing part generates, responsive to an input word entered into the automaton, states necessary for transition according to the concatenation rules corresponding to the input word without generating any state that can be transited by pursuing a null transition succeeding the generated states.

Abstract: Method and apparatus for finding the focus of a document. A semantic network includes a plurality of nodes, each representing a concept, and links, connecting the nodes, representing relations between the concepts is used. The method including: providing a list of terms in an input document which match concepts represented by the semantic network, and a frequency value for each matched term indicating the number of times the term appears in the document; mapping each matched term to a referent node or to a plurality of possible referent nodes in the semantic network, and assigning weights to nodes.

Abstract: The invention can include a token list generating unit 11 for decomposing a natural language text to be processed into tokens that are components of the natural language text and registering them on a token list, and a token string selecting unit 13 for selecting optimum token strings for composing the natural language text to be processed on the basis of the token list generated by the token list generating unit 11. The token list generating unit 11 registers, on the token list, tokens among the tokens obtained by decomposing the natural language text to be processed except tokens decomposable into smaller tokens according to conditions imposed on the morphological analysis.

Abstract: A regular-expression dictionary, as opposed to an exact-match dictionary, is constructed for utilization within computerized textual analysis. One or more data types are defined for entries within the regular-expression dictionary, within a markup-language schema. A structure in the markup-language schema is provided that encompasses the data types of the entries within the regular-expression dictionary. For each of a number of entries of the regular-expression dictionary, a mapping methodology is defined between a source definition of the entry to the structure and the data types within the markup-language schema. Furthermore, a definition of the entry is mapped to the data types within the structure of the markup-language schema, using the mapping methodology defined. The markup language may be eXtensible Markup Language (XML), or another type of markup language.

Abstract: Method and apparatus for finding the focus of a document. A semantic network includes a plurality of nodes, each representing a concept, and links, connecting the nodes, representing relations between the concepts is used. The method including: providing a list of terms in an input document which match concepts represented by the semantic network, and a frequency value for each matched term indicating the number of times the term appears in the document; mapping each matched term to a referent node or to a plurality of possible referent nodes in the semantic network, and assigning weights to nodes.

Abstract: A regular-expression dictionary, as opposed to an exact-match dictionary, is constructed for utilization within computerized textual analysis. One or more data types are defined for entries within the regular-expression dictionary, within a markup-language schema. A structure in the markup-language schema is provided that encompasses the data types of the entries within the regular-expression dictionary. For each of a number of entries of the regular-expression dictionary, a mapping methodology is defined between a source definition of the entry to the structure and the data types within the markup-language schema. Furthermore, a definition of the entry is mapped to the data types within the structure of the markup-language schema, using the mapping methodology defined. The markup language may be eXtensible Markup Language (XML), or another type of markup language.

Abstract: To improve the processing speed of a morphological analysis system, an analysis processing part retrieves words constituting a natural language sentence from a word dictionary, retrieves concatenation rules from a grammar dictionary, creates an automaton based on the words and the concatenation rules, and obtains a morphological analysis. The grammar dictionary stores rules integrating concatenation rules representing non-null transitions and concatenation rules representing null transitions in which transition sources of the first concatenation rule are their transition destinations. To create the automaton, an optimal solution searching part of the analysis processing part generates, responsive to an input word entered into the automaton, states necessary for transition according to the concatenation rules corresponding to the input word without generating any state that can be transited by pursuing a null transition succeeding the generated states.

Abstract: The invention can include a token list generating unit 11 for decomposing a natural language text to be processed into tokens that are components of the natural language text and registering them on a token list, and a token string selecting unit 13 for selecting optimum token strings for composing the natural language text to be processed on the basis of the token list generated by the token list generating unit 11. The token list generating unit 11 registers, on the token list, tokens among the tokens obtained by decomposing the natural language text to be processed except tokens decomposable into smaller tokens according to conditions imposed on the morphological analysis.

Abstract: A managing system for managing slurry, which is supplied to a wire saw. Slurry is prepared in a preparing tank and sent to the wire saw and used to cut workpieces. After usage for cutting workpieces, the slurry is sent to a separating apparatus from the wire saw. The separating apparatus separates impurities from the used slurry to recover a mixture of recyclable dispersing liquid and abrasive grains from the used slurry. The recovered mixture is returned to the preparing tank. The recovered mixture is mixed with fresh abrasive grains and dispersing liquid in the preparing tank to prepare slurry. The property (specific gravity and viscosity) of the slurry in the preparing tank is detected. The amount of fresh abrasive grains and dispersing liquid supplied to the preparing tank is adjusted in accordance with the detection results. Accordingly, slurry having properties that are optimal for the cutting of workpieces is prepared.

Abstract: A slurry managing system for a wire saw is disclosed. The wire saw includes a wire that has a plurality of wire lines extending in parallel to one another. The wire is supplied with slurry containing abrasive grains in dispersing liquid to cut a workpiece so as to simultaneously produce a multiplicity of wafers. A mixer device mixes the slurry prior to supplying of the slurry to the wire saw. A first supplying device supplies the grains to the mixer device. A second supplying device supplies the dispersing liquid to the mixer device. A first adjusting device adjusts the amount of the grains supplied to the mixer device from the first supplying device. A second adjusting device adjusts the amount of the liquid supplied to the mixer device from the second supplying device.

Abstract: A processing system for processing of wafers that are formed by slicing a cylindrical workpiece which is adhered to a support plate by an adhesive agent. The processing system includes a washing apparatus, a removing apparatus, a separating apparatus, and a transferring apparatus. The washing apparatus washes the wafers that are remained adhered to the support plate. The removing apparatus removes a group of the wafers from the support plate. The removed wafers are gathered in a cylindrical shape. The separating apparatus separates the wafers one by one. The separating apparatus includes a vessel for accommodating the wafers separated one from another. The transferring apparatus transfers the wafers from the washing apparatus to the removing apparatus and then to the separating apparatus.