Abstract: Examples provide a self-supervised language model for document-to-document similarity scoring and ranking long documents of arbitrary length in an absence of similarity labels. In a first stage of a two-staged hierarchical scoring, a sentence similarity matrix is created for each paragraph in the candidate document. A sentence similarity score is calculated based on the sentence similarity matrix. In the second stage, a paragraph similarity matrix is constructed based on aggregated sentence similarity scores associated with the first candidate document. A total similarity score for the document is calculated based on the normalize the paragraph similarity matrix for each candidate document in a collection of documents. The model is trained using a masked language model and intra-and-inter document sampling. The documents are ranked based on the similarity scores for the documents.

Abstract: The disclosure herein describes a system for interpreting text-based similarity between a seed item and a recommended item selected by a pre-trained language model from a plurality of candidate items based on semantic similarities between the seed item and the recommended item. The system analyzes similarity scores and contextual paragraph representations representing text-based descriptions of the seed item and recommended item to generate gradient maps and word scores representing the text-based descriptions. A model for interpreting text-based similarity utilizes the calculated gradients and word scores to match words from the seed item description with words in the recommended item description having similar semantic meaning. The word-pairs having the highest weight are identified by the system as the word-pairs having the greatest influence over the selection of the recommended item from the candidate items by the original pre-trained language model.

Abstract: Examples provide a self-supervised language model for document-to-document similarity scoring and ranking long documents of arbitrary length in an absence of similarity labels. In a first stage of a two-staged hierarchical scoring, a sentence similarity matrix is created for each paragraph in the candidate document. A sentence similarity score is calculated based on the sentence similarity matrix. In the second stage, a paragraph similarity matrix is constructed based on aggregated sentence similarity scores associated with the first candidate document. A total similarity score for the document is calculated based on the normalize the paragraph similarity matrix for each candidate document in a collection of documents. The model is trained using a masked language model and intra-and-inter document sampling. The documents are ranked based on the similarity scores for the documents.

Abstract: Examples provide a self-supervised language model for document-to-document similarity scoring and ranking long documents of arbitrary length in an absence of similarity labels. In a first stage of a two-staged hierarchical scoring, a sentence similarity matrix is created for each paragraph in the candidate document. A sentence similarity score is calculated based on the sentence similarity matrix. In the second stage, a paragraph similarity matrix is constructed based on aggregated sentence similarity scores associated with the first candidate document. A total similarity score for the document is calculated based on the normalize the paragraph similarity matrix for each candidate document in a collection of documents. The model is trained using a masked language model and intra-and-inter document sampling. The documents are ranked based on the similarity scores for the documents.

Abstract: Examples provide a self-supervised language model for document-to-document similarity scoring and ranking long documents of arbitrary length in an absence of similarity labels. In a first stage of a two-staged hierarchical scoring, a sentence similarity matrix is created for each paragraph in the candidate document. A sentence similarity score is calculated based on the sentence similarity matrix. In the second stage, a paragraph similarity matrix is constructed based on aggregated sentence similarity scores associated with the first candidate document. A total similarity score for the document is calculated based on the normalize the paragraph similarity matrix for each candidate document in a collection of documents. The model is trained using a masked language model and intra-and-inter document sampling. The documents are ranked based on the similarity scores for the documents.

Abstract: The disclosure herein describes a system for interpreting text-based similarity between a seed item and a recommended item selected by a pre-trained language model from a plurality of candidate items based on semantic similarities between the seed item and the recommended item. The system analyzes similarity scores and contextual paragraph representations representing text-based descriptions of the seed item and recommended item to generate gradient maps and word scores representing the text-based descriptions. A model for interpreting text-based similarity utilizes the calculated gradients and word scores to match words from the seed item description with words in the recommended item description having similar semantic meaning. The word-pairs having the highest weight are identified by the system as the word-pairs having the greatest influence over the selection of the recommended item from the candidate items by the original pre-trained language model.