会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 19. 发明申请
    • METHOD FOR AUTOMATICALLY COMPUTING PROFICIENCY OF PROGRAMMING SKILLS
    • 自动计算编程技能的方法
    • US20090182757A1
    • 2009-07-16
    • US11972760
    • 2008-01-11
    • Rohit Manohar LotlikarNandakishore Kambhatla
    • Rohit Manohar LotlikarNandakishore Kambhatla
    • G06F17/00
    • G06Q30/02
    • Techniques for automatically computing a programmer proficiency rating for one or more programmers are provided. The techniques include obtaining one or more programmer artifacts for each programmer to be assessed, obtaining one or more programmer artifacts and one or more human proficiency ratings for a separate set of one or more programmers, training a first module to learn a rating model from the one or more programmer artifacts and one or more human proficiency ratings for the separate set of one or more programmers, and using a second module to apply the rating model to the one or more programmer artifacts for each programmer to be assessed to automatically generate the programmer proficiency rating for each programmer. Techniques are also provided for generating a database of one or more programmer proficiency ratings.
    • 提供了自动计算一个或多个程序员程序员熟练程度的技术。 这些技术包括为要评估的每个程序员获得一个或多个程序员工件,为一个或多个程序员的单独集合获得一个或多个程序员工件和一个或多个人员熟练度等级,训练第一模块以从 一个或多个程序员工件和对于一个或多个程序员的单独集合的一个或多个人员熟练度等级,并且使用第二模块将评估模型应用于要被评估的每个程序员的一个或多个编程器工件以自动生成编程器 每位程序员的熟练程度。 还提供了用于生成一个或多个程序员熟练度等级的数据库的技术。
    • 20. 发明授权
    • Method and apparatus for creating speech recognition grammars
constrained by counter examples
    • 用于创建由计数器示例约束的语音识别语法的方法和装置
    • US5937385A
    • 1999-08-10
    • US954761
    • 1997-10-20
    • Wlodek Wlodzimierz ZadroznyNandakishore Kambhatla
    • Wlodek Wlodzimierz ZadroznyNandakishore Kambhatla
    • G10L15/18G10L5/06G10L9/00
    • G10L15/193G10L15/183
    • An automated system generates and revises grammars for speech recognizers in a speech recognition system. Given an initial grammar, expressed in terms of non-terminals in Backus-Naur Form (BNF) notation, a sentence generator generates a list of all sentences accepted by the grammar. From this list, a corpus of inappropriate or irrelevant sentences which are accepted by the grammar (counter-examples) is identified. A grammar revisor program uses the original grammar and the list of counter examples, to generate a pruned list from which a revised grammar is generated. The revision process is iterated several times either concatenating or merging pairs of non-terminals until the revised grammar is deemed satisfactory in that it accepts as legal only relevant sentences. The revised grammar is used by the speech recognizer, thus reducing errors in the overall system.
    • 自动化系统生成和修改语音识别系统中语音识别器的语法。 给出一种初始语法,用Backus-Naur表格(BNF)表示法表示非终端语法,一个句子生成器生成语法接受的所有句子的列表。 从该列表中,确定了语法接受的不适当或不相关句子的语料库(反例)。 语法指导程序使用原始语法和计数器示例列表来生成修剪的语法的修剪列表。 修订过程多次重复连接或合并非终端对,直到修改后的语法被认为是令人满意的,因为它只接受合法的相关句子。 修改后的语法由语音识别器使用,从而减少了整个系统的错误。