公开(公告)号：US20070220365A1

公开(公告)日：2007-09-20

申请号：US11378134

申请日：2006-03-17

申请人： Stefania Castellani ,  Nicola Cancedda ,  Maria Grasso ,  Jacki O'Neill

发明人： Stefania Castellani ,  Nicola Cancedda ,  Maria Grasso ,  Jacki O'Neill

IPC分类号： G06F11/00

CPC分类号： G06Q10/00 ,  G03G15/502 ,  G03G15/5075 ,  G03G15/55 ,  G03G2215/00109

摘要： A method for assisting a user to correct a problem with a device, such as a printer includes extracting, from records comprising user actions on the device, a string of user actions on the device. The string of user actions is compared with at least one predetermined sequence of user actions for correction of a predefined problem with the device. Based on the comparison, an evaluation is made as to whether at least one prior user has attempted the predetermined sequence and, if so, a procedure is implemented to avoid a user repeating the prior attempt.

摘要翻译： 用于帮助用户纠正诸如打印机的设备的问题的方法包括从设备上包括用户动作的记录中提取在设备上的用户动作串。 将用户操作串与至少一个预定的用户动作顺序进行比较，以便用于校正与设备的预定义问题。 基于比较，评估至少一个在先用户是否尝试了预定的序列，如果是，则实施一个过程以避免用户重复先前的尝试。

公开(公告)号：US07647534B2

公开(公告)日：2010-01-12

申请号：US11378134

申请日：2006-03-17

申请人： Stefania Castellani ,  Nicola Cancedda ,  Maria Antonietta Grasso ,  Jacki O'Neill

发明人： Stefania Castellani ,  Nicola Cancedda ,  Maria Antonietta Grasso ,  Jacki O'Neill

IPC分类号： G06F11/00

CPC分类号： G06Q10/00 ,  G03G15/502 ,  G03G15/5075 ,  G03G15/55 ,  G03G2215/00109

摘要： A method for assisting a user to connect a problem with a device, such as a printer includes extracting, from records comprising user actions on the device, string of user actions on the device. The string of user action is compared with at least one predetermined sequence of user actions for correction of predefined problem with the device. Based on the comparison, an evaluation is made as to whether at least one prior user has attempted the predetermined sequence and, if so, a procedure is implemented to avoid a user repeating the prior attempt.

摘要翻译： 用于辅助用户将问题与诸如打印机的设备连接的方法包括从包括设备上的用户动作的记录中提取在设备上的用户动作串。 将用户操作串与至少一个预定的用户动作序列进行比较，以便用于校正与设备的预定义问题。 基于比较，评估至少一个在先用户是否尝试了预定的序列，如果是，则实施一个过程以避免用户重复先前的尝试。

公开(公告)号：US09552355B2

公开(公告)日：2017-01-24

申请号：US12784040

申请日：2010-05-20

申请人： Marc Dymetman ,  Wilker Ferreira Aziz ,  Nicola Cancedda ,  Jean-Marc Coursimault ,  Vassilina Nikoulina ,  Lucia Specia

发明人： Marc Dymetman ,  Wilker Ferreira Aziz ,  Nicola Cancedda ,  Jean-Marc Coursimault ,  Vassilina Nikoulina ,  Lucia Specia

IPC分类号： G06F17/28

CPC分类号： G06F17/2827 ,  G06F17/2818

摘要： A system and a method for phrase-based translation are disclosed. The method includes receiving source language text to be translated into target language text. One or more dynamic bi-phrases are generated, based on the source text and the application of one or more rules, which may be based on user descriptions. A dynamic feature value is associated with each of the dynamic bi-phrases. For a sentence of the source text, static bi-phrases are retrieved from a bi-phrase table, each of the static bi-phrases being associated with one or more values of static features. Any of the dynamic bi-phrases which each cover at least one word of the source text are also retrieved, which together form a set of active bi-phrases. Translation hypotheses are generated using active bi-phrases from the set and scored with a translation scoring model which takes into account the static and dynamic feature values of the bi-phrases used in the respective hypothesis. A translation, based on the hypothesis scores, is then output.

