International Business Machines Corporation

Yuta Tsuboi

Daisuke Takuma

Issei Yoshida

Tetsuya Nasukawa

Gakuto Kurata

Hideo Watanabe

Yuji Watanabe

Toshihiro Takahashi

Tsuyoshi Ide

Shoko Suzuki

Toru Nagano

Akira Tajima

Hisashi Kashima

Raymond Harry Rudy

Takahide Nogayama

Teruo Koyanagi

Shohei Hido

Rikiya Takahashi

Raymond H P Rudy

Scott Ross Trent

Yuya Unno

Masayoshi Mizutani

Yao-zhong Zhang

Hiroshi Kanayama

Akiko Murakami

A technique for estimating phonemes for a word written in a different language is disclosed. A sequence of graphemes of a given word in a source language is received. The sequence of the graphemes in the source language is converted into a sequence of phonemes in the source language. One or more sequences of phonemes in a target language are generated from the sequence of the phonemes in the source language by using a neural network model. One sequence of phonemes in the target language is determined for the given word. Also, technique for estimating graphemes of a word from phonemes in a different language is disclosed.

Generating phonemes of loan words using two converters

A method and system are provided for performing a security inspection of a set of virtual images. The method includes merging the virtual images into a tree structure having a root and a plurality of leaves such that child leaves and a parent leaf to the child leaves have common ones of the virtual images. The method further includes applying a bisection method against a path in the tree from the root to a given one of the plurality of leaves having a given one of the virtual images in which a security violation has been identified to find a particular one of the virtual images that is a root cause of the security violation. The method also includes performing a corrective action for any of the plurality of images having the security violation.

Security inspection of massive virtual hosts for immutable infrastructure and infrastructure as code

A method and system are provided for performing a security inspection of a set of virtual images in a cloud infrastructure. The method includes merging the virtual images into a tree structure having a root and a plurality of leaves such that child leaves and a parent leaf to the child leaves have common ones of the virtual images. The method further includes identifying a security violation in a given one of the virtual images at a given one of the plurality of leaves. The method also includes applying a bisection method against a path in the tree from the root to the given one of the plurality of leaves to find a particular one of the virtual images that is a root cause of the security violation. The method additionally includes performing a corrective action for any of the plurality of images having the security violation.

A method, article of manufacture, and system for enabling context surrounding a search result to be displayed succinctly. The method includes searching a document set configured as a frequency ordered suffix tree to obtain a frequency ordered context tree. Applying dynamic programming to the frequency ordered context tree to retrieve a set (C) of context strings (c) having n1 elements of context strings (c). Defining an area covered by a character string (s) in the entire set of context strings C {c, . . . , c} as the product of (1) the number (n2) of context strings (c) having s as a prefix and (2) the length of character string (s). Obtaining a set of character strings (S) that maximizes the sum of areas. In addition, dynamic programming can include a pruning process such that if an upper limit does not reach a maximum value, the search in progress is abandoned.

Character string generation method, article of manufacture and system

An apparatus and method for calculating a score of matching a sentence with a query pattern having a dependency structure. The apparatus includes: an input unit acquiring an analysis target sentence, a query pattern and an index value indexing how a linguistic unit in the sentence tends to modify another; and a score calculation unit calculating a matching score indexing the degree of matching of the sentence with the query pattern. The matching score is represented by a function having an index value with which a dependency relation included in the query pattern is associated. The score is calculated by attempting association between a substructure of the query pattern and a range in the sentence and by performing recursive calculation in the substructure and the range while storing partial calculation result of the function in a memory area for reuse.

Information processing apparatus, natural language analysis method, program and recording medium

A computer implemented method, system, and product for finding correspondence between terms in two different languages. The method includes the steps of: creating a technical term set and a general term set for each of i) a first language and ii) a second language, creating two bipartite graphs, where each graph corresponds to one of the two languages, and connects the technical term set and general term set of each language, respectively, with weighted links based on corpus information, creating a third bipartite graph by creating weighted links between general terms in the first language and general terms in the second language by using a translation dictionary, creating an association matrix M corresponding to the three bipartite graphs, calculating a similarity matrix Q by calculation of an inverse matrix, and outputting correspondence between the technical term sets of the first and second language on basis of the similarity matrix.

