Country
Full text data for US,EP,CN
Type
Legal Validity
Legal Status
Filing Date
Publication Date
Inventor
Assignee
Click to expand
IPC(Section)
IPC(Class)
IPC(Subclass)
IPC(Group)
IPC(Subgroup)
LOC
Agent
Agency
Claims Number
Figures Number
Citation Number of Times
Assignee Number
No. Publication Number Title Publication/Patent Number Publication/Patent Number Publication Date Publication Date
Application Number Application Number Filing Date Filing Date
Inventor Inventor Assignee Assignee IPC IPC
1
US2021124803A1
USER-CUSTOMIZED COMPUTER-AUTOMATED TRANSLATION
Publication/Patent Number: US2021124803A1 Publication Date: 2021-04-29 Application Number: 16/665,446 Filing Date: 2019-10-28 Inventor: Alloh, Mustafa   Grant, Robert Huntington   Ads, Hesham Mohamed Mohamed   Mulder, Jessica   Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION   IPC: G06F17/27 Abstract: A user-customized method, system and computer program for automated translation from a source language and a target language. The user's native language and accent are detected, from which a set of phonemes is determined which are those that are difficult to pronounce for that user based on his or her native language and accent. A translation engine is applied to translate a fragment of the source language input into target language output, wherein the translation is performed with reference to the synonym database for the target language so as to preferentially avoid word strings in the output that contain phonemes that exist in the user's set of difficult-to-pronounce phonemes.
2
US2020110806A1
METHODS, DEVICES AND SYSTEMS FOR DATA AUGMENTATION TO IMPROVE FRAUD DETECTION
Publication/Patent Number: US2020110806A1 Publication Date: 2020-04-09 Application Number: 16/595,890 Filing Date: 2019-10-08 Inventor: Goutal, Sebastien   Meyer, Maxime Marc   Assignee: Vade Secure, Inc.   IPC: G06F17/27 Abstract: A computer-implemented method of generating an augmented electronic text document comprises establishing a directed multigraph where each vertex is associated with a separate language and is connected to at least one other one of the vertices by an oriented edge indicative of a machine translation engine's ability to translate between languages associated with the vertices connected by the oriented edge with acceptable performance. The directed multigraph is then traversed starting at a predetermined origin vertex associated with an original language of the original electronic text document by randomly selecting an adjacent vertex pointed to by an oriented edge connected to the predetermined origin vertex and causing a machine translation engine to translate the original electronic text document from the original language to a language associated with the selected vertex. The directed multigraph is then further traversed as allowed by the oriented edges from the intermediate vertex to successive other next-adjacent connected vertices, each time machine translating a previously-translated electronic text document into a language associated with a randomly-selected next-adjacent vertex until the predetermined origin vertex is selected and the previously translated electronic text document is re-translated into the original language and designated as the augmented electronic text document.
3
US2020097552A1
SYNONYM DETERMINATION DEVICE AND SYNONYM DETERMINATION METHOD
Publication/Patent Number: US2020097552A1 Publication Date: 2020-03-26 Application Number: 16/524,403 Filing Date: 2019-07-29 Inventor: Haruna, Takaaki   Takeuchi, Tadashi   Oda, Takuya   Assignee: HITACHI, LTD.   IPC: G06F17/27 Abstract: Provided is a synonym determination method to improve the determination accuracy of synonyms and reduce data and work. By executing the attribute tag attaching program 21, the CPU 11 attaches an attribute tag to a word extracted from the document data 31. By executing the word co-occurrence index calculation program 22, the CPU 11 calculates a co-occurrence index between words. By executing the attribute-related word search program 23, when there is a set of words having the same attribute among words whose co-occurrence index calculated between words having attributes related with each other is equal to or more than the lower limit value, the CPU 11 determines the set of words to be synonymous. By executing the synonym registration program 24, the CPU 11 presents the words determined to be synonymous to the user 3 as synonym candidates and registers the words presented in the synonym dictionary.
4
US2020134025A1
Augmentation of a Text Representation Model
Publication/Patent Number: US2020134025A1 Publication Date: 2020-04-30 Application Number: 16/168,913 Filing Date: 2018-10-24 Inventor: Margulis, Daniel   Branson, Courtney   Hackett, Marquis   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: Embodiments relate to a system, program product, and method for use with an intelligent computer platform and cognitive processing. The embodiments support a mechanism for employing machine learning into dynamically processing a file. File data points are converted to vector form and augmented with similar or synonymous terms. The vector representations of the data points are utilized to identify words and their frequencies, and the identified frequencies are extrapolated and applied to the synonymous terms. As communications are received, the ML model converts the communication to vector form, and compares a feature vector of the communication with data point or file feature vectors to identify and map the communication to a similarly classified file.
5
US2020004826A1
PERSONALIZATION AND SYNONYM HIERARCHY FOR SMART REPLIES
Publication/Patent Number: US2020004826A1 Publication Date: 2020-01-02 Application Number: 16/020,167 Filing Date: 2018-06-27 Inventor: Pasternack, Jeffrey William   Assignee: Microsoft Technology Licensing, LLC   IPC: G06F17/27 Abstract: Techniques for generating smart replies are disclosed herein. A computer system may generate candidate replies to a message from a first device of a first user to a second device of a second user based on content of the message using a first model, and determine synonym replies based on the candidate replies using a hierarchical graph data structure, with the synonym replies including the candidate replies in addition to synonyms of the candidate replies, the hierarchical graph data structure comprising a tree of concepts ranging from root nodes to leaf nodes of synonym replies. The computer system may generate smart replies using a second model based on the synonym replies and corresponding user selection data for each one of the plurality of synonym replies, with the user selection data indicating a number of times the second user has selected the corresponding synonym reply for replying to messages.
6
US2020073944A1
Generation of Variable Natural Language Descriptions From Structured Data
Publication/Patent Number: US2020073944A1 Publication Date: 2020-03-05 Application Number: 16/120,979 Filing Date: 2018-09-04 Inventor: Mishra, Abhijit   Jain, Parag   Laha, Anirban   Sankaranarayanan, Karthik   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: Techniques for the generation of variable natural language descriptions from structured data are disclosed including receiving input data and generating a first plurality of tuples based on the received input data. A first plurality of sentences and a corresponding second plurality of tuples are obtained from a data repository based on the first plurality of tuples. A second plurality of sentences is generated based on the second plurality of tuples, the first plurality of sentences, and the first plurality of tuples. A sentence is selected from the first plurality of sentences and the second plurality of sentences for each of the first plurality of tuples. At least one paragraph variation is generated where each paragraph variation is generated based on two or more of the selected sentences. The at least one paragraph variation is presented as a natural language description of the input data.
7
US10546068B2
Contextual validation of synonyms in otology driven natural language processing
Publication/Patent Number: US10546068B2 Publication Date: 2020-01-28 Application Number: 16/173,186 Filing Date: 2018-10-29 Inventor: Edwards, Stephen J.   Nassar, Ahmed M.   Trim, Craig M.   Wong, Albert T.   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: Embodiments described herein provide approaches for validating synonyms in ontology driven natural language processing. Specifically, an approach is provided for receiving a user input containing a token, structuring the user input into a semantic model comprising a set of classes each containing a set of related permutations of the token, designating the token as a synonym of one of the set of related permutations, annotating the token with a class from the set of classes corresponding to the one of the set of related permutations, and validating the annotation of the token by determining an accuracy of the designation of the token as a synonym of the one of the set of related permutations. In one embodiment, the accuracy is determined by quantifying a linear distance between the token and a contextual token also within the user input, and comparing the linear distance to a pre-specified linear distance limit.
8
US2020004825A1
GENERATING DIVERSE SMART REPLIES USING SYNONYM HIERARCHY
Publication/Patent Number: US2020004825A1 Publication Date: 2020-01-02 Application Number: 16/020,148 Filing Date: 2018-06-27 Inventor: Pasternack, Jeffrey William   Dhariwal, Arpit   Zhao, Bing   Chakravarthi, Nimesh Madhavan   Channabasappa, Rajashekar Nandeesh   Assignee: Microsoft Technology Licensing, LLC   IPC: G06F17/27 Abstract: Techniques for generating diverse smart replies using a synonym hierarchy are disclosed herein. A computer system may detect that a first set of one or more messages having first content has been transmitted from a first computing device of a first user to a second computing device of a second user, determine a plurality of candidate replies based on the first content of the first set of one or more messages, and then select a plurality of smart replies from the plurality of candidate replies using a hierarchical graph data structure and at least one diversity rule. The selecting of the plurality of smart replies comprises omitting at least one of the plurality of candidate replies from selection based on the at least one diversity rule, which limits a number of the plurality of smart replies that have a common parent node.
9
US2020272698A1
METHODS AND ARRANGEMENTS TO ADJUST COMMUNICATIONS
Publication/Patent Number: US2020272698A1 Publication Date: 2020-08-27 Application Number: 16/287,530 Filing Date: 2019-02-27 Inventor: Abdi, Taghi Abad Fardin   Walters, Austin Grant   Goodsitt, Jeremy Edward   Farivar, Reza   Pham, Vincent   Truong, Anh   Assignee: Capital One Services, LLC   IPC: G06F17/27 Abstract: Logic may adjust communications between customers. Logic may cluster customers into a first group associated with a first subset of synonyms and a second group associated with a second subset of the synonyms. Logic may associate a first tag with the first group and with each of the synonyms of the first subset. Logic may associate a second tag with the second group and with each of the synonyms of the second subset. Logic may associate one or more models with pairs of the groups. A first pair may comprise the first group and the second group. The first model associated with the first pair may adjust words in communications between the first group and the second group, based on the synonyms associated with the first pair, by replacement of words in a communication between customers of the first subset and customers of the second sub set.
10
US2020342061A1
GENERATION OF DOMAIN THESAURUS
Publication/Patent Number: US2020342061A1 Publication Date: 2020-10-29 Application Number: 16/396,197 Filing Date: 2019-04-26 Inventor: Kaufmann, Joseph M.   Krishnamurthy, Lakshminarayanan   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: Embodiments provide a computer implemented method for generating a domain-specific thesaurus on a cognitive system, comprising: receiving data of the domain-specific corpus and a plurality of terms of interest from a user; splitting the data of the domain-specific corpus into a plurality of sentences using natural language processing techniques; for each term in the plurality of terms of interest, retrieving a plurality of candidate sentences containing a corresponding term, from the plurality of sentences; for each candidate sentence, providing a list of synonyms of the corresponding term, wherein the synonyms are contextual alternatives in the corresponding candidate sentence; for each term in the plurality of terms of interest, tracking a frequency of each synonym, and forming a frequency map including all the synonyms of a corresponding term and the frequency of each synonym; and generating a domain-specific thesaurus based on a combination of all the synonyms in the frequency map.
11
US2019065475A1
CONTEXTUAL VALIDATION OF SYNONYMS IN OTOLOGY DRIVEN NATURAL LANGUAGE PROCESSING
Publication/Patent Number: US2019065475A1 Publication Date: 2019-02-28 Application Number: 16/173,186 Filing Date: 2018-10-29 Inventor: Edwards, Stephen J.   Nassar, Ahmed M.   Trim, Craig M.   Wong, Albert T.   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: Embodiments described herein provide approaches for validating synonyms in ontology driven natural language processing. Specifically, an approach is provided for receiving a user input containing a token, structuring the user input into a semantic model comprising a set of classes each containing a set of related permutations of the token, designating the token as a synonym of one of the set of related permutations, annotating the token with a class from the set of classes corresponding to the one of the set of related permutations, and validating the annotation of the token by determining an accuracy of the designation of the token as a synonym of the one of the set of related permutations. In one embodiment, the accuracy is determined by quantifying a linear distance between the token and a contextual token also within the user input, and comparing the linear distance to a pre-specified linear distance limit.
12
WO2019120169A1
SYNONYMOUS DATA AUTOMATIC ASSOCIATION METHOD AND APPARATUS IN HETEROGENEOUS DATABASE, AND ELECTRONIC DEVICE
Publication/Patent Number: WO2019120169A1 Publication Date: 2019-06-27 Application Number: 2018121512 Filing Date: 2018-12-17 Inventor: Guo, Xingrong   Assignee: BEIJING KINGSOFT CLOUD TECHNOLOGY CO., LTD.   BEIJING KINGSOFT CLOUD NETWORK TECHNOLOGY CO., LTD.   IPC: G06F16/20 Abstract: Provided are a synonymous data automatic association method and apparatus in a heterogeneous database, and an electronic device. The method comprises: acquiring a field in a first database and a second database, wherein the first database and the second database are mutually heterogeneous databases; searching for a word corresponding to the acquired field in a lexicon based on a mapping relationship between a pre-set field and a word in a lexicon, so as to obtain a word corresponding to each field in the first database and a word corresponding to each field in the second database, wherein the lexicon includes technical terms of the industry to which the first database and the second database belong; respectively comparing the similarity between the word corresponding to each field in the first database and the word corresponding to each field in the second database, and associating the first field in the first database with the second field in the second database, wherein the similarity between the word corresponding to the first field and the word corresponding to the second field is greater than a pre-set threshold. By means of applying the embodiments of the present application, the efficiency of synonymous data association between heterogeneous databases can be improved.
13
US2019384819A1
METHOD OF DETERMINING WORD SIMILARITY
Publication/Patent Number: US2019384819A1 Publication Date: 2019-12-19 Application Number: 16/557,710 Filing Date: 2019-08-30 Inventor: Jo, Hwiyeol   Assignee: LG ELECTRONICS INC.   IPC: G06F17/27 Abstract: The present disclosure provides a word vector correction method using artificial intelligence technology. According to the present invention, a method of determining a word similarity for a specific document matrix including a plurality of N word vectors having M dimensions includes decomposing the specific document matrix into a word matrix represented in a D-dimensional word space using a D-dimensional weight matrix; calculating a similarity between the plurality of D-dimensional word vectors included in the word matrix obtained through the decomposition; and determining that words corresponding to word vectors satisfying a preset reference similarity value are similar to each other when the calculated similarity value satisfies the preset reference similarity value.
14
DE102019104475A1
VERFAHREN UND SYSTEM ZUM ZERLEGEN UND DURCHSUCHEN VON BINÄRBASIERTEN FAHRZEUGDATEN
Publication/Patent Number: DE102019104475A1 Publication Date: 2019-08-22 Application Number: 102019104475 Filing Date: 2019-02-21 Inventor: Ge, Yao   Llado, Pol   Hawley, Taylor   Schmotzer, John   Assignee: Ford Motor Company   IPC: G06F17/27 Abstract: Diese Offenbarung stellt ein Verfahren und System zum Zerlegen und Durchsuchen von binärbasierten Fahrzeugdaten bereit. Das Verfahren beinhaltet Extrahieren von Fahrzeugdateinamensmetadaten für eine oder mehrere Fahrzeugdateien; Parsen von Daten der Fahrzeugdateien zum Erzeugen von kategorisierten Objekten auf Grundlage eines Fahrzeugdatenwörterbuchs für die Fahrzeugdateien; Assoziieren jedes der kategorisierten Objekte mit jeweiligen Fahrzeugdateinamensmetadaten; Speichern von Fahrzeugdokumenten, die auf die kategorisierten Objekte hindeuten, mit assoziierten Fahrzeugdateinamensmetadaten in einem Datenbanksystem; Erstellen einer Anfrage auf Grundlage einer Sucheingabe, die mittels einer angezeigten Suchschnittstelle erfasst wird; und Übertragen von Suchergebnissen als Reaktion auf die Sucheingabe. Das Fahrzeugdatenwörterbuch definiert mehrere Begriffe, die auf in den Fahrzeugdateien bereitgestellte Decodierlogik hindeuten.
15
US2019220517A1
Probabilistic Modeling System and Method
Publication/Patent Number: US2019220517A1 Publication Date: 2019-07-18 Application Number: 16/247,215 Filing Date: 2019-01-14 Inventor: Vigoda, Benjamin W.   Kearney, Glynnis   Zimoch, Pawel Jerzy   Barr, Matthew C.   Forsythe, Martin Blood Zwirner   Assignee: Gamalon, Inc.   IPC: G06F17/27 Abstract: A computer-implemented method, computer program product and computing system for obtaining the word-based synonym ML object from an ML object collection that defines a plurality of ML objects; adding the word-based synonym ML object to a probabilistic model; generating a list of synonym words via the word-based synonym ML object; and enabling the list of synonym words to be edited by a user.
16
US2019197113A1
NAMING CONVENTION RECONCILER
Publication/Patent Number: US2019197113A1 Publication Date: 2019-06-27 Application Number: 15/854,115 Filing Date: 2017-12-26 Inventor: Iyengar, Arun K.   Assignee: INTERNATIONAL BUSINESS MACHINES CORPORATION   IPC: G06F17/27 Abstract: Embodiments of the present invention disclose a method, a computer program product, and a computer system for a naming convention reconciler. A computer receives and pre-processing first dictionary 114 and second dictionary 116. In addition, the computer parses the pre-processed dictionaries to extract one or more names from each of the two dictionaries. The computer then generates a hash table of the names extracted from the second dictionary and searches the hash table for names that include a word in common with a name extracted from first dictionary 114. Based on identifying a name in the hash table that includes a word in common with a name extracted from first dictionary 114, the computer determines a similarity between the names and stores an association between the names having a greatest similarity.
17
US2019347330A1
INFORMATION PROCESSING APPARATUS AND NON-TRANSITORY COMPUTER READABLE MEDIUM STORING INFORMATION PROCESSING PROGRAM
Publication/Patent Number: US2019347330A1 Publication Date: 2019-11-14 Application Number: 16/351,547 Filing Date: 2019-03-13 Inventor: Osamura, Toru   Assignee: FUJI XEROX CO., LTD.   IPC: G06F17/27 Abstract: An information processing apparatus includes a collecting unit that collects data from communication devices, a receiving unit that receives a selection condition, a selecting unit that selects a piece of data from the collected data based on the selection condition received by the receiving unit, and an output unit that outputs the selected piece of data to a subsequent processing unit.
18
US2019095428A1
INFORMATION PROCESSING APPARATUS, DIALOGUE PROCESSING METHOD, AND DIALOGUE SYSTEM
Publication/Patent Number: US2019095428A1 Publication Date: 2019-03-28 Application Number: 16/059,233 Filing Date: 2018-08-09 Inventor: Asano, Yu   Iwayama, Makoto   Assignee: HITACHI, LTD.   IPC: G06F17/27 Abstract: An information processing apparatus that has a processor and a memory and analyzes a dialogue log data including an input sentence from a user and an answer to the input sentence as an output sentence includes a failure location detecting unit that receives the dialogue log data and detects a failure location of a dialogue from the dialogue log data, a failure cause analyzing unit that analyzes a failure cause from the dialogue log data corresponding to the failure location, a confirmation processing unit that generates and outputs a question sentence from the dialogue log data depending on the failure cause, and a knowledge registration processing unit that receives an answer to the question sentence and adds the answer as new knowledge to a dialogue data for obtaining an output sentence from the input sentence.
19
US10325026B2
Recombination techniques for natural language generation
Publication/Patent Number: US10325026B2 Publication Date: 2019-06-18 Application Number: 14/866,066 Filing Date: 2015-09-25 Inventor: Cardillo, Bryan D.   Assignee: International Business Machines Corporation   IPC: G06F17/27 Abstract: A technique for generating a new equivalent phrase for an input phrase includes receiving a first input phrase for natural language expansion. Tokens that correspond to parts of speech are generated for the first input phrase. An original grammar tree is generated using at least some of the tokens. One or more alternate grammar trees are generated that are different from the original grammar tree but substantially equivalent to the original grammar tree. One or more synonyms for at least one of the tokens are generated. Finally, one or more new phrases are generated based on the one or more alternate grammar trees and the one or more synonyms.
20
US10482185B1
Methods and arrangements to adjust communications
Publication/Patent Number: US10482185B1 Publication Date: 2019-11-19 Application Number: 16/286,999 Filing Date: 2019-02-27 Inventor: Abdi, Taghi Abad Fardin   Walters, Austin Grant   Goodsitt, Jeremy Edward   Farivar, Reza   Pham, Vincent   Truong, Anh   Assignee: Capital One Services, LLC   IPC: G06F17/27 Abstract: Logic may adjust communications between customers. Logic may cluster customers into a first group associated with a first subset of synonyms and a second group associated with a second subset of the synonyms. Logic may associate a first tag with the first group and with each of the synonyms of the first subset. Logic may associate a second tag with the second group and with each of the synonyms of the second subset. Logic may associate one or more models with pairs of the groups. A first pair may comprise the first group and the second group. The first model associated with the first pair may adjust words in communications between the first group and the second group, based on the synonyms associated with the first pair, by replacement of words in a communication between customers of the first subset and customers of the second sub set.
Total 52 pages