N-ary relation prediction over text spans
US-2020311198-A1 · Oct 1, 2020 · US
US11630952B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11630952-B2 |
| Application number | US-201916518894-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jul 22, 2019 |
| Priority date | Jul 22, 2019 |
| Publication date | Apr 18, 2023 |
| Grant date | Apr 18, 2023 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
This disclosure relates to methods, non-transitory computer readable media, and systems that can classify term sequences within a source text based on textual features analyzed by both an implicit-class-recognition model and an explicit-class-recognition model. For example, by applying machine-learning models for both implicit and explicit class recognition, the disclosed systems can determine a class corresponding to a particular term sequence within a source text and identify the particular term sequence reflecting the class. The dual-model architecture can equip the disclosed systems to apply (i) the implicit-class-recognition model to recognize implicit references to a class in source texts and (ii) the explicit-class-recognition model to recognize explicit references to the same class in source texts.
Opening claim text (preview).
We claim: 1. A non-transitory computer readable medium storing instructions thereon that, when executed by at least one processor, cause the at least one processor to: generate a first plurality of n-gram class scores corresponding to a plurality of classes for term sequences from a source text utilizing an implicit-class-recognition model; generate a second plurality of n-gram class scores corresponding to the plurality of classes for the term sequences from the source text utilizing an explicit-class-recognition model, wherein the first plurality of n-gram class scores and the second plurality of n-gram class scores indicate measures of likelihood that the term sequences from the source text correspond to the plurality of classes; and determine a class from the plurality of classes corresponding to the source text and a term sequence from the source text reflecting the class based on the first plurality of n-gram class scores and the second plurality of n-gram class scores. 2. The non-transitory computer readable medium of claim 1 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to: generate the first plurality of n-gram class scores by generating a first set of unigram class scores, a first set of bigram class scores, and a first set of trigram class scores utilizing the implicit-class-recognition model; and generate the second plurality of n-gram class scores by generating a second set of unigram class scores, a second set of bigram class scores, and a second set of trigram class scores utilizing the explicit-class-recognition model. 3. The non-transitory computer readable medium of claim 1 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to: apply a max pooling layer to the first plurality of n-gram class scores and the second plurality of n-gram class scores to generate consolidated-class scores for the term sequences; and identify the class and the term sequence based on the consolidated-class scores. 4. The non-transitory computer readable medium of claim 1 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to generate the first plurality of n-gram class scores for the term sequences from the source text utilizing the implicit-class-recognition model by: generating a plurality of feature vectors based on terms from the source text utilizing a plurality of long-short-term memory (“LSTM”) layers from the implicit-class-recognition model; and generating the first plurality of n-gram class scores for the term sequences based on the plurality of feature vectors utilizing a convolutional neural network from the implicit-class-recognition model. 5. The non-transitory computer readable medium of claim 4 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to: generate the plurality of feature vectors by: generating a first feature vector for a first term embedding from a first term of the source text utilizing the plurality of LSTM layers; and generating a second feature vector for a second term embedding from a second term of the source text utilizing the plurality of LSTM layers; and generate the first plurality of n-gram class scores for the term sequences by utilizing the convolutional neural network to generate a first unigram class score based on the first feature vector, generate a second unigram class score based on the second feature vector, and generate a bigram class score based on the first feature vector and the second feature vector. 6. The non-transitory computer readable medium of claim 1 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to generate the second plurality of n-gram class scores for the term sequences from the source text utilizing the explicit-class-recognition model by: generating similarity matrices based on terms from the source text and a plurality of labels corresponding to a plurality of classes; and analyzing the similarity matrices utilizing a convolutional neural network of the explicit-class-recognition model to generate the second plurality of n-gram class scores. 7. The non-transitory computer readable medium of claim 6 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to generate the similarity matrices by: generating a first similarity matrix comprising similarity scores between source-term-feature vectors for the terms from the source text and label-feature vectors for a first label corresponding to a first class; and generating a second similarity matrix comprising similarity scores between the source-term-feature vectors for the terms from the source text and label-feature vectors for a second label corresponding to a second class. 8. The non-transitory computer readable medium of claim 1 , wherein the instructions, when executed by the at least one processor, cause the at least one processor to provide, for display within a graphical user interface of a computing device, the source text and a visual indicator identifying the term sequence in the source text as corresponding to the class. 9. The non-transitory computer readable medium of claim 1 , wherein: the term sequences from the source text comprise unigrams, bigrams, and trigrams; and the term sequence comprises one of a unigram, a bigram, or a trigram. 10. A system comprising: at least one processor; and at least one non-transitory computer readable medium comprising instructions that, when executed by the at least one processor, cause the system to: generate a first plurality of class scores for term sequences from a source text utilizing an implicit-class-recognition model by: generating a plurality of feature vectors based on terms from the source text utilizing a plurality of LSTM layers; and generating the first plurality of class scores for the term sequences based on the plurality of feature vectors utilizing a first convolutional neural network; generate a second plurality of class scores for the term sequences from the source text utilizing an explicit-class-recognition model by: generating similarity matrices based on the terms from the source text and a plurality of labels corresponding to the plurality of classes; and analyzing the similarity matrices utilizing a second convolutional neural network to generate the second plurality of class scores; and determine a class corresponding to a term sequence from the source text reflecting the class based on the first plurality of class scores and the second plurality of class scores. 11. The system of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the system to: generate the first plurality of class scores by generating a first set of unigram class scores, a first set of bigram class scores, and a first set of trigram class scores utilizing the implicit-class-recognition model; and generate the second plurality of class scores by generating a second set of unigram class scores, a second set of bigram class scores, and a second set of trigram class scores utilizing the explicit-class-recognition model. 12. The system of claim 10 , further comprising instructions that, when executed by the at least one processor, cause the system to: generate the plurality of feature vectors by: generating a first feature vector for a first term embedding from a first term of the source text utilizing the plurality of LSTM layers; and generating a second feature vector for a second term embedding from a second
Recognition of textual entities · CPC title
using classification, e.g. of video objects · CPC title
Convolutional networks [CNN, ConvNet] · CPC title
Supervised learning · CPC title
characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU] · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.