会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Spelling and grammar checking system
    • 拼写和语法检查系统
    • US07853874B2
    • 2010-12-14
    • US11765631
    • 2007-06-20
    • Yves SchabesEmmanuel Roche
    • Yves SchabesEmmanuel Roche
    • G06F17/00G06F17/27
    • G06F17/274G06F17/273Y10S707/99935
    • System of correcting misspelled words in input text detects a misspelled word in the input text, determines a list of alternative words for the misspelled word, and ranks the list of alternative words based on a context of the input text. In certain embodiments, finite state machines (FSMs) are utilized in the spelling and grammar correction process, storing one or more lexicon FSMs, each of which represents a set of correctly spelled reference words. Storing the lexicon as one or more FSMs facilitates those embodiments of the invention employing a client-server architecture. The input text to be corrected may also be encoded as a FSM, which includes alternative word(s) for word(s) in need of correction along with associated weights. The invention adjusts the weights by taking into account the grammatical context in which the word appears in the input text. In certain embodiments the modification is performed by applying a second FSM to the FSM that was generated for the input text, where the second FSM encodes a grammatically correct sequence of words, thereby generating an additional FSM.
    • 在输入文本中纠正拼写错误的单词的系统检测输入文本中的拼写错误的单词,确定拼写错误的单词的备选单词列表,并根据输入文本的上下文排列替代单词列表。 在某些实施例中,在拼写和语法校正过程中使用有限状态机(FSM),存储一个或多个词典FSM,每个词典表示一组正确拼写的参考词。 将词典存储为一个或多个FSM有助于使用客户端 - 服务器架构的本发明的这些实施例。 要校正的输入文本也可以被编码为FSM,其包括需要校正的字的备选字以及关联的权重。 本发明通过考虑到该词在输入文本中出现的语法上下文来调整权重。 在某些实施例中,通过将第二FSM应用于为输入文本生成的FSM来执行修改,其中第二FSM对语法上正确的单词序列进行编码,从而生成附加的FSM。
    • 3. 发明申请
    • SPELLING AND GRAMMAR CHECKING SYSTEM
    • 发芽和粒子检查系统
    • US20080077859A1
    • 2008-03-27
    • US11765631
    • 2007-06-20
    • Yves SchabesEmmanuel Roche
    • Yves SchabesEmmanuel Roche
    • G06F15/00
    • G06F17/274G06F17/273Y10S707/99935
    • System of correcting misspelled words in input text detects a misspelled word in the input text, determines a list of alternative words for the misspelled word, and ranks the list of alternative words based on a context of the input text. In certain embodiments, finite state machines (FSMs) are utilized in the spelling and grammar correction process, storing one or more lexicon FSMs, each of which represents a set of correctly spelled reference words. Storing the lexicon as one or more FSMs facilitates those embodiments of the invention employing a client-server architecture. The input text to be corrected may also be encoded as a FSM, which includes alternative word(s) for word(s) in need of correction along with associated weights. The invention adjusts the weights by taking into account the grammatical context in which the word appears in the input text. In certain embodiments the modification is performed by applying a second FSM to the FSM that was generated for the input text, where the second FSM encodes a grammatically correct sequence of words, thereby generating an additional FSM.
    • 在输入文本中纠正拼写错误的单词的系统检测输入文本中的拼写错误的单词,确定拼写错误的单词的备选单词列表,并根据输入文本的上下文排列替代单词列表。 在某些实施例中,在拼写和语法校正过程中使用有限状态机(FSM),存储一个或多个词典FSM,每个词典表示一组正确拼写的参考词。 将词典存储为一个或多个FSM有助于使用客户端 - 服务器架构的本发明的这些实施例。 要校正的输入文本也可以被编码为FSM,其包括需要校正的字的备选字以及关联的权重。 本发明通过考虑到该词在输入文本中出现的语法上下文来调整权重。 在某些实施例中,通过将第二FSM应用于为输入文本生成的FSM来执行修改,其中第二FSM对语法上正确的单词序列进行编码,从而生成附加的FSM。
    • 4. 发明授权
    • Word inflection correction system
    • 词变形校正系统
    • US5521816A
    • 1996-05-28
    • US251897
    • 1994-06-01
    • Emmanuel RocheYves SchabesAndrew R. Golding
    • Emmanuel RocheYves SchabesAndrew R. Golding
    • G06F17/27
    • G06F17/273
    • In a grammar checking system which includes first tagging a sentence as to parts of speech and recovery of underlying spellings, a system for the correction of inflections includes identifying typical example of words which do not follow normal rules either as to pluralization, past tense, past participle, comparative formation and superlative formation, with this unique list of incorrect words forming the basis for suggesting suitable replacement words the system first performs a conventional spell check to detect mispellings by dictionary lookup system. Thereafter correct words are suggested based on an English dictionary and on the root forms and the morphological features derived from the incorrect words in the compendium.
    • 在语法检查系统中,包括首先将语句标记为词性和恢复基础拼写,用于纠正变形的系统包括识别不符合多元化,过去式,过去的正常规则的单词的典型示例 分词,比较形成和最高级的形成,这个不正确的单词的唯一列表形成建议合适的替换词的基础,系统首先执行常规拼写检查以通过字典查找系统检测误字。 此后,根据英文字典和根本形式以及从纲要中不正确的词导出的形态特征,提出了正确的单词。
    • 5. 发明授权
    • Content sharing with limited cloud storage
    • 内容共享与有限的云存储
    • US08886700B2
    • 2014-11-11
    • US13801083
    • 2013-03-13
    • Emmanuel RocheYves Schabes
    • Emmanuel RocheYves Schabes
    • G06F15/16G06F7/00G06F17/30H04L29/08
    • H04L67/306G06F17/30206
    • Apparatus and methods for sharing electronically rendered information between a plurality of devices over a data communications network with limited used of network data storage is described. Content may be shared automatically between members of a share group, without interactive content-sharing operations being executed by users. The embodiments include content tagging, commenting, searching, and syncing of content. Action metadata messages, that are not viewed by a user of a device, may be sent separately from content portions to notify share-group members of content to be shared. Sharing of content can be accomplished via peer-to-peer links as well as intermediary links, which may execute concurrently.
    • 描述了通过数据通信网络在多个设备之间共享电子呈现的信息的装置和方法,该网络具有有限的网络数据存储。 可以在共享组的成员之间自动共享内容,而不由用户执行交互式内容共享操作。 这些实施例包括内容标记,评论,搜索和内容的同步。 操作元数据消息不被设备的用户查看,可以与内容部分分开发送,以通知共享组成员要共享的内容。 可以通过点对点链路以及可以同时执行的中间链路来实现内容共享。
    • 6. 发明授权
    • Method for detecting and fulfilling an information need corresponding to simple queries
    • 用于检测和实现与简单查询相对应的信息需求的方法
    • US07120627B1
    • 2006-10-10
    • US10305221
    • 2002-11-26
    • Yves SchabesEmmanuel Roche
    • Yves SchabesEmmanuel Roche
    • G06F17/30
    • G06F17/30864G06F17/30646G06F17/30654G06F17/30657G06F17/3066Y10S707/99933Y10S707/99936
    • Described are techniques used in fulfilling an information need not formulated as a natural language question. A query is accepted that includes one or more words not formulated as a natural language question. The query is syntactically analyzed in order to extract a concept from the query. Documents are identified containing the one or more words. The analyzed query is matched to one or more question keys in a structures repository. A best match is determined between the analyzed query and a question key of the structures repository. The key of the at least one best key match is mapped to partially specified queries and the key of the best question key match is mapped to questions representing an information need corresponding to the query. The partially specified queries and questions are matched to potential answers contained in a collection of documents. One or more matching answers are returned based on a metric.
    • 描述的是用于实现不需要形成为自然语言问题的信息的技术。 接受一个包含一个或多个未被表达为自然语言问题的单词的查询。 语法分析查询以从查询中提取概念。 识别包含一个或多个单词的文档。 分析的查询与结构存储库中的一个或多个问题密钥相匹配。 在分析的查询和结构存储库的问题键之间确定最佳匹配。 将至少一个最佳密钥匹配的密钥映射到部分指定的查询,并将最佳问题密钥匹配的密钥映射到表示与查询相对应的信息需求的问题。 部分指定的查询和问题与文档集合中包含的潜在答案相匹配。 基于度量返回一个或多个匹配答案。
    • 7. 发明授权
    • Contextual tagger utilizing deterministic finite state transducer
    • 使用确定性有限状态传感器的语境标签
    • US5610812A
    • 1997-03-11
    • US264981
    • 1994-06-24
    • Yves SchabesEmmanuel Roche
    • Yves SchabesEmmanuel Roche
    • G06F17/27G06F7/27
    • G06F17/274
    • A system for assigning part-of-speech tags to English text includes an improved contextual tagger which utilizes a deterministic finite state transducer to improve tagging speed such that large documents can have its sentences accurately tagged as to parts of speech to permit fast grammar checking, spell checking, information retrieval, text indexing and optical character recognition. The subject system performs by first acquiring a set of rules by examining a training corpus of tagged text. Then, these rules are transformed into a deterministic finite-state transducer through the utilization of non-deterministic transducers, a composer and a determiniser. In order to tag an input sentence, the sentence is initially tagged by first assigning each word in the sentence with its most likely part of speech tag regardless of the surrounding words in the sentences. The deterministic finite-state transducer is then applied on the resulting sequence of part of speech tags using the surrounding words and obtains the final part of speech tags. The Subject System requires an amount of time to compute the part-of-speech tags which is proportional to the number of words in the input sentence and which is independent of the number of rules it has applied.
    • 用于将词性标签分配给英文文本的系统包括改进的上下文标签器,其使用确定性有限状态传感器来改善标记速度,使得大文档可以将句子准确地标记为语音部分以允许快速语法检查, 拼写检查,信息检索,文本索引和光学字符识别。 主题系统通过首先通过检查标签文本的训练语料库获得一组规则来执行。 然后,这些规则通过使用非确定性换能器,作曲家和确定器,被转化为确定性的有限状态换能器。 为了标记输入句子,该句子最初被标记,首先将句子中的每个单词与其最可能的语音标签部分分配,而不管句子中的周围单词。 然后使用周围词将确定性有限状态传感器应用于部分语音标签的所得序列,并获得语音标签的最后部分。 主题系统需要一定的时间来计算与输入句子中的单词数成正比的词性标签,并且与其应用的规则数量无关。
    • 8. 发明授权
    • System for correcting improper determiners
    • 用于校正不正确的确定器的系统
    • US5477448A
    • 1995-12-19
    • US251978
    • 1994-06-01
    • Andrew R. GoldingYves SchabesEmmanuel Roche
    • Andrew R. GoldingYves SchabesEmmanuel Roche
    • G06F17/27G06F17/28
    • G06F17/274
    • In a grammar checking system which includes first tagging a sentence as to parts of speech, an improper determiner correction module detects improper referents of a noun phrase and suggests insertion of a determiner should one be necessary or the deletion of an improper determiner. To detect improper use of a determiner, parts of speech tags are utilized to characterize a sentence, thus to identify noun phrases by maximally matching a pattern that defines which sequences of parts of speech tags constitute valid noun phrases. This is accomplished by identifying the start of the noun phrase and its end to permit checking for either missing determiners, extraneous determiners, or lack of agreement in number for the constituents of the noun phrase. Once a noun phrase is found, the system tests to see if the noun is a head noun and thereafter if the head noun is a singular non-proper noun, whether the noun phrase contains a determiner, whether the noun phrase is a title, whether the head noun is a mass noun or whether the noun phrase is part of an idiom. The system also checks to see if the head noun is a proper noun and if so whether the noun phrase contains a determiner. Finally, if the noun phrase contains a determiner the system checks if the determiner agrees in number with the head noun. In this manner, both missing determiners, extraneous determiners and determiner noun number disagreement are detected and reported.
    • 在语法检查系统中,包括首先将语句标记为词性,不正确的确定器校正模块检测名词短语的不正确指示,并建议插入确定器应该是必需的,或删除不正确的确定器。 为了检测判断器的不当使用,使用词性标签来表征句子,从而通过最大限度地匹配定义语音标签的哪个部分序列构成有效名词短语的模式来识别名词短语。 这是通过识别名词短语的开始和结束,以允许检查缺失的确定者,无关的确定者,或者对于名词短语的组成部分的数量不一致。 一旦发现名词短语,系统就会测试名词是否是头名词,之后如果头名词是单数非正式名词,则名词短语是否包含决定者,名词短语是否是标题,是否 头名词是一个大众名词,还是名词短语是成语的一部分。 系统还检查头名词是否是专有名词,如果是,名词短语是否包含决定者。 最后,如果名词短语包含确定词,则系统检查确定词是否与头名称一致。 以这种方式,检测和报告缺失确定因子,外来决定因素和确定者名词数量不一致。
    • 9. 发明申请
    • CONTENT SHARING WITH LIMITED CLOUD STORAGE
    • 内容共享与有限的云存储
    • US20140122591A1
    • 2014-05-01
    • US13801083
    • 2013-03-13
    • Emmanuel RocheYves Schabes
    • Emmanuel RocheYves Schabes
    • H04L29/08
    • H04L67/306G06F17/30206
    • Apparatus and methods for sharing electronically rendered information between a plurality of devices over a data communications network with limited used of network data storage is described. Content may be shared automatically between members of a share group, without interactive content-sharing operations being executed by users. The embodiments include content tagging, commenting, searching, and syncing of content. Action metadata messages, that are not viewed by a user of a device, may be sent separately from content portions to notify share-group members of content to be shared. Sharing of content can be accomplished via peer-to-peer links as well as intermediary links, which may execute concurrently.
    • 描述了通过数据通信网络在多个设备之间共享电子呈现的信息的装置和方法,该网络具有有限的网络数据存储。 可以在共享组的成员之间自动共享内容,而不由用户执行交互式内容共享操作。 这些实施例包括内容标记,评论,搜索和内容的同步。 操作元数据消息不被设备的用户查看,可以与内容部分分开发送,以通知共享组成员要共享的内容。 可以通过点对点链路以及可以同时执行的中间链路来实现内容共享。
    • 10. 发明授权
    • Spelling and grammar checking system
    • 拼写和语法检查系统
    • US07243305B2
    • 2007-07-10
    • US10153460
    • 2002-05-22
    • Yves SchabesEmmanuel Roche
    • Yves SchabesEmmanuel Roche
    • G06F15/00G06F17/00
    • G06F17/274G06F17/273Y10S707/99935
    • System of correcting misspelled words in input text detects a misspelled word in the input text, determines a list of alternative words for the misspelled word, and ranks the list of alternative words based on a context of the input text. In certain embodiments, finite state machines (FSMs) are utilized in the spelling and grammar correction process, storing one or more lexicon FSMs, each of which represents a set of correctly spelled reference words. Storing the lexicon as one or more FSMs facilitates those embodiments of the invention employing a clinet-server architecture. The input text to be corrected may also be encoded as a FSM, which includes alternative word(s) for word(s) in need of correction along with associated weights. The invention adjusts the weights by taking into account the grammatical context in which the word appears in the input text. In certain embodiments the modification is performed by applying a second FSM to the FSM that was generated for the input text, where the second FSM encodes a grammatically correct sequence of words, thereby generating an additional FSM.
    • 在输入文本中纠正拼写错误的单词的系统检测输入文本中的拼写错误的单词,确定拼写错误的单词的备选单词列表,并根据输入文本的上下文排列替代单词列表。 在某些实施例中,在拼写和语法校正过程中使用有限状态机(FSM),存储一个或多个词典FSM,每个词典表示一组正确拼写的参考词。 将词典存储为一个或多个FSM有助于采用临床 - 服务器架构的本发明的这些实施例。 要校正的输入文本也可以被编码为FSM,其包括需要校正的字的备选字以及关联的权重。 本发明通过考虑到该词在输入文本中出现的语法上下文来调整权重。 在某些实施例中,通过将第二FSM应用于为输入文本生成的FSM来执行修改,其中第二FSM对语法上正确的单词序列进行编码,从而生成附加的FSM。