摘要翻译： 公开了一种用于基于短语的翻译的系统和方法。 该方法包括接收要翻译成目标语言文本的源语言文本。 基于可以基于用户描述的一个或多个规则的源文本和应用来生成一个或多个动态双词组。 动态特征值与每个动态双词组相关联。 对于源文本的句子，从双词表检索静态双词组，每个静态双词组与一个或多个静态特征值相关联。 还检索了每个覆盖源文本的至少一个单词的动态双词组，其一起形成一组活动双词组。 使用来自集合的活动双词组产生翻译假设，并用考虑到各自假设中使用的双词组的静态和动态特征值的翻译评分模型进行评分。 然后输出基于假设分数的翻译。

公开(公告)号：US08612205B2

公开(公告)日：2013-12-17

申请号：US12814657

申请日：2010-06-14

申请人： Gregory Alan Hanneman ,  Nicola Cancedda ,  Marc Dymetman

发明人： Gregory Alan Hanneman ,  Nicola Cancedda ,  Marc Dymetman

IPC分类号： G06F17/28 ,  G06F17/20 ,  G06F17/27 ,  G10L21/00 ,  G06F17/30

CPC分类号： G06F17/2827

摘要： A system and method for generating word alignments from pairs of aligned text strings are provided. A corpus of text strings provides pairs of text strings, primarily sentences, in source and target languages. A first alignment between a text string pair creates links therebetween. Each link links a single token of the first text string to a single token of the second text string. A second alignment also creates links between the text string pair. In some cases, these links may correspond to bi-phrases. A modified first alignment is generated by selectively modifying links in the first alignment which include a word which is infrequent in the corpus, based on links generated in the second alignment. This results in removing at least some of the links for the infrequent words, allowing more compact and better quality bi-phrases, with higher vocabulary coverage, to be extracted for use in a machine translation system.

摘要翻译： 提供了用于从对齐的文本串对中生成字对齐的系统和方法。 文本字符串的语料库以源语言和目标语言提供了一对文本字符串，主要是句子。 文本串对之间的第一对齐在其间创建链接。 每个链接将第一个文本字符串的单个标记链接到第二个文本字符串的单个标记。 第二个对齐也创建文本串对之间的链接。 在某些情况下，这些链接可能对应于双语短语。 通过基于在第二对准中产生的链接，通过选择性地修改第一对齐中的链接来生成修改的第一对准，该链接包括语料库中不频繁的单词。 这导致删除不频繁的单词的至少一些链接，允许提取具有较高词汇覆盖率的更紧凑和更好质量的双语短语以用于机器翻译系统。

公开(公告)号：US20130042108A1

公开(公告)日：2013-02-14

申请号：US13204894

申请日：2011-08-08

申请人： Nicola Cancedda

发明人： Nicola Cancedda

IPC分类号： H04L9/32

CPC分类号： G06F21/6227 ,  G06F21/602 ,  G06F21/606 ,  G06F2221/2115 ,  H04L9/0894 ,  H04L9/321

摘要： A server and a client mutually exclusively execute server-side and client-side commutative cryptographic processes and server-side and client-side commutative permutation processes. The server has access to a hash table, while the client does not. The server and client perform a method including: encrypting and reordering the hash table using the server; communicating the encrypted and reordered hash table to the client; further encrypting and further reordering the hash table using the client; communicating the further encrypted and further reordered hash table back to the server; and partially decrypting and partially undoing the reordering using the server to generate a double-blind hash table. To read an entry, the client hashes and permute an index key and communicates same to the server which retrieves an item from the double-blind hash table using the hashed and permuted index key and sends it back to the client which decrypts the retrieved item.

摘要翻译： 服务器和客户端互斥地执行服务器端和客户端交换密码过程以及服务器端和客户端交换排列过程。 服务器可以访问哈希表，而客户端则不能访问。 服务器和客户机执行一种方法，包括：使用服务器对散列表进行加密和重新排序; 将加密和重新排序的哈希表传送给客户端; 使用客户端进一步加密和进一步重新排序哈希表; 将进一步加密和进一步重新排序的哈希表传送回服务器; 并使用服务器部分地解密并部分地解除重排序以生成双盲哈希表。 为了读取条目，客户端将使用散列和置换的索引关键字将索引关键字进行散列并置换索引关键字并将其从使用双盲散列表检索项目的服务器进行通信，并将其发送回解密检索项目的客户端。