Method, program and system for finding correspondence between terms

An information processing method for defining a data structure for pattern matching, the method executed by an information processing apparatus, comprises generating, by the apparatus, an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint patterns each including plural constraints; searching, by the apparatus, for a second substructure similar to a first substructure from a root node by determining a set relation between transition conditions of respective transition edges; and defining, by the apparatus, an additional transition link from a tail node of the second substructure to a child node at a tail end of the first substructure, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation.

Defining a data structure for pattern matching

An information processing apparatus according to the present invention comprises a generation section configured to generate an ordered tree structure by defining transition edges between nodes using, as transition conditions, respective constraints from one or more constraint pattern each including plural constraints, a search section configured to search for a second substructure K similar to a first substructure P from a root node by determining a set relation between transition conditions of respective transition edges, and a transition defining section configured to define an additional transition link from a tail node sof the second substructure K to a child node sof the first substructure P, the additional transition link adding a constraint to be met by an indeterminant identified from the set relation, wherein a data structure for pattern matching is defined.

Location estimation systems, methods, and non-transitory computer program products. The system includes: storage means provided in the computer, means for storing the vector datasets in the storage means of the computer, means for calculating the similarity between the vector dataset without any location label and each neighboring vector dataset with a location label, by using any one of a q-norm where 0&#x2266;q&#x2266;1 and an exponential attenuation function, and means for estimating the location label of the vector data without any location label from the calculated similarities.

Location estimation system, method and program

A system, method and computer program product for searching at high speed for documents matching a dependency pattern from document data containing a large volume of text documents. The system includes a storage device for storing, index storage means for storing in the storage device occurrence information, receiving means for receiving information, reading means for reading from the index storage means, and searching means for comparing occurrence information. The method and computer program product include the steps of storing in the storage device, receiving information, reading from the storage device, comparing occurrence information, and searching. The computer program product includes instructions to execute the steps of storing each of the plurality of document data in the storage device, storing in the storage device occurrence information.

Information search system, method and program

A location estimation method using label propagation. The achieved location estimation method is robust to variations in radio signal strengths and is highly accurate by using the q-norm (0&#x3c;q&#x3c;1), especially, for calculating the similarities among radio signal strength vectors. The accuracy in location estimation is further improved by putting more importance on the time-series similarities. Specifically, the time-series similarity is calculated by using time-series values indicating the temporal order of radio signal strengths during the measurement. If the time-series similarity is larger than the similarity between the radio signal strength vectors, the time-series similarity is preferentially used. The exponential attenuation function can also be used for calculating the similarities, instead of the q norm (0&#x3c;q&#x3c;1).

A system of the present invention stores: a first index which designates lists of keywords contained in texts from identifications of the respective texts; a second index which designates lists of texts containing keywords from identifications of the respective keywords; and the number of texts containing the respective keywords. Then, upon receiving an input of a text search condition, the system calculates an estimation of search time by the first index and an estimation of search time by the second index, and determines which one of the first and second indexes makes a search faster. Then, by using the index which has been determined to make the search faster, the system searches for keywords which appear in texts satisfying the text search condition with higher frequency.

System of effectively searching text for keyword, and method thereof

Embodiments herein properly determine relevance between persons. Embodiments herein provide a system for evaluating relevance between persons, including relevance detecting means for detecting directed relevance of a person as a target to another person based on a text in which evaluations or feelings of the other person by another person is expressed; storing means for storing the detected relevance; evaluating means for evaluating, with respect to a set of a first person and second person to be evaluated, relevance between the first person and the second person based on a plurality of relevances including the stored relevances and reaching the second person from the first person via at least one further person; and outputting means for outputting the relevance evaluated.

Growing community of inventors

Kanagawa-ken, Japan

Yuta Tsuboi