Iterators for Applying Term Occurrence-Level Constraints in Natural Language Searching
    1.
    发明申请
    Iterators for Applying Term Occurrence-Level Constraints in Natural Language Searching 有权
    在自然语言搜索中应用术语发生级约束的迭代器

    公开(公告)号:US20090070298A1

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

    申请号:US12201047

    申请日:2008-08-29

    IPC分类号: G06F7/06 G06F17/30

    CPC分类号: G06F17/30684

    摘要: Tools and techniques are described that relate to iterators for applying term occurrence-level constraints in natural language searching. These tools may receive a natural language input query, and define term occurrence-level constraints applicable to the input query. The methods may also identify facts requested in the input query, and may instantiate an iterator to traverse a fact index to identify candidate facts responsive to the input query. This iterator may traverse through at least a portion of the fact index. The methods may receive candidate facts from this iterator, with these candidate facts including terms, referred to as term-level occurrences. The methods may apply the term occurrence-level constraints to the term-level occurrences. The methods may select the candidate fact for inclusion in search results for the input query, based at least in part on applying the term occurrence-level constraint.

    摘要翻译: 描述了与在自然语言搜索中应用术语出现级约束的迭代器相关的工具和技术。 这些工具可以接收自然语言输入查询,并且定义适用于输入查询的术语出现级约束。 所述方法还可以识别在输入查询中请求的事实,并且可以实例化迭代器遍历事实索引以响应于输入查询来识别候选事实。 该迭代器可以遍历事实索引的至少一部分。 这些方法可以从这个迭代器接收候选事实,这些候选事实包括术语,称为术语级别的事件。 这些方法可以将术语“出现级”约束应用于术语级别的出现。 该方法可以至少部分地基于应用术语出现级别约束来选择候选事实以包括在输入查询的搜索结果中。

    Iterators for applying term occurrence-level constraints in natural language searching
    2.
    发明授权
    Iterators for applying term occurrence-level constraints in natural language searching 有权
    在自然语言搜索中应用术语发生级约束的迭代器

    公开(公告)号:US07984032B2

    公开(公告)日:2011-07-19

    申请号:US12201047

    申请日:2008-08-29

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30684

    摘要: Tools and techniques are described that relate to iterators for applying term occurrence-level constraints in natural language searching. These tools may receive a natural language input query, and define term occurrence-level constraints applicable to the input query. The methods may also identify facts requested in the input query, and may instantiate an iterator to traverse a fact index to identify candidate facts responsive to the input query. This iterator may traverse through at least a portion of the fact index. The methods may receive candidate facts from this iterator, with these candidate facts including terms, referred to as term-level occurrences. The methods may apply the term occurrence-level constraints to the term-level occurrences. The methods may select the candidate fact for inclusion in search results for the input query, based at least in part on applying the term occurrence-level constraint.

    摘要翻译: 描述了与在自然语言搜索中应用术语出现级约束的迭代器相关的工具和技术。 这些工具可以接收自然语言输入查询,并且定义适用于输入查询的术语出现级约束。 所述方法还可以识别在输入查询中请求的事实,并且可以实例化迭代器遍历事实索引以响应于输入查询来识别候选事实。 该迭代器可以遍历事实索引的至少一部分。 这些方法可以从这个迭代器接收候选事实,这些候选事实包括术语,称为术语级别的事件。 这些方法可以将术语“出现级”约束应用于术语级别的出现。 该方法可以至少部分地基于应用术语出现级别约束来选择候选事实以包括在输入查询的搜索结果中。

    Efficient storage and retrieval of posting lists
    3.
    发明授权
    Efficient storage and retrieval of posting lists 有权
    发布清单的高效存储和检索

    公开(公告)号:US08229970B2

    公开(公告)日:2012-07-24

    申请号:US12201079

    申请日:2008-08-29

    IPC分类号: G06F17/30

    CPC分类号: G06F17/2785 G06F17/30625

    摘要: A role tree having nodes corresponding to semantic roles in a hierarchy is defined. A posting list is generated for each association of a term and a semantic role in the hierarchy. The posting lists are stored contiguously on a physical storage medium such that a subtree of the hierarchy of semantic roles can be loaded from the storage medium as a single contiguous block. The posting lists for a subtree of the hierarchy are retrieved by obtaining data identifying the beginning location on the physical storage medium of the posting lists for the term at the top of a desired subtree of the hierarchy and data identifying the length of the posting lists of the desired subtree of the hierarchy. A single contiguous block that includes the posting lists for the desired subtree of the hierarchy is then retrieved from the beginning location through the specified length.

    摘要翻译: 定义了具有与层次结构中的语义角色对应的节点的角色树。 为层次结构中的术语和语义角色的每个关联生成发布列表。 发布列表被连续地存储在物理存储介质上,使得语义角色的层次结构的子树可以作为单个连续块从存储介质加载。 通过获得标识物理存储介质上的开始位置的数据来检索层次结构的子树的发布列表,用于在层次结构的期望子树的顶部的术语的发布列表,以及标识发布列表的长度的数据 所需层次结构的子树。 然后从起始位置通过指定的长度检索包含层次结构所需子树的发布列表的单个连续块。

    Fact-based indexing for natural language search
    4.
    发明授权
    Fact-based indexing for natural language search 有权
    基于事实的自然语言搜索索引

    公开(公告)号:US08639708B2

    公开(公告)日:2014-01-28

    申请号:US12201596

    申请日:2008-08-29

    IPC分类号: G06F7/00 G06F17/30

    CPC分类号: G06F17/30696 G06F17/30684

    摘要: Computer-readable media and a computer system for implementing a natural language search using fact-based structures and for generating such fact-based structures are provided. A fact-based structure is generated using a semantic structure, which represents information, such as text, from a document, such as a web page. Typically, a natural language parser is used to create a semantic structure of the information, and the parser identifies terms, as well as the relationship between the terms. A fact-based structure of a semantic structure allows for a linear structure of these terms and their relationships to be created, while also maintaining identifiers of the terms to convey the dependency of one fact-based structure on another fact-based structure. Additionally, synonyms and hypernyms are identified while generating the fact-based structure to improve the accuracy of the overall search.

    摘要翻译: 提供了计算机可读介质和用于使用基于事实的结构实现自然语言搜索和用于生成这种基于事实的结构的计算机系统。 使用语义结构生成基于事实的结构,该语义结构表示来自诸如网页的文档的诸如文本的信息。 通常,使用自然语言解析器来创建信息的语义结构,并且解析器识别术语以及术语之间的关系。 语义结构的基于事实的结构允许创建这些术语及其关系的线性结构,同时还保留术语的标识符以传达一个基于事实的结构对另一个基于事实的结构的依赖。 此外,在生成基于事实的结构以提高整体搜索的准确性的同时,确定同义词和高词。

    Efficient Storage and Retrieval of Posting Lists
    5.
    发明申请
    Efficient Storage and Retrieval of Posting Lists 有权
    有效存储和检索发布列表

    公开(公告)号:US20090132521A1

    公开(公告)日:2009-05-21

    申请号:US12201079

    申请日:2008-08-29

    IPC分类号: G06F17/30 G06F17/28

    CPC分类号: G06F17/2785 G06F17/30625

    摘要: A role tree having nodes corresponding to semantic roles in a hierarchy is defined. A posting list is generated for each association of a term and a semantic role in the hierarchy. The posting lists are stored contiguously on a physical storage medium such that a subtree of the hierarchy of semantic roles can be loaded from the storage medium as a single contiguous block. The posting lists for a subtree of the hierarchy are retrieved by obtaining data identifying the beginning location on the physical storage medium of the posting lists for the term at the top of a desired subtree of the hierarchy and data identifying the length of the posting lists of the desired subtree of the hierarchy. A single contiguous block that includes the posting lists for the desired subtree of the hierarchy is then retrieved from the beginning location through the specified length.

    摘要翻译: 定义了具有与层次结构中的语义角色对应的节点的角色树。 为层次结构中的术语和语义角色的每个关联生成发布列表。 发布列表被连续地存储在物理存储介质上,使得语义角色的层次结构的子树可以作为单个连续块从存储介质加载。 通过获得标识物理存储介质上的开始位置的数据来检索层次结构的子树的发布列表,用于在层次结构的期望子树的顶部的术语的发布列表,以及标识发布列表的长度的数据 所需层次结构的子树。 然后从起始位置通过指定的长度检索包含层次结构所需子树的发布列表的单个连续块。

    Efficiently representing word sense probabilities
    6.
    发明授权
    Efficiently representing word sense probabilities 有权
    有效地表示单词感觉概率

    公开(公告)号:US08280721B2

    公开(公告)日:2012-10-02

    申请号:US12200999

    申请日:2008-08-29

    IPC分类号: G06F17/27

    CPC分类号: G06F17/2755

    摘要: Word sense probabilities are compressed for storage in a semantic index. Each word sense for a word is mapped to one of a number of “buckets” by assigning a bucket score to the word sense. A scoring function is utilized to assign the bucket scores that maximizes the entropy of the assigned bucket scores. Once the bucket scores have been assigned to the word senses, the bucket scores are stored in the semantic index. The bucket scores stored in the semantic index may be utilized to prune one or more of the word senses prior to construction of the semantic index. The bucket scores may also be utilized to prune and rank the word senses at the time a query is performed using the semantic index.

    摘要翻译: 字义概率被压缩以存储在语义索引中。 通过将桶分数分配给词语,将单词的每个单词感觉映射到多个水桶中的一个。 使用评分函数来分配使分配的桶分数的熵最大化的桶分数。 一旦桶分数被分配到单词感觉,桶分数被存储在语义索引中。 存储在语义索引中的桶分数可以用于在构建语义索引之前修剪一个或多个单词感觉。 桶分数也可用于在使用语义索引执行查询的时候对单词感觉进行修剪和排序。

    Efficiently Representing Word Sense Probabilities
    7.
    发明申请
    Efficiently Representing Word Sense Probabilities 有权
    有效地代表词义概率

    公开(公告)号:US20090094019A1

    公开(公告)日:2009-04-09

    申请号:US12200999

    申请日:2008-08-29

    IPC分类号: G06F17/27

    CPC分类号: G06F17/2755

    摘要: Word sense probabilities are compressed for storage in a semantic index. Each word sense for a word is mapped to one of a number of “buckets” by assigning a bucket score to the word sense. A scoring function is utilized to assign the bucket scores that maximizes the entropy of the assigned bucket scores. Once the bucket scores have been assigned to the word senses, the bucket scores are stored in the semantic index. The bucket scores stored in the semantic index may be utilized to prune one or more of the word senses prior to construction of the semantic index. The bucket scores may also be utilized to prune and rank the word senses at the time a query is performed using the semantic index.

    摘要翻译: 字义概率被压缩以存储在语义索引中。 通过将一个桶分数分配给单词感觉,将单词的每个单词感觉映射到多个“桶”中的一个。 使用评分函数来分配使分配的桶分数的熵最大化的桶分数。 一旦桶分数被分配到单词感觉,桶分数被存储在语义索引中。 存储在语义索引中的桶分数可以用于在构建语义索引之前修剪一个或多个单词感觉。 桶分数也可用于在使用语义索引执行查询的时候对单词感觉进行修剪和排序。

    COMPACT CAMERA-MOUNTABLE VIDEO ENCODER, STUDIO RACK-MOUNTABLE VIDEO ENCODER, CONFIGURATION DEVICE, AND BROADCASTING NETWORK UTILIZING THE SAME
    8.
    发明申请
    COMPACT CAMERA-MOUNTABLE VIDEO ENCODER, STUDIO RACK-MOUNTABLE VIDEO ENCODER, CONFIGURATION DEVICE, AND BROADCASTING NETWORK UTILIZING THE SAME 审中-公开
    紧凑型摄像机可视视频编码器,工作台机架式视频编码器,配置设备和使用其的广播网络

    公开(公告)号:US20090323802A1

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

    申请号:US12494176

    申请日:2009-06-29

    IPC分类号: H04N11/02

    摘要: A turn-key solution is provided for the live Internet audio/video broadcasting and the transferring of previously recorded material. A system shares audio/video data over a network by utilizing a compact, camera-mountable video/audio encoder and a connection module mounted to a video camera. The video/audio encoder includes a connection interface for receiving the audio/video data, a digital signal processor for encoding the audio/video data, and a network interface for coupling the video/audio encoder to a network, such as the Internet. The connection module mounts the video/audio encoder to the video camera and provides an electronic interface to the camera to transfer the audio/video data from the camera to the video/audio encoder through the connection interface. A remote controller including a user interface enables the addition of metadata to the audio/video file over a personal area network connection.

    摘要翻译: 为实时互联网音频/视频广播提供交钥匙解决方案,并传送以前记录的资料。 系统通过使用紧凑的,可相机安装的视频/音频编码器和安装到摄像机的连接模块,通过网络共享音频/视频数据。 视频/音频编码器包括用于接收音频/视频数据的连接接口,用于对音频/视频数据进行编码的数字信号处理器,以及用于将视频/音频编码器耦合到诸如因特网的网络的网络接口。 连接模块将视频/音频编码器安装到摄像机,并为摄像机提供电子接口,通过连接接口将音频/视频数据从摄像机传输到视频/音频编码器。 包括用户界面的遥控器能够通过个人区域网络连接向音频/视频文件添加元数据。

    Papaver orienbtale plant named ‘Flamenco Dancer’
    9.
    植物专利
    Papaver orienbtale plant named ‘Flamenco Dancer’ 有权
    罂粟植物名为“弗拉门戈舞者”

    公开(公告)号:USPP20123P2

    公开(公告)日:2009-06-23

    申请号:US11827336

    申请日:2007-07-10

    申请人: Chad Walters

    发明人: Chad Walters

    IPC分类号: A01H5/00

    CPC分类号: A01H5/02

    摘要: The new and distinct Papaver orientale plant named ‘Flamenco Dancer’ with deeply fringed red petals, large, upright, cupped flowers on sturdy stems suitable for landscaping in mass or as a specimen plant.

    摘要翻译: 新的和独特的罂粟植物名为“弗拉门戈舞者”,深绿色的红色花瓣,大而直立的花杯,坚固的茎,适合大规模景观美化或作为标本植物。

    Checkpointing Iterators During Search
    10.
    发明申请
    Checkpointing Iterators During Search 有权
    搜索期间检查点迭代器

    公开(公告)号:US20090070308A1

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

    申请号:US12201051

    申请日:2008-08-29

    IPC分类号: G06F17/30

    CPC分类号: G06F17/30675 G06F17/30864

    摘要: Tools and techniques are described herein for checkpointing iterators during search. These tools may provide methods that include instantiating iterators in response to a search request. The iterators include fixed state information that remains constant over a life of the iterator, and further include dynamic state information that is updated over the life of the iterator. The iterators traverse through postings lists in connection with performing the search request. As the iterators traverse the posting lists, the iterators may update their dynamic state information. The iterators may then evaluate whether to create checkpoints, with the checkpoints including representations of the dynamic state information.

    摘要翻译: 本文描述了工具和技术,用于在搜索期间检查点迭代器。 这些工具可以提供包括实例化响应于搜索请求的迭代器的方法。 迭代器包括在迭代器的整个生命周期内保持恒定的固定状态信息,并且还包括在迭代器的寿命期间更新的动态状态信息。 迭代器遍历与执行搜索请求相关的发布列表。 当迭代器遍历发布列表时,迭代器可以更新其动态状态信息。 迭代器然后可以评估是否创建检查点,检查点包括动态状态信息的表示。