公开(公告)号：US07587307B2

公开(公告)日：2009-09-08

申请号：US10737972

申请日：2003-12-18

申请人： Nicola Cancedda ,  Kenji Yamada

发明人： Nicola Cancedda ,  Kenji Yamada

IPC分类号： G06F17/27 ,  G06F17/28

CPC分类号： G06F17/2854 ,  G06F17/28 ,  G06F17/3069

摘要： Quality of machine translation of natural language is determined by computing a sequence kernel that provides a measure of similarity between a first sequence of symbols representing a machine translation in a target natural language and a second sequence of symbols representing a reference translation in the target natural language. The measure of similarity takes into account the existence of non-contiguous subsequences shared by the first sequence of symbols and the second sequence of symbols. When the similarity measure does not meet an acceptable threshold level, the translation model of the machine translator may be adjusted to improve subsequent translations performed by the machine translator.

摘要翻译： 自然语言的机器翻译的质量通过计算提供表示目标自然语言中的机器翻译的第一符号序列与表示目标自然语言中的参考翻译的第二符号序列之间的相似度的度量来确定 。 相似性的度量考虑了由第一符号序列和第二符号序列共享的非连续子序列的存在。 当相似性度量不满足可接受的阈值水平时，可以调整机器翻译器的翻译模型，以改善由机器翻译器执行的后续翻译。

公开(公告)号：US20080300857A1

公开(公告)日：2008-12-04

申请号：US11756684

申请日：2007-06-01

申请人： Madalina Barbaiani ,  Nicola Cancedda ,  Christopher R. Dance ,  Szilard Zsolt Fazekas ,  Tamas Gaal ,  Eric Gaussier

发明人： Madalina Barbaiani ,  Nicola Cancedda ,  Christopher R. Dance ,  Szilard Zsolt Fazekas ,  Tamas Gaal ,  Eric Gaussier

IPC分类号： G06F17/28

CPC分类号： G06F17/2827

摘要： An alignment method includes, for a source sentence in a source language, identifying whether the sentence includes at least one candidate term comprising a contiguous subsequence of words of the source sentence. A target sentence in a target language is aligned with the source sentence. This includes developing a probabilistic model which models conditional probability distributions for alignments between words of the source sentence and words of the target sentence and generating an optimal alignment based on the probabilistic model, including, where the source sentence includes the at least one candidate term, enforcing a contiguity constraint which requires that all the words of the target sentence which are aligned with an identified candidate term form a contiguous subsequence of the target sentence.

摘要翻译： 对准方法包括对于源语言的源语句，识别句子是否包括包括源语句的单词的连续子序列的至少一个候选词。 目标语言中的目标句子与源语句对齐。 这包括开发概率模型，其模拟条件概率分布，用于源语句的单词与目标句子的单词之间的对齐，并且基于概率模型产生最佳对齐，包括：源语句包括至少一个候选词， 执行连续性约束，其要求与所识别的候选词对齐的目标句子的所有单词形成目标句子的连续子序列。

公开(公告)号：US09213696B2

公开(公告)日：2015-12-15

申请号：US13590372

申请日：2012-08-21

申请人： Nicola Cancedda

发明人： Nicola Cancedda

IPC分类号： G06F17/28 ,  H04L9/32 ,  H04L9/06 ,  H04L9/08

CPC分类号： G06F17/289 ,  H04L9/0643 ,  H04L9/0822 ,  H04L9/3236

摘要： The disclosed embodiments relate to systems and methods for securely accessing a phrase table. One or more records in the phrase table are encrypted using a first set of keys. The first set of keys is encrypted using a second key. A decoder module is compiled based on the second key. Thereafter, the one or more encrypted records and/or the decoder module are transmitted to the first computing device at the client side. The first set of encrypted keys is transmitted to a second computing device. The first computing device transmits a request to the second computing device to send an encrypted key. The decoder module decrypts the encrypted key to generate a key. The first computing device uses the key to decrypt one or more encrypted records.

