Abstract:
PROBLEM TO BE SOLVED: To improve the selection accuracy of translated words in a machine translation mode without lowering the processing efficiency by using plural types of dictionaries including a context dictionary when a word that is not defined in a compound word dictionary is translated in a sentence. SOLUTION: Every input sentence is taken out at its head (110), and the compound words corresponding to a word string composing a single input sentence are retrieved from a compound word dictionary. When each of wards which are not corresponding to the compound words is translated (120), its translation is decided by a context dictionary and the translated word is obtained based on the translation (130). The translated word undergoes the translation result registering processing. Then it's checked whether an object word is stored in a translation result recording buffer as a header. If the object word is stored in the buffer, it's checked whether or not its translated word is stored in the buffer and all words which are not corresponding to the compound words are processed (140, 160). Then all words are translated (170). When it's decided that a full sentence is translated, the sentence is registered (180 to 195) after undergoing the retranslation effect evaluation processing.
Abstract:
PROBLEM TO BE SOLVED: To relate a large quantity of article data to each other with high efficiency and at a high speed by producing a similarity matrix from the similarity set among plural documents via the time restriction and transforming the similarity matrix into an adjacency matrix that shows the correlated between the documents. SOLUTION: A set of articles is shown in the sets that are ordered in a time sequence. A set of articles correlated to each other is defined by a directed graph (V, A), where V means a set of articles (nodes) with A meaning a set consisting of two pairs (i, j) of nodes (i, j: elements of V). As a set of nodes is ordered in time, the limit conditions that: For (di , dj ) EA and i
Abstract:
PROBLEM TO BE SOLVED: To precisely retrieve text information which has strong association with numerical information such as time series data, and to display the text information by associating it with the numerical information. SOLUTION: This information processor for associating text information with the numerical information of time series is provided with a generation part for generating first words and phrases showing the change of a first numerical information in a certain period; a first retrieval part for retrieving text information matched with a retrieval key including the first words and phrases from among a plurality of pieces of text information as the object of retrieval; and an output part for outputting the retrieved text information by associating it with the first numerical information in the period. In this information processor, the first retrieval part may retrieve text information describing the fact that the first numerical information has been changed as shown by the first words and phrases from among a plurality of pieces of text information prepared or announced in the period. COPYRIGHT: (C)2007,JPO&INPIT
Abstract:
PROBLEM TO BE SOLVED: To enable efficient translation an to facilitate customization. SOLUTION: A part of an original text is made correspond to a translation pattern and the part is translated into a target language. Each translation pattern 18 consists of an original language pattern 18A, a target language pattern 18D corresponding to the original text pattern, a variable 18B corresponding to the original text pattern, and a variable 18C corresponding to the target language pattern. When part of the original text matches one original language pattern, the original language pattern 18B is replaced with the 1st variable and the corresponding target language pattern 18D is represented with the 2nd variable 18C. When part of the original language sentence replaced with the 1st variable matches another original language pattern in nesting structure in which the 1st variable is incorporated, the original language pattern is replaced with a 3rd variable, and the target language pattern in nesting structure in which the 2nd variable is incorporated is represented with a 4th variable corresponding to the original language pattern.
Abstract:
PURPOSE:To convert an original sentence in a first language to a translated sentence in a second language with a high precision by flexibly selecting word meanings and translated words in the unit of word and phrase so that the original sentence and the translated sentence correspond to each other most suitably. CONSTITUTION:An input sentence in the first language is analyzed to a graph structure having nodal points and branches by an input analysis part 14. In a translated word selector 20, a variable introducing part 22 introduces variables in parts having ambiguity in the graph structure. Restrictions of these variables are propagated to the other parts by a restriction carcelling part 24 to obtain solutions of translated word determination in the other parts, and a contradictionless solution is locally obtained at every part. A variable materializing part 26 locally obtains a solution at every contradictionless part in accordance with the pattern of variables. An output sentence generating part 36 generates a sentence in the second language from a set of these solutions. Consequently, the combination explosion of original words and translate word which can occur at the time of analysis is avoided, and determination of words in the second language in ambiguous parts is delayed till the time just before sentence generation to utilize maximum information.