MEMBERSHIP CHECKING OF DIGITAL TEXT
    2.
    发明申请
    MEMBERSHIP CHECKING OF DIGITAL TEXT 有权
    会员资料检查数字文本

    公开(公告)号:US20090300014A1

    公开(公告)日:2009-12-03

    申请号:US12132108

    申请日:2008-06-03

    IPC分类号: G06F7/06

    CPC分类号: G06F17/30707

    摘要: The described implementations relate to data analysis, such as membership checking. One technique identifies candidate matches between document sub-strings and database members utilizing signatures. The technique further verifies that the candidate matches are true matches.

    摘要翻译: 所描述的实现涉及数据分析,例如成员资格检查。 一种技术用于识别利用签名的文档子串和数据库成员之间的候选匹配。 该技术进一步验证候选匹配是真实匹配。

    Efficient evaluation of object finder queries
    3.
    发明授权
    Efficient evaluation of object finder queries 失效
    对象查询器查询的高效评估

    公开(公告)号:US07730060B2

    公开(公告)日:2010-06-01

    申请号:US11423303

    申请日:2006-06-09

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30964

    摘要: The subject disclosure pertains to a class of object finder queries that return the best target objects that match a set of given keywords. Mechanisms are provided that facilitate identification of target objects related to search objects that match a set of query keywords. Scoring mechanisms/functions are also disclosed that compute relevance scores of target objects. Further, efficient early termination techniques are provided to compute the top K target objects based on a scoring function.

    摘要翻译: 主题公开涉及一类对象查找器查询,其返回与一组给定关键字匹配的最佳目标对象。 提供了有助于识别与一组查询关键字匹配的搜索对象相关的目标对象的机制。 还公开了计算目标对象的相关性分数的评分机制/功能。 此外,提供有效的提前终止技术以基于评分功能计算顶部K个目标对象。

    EFFICIENT EVALUATION OF OBJECT FINDER QUERIES
    5.
    发明申请
    EFFICIENT EVALUATION OF OBJECT FINDER QUERIES 失效
    有效评估对象查找器

    公开(公告)号:US20070288421A1

    公开(公告)日:2007-12-13

    申请号:US11423303

    申请日:2006-06-09

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30964

    摘要: The subject disclosure pertains to a class of object finder queries that return the best target objects that match a set of given keywords. Mechanisms are provided that facilitate identification of target objects related to search objects that match a set of query keywords. Scoring mechanisms/functions are also disclosed that compute relevance scores of target objects. Further, efficient early termination techniques are provided to compute the top K target objects based on a scoring function.

    摘要翻译: 主题公开涉及一类对象查找器查询,其返回与一组给定关键字匹配的最佳目标对象。 提供了有助于识别与一组查询关键字匹配的搜索对象相关的目标对象的机制。 还公开了计算目标对象的相关性分数的评分机制/功能。 此外,提供有效的提前终止技术以基于评分功能计算顶部K个目标对象。

    Scalable lookup-driven entity extraction from indexed document collections
    6.
    发明申请
    Scalable lookup-driven entity extraction from indexed document collections 有权
    从索引文档集合提取可扩展的查找驱动实体

    公开(公告)号:US20090319500A1

    公开(公告)日:2009-12-24

    申请号:US12144675

    申请日:2008-06-24

    IPC分类号: G06F17/30 G06F7/06 G06F17/27

    CPC分类号: G06F17/30011 G06F17/278

    摘要: A set of documents is filtered for entity extraction. A list of entity strings is received. A set of token sets that covers the entity strings in the list is determined. An inverted index generated on a first set of documents is queried using the set of token sets to determine a set of document identifiers for a subset of the documents in the first set. A second set of documents identified by the set of document identifiers is retrieved from the first set of documents. The second set of documents is filtered to include one or more documents of the second set that each includes a match with at least one entity string of the list of entity strings. Entity recognition may be performed on the filtered second set of documents.

    摘要翻译: 过滤一组文档进行实体提取。 接收到实体字符串的列表。 确定一组涵盖列表中的实体字符串的令牌集。 使用该组令​​牌查询在第一组文档上生成的反向索引,以确定第一组中的文档的子集的一组文档标识符。 从第一组文档中检索由该组文档标识符标识的第二组文档。 第二组文档被过滤以包括第二组的一个或多个文档,每个文档包括与实体字符串列表的至少一个实体字符串的匹配。 可以对经过滤的第二组文件执行实体识别。

    Keyword Searching On Database Views
    7.
    发明申请
    Keyword Searching On Database Views 审中-公开
    关键字搜索数据库视图

    公开(公告)号:US20100299367A1

    公开(公告)日:2010-11-25

    申请号:US12469399

    申请日:2009-05-20

    IPC分类号: G06F17/30

    摘要: A keyword search is executed on a view of a database based on a Boolean keyword query. The view includes multiple text columns, and the keyword search is executed on each of the multiple text columns in the view. The output results from the keyword search on each of the text columns include tuple identifiers of one or more relevant tuples and a relevancy score for ranking the results of the keyword query.

    摘要翻译: 在基于布尔关键字查询的数据库视图上执行关键字搜索。 该视图包括多个文本列,并且在视图中的每个多个文本列上执行关键字搜索。 每个文本列上的关键字搜索的输出结果包括一个或多个相关元组的元组标识符和用于对关键字查询的结果进行排名的相关分数。

    Scalable lookup-driven entity extraction from indexed document collections
    8.
    发明授权
    Scalable lookup-driven entity extraction from indexed document collections 有权
    从索引文档集合提取可扩展的查找驱动实体

    公开(公告)号:US08782061B2

    公开(公告)日:2014-07-15

    申请号:US12144675

    申请日:2008-06-24

    IPC分类号: G06F17/30 G06F7/00

    CPC分类号: G06F17/30011 G06F17/278

    摘要: A set of documents is filtered for entity extraction. A list of entity strings is received. A set of token sets that covers the entity strings in the list is determined. An inverted index generated on a first set of documents is queried using the set of token sets to determine a set of document identifiers for a subset of the documents in the first set. A second set of documents identified by the set of document identifiers is retrieved from the first set of documents. The second set of documents is filtered to include one or more documents of the second set that each includes a match with at least one entity string of the list of entity strings. Entity recognition may be performed on the filtered second set of documents.

    摘要翻译: 过滤一组文档进行实体提取。 接收到实体字符串的列表。 确定一组涵盖列表中的实体字符串的令牌集。 使用该组令​​牌查询在第一组文档上生成的反向索引,以确定第一组中的文档的子集的一组文档标识符。 从第一组文档中检索由该组文档标识符标识的第二组文档。 第二组文档被过滤以包括第二组的一个或多个文档,每个文档包括与实体字符串列表的至少一个实体字符串的匹配。 可以对经过滤的第二组文件执行实体识别。

    Finding related entity results for search queries
    9.
    发明授权
    Finding related entity results for search queries 有权
    查找搜索查询的相关实体结果

    公开(公告)号:US08195655B2

    公开(公告)日:2012-06-05

    申请号:US11758024

    申请日:2007-06-05

    IPC分类号: G06F17/30

    CPC分类号: G06F17/278 G06F17/30864

    摘要: Architecture for finding related entities for web search queries. An extraction component takes a document as input and outputs all the mentions (or occurrences) of named entities such as names of people, organizations, locations, and products in the document, as well as entity metadata. An indexing component takes a document identifier (docID) and the set of mentions of named entities and, stores and indexes the information for retrieval. A document-based search component takes a keyword query and returns the docIDs of the top documents matching with the query. A retrieval component takes a docID as input, accesses the information stored by the indexing component and returns the set of mentions of named entities in the document. This information is then passed to an entity scoring and thresholding component that computes an aggregate score of each entity and selects the entities to return to the user.

    摘要翻译: 用于查找网络搜索查询的相关实体的架构。 提取组件将文档作为输入并输出所有实体的所有提及(或出现),例如文档中的人员,组织,位置和产品的名称以及实体元数据。 索引组件采用文档标识符(docID)和命名实体的提及集合,并存储和索引信息进行检索。 基于文档的搜索组件接受关键字查询,并返回与查询匹配的顶级文档的docID。 检索组件将docID作为输入,访问由索引组件存储的信息,并返回文档中命名实体的提及集。 然后将该信息传递给实体计分和阈值组件,该组件计算每个实体的聚合分数,并选择要返回给用户的实体。

    Pushing Search Query Constraints Into Information Retrieval Processing
    10.
    发明申请
    Pushing Search Query Constraints Into Information Retrieval Processing 审中-公开
    将搜索查询约束推送到信息检索处理中

    公开(公告)号:US20110320446A1

    公开(公告)日:2011-12-29

    申请号:US12823124

    申请日:2010-06-25

    IPC分类号: G06F17/30

    CPC分类号: G06F16/90335

    摘要: This patent application relates to interval-based information retrieval (IR) search techniques for efficiently and correctly answering keyword search queries. In some embodiments, a range of information-containing blocks for a search query can be identified. Each of these blocks, and thus the range, can include document identifiers that identify individual corresponding documents that contain a term found in the search query. From the range, a subrange(s) having a smaller number of blocks than the range can be selected. This can be accomplished without decompressing the blocks by partitioning the range into intervals and evaluating the intervals. The smaller number of blocks in the subranges(s) can then be decompressed and processed to identify a doc ID(s) and thus document(s) that satisfies the query.

    摘要翻译: 该专利申请涉及用于有效和正确地回答关键词搜索查询的基于间隔的信息检索(IR)搜索技术。 在一些实施例中,可以识别用于搜索查询的一系列含有信息的块。 这些块中的每个以及因此的范围可以包括识别包含在搜索查询中找到的术语的各个对应文档的文档标识符。 从该范围可以选择具有比该范围少的块数量的子范围。 这可以在不通过将范围划分成间隔并且评估间隔来解压缩块的情况下实现。 然后可以解压缩和处理子范围中较小数量的块,以识别文档ID,从而识别符合查询的文档。