公开(公告)号：US07792761B2

公开(公告)日：2010-09-07

申请号：US11552205

申请日：2006-10-24

Applicant: Akiko Murakami ,  Yuta Tsuboi ,  Hideo Watanabe ,  Issei Yoshida

Inventor： Akiko Murakami ,  Yuta Tsuboi ,  Hideo Watanabe ,  Issei Yoshida

IPC: G06Q99/00

CPC classification number: G06N5/02 ,  G06F17/274 ,  G06F17/3061 ,  G06Q30/02 ,  G06Q50/01

Abstract: 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.

Abstract translation: 本文中的实施例适当地确定人之间的相关性。 本文的实施例提供了一种用于评估人之间的相关性的系统，包括相关性检测装置，用于基于其中表达另一个人的评价或感觉的文本来检测作为目标的人的目标的定向相关性; 存储装置，用于存储检测到的相关性; 评估装置，用于基于包括所存储的相关性的多个相关性并且从第一人通过第二人到达第二人来评估关于被评估的第一人和第二人的一组相关性的第一人与第二人之间的相关性 至少另外一个人; 以及输出装置，用于输出评估的相关性。

公开(公告)号：US07584184B2

公开(公告)日：2009-09-01

申请号：US11555790

申请日：2006-11-02

Applicant: Daisuke Takuma ,  Issei Yoshida ,  Yuta Tsuboi

Inventor： Daisuke Takuma ,  Issei Yoshida ,  Yuta Tsuboi

IPC: G06F7/00

CPC classification number: G06F17/3061 ,  Y10S707/99935

Abstract: 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.

Abstract translation: 本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。 然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。 然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

公开(公告)号：US20090109095A1

公开(公告)日：2009-04-30

申请号：US12257437

申请日：2008-10-24

Applicant: Shohei Hido ,  Tsuyoshi Ide ,  Hisashi Kashima ,  Shoko Suzuki ,  Akira Tajima ,  Rikiya Takahashi ,  Toshihiro Takahashi ,  Yuta Tsuboi

Inventor： Shohei Hido ,  Tsuyoshi Ide ,  Hisashi Kashima ,  Shoko Suzuki ,  Akira Tajima ,  Rikiya Takahashi ,  Toshihiro Takahashi ,  Yuta Tsuboi

IPC: G01S5/08

CPC classification number: G01S5/0252

Abstract: 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

Abstract translation: 使用标签传播的位置估计方法。 实现的位置估计方法对无线电信号强度的变化是鲁棒的，并且通过使用q范数（0

公开(公告)号：US20060112134A1

公开(公告)日：2006-05-25

申请号：US11273924

申请日：2005-11-14

Applicant: Yuta Tsuboi ,  Hiroshi Kanayama ,  Tetsuya Nasukawa ,  Hideo Watanabe

Inventor： Yuta Tsuboi ,  Hiroshi Kanayama ,  Tetsuya Nasukawa ,  Hideo Watanabe

IPC: G06F7/00

CPC classification number: G06F17/277 ,  G06F17/2775 ,  G06Q30/02 ,  Y10S707/99943 ,  Y10S707/99945

Abstract: A system, method, and program product to correctly detect a preference expression indicating persons' likes and dislikes of a commercial product or the like. Specifically, the expression detecting system for detecting preference expressions indicating evaluators' likes and dislikes of a specific object from texts describing evaluation of the specific object, and stores each of the texts describing evaluation of a specific object in association with an attribute of the text. The method extracts an evaluating expression describing evaluation of the specific object from each of the texts; determines whether the extracted evaluating expression has positive polarity or negative polarity, where the positive polarity indicates favorable evaluation of the specific object and the negative polarity indicates unfavorable evaluation of the specific object. The system then inputs a text attribute that is designated as an object for detecting the preference expressions; and detects an evaluating expression, which is detected from a text having an input attribute from the extracted evaluating expressions as one of the preference expressions and outputs the preference expressions in association with a frequency of the preference expressions being determined to have the positive polarity or the negative polarity in the text having the attribute.

Abstract translation: 一种系统，方法和程序产品，用于正确地检测表示商业产品的喜好和不喜欢的偏好表达等。 具体地，表示检测系统用于从描述特定对象的评估的文本中检测指示评估者对特定对象的喜好和不喜欢的偏好表达，并且存储描述与文本的属性相关联的特定对象的评估的每个文本。 该方法从每个文本中提取描述特定对象的评估的评估表达; 确定提取的评估表达式是否具有正极性或负极性，其中正极性表示特定对象的有利评估，负极性表示特定对象的不利评估。 然后，系统输入被指定为用于检测偏好表达式的对象的文本属性; 并且检测从具有来自所提取的评估表达式的具有输入属性的文本中检测到的评估表达式作为所述偏好表达式之一，并且输出与所述偏好表达式的频率相关联的所述偏好表达式被确定为具有正极性或 具有属性的文本中的负极性。

公开(公告)号：US08495101B2

公开(公告)日：2013-07-23

申请号：US13408706

申请日：2012-02-29

Applicant: Teruo Koyanagi ,  Yuta Tsuboi

Inventor： Teruo Koyanagi ,  Yuta Tsuboi

IPC: G06F17/30

CPC classification number: G06F17/30

