paper-with-me

홈 › Papers

Unsupervised Contextualized Document Representation

2021-09-22 · EMNLP (sustainlp) 2021 11 · Ankur Gupta, Vivek Gupta

Several NLP tasks need the effective representation of text documents. Arora et. al., 2017 demonstrate that simple weighted averaging of word vectors frequently outperforms neural models. SCDV (Mekala et. al., 2017) further extends this from sentences to documents by employing soft and sparse clustering over pre-computed word vectors. However, both techniques ignore the polysemy and contextual character of words. In this paper, we address this issue by proposing SCDV+BERT(ctxd), a simple and effective unsupervised representation that combines contextualized BERT (Devlin et al., 2019) based word embedding for word sense disambiguation with SCDV soft clustering approach. We show that our embeddings outperform original SCDV, pre-train BERT, and several other baselines on many classification datasets. We also demonstrate our embeddings effectiveness on other tasks, such as concept matching and sentence similarity. In addition, we show that SCDV+BERT(ctxd) outperforms fine-tune BERT and different embedding approaches in scenarios with limited data and only few shots examples.

📄 PDF Abstract BibTeX arXiv:2109.10509

Code (1)

vgupta123/contextualize_scdv 공식 구현

Tasks

ClusteringSentenceSentence SimilarityWord Sense Disambiguation

Methods 이 논문이 사용한 방법론

Attention 설명 없음
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
WordPiece 설명 없음
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Residual Connection 설명 없음
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.

Similar Papers 제목 키워드 기반

L2F/INESC-ID at SemEval-2019 Task 2: Unsupervised Lexical Semantic Frame Induction using Contextualized Word Representations

2019-06-01 · SEMEVAL 2019 6 · Eug{\'e}nio Ribeiro, V{\^a}nia Mendon{\c{c}}a, Ricardo Ribeiro, David Martins de Matos 외

Building large datasets annotated with semantic information, such as FrameNet, is an expensive process. Consequently, such resources are unavailable for many languages and specific domains. This problem can be alleviated…

ClusteringGraph ClusteringTask 2Word Sense Disambiguation

Topic Aware Contextualized Embeddings for High Quality Phrase Extraction

2022-01-17 · Venktesh V, Mukesh Mohania, Vikram Goyal

Keyphrase extraction from a given document is the task of automatically extracting salient phrases that best describe the document. This paper proposes a novel unsupervised graph-based ranking method to extract high-qual…

Keyphrase ExtractionVocal Bursts Intensity Prediction

COIL: Revisit Exact Lexical Match in Information Retrieval with Contextualized Inverted List

2021-04-15 · NAACL 2021 4 · Luyu Gao, Zhuyun Dai, Jamie Callan

Classical information retrieval systems such as BM25 rely on exact lexical match and carry out search efficiently with inverted list index. Recent neural IR models shifts towards soft semantic matching all query document…

Information RetrievalRetrieval

BERTgrid: Contextualized Embedding for 2D Document Representation and Understanding

2019-09-11 · NeurIPS Workshop Document_Intelligen 2019 12 · Timo I. Denk, Christian Reisswig

For understanding generic documents, information like font sizes, column layout, and generally the positioning of words may carry semantic information that is crucial for solving a downstream document intelligence task. …

Instance SegmentationLanguage ModelingLanguage ModellingSemantic Segmentation

SUPERT: Towards New Frontiers in Unsupervised Evaluation Metrics for Multi-Document Summarization

2020-05-07 · ACL 2020 6 · Yang Gao, Wei Zhao, Steffen Eger

We study unsupervised multi-document summarization evaluation metrics, which require neither human-written reference summaries nor human annotations (e.g. preferences, ratings, etc.). We propose SUPERT, which rates the q…

Document SummarizationMulti-Document Summarizationreinforcement-learningReinforcement Learning (RL)+2