摘要翻译： 所公开的实施例涉及用于安全地访问短语表的系统和方法。 短语表中的一个或多个记录使用第一组密钥进行加密。 第一组密钥使用第二个密钥进行加密。 基于第二密钥编译解码器模块。 此后，一个或多个加密记录和/或解码器模块在客户端被发送到第一计算设备。 第一组加密密钥被发送到第二计算设备。 第一计算设备向第二计算设备发送请求以发送加密的密钥。 解码器模块解密加密的密钥以产生密钥。 第一计算设备使用密钥来解密一个或多个加密记录。

公开(公告)号：US08504353B2

公开(公告)日：2013-08-06

申请号：US12509633

申请日：2009-07-27

申请人： Mikhail Zaslavskiy ,  Marc Dymetman ,  Nicola Cancedda

发明人： Mikhail Zaslavskiy ,  Marc Dymetman ,  Nicola Cancedda

IPC分类号： G06F17/28

CPC分类号： G06F17/2818

摘要： Systems and methods are described that facilitate phrase-based statistical machine translation (SMT) incorporating bigram (or higher n-gram) language models by modeling bi-phrases as nodes in a graph. Additionally, construction of a translation is modeled as a “tour” amongst the nodes of the graph, such that a translation solution is generated by treating the graph as a generalized traveling salesman problem (GTSP) and solving for an optimal tour. The overall cost of a tour is computed by adding the costs associated with the edges traversed during the tour. Thus, the described systems and methods map the SMT problem directly into a GTSP problem, which itself can be directly converted into a TSP problem.

摘要翻译： 描述了系统和方法，其通过将双语作为图形中的节点建模来促进通过混合二进制（或更高n-gram）语言模型的基于短语的统计机器翻译（SMT）。 另外，翻译的构建被建模为图形的节点之间的“旅游”，使得通过将图形视为广义旅行推销员问题（GTSP）并解决最佳旅游来生成翻译解决方案。 旅游的总体成本是通过添加与旅行中遍历的边缘相关联的成本来计算的。 因此，所描述的系统和方法将SMT问题直接映射到GTSP问题中，其本身可以直接转换成TSP问题。

公开(公告)号：US20130030787A1

公开(公告)日：2013-01-31

申请号：US13189738

申请日：2011-07-25

申请人： Nicola Cancedda ,  Sara Stymne

发明人： Nicola Cancedda ,  Sara Stymne

IPC分类号： G06F17/28

CPC分类号： G06F17/2881 ,  G06F17/2755 ,  G06F17/2818

摘要： A method and a system for making merging decisions for a translation are disclosed which are suited to use where the target language is a productive compounding one. The method includes outputting decisions on merging of pairs of words in a translated text string with a merging system. The merging system can include a set of stored heuristics and/or a merging model. In the case of heuristics, these can include a heuristic by which two consecutive words in the string are considered for merging if the first word of the two consecutive words is recognized as a compound modifier and their observed frequency f1 as a closed compound word is larger than an observed frequency f2 of the two consecutive words as a bigram. In the case of a merging model, it can be one that is trained on features associated with pairs of consecutive tokens of text strings in a training set and predetermined merging decisions for the pairs. A translation in the target language is output, based on the merging decisions for the translated text string.

摘要翻译： 公开了一种用于进行翻译的合并决定的方法和系统，其适用于目标语言是生产性复合的目的语言。 该方法包括输出关于将翻译的文本串中的单词对合并到合并系统的决定。 合并系统可以包括一组存储的启发式和/或合并模型。 在启发式的情况下，这些可以包括启发式，如果两个连续字中的第一个单词被识别为复合修饰符，则将字符串中的两个连续字考虑用于合并，并且其作为闭合复合词的观察频率f1较大 比观察到的两个连续词的频率f2为一个二进制数。 在合并模型的情况下，它可以是针对与训练集中的文本串的连续令牌的对相关联的特征以及针对对的预定的合并决策而训练的特征。 基于翻译文本字符串的合并决定，输出目标语言的翻译。