Abstract: 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.

Abstract translation: 一种用于定义用于模式匹配的数据结构的信息处理方法，所述方法由信息处理装置执行，包括通过在所述装置之间定义过渡边缘来生成有序树结构，所述过渡边使用作为转移条件的转移条件， 每个约束模式包括多个约束; 通过确定相应过渡边缘的转换条件之间的集合关系，通过该装置从根节点搜索类似于第一子结构的第二子结构; 以及由所述装置定义从所述第二子结构的尾节点到所述第一子结构的尾端处的子节点的附加转变链路，所述附加转变链路添加由所述集合关系识别的不确定性要满足的约束 。

公开(公告)号：US08407261B2

公开(公告)日：2013-03-26

申请号：US12494559

申请日：2009-06-30

Applicant: Teruo Koyanagi ,  Yuta Tsuboi

Inventor： Teruo Koyanagi ,  Yuta Tsuboi

IPC: G06F17/30

CPC classification number: G06F17/30

Abstract: 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 sKn of the second substructure K to a child node sPn+1 of 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.

Abstract translation: 根据本发明的信息处理设备包括生成部分，其被配置为通过使用从包括多个约束的一个或多个约束模式的转移条件来定义各个约束来定义节点之间的过渡边缘来生成有序树结构;搜索部分被配置为 通过确定各个过渡边缘的转换条件之间的集合关系以及被配置为从第二子结构的尾节点sKn定义附加转变链路的转移定义部分，从根节点搜索类似于第一子结构P的第二子结构K K到第一子结构P的子节点sPn + 1，附加转移链路添加由从集合关系识别的不确定性要满足的约束，其中定义用于模式匹配的数据结构。

公开(公告)号：US20130060562A1

公开(公告)日：2013-03-07

申请号：US13599588

申请日：2012-08-30

Applicant: Yuta Tsuboi ,  Yuya Unno

Inventor： Yuta Tsuboi ,  Yuya Unno

IPC: G06F17/27

CPC classification number: G06F17/2785 ,  G06F17/30684

Abstract: 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.

Abstract translation: 一种用于计算与具有依赖关系结构的查询图案匹配句子的得分的装置和方法。 该装置包括：获取分析目标句子的输入单元，查询模式以及指标语言单元如何倾向于修改另一个语句单元的索引值; 以及分数计算单元，计算将所述句子与所述查询模式的匹配度进行索引的匹配分数。 匹配分数由具有与查询模式中包括的依赖关系相关联的索引值的函数表示。 通过尝试在查询模式的子结构与句子中的范围之间的关联并且通过在子结构和范围内执行递归计算并将功能的部分计算结果存储在存储区域中以供重用来计算分数。

公开(公告)号：US20120316863A1

公开(公告)日：2012-12-13

申请号：US13591292

申请日：2012-08-22

Applicant: Tetsuya Nasukawa ,  Raymond Harry Rudy ,  Yuta Tsuboi ,  Yao-zhong Zhang

Inventor： Tetsuya Nasukawa ,  Raymond Harry Rudy ,  Yuta Tsuboi ,  Yao-zhong Zhang

IPC: G06F17/20

CPC classification number: G06F17/2809

Abstract: 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.

公开(公告)号：US08171052B2

公开(公告)日：2012-05-01

申请号：US12396876

申请日：2009-03-03

Applicant: Daisuke Takuma ,  Yuta Tsuboi

Inventor： Daisuke Takuma ,  Yuta Tsuboi

IPC: G06F7/00

CPC classification number: G06F17/30684 ,  G06F17/30625

Abstract: 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.

Abstract translation: 一种用于从包含大量文本文档的文档数据中高速搜索与依赖性模式匹配的文档的系统，方法和计算机程序产品。 该系统包括存储装置，用于存储索引存储装置，用于存储在存储装置中的发生信息，用于接收信息的接收装置，用于从索引存储装置读取的读取装置和用于比较发生信息的搜索装置。 该方法和计算机程序产品包括存储在存储装置中的步骤，接收信息，从存储装置读取，比较发生信息和搜索。 计算机程序产品包括执行将多个文档数据中的每一个存储在存储装置中的步骤的指令，存储在存储装置中的发生信息。

公开(公告)号：US20120036149A1

公开(公告)日：2012-02-09

申请号：US13185579

申请日：2011-07-19

Applicant: Yuta Tsuboi ,  Yuya Unno

Inventor： Yuta Tsuboi ,  Yuya Unno

IPC: G06F17/30

CPC classification number: G06F17/30696

Abstract: 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 {c1, . . . , cn1} 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.

Abstract translation: 用于使搜索结果周围的上下文能够简洁地显示的方法，制品和系统。 该方法包括搜索配置为频率有序后缀树的文档集以获得频率排序的上下文树。 将动态规划应用于频率有序上下文树以检索具有上下文串（c）的n1个元素的上下文串（c）的集合（C）。 定义整个上下文串C {c1，...中的字符串覆盖的区域。 。 。 ，cn1}作为（1）具有s作为前缀的上下文串（c）的数量（n2）和（2）字符串的长度的乘积。 获取最大化区域总和的一组字符串（S）。 此外，动态编程可以包括修剪过程，使得如果上限没有达到最大值，则正在进行的搜索被放弃。