Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Luana Fagarasan

dblp:139/0896 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Representation and self-supervised learning · 50% Information extraction and text analysis · 50%
Theoretical computer science
1 paper
Automata and formal languages · 100%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › compositional representation
compositional distributional semantics
0.212014
Reducing Dimensions of Tensors in Type-Driven Distributional Semantics · EMNLP 2014
Natural language and speech › Information extraction and text analysis › lexical semantics › verb semantics
selectional preference
0.212014
Reducing Dimensions of Tensors in Type-Driven Distributional Semantics · EMNLP 2014
Automata and formal languages › categorial grammar
combinatory categorial grammar
0.112014
Reducing Dimensions of Tensors in Type-Driven Distributional Semantics · EMNLP 2014

Methods — techniques the papers use, named apart from their topics

tensor decomposition · 0.4lower-dimensional approximation · 0.4
YearPublicationVenuePosition
2014 Reducing Dimensions of Tensors in Type-Driven Distributional Semantics
abstract
Compositional distributional semantics is a subfield of Computational Linguistics which investigates methods for representing the meanings of phrases and sentences.In this paper, we explore implementations of a framework based on Combinatory Categorial Grammar (CCG), in which words with certain grammatical types have meanings represented by multilinear maps (i.e.multi-dimensional arrays, or tensors).An obstacle to full implementation of the framework is the size of these tensors.We examine the performance of lower dimensional approximations of transitive verb tensors on a sentence plausibility/selectional preference task.We find that the matrices perform as well as, and sometimes even better than, full tensors, allowing a reduction in the number of parameters needed to model the framework.
Tamara Polajnar, Luana Fagarasan, Stephen Clark
EMNLP2