paper-with-me

홈 › Papers

Embedding Lexical Features via Low-Rank Tensors

2016-04-02 · NAACL 2016 6 · Mo Yu, Mark Dredze, Raman Arora, Matthew Gormley

Modern NLP models rely heavily on engineered features, which often combine word and contextual information into complex lexical features. Such combination results in large numbers of features, which can lead to over-fitting. We present a new model that represents complex lexical features---comprised of parts for words, contextual information and labels---in a tensor that captures conjunction information among these parts. We apply low-rank tensor approximations to the corresponding parameter tensors to reduce the parameter space and improve prediction speed. Furthermore, we investigate two methods for handling features that include $n$-grams of mixed lengths. Our model achieves state-of-the-art results on tasks in relation extraction, PP-attachment, and preposition disambiguation.

📄 PDF Abstract BibTeX arXiv:1604.00461

Code (1)

Gorov/LowRankFCM 공식 구현

Tasks

Relation Extraction

Similar Papers 제목 키워드 기반

Exploring Classic and Neural Lexical Translation Models for Information Retrieval: Interpretability, Effectiveness, and Efficiency Benefits

2021-02-12 · Leonid Boytsov, Zico Kolter

We study the utility of the lexical translation model (IBM Model 1) for English text retrieval, in particular, its neural variants that are trained end-to-end. We use the neural Model1 as an aggregator layer applied to c…

CPUDocument RankingInformation RetrievalRetrieval+2

A comparative study of word embeddings and other features for lexical complexity detection in French

2018-05-01 · JEPTALNRECITAL 2018 5 · Aina Gar{\'\i} Soler, Marianna Apidianaki, Alex Allauzen, re

Lexical complexity detection is an important step for automatic text simplification which serves to make informed lexical substitutions. In this study, we experiment with word embeddings for measuring the complexity of F…

Text SimplificationWord Embeddings

Stanford MLab at SemEval-2021 Task 1: Tree-Based Modelling of Lexical Complexity using Word Embeddings

2021-08-01 · SEMEVAL 2021 · Erik Rozi, Niveditha Iyer, Gordon Chi, Enok Choe 외

This paper presents our system for the single- and multi-word lexical complexity prediction tasks of SemEval Task 1: Lexical Complexity Prediction. Text comprehension depends on the reader{'}s ability to understand the w…

Lexical Complexity PredictionPredictionReading ComprehensionWord Embeddings

Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squares

2019-12-17 · M. A. Iwen, D. Needell, E. Rebrova, A. Zare

In this paper new general modewise Johnson-Lindenstrauss (JL) subspace embeddings are proposed that are both considerably faster to generate and easier to store than traditional JL embeddings when working with extremely …

Learning Tensor Low-Rank Prior for Hyperspectral Image Reconstruction

2021-06-19 · CVPR 2021 1 · Shipeng Zhang, Lizhi Wang, Lei Zhang, Hua Huang

Snapshot hyperspectral imaging has been developed to capture the spectral information of dynamic scenes. In this paper, we propose a deep neural network by learning the tensor low-rank prior of hyperspectral images (…

Image Reconstruction