会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明申请
    • TRANSLATION APPARATUS, TRANSLATION METHOD AND PROGRAM
    • US20220343084A1
    • 2022-10-27
    • US17639459
    • 2020-08-25
    • NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    • Masaaki NAGATAYuto TAKEBAYASHIChenhui CHUYuki ARASE
    • G06F40/49G06F40/242G06F40/284
    • A translation apparatus includes: a preprocessing unit that takes an input sentence in a source language and outputs a token string in which the input sentence has been segmented in tokens, the tokens being a predetermined unit of processing; an output sequence prediction unit that inputs the token string output by the preprocessing unit to a trained translation model and predicts a word translation probability of a translation candidate for each token of the token string from the trained translation model; a word set prediction unit that checks each token of the token string output by the preprocessing unit against entry words of a bilingual dictionary, and upon detecting an entry word that agrees with the token in the bilingual dictionary, generates a target-language word set from a set of tokens constituting a translation phrase corresponding to the detected entry word; and an output sequence determination unit that computes a reward which is based on whether a translation candidate for each token of the input sentence is included in the target-language word set or not and determines a translated sentence of the input sentence based on a word translation score computed by adding the reward to the word translation probability of the translation candidate. Units of tokens constituting the translation phrase in the bilingual dictionary are subwords.
    • 7. 发明申请
    • FAST SPARSE OPTIMIZATION DEVICE, FAST SPARSE OPTIMIZATION METHOD, AND PROGRAM
    • US20220075844A1
    • 2022-03-10
    • US17417352
    • 2019-12-17
    • NIPPON TELEGRAPH AND TELEPHONE CORPORATION
    • Shinsaku SAKAUEMasaaki NAGATA
    • G06F17/16
    • An object is to make it possible to find a high-quality solution at a high speed even for a nonconvex sparse optimization problem of bad conditions. A computation unit 130 computes, with respect to each element that is not included in a set of nonzero elements that is previously obtained or an initial value of the set of nonzero elements, an optimum value of an objective function in a case in which elements that are allowed to be nonzero elements are only elements included in a set that is obtained by adding the element not included in the set of nonzero elements to the set of nonzero elements. A main processing unit 120 selects added elements in the order of optimum values of the objective function and adds the selected elements to the set of nonzero elements, the number of selected elements being an addition upper limit number determined in advance for each number of times of repetition such that a sum total of addition upper limit numbers is a predetermined number, the elements being selected such that an element with which a preferable optimum value can be obtained is preferentially selected. A determination unit 140 causes the computation unit 130 to repeatedly perform computation and causes the main processing unit 120 to repeatedly perform selection and addition. An output unit 150 outputs a value of the variable vector that optimizes the value of the objective function when only the set of nonzero elements is allowed to be nonzero elements.