IP Library › Granted Patent US 12,602,569
Granted Patent B2
US 12,602,569 · App. 17/087,881 · Granted Apr 14, 2026

Extracting entity relationships from digital documents utilizing multi-view neural networks

Inventors: Amir Pouran Ben Veyseh (Eugene, OR); Franck Dernoncourt (Sunnyvale, CA); Quan Tran (San Jose, CA); Lidan Wang (San Jose, CA)
Assignee: Adobe Inc.
G06N3/045G06F17/16G06F40/295G06F40/30G06N3/047
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,602,569
App. No.
17/087,881
Granted
Apr 14, 2026
Kind
B2
Abstract

This disclosure describes methods, non-transitory computer readable storage media, and systems that utilize a plurality of neural networks to determine structural and semantic information via different views of a word sequence and then utilize this information to extract a relationship between word sequence entities. For example, the disclosed systems generate a plurality of sets of encoded word representation vectors utilizing the plurality of neural networks. The disclosed system then extracts the relationship from an overall word representation vector generated based on the sets of encoded word representation vectors. Furthermore, the disclosed system enforces structural and semantic consistency between views via a plurality of constrains involving a control mechanism for the semantic view and a plurality of losses.

Claims (79)

1 . A non-transitory computer readable storage medium comprising instructions that, when executed by at least one processor, cause a computing device to:

generate, utilizing a long short-term memory neural network, a first set of encoded word representation vectors for a sequence of words comprising at least two entities;

generate, utilizing a ranked neurons long short-term memory neural network, a second set of encoded word representation vectors for the sequence of words;

generate, utilizing a self-attention neural network and from the first set of encoded word representation vectors, a third set of encoded word representation vectors for the sequence of words by:

generating an initial set of encoded word representation vectors utilizing the self-attention neural network; and

generating the third set of encoded word representation vectors by modifying the initial set of encoded word representation vectors according to a control vector selected from the first set of encoded word representation vectors; and

extract, utilizing a classification neural network, a relationship between the at least two entities in the sequence of words by providing the first set of encoded word representation vectors generated by the long short-term memory neural network, the second set of encoded word representation vectors generated by the ranked neurons long short-term memory neural network, and the third set of encoded word representation vectors generated by the self-attention neural network to the classification neural network.

2 . The non-transitory computer readable storage medium as recited in claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate a sequence of word representation vectors based on word embeddings for the sequence of words and position embeddings indicating positions of the at least two entities within the sequence of words; and

generate the first set of encoded word representation vectors, the second set of encoded word representation vectors, and the third set of encoded word representation vectors from the sequence of word representation vectors.

3 . The non-transitory computer readable storage medium as recited in claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

determine an overall word representation vector by combining max-pooling aggregation vectors of the first set of encoded word representation vectors, the second set of encoded word representation vectors, and the third set of encoded word representation vectors with encoded word representation vectors of the at least two entities; and

extract the relationship between the at least two entities from the overall word representation vector utilizing the classification neural network.

4 . The non-transitory computer readable storage medium as recited in claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to generate, utilizing the ranked neurons long short-term memory neural network, the second set of encoded word representation vectors by:

generating a set of structural importance scores indicating a proximity of each word in the sequence of words to a root node of a tree structure; and

generating the second set of encoded word representation vectors based on the set of structural importance scores.

5 . The non-transitory computer readable storage medium as recited in claim 4 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate, utilizing the self-attention neural network, key vectors, query vectors, and value vectors for the first set of encoded word representation vectors; and

generate, utilizing the self-attention neural network, the third set of encoded word representation vectors based on the key vectors, the query vectors, and the value vectors.

6 . The non-transitory computer readable storage medium as recited in claim 5 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

generate, utilizing the self-attention neural network, a set of semantic connection scores between each pair of words in the sequence of words indicating a semantic graph structure based on the key vectors and the query vectors;

determine an importance probability distribution from the set of structural importance scores and a semantic probability distribution from the set of semantic connection scores;

determine a structure loss based on a Kullback-Leibler divergence between the importance probability distribution and the semantic probability distribution; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, or the self-attention neural network according to the structure loss.

7 . The non-transitory computer readable storage medium as recited in claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

determine, utilizing a variable discriminator, an estimated mutual information metric between the first set of encoded word representation vectors and the second set of encoded word representation vectors;

determine a mutual information loss based on the estimated mutual information metric; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, or the self-attention neural network according to the mutual information loss.

8 . The non-transitory computer readable storage medium as recited in claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to extract the relationship between the at least two entities by:

generating, utilizing a classification neural network, an overall word representation vector by combining the first set of encoded word representation vectors, the second set of encoded word representation vectors, and the third set of encoded word representation vectors;

generating, utilizing a classification neural network, a relationship probability distribution over possible relationships for the at least two entities based on the overall word representation vector; and

generating a label indicating the relationship between the at least two entities from the relationship probability distribution.

9 . The non-transitory computer readable storage medium as recited in claim 8 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:

determine a classification loss by determining a negative log-likelihood of the relationship probability distribution; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, or the self-attention neural network according to the classification loss.

10 . A system comprising:

a memory device comprising:

a sequence of words comprising a first entity and a second entity; and

a long short-term memory neural network, a ranked neurons long short-term memory neural network, a self-attention neural network, and a classification neural network;

a computing device configured to cause the system to:

generate word representation vectors for the sequence of words;

generate a first set of encoded word representation vectors, a second set of encoded word representation vectors, and a third set of encoded word representation vectors by processing the word representation vectors utilizing the long short-term memory neural network, the ranked neurons long short-term memory neural network, and the self-attention neural network, the self-attention neural network generating the third set of encoded word representation vectors from the first set of encoded word representation vectors generated by the long short-term memory neural network by:

generating an initial set of encoded word representation vectors utilizing the self-attention neural network; and

generating the third set of encoded word representation vectors by modifying the initial set of encoded word representation vectors according to a control vector selected from the first set of encoded word representation vectors;

generate an overall word representation vector by combining the first set of encoded word representation vectors from the long short-term memory neural network, the second set of encoded word representation vectors from the ranked neurons long short-term memory neural network, and the third set of encoded word representation vectors from the self-attention neural network; and

determine a relationship between the first entity and the second entity in the sequence of words by processing the overall word representation vector utilizing the classification neural network.

11 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to generate the second set of encoded word representation vectors by:

generating, utilizing a set of forget gates of the ranked neurons long short-term memory neural network, a set of structural importance scores indicating a proximity of each word to a root node of a tree structure; and

generating, based on the set of structural importance scores, the second set of encoded word representation vectors comprising a plurality of hidden vectors from the ranked neurons long short-term memory neural network.

12 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to generate the third set of encoded word representation vectors by:

generating, for pairs of words in the sequence of words, semantic connection scores indicating semantic connections between the pairs of words by utilizing the self-attention neural network to process corresponding pairs of encoded word representation vectors of the first set of encoded word representation vectors; and

generating the third set of encoded word representation vectors based on the semantic connection scores for the pairs of words in the sequence of words.

13 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to determine the relationship between the first entity and the second entity by:

generating, from the overall word representation vector, a relationship probability distribution over a plurality of possible relationships between the first entity and the second entity; and

determining the relationship between the first entity and the second entity based on the relationship probability distribution.

14 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to:

determine a structure loss based on a set of structural importance scores associated with the ranked neurons long short-term memory neural network and a set of semantic importance scores associated with the self-attention neural network; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, and the self-attention neural network based on the structure loss.

15 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to:

determine a mutual information loss based on a mutual information metric between the first set of encoded word representation vectors and the second set of encoded word representation vectors; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, or the self-attention neural network based on the mutual information loss.

16 . The system as recited in claim 10 , wherein the computing device is further configured to cause the system to:

determine a classification loss by comparing a classification prediction generated by the classification neural network from the overall word representation vector to a ground truth classification; and

learn parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, or the self-attention neural network based on the classification loss.

17 . A method comprising:

generating word representation vectors for a sequence of words comprising a first entity and a second entity;

generating an overall word representation vector including a plurality of sets of encoded word representation vectors from the word representation vectors by generating a first set of encoded word representation vectors utilizing a long short-term memory neural network, a second set of encoded word representation vectors utilizing a ranked neurons long short-term memory neural network, and a third set of encoded word representation vectors from the first set of encoded word representation vectors utilizing a self-attention neural network, the self-attention neural network generating the third set of encoded word representation vectors by:

generating an initial set of encoded word representation vectors utilizing the self-attention neural network; and

generating the third set of encoded word representation vectors by modifying the initial set of encoded word representation vectors according to a control vector selected from the first set of encoded word representation vectors;

wherein parameters of the long short-term memory neural network, the ranked neurons long short-term memory neural network, and the self-attention neural network are jointly learned based on a classification loss, a structure loss, and a mutual information loss; and

extract a relationship between the first entity and the second entity in the sequence of words by processing the overall word representation vector utilizing a classification neural network.

18 . The method as recited in claim 17 , wherein generating the overall word representation vector comprises:

combining the first set of encoded word representation vectors, the second set of encoded word representation vectors, and the third set of encoded word representation vectors into the overall word representation vector by:

determining max-pooling aggregation vectors of the first set of encoded word representation vectors, the second set of encoded word representation vectors, and the third set of encoded word representation vectors; and

combining the max-pooling aggregation vectors with encoded word representation vectors of the first entity and the second entity.

19 . The method as recited in claim 17 , wherein extracting the relationship between the first entity and the second entity comprises:

generating, utilizing the classification neural network, a plurality of classification probabilities associated with a plurality of possible relationships for the first entity and the second entity; and

selecting, from the plurality of possible relationships, a possible relationship with a highest relationship probability as the relationship between the first entity and the second entity.

20 . The method as recited in claim 17 , further comprising determining a total loss comprising the classification loss, the structure loss, and the mutual information loss by weighting the structure loss with a first weighting parameter and the mutual information loss with a second weighting parameter.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 3, 2020
From: VEYSEH, AMIR POURAN BEN; DERNONCOURT, FRANCK; TRAN, QUAN; WANG, LIDAN
To: ADOBE INC.
Reel/Frame 054255/0490 →
Continuity (1)
Related Publication 20220138534A1 · May 5, 2022
References Cited (44)
US 9836533B1 · Levi · 2017 [cited by examiner]
US 20080097951A1 · Gupta · 2008 [cited by examiner]
US 20200302953A1 · Ando · 2020 [cited by examiner]
US 20200372225A1 · Xu · 2020 [cited by examiner]
US 20210021621A1 · Janakiraman · 2021 [cited by examiner]
Hao et al, 2019, “Towards Better Modeling Hierarchical Structure for Self-Attention with Ordered Neurons” (Year: 2019). [cited by examiner]
Li et al, Jan. 2020, “Bidirectional LSTM with self-attention mechanism and multi-channel features for sentiment classification” (Year: 2020). [cited by examiner]
Jo & Myaeng, Jul. 2020, “Roles and Utilization of Attention Heads in Transformer-based Neural Language Models” (Year: 2020). [cited by examiner]
Li et al, Sep. 2020, “Syntax Role for Neural Semantic Role Labeling” (Year: 2020). [cited by examiner]
Liu et al, 2018, “Long Length Document Classification by Local Convolutional Feature Aggregation” (Year: 2018). [cited by examiner]
Belghazi, M. I.; Baratin, A.; Rajeswar, S.; Ozair, S.; Bengio, Y.; Courville, A.; and Hjelm, R. D. 2018. Mine: mutual information neural estimation. In ICML. [cited by applicant]
Chan, Y. S., and Roth, D. 2010. Exploiting background knowledge for relation extraction. In COLING. [cited by applicant]
Fu, L.; Nguyen, T. H.; Min, B.; and Grishman, R. 2017. Domain adaptation for relation extraction with domain adversarial neural network. In IJCNLP. [cited by applicant]
Guo, Z.; Zhang, Y.; and Lu, W. 2019. Attention guided graph convolutional networks for relation extraction. In ACL. [cited by applicant]
Hendrickx, I.; Kim, S. N.; Kozareva, Z.; Nakov, P.; O Seaghdha, D.; Pado, S.; Pennacchiotti, M.; Romano, L.; and Szpakowicz, S. 2010. Semeval—2010 task 8: Multi-way classification of semantic relations between pairs of … [cited by applicant]
Hjelm, R. D.; Fedorov, A.; Lavoie-Marchildon, S.; Grewal, K.; Bachman, P.; Trischler, A.; and Bengio, Y. 2019. Learning deep representations by mutual information estimation and maximization. In ICLR. [cited by applicant]
Liu, Y.; Wei, F.; Li, S.; Ji, H.; Zhou, M.; and Wang, H. 2015. A dependency-based neural network for relation classification. In ACL. [cited by applicant]
Miwa, M., and Bansal, M. 2016. End-to-end relation extraction using lstms on sequences and tree structures. In ACL. [cited by applicant]
Nguyen, T. H., and Grishman, R. 2014. Employing word representations and regularization for domain adaptation of relation extraction. In ACL. [cited by applicant]
Nguyen, T. H., and Grishman, R. 2015a. Relation extraction: Perspective from convolutional neural networks. In Proceedings of the 1st NAACL Workshop on Vector Space Modeling for NLP (VSM). [cited by applicant]
Nguyen, T. H., and Grishman, R. 2016. Combining neural networks and log-linear models to improve relation extraction. In Proceedings of IJCAI Workshop on Deep Learning for Artificial Intelligence. [cited by applicant]
Nguyen, T. H., and Grishman, R. 2018a. Graph convolutional networks with argument-aware pooling for event detection. In AAAI. [cited by applicant]
Nguyen, T. H.; Plank, B.; and Grishman, R. 2015c. Semantic representations for domain adaptation: A case study on the tree kernel-based method for relation extraction. In ACL-IJCNLP. [cited by applicant]
Peng, N.; Poon, H.; Quirk, C.; Toutanova, K.; and Yih, W.-t. 2017. Cross-sentence n-ary relation extraction with graph lstms. In TACL. [cited by applicant]
Plank, B. 2011. Domain adaptation for parsing. In Ph.D. thesis. University of Groningen. [cited by applicant]
Shen, Y.; Tan, S.; Sordoni, A.; and Courville, A. 2019. Ordered neurons: Integrating tree structures into recurrent neural networks. In ICLR. [cited by applicant]
Shi, G.; Feng, C.; Huang, L.; Zhang, B.; Ji, H.; Liao, L.; and Huang, H. 2018. Genre separation network with adversarial training for cross-genre relation extraction. In EMNLP. [cited by applicant]
Socher, R.; Huval, B.; Manning, C. D.; and Ng, A. Y. 2012. Semantic compositionality through recursive matrix-vector spaces. In EMNLP. [cited by applicant]
Song, L.; Zhang, Y.; Wang, Z.; and Gildea, D. 2018. N-ary relation extraction using graph state lstm. In EMNLP. [cited by applicant]
Strubell, E.; Verga, P.; Andor, D.; Weiss, D.; and McCallum, A. 2018. Linguistically-informed self-attention for semantic role labeling. In EMNLP. [cited by applicant]
Sun, A.; Grishman, R.; and Sekine, S. 2011. Semi-supervised relation extraction with large-scale word clustering. In ACL. [cited by applicant]
Tai, K. S.; Socher, R.; and Manning, C. D. 2015. Improved semantic representations from tree-structured long short-term memory networks. In ACL. [cited by applicant]
Tran, V.-H.; Phi, V.-T.; Shindo, H.; and Matsumoto, Y. 2019. Relation classification using segment-level attention-based cnn and dependency-based rnn. In NAACL-HLT. [cited by applicant]
Vaswani, A.; Shazeer, N.; Parmar, N.; Uszkoreit, J.; Jones, L.; Gomez, A. N.; Kaiser, L. u.; and Polosukhin, I. 2017. Attention is all you need. In NIPS. [cited by applicant]
Verga, P.; Strubell, E.; and McCallum, A. 2018. Simultaneously self-attending to all mentions for full-abstract biological relation extraction. In EMNLP. [cited by applicant]
Veyseh, A. P. B.; Nguyen, T. H.; and Dou, D. 2019. Improving cross-domain performance for relation extraction via dependency prediction and information flow control. In IJCAI. [cited by applicant]
Wang, L.; Cao, Z.; de Melo, G.; and Liu, Z. 2016. Relation classification via multi-level attention cnns. In EMNLP. [cited by applicant]
Xu, Y.; Mou, L.; Li, G.; Chen, Y.; Peng, H.; and Jin, Z. 2015. Classifying relations via long short term memory networks along shortest dependency paths. In EMNLP. [cited by applicant]
Yu, M.; Gormley, M. R.; and Dredze, M. 2015. Combining word embeddings and feature embeddings for fine-grained relation extraction. In NAACL-HLT. [cited by applicant]
Zelenko, D.; Aone, C.; and Richardella, A. 2003. Kernel methods for relation extraction. In Journal of machine learning research. [cited by applicant]
Zeng, D.; Liu, K.; Lai, S.; Zhou, G.; and Zhao, J. 2014. Relation classification via convolutional deep neural network. In COLING. [cited by applicant]
Zhang, Y.; Zhong, V.; Chen, D.; Angeli, G.; and Manning, C. D. 2017. Position-aware attention and supervised data improve slot filling. In EMNLP. [cited by applicant]
Zhang, Y.; Qi, P.; and Manning, C. D. 2018. Graph convolution over pruned dependency trees improves relation extraction. In EMNLP. [cited by applicant]
Zhou, G.; Su, J.; Zhang, J.; and Zhang, M. 2005. Exploring various knowledge in relation extraction. In ACL. [cited by applicant]