会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Database table partitioning allowing overlaps used in full text query
    • 数据库表分区,允许在全文查询中使用重叠
    • US08667010B2
    • 2014-03-04
    • US13360052
    • 2012-01-27
    • Enyuan WuAlan K. MichaelWootaek SeoBeom Seok Oh
    • Enyuan WuAlan K. MichaelWootaek SeoBeom Seok Oh
    • G06F7/00
    • G06F17/30584
    • Various embodiments provide a set of algorithms and scripts, e.g., SQL scripts, to perform automatic horizontal table and index partitioning that allows overlapping of data records, used in full-text search queries. In at least some embodiments, table creation and populating script is utilized to create a set of smaller tables partitioned by one column. In at least some embodiments, SELECT query modification script is provided to generate a query that works on the partitioned tables to achieve better performance. In at least some other embodiments, other query creation script is provided to modify the INSERT/UPDATE/DELETE queries for the original large table to automatically keep these queries synchronized with partitioned tables.
    • 各种实施例提供一组算法和脚本,例如SQL脚本,以执行允许在全文搜索查询中使用的数据记录的重叠的自动水平表和索引分割。 在至少一些实施例中,使用表创建和填充脚本来创建由一列分割的一组较小的表。 在至少一些实施例中,提供了SELECT查询修改脚本以生成在分区表上工作的查询以实现更好的性能。 在至少一些其他实施例中,提供了其他查询创建脚本来修改原始大表的INSERT / UPDATE / DELETE查询以自动保持这些查询与分区表同步。
    • 2. 发明申请
    • Database Table Partitioning Allowing Overlaps Used in Full Text Query
    • 数据库表分区允许在全文查询中使用的重叠
    • US20130198218A1
    • 2013-08-01
    • US13360052
    • 2012-01-27
    • Enyuan WuAlan K. MichaelWootaek SeoBeom Seok Oh
    • Enyuan WuAlan K. MichaelWootaek SeoBeom Seok Oh
    • G06F17/30
    • G06F17/30584
    • Various embodiments provide a set of algorithms and scripts, e.g., SQL scripts, to perform automatic horizontal table and index partitioning that allows overlapping of data records, used in full-text search queries. In at least some embodiments, table creation and populating script is utilized to create a set of smaller tables partitioned by one column. In at least some embodiments, SELECT query modification script is provided to generate a query that works on the partitioned tables to achieve better performance. In at least some other embodiments, other query creation script is provided to modify the INSERT/UPDATE/DELETE queries for the original large table to automatically keep these queries synchronized with partitioned tables.
    • 各种实施例提供一组算法和脚本,例如SQL脚本,以执行允许在全文搜索查询中使用的数据记录的重叠的自动水平表和索引分割。 在至少一些实施例中,使用表创建和填充脚本来创建由一列分割的一组较小的表。 在至少一些实施例中,提供了SELECT查询修改脚本以生成在分区表上工作的查询以实现更好的性能。 在至少一些其他实施例中,提供了其他查询创建脚本来修改原始大表的INSERT / UPDATE / DELETE查询以自动保持这些查询与分区表同步。
    • 3. 再颁专利
    • Efficient use of exceptions in text segmentation
    • 在文本分割中有效地使用异常
    • USRE44722E1
    • 2014-01-21
    • US13608446
    • 2012-09-10
    • Enyuan WuAlan K. MichaelMarcus A. TaylorBeom Seok OhShusuke Uehara
    • Enyuan WuAlan K. MichaelMarcus A. TaylorBeom Seok OhShusuke Uehara
    • G06F17/20G06F17/27
    • Input text may be broken into sentence, or other types of segments, by first detecting exceptions in the input text, and then detecting break positions. Given a segment breaking scheme that comprises a set of break rules and a set of exceptions, a regular expression is created that represents the break rules, and another regular expression is created that represents the exceptions. The input text is analyzed to identify strings that match any exception, and the matching strings are substituted with placeholders that are not likely to occur naturally in the input. The resulting text, with substitutions, is then evaluated to find the positions in the text that match the break rules. Those positions are declared to be segment breaks, and the placeholders are then replaced with the original strings. The result is the original text, with breaks assigned to the appropriate positions in the text.
    • 通过首先检测输入文本中的异常,然后检测断点位置,将输入文本分解成句子或其他类型的段。 给定一个包含一组中断规则和一组异常的分段断开方案,创建一个表示断点规则的正则表达式,并创建另一个表示异常的正则表达式。 分析输入文本以识别与任何异常相匹配的字符串,并且匹配的字符串将替换为不太可能在输入中自然发生的占位符。 然后评估产生的带有替换的文本,以查找与断点规则匹配的文本中的位置。 这些职位被宣布为细分受众群,然后用原始字符串替换占位符。 结果是原始文本,文本中分配给适当位置的中断。
    • 4. 发明申请
    • FUZZY MATCHING AND SCORING BASED ON DIRECT ALIGNMENT
    • 基于直接对齐的FUZZY匹配和分割
    • US20120143593A1
    • 2012-06-07
    • US12961878
    • 2010-12-07
    • Enyuan WuAlan K. MichaelBeom Seok OhShusuke UeharaKevin S. O'Donnell
    • Enyuan WuAlan K. MichaelBeom Seok OhShusuke UeharaKevin S. O'Donnell
    • G06F17/28
    • G06F17/2836
    • Various embodiments provide a translation memory system that utilizes sentence-level fuzzy matching and a scoring algorithm based on direct alignment. In one or more embodiments, a fuzzy match scoring formula includes use of an edit operation definition to define various deductions that are computed as part of an overall score, an overall scoring algorithm, and word-level scoring and partial match definitions. A direct alignment algorithm finds a computed alignment between two sentences using a pair-wise difference matrix associated with a primary sentence and a comparison sentence. An overall algorithm identifies editing operations such as replacements, position swaps and adjustments for a final score calculation. Once final scores are calculated between the primary sentence and multiple comparison sentences, a primary/comparison sentence pair can be selected, based on the score, to serve as a basis for translating the primary sentence.
    • 各种实施例提供了一种利用句级模糊匹配的翻译记忆系统和基于直接对齐的评分算法。 在一个或多个实施例中,模糊匹配评分公式包括使用编辑操作定义来定义作为整体得分的一部分计算的各种扣除,总体评分算法以及词级评分和部分匹配定义。 直接对齐算法使用与主句和比较句相关联的成对差分矩阵来找到两个句子之间的计算对齐。 总体算法识别编辑操作,例如替换,位置互换和最终得分计算的调整。 一旦在主句和多个比较句子之间计算最终分数,可以基于分数来选择主/比较句对,以作为翻译主句的基础。
    • 5. 发明授权
    • Efficient use of exceptions in text segmentation
    • 在文本分割中有效地使用异常
    • US08086442B1
    • 2011-12-27
    • US12968348
    • 2010-12-15
    • Enyuan WuAlan K. MichaelMarcus A. TaylorBeom Seok OhShusuke Uehara
    • Enyuan WuAlan K. MichaelMarcus A. TaylorBeom Seok OhShusuke Uehara
    • G06F17/20G06F17/27
    • G06F17/2294G06F17/2229
    • Input text may be broken into sentence, or other types of segments, by first detecting exceptions in the input text, and then detecting break positions. Given a segment breaking scheme that comprises a set of break rules and a set of exceptions, a regular expression is created that represents the break rules, and another regular expression is created that represents the exceptions. The input text is analyzed to identify strings that match any exception, and the matching strings are substituted with placeholders that are not likely to occur naturally in the input. The resulting text, with substitutions, is then evaluated to find the positions in the text that match the break rules. Those positions are declared to be segment breaks, and the placeholders are then replaced with the original strings. The result is the original text, with breaks assigned to the appropriate positions in the text.
    • 通过首先检测输入文本中的异常,然后检测断点位置,将输入文本分解成句子或其他类型的段。 给定一个包含一组中断规则和一组异常的分段断开方案,创建一个表示断点规则的正则表达式,并创建另一个表示异常的正则表达式。 分析输入文本以识别与任何异常相匹配的字符串,并且匹配的字符串将替换为不太可能在输入中自然发生的占位符。 然后评估产生的带有替换的文本,以查找与断点规则匹配的文本中的位置。 这些职位被宣布为细分受众群,然后用原始字符串替换占位符。 结果是原始文本,文本中分配给适当位置的中断。
    • 8. 发明授权
    • Matching target strings to known strings
    • 将目标字符串与已知字符串匹配
    • US09251289B2
    • 2016-02-02
    • US13229369
    • 2011-09-09
    • Enyuan Wu
    • Enyuan Wu
    • G06F17/30
    • G06F17/30961G06F17/30864
    • One or more techniques and/or systems are disclosed for matching a target string to a known string. A target string is broken into one or more target terms, and the one or more target terms are matched to known terms in an index tree. The index tree comprises one or more known terms from a plurality of known strings, where the respective known terms in the index tree are associated with one or more known string IDs. A known term that is associated with a known string ID (in the index tree, and to which a target term is matched), is comprised in a known string, which corresponds to the known string ID. The target string can be matched to the known string using the known string's corresponding known string ID that is associated with a desired number of occurrences in the matching of the one or more target terms.
    • 公开了一种或多种技术和/或系统,用于将目标字符串与已知字符串进行匹配。 目标字符串被分解为一个或多个目标术语,并且一个或多个目标术语与索引树中的已知术语相匹配。 索引树包括来自多个已知字符串的一个或多个已知项,其中索引树中的各个已知项与一个或多个已知字符串ID相关联。 与已知字符串ID相关联的已知字符串(在索引树中,并且目标词匹配到其中)被包含在对应于已知字符串ID的已知字符串中。 目标字符串可以使用已知字符串的对应的已知字符串ID与已知字符串匹配,该字符串ID与所述一个或多个目标项的匹配中的期望出现次数相关联。
    • 9. 发明申请
    • MATCHING TARGET STRINGS TO KNOWN STRINGS
    • 匹配目标线到已知的行
    • US20130066898A1
    • 2013-03-14
    • US13229369
    • 2011-09-09
    • Enyuan Wu
    • Enyuan Wu
    • G06F17/30
    • G06F17/30961G06F17/30864
    • One or more techniques and/or systems are disclosed for matching a target string to a known string. A target string is broken into one or more target terms, and the one or more target terms are matched to known terms in an index tree. The index tree comprises one or more known terms from a plurality of known strings, where the respective known terms in the index tree are associated with one or more known string IDs. A known term that is associated with a known string ID (in the index tree, and to which a target term is matched), is comprised in a known string, which corresponds to the known string ID. The target string can be matched to the known string using the known string's corresponding known string ID that is associated with a desired number of occurrences in the matching of the one or more target terms.
    • 公开了一种或多种技术和/或系统,用于将目标字符串与已知字符串进行匹配。 目标字符串被分解为一个或多个目标术语,并且一个或多个目标术语与索引树中的已知术语相匹配。 索引树包括来自多个已知字符串的一个或多个已知项,其中索引树中的各个已知项与一个或多个已知字符串ID相关联。 与已知字符串ID相关联的已知字符串(在索引树中,并且目标词匹配到其中)被包含在对应于已知字符串ID的已知字符串中。 目标字符串可以使用已知字符串的对应的已知字符串ID与已知字符串匹配,该字符串ID与所述一个或多个目标项的匹配中的期望出现次数相关联。