Semantic composition with quotient algebras

Authors:
Daoud Clarke;Rudi Lutz;David Weir
Affiliations:
University of Hertfordshire Hatfield, UK;University of Sussex, Brighton, UK;University of Sussex, Brighton, UK
Venue:
GEMS '10 Proceedings of the 2010 Workshop on GEometrical Models of Natural Language Semantics
Year:
2010

Citing 6
Cited 2

Tensor product variable binding and the representation of symbolic structures in connectionist systems

Artificial Intelligence - On connectionist symbol processing
Explorations in Automatic Thesaurus Discovery

Explorations in Automatic Thesaurus Discovery
Automatic word sense discrimination

Computational Linguistics - Special issue on word sense disambiguation
Automatic retrieval and clustering of similar words

COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Finding predominant word senses in untagged text

ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Paraphrase assessment in structured vector space: exploring parameters and datasets

GEMS '09 Proceedings of the Workshop on Geometrical Models of Natural Language Semantics

Algebraic approaches to compositional distributional semantics

IWCS '11 Proceedings of the Ninth International Conference on Computational Semantics
Experimenting with transitive verbs in a DisCoCat

GEMS '11 Proceedings of the GEMS 2011 Workshop on GEometrical Models of Natural Language Semantics

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe an algebraic approach for computing with vector based semantics. The tensor product has been proposed as a method of composition, but has the undesirable property that strings of different length are incomparable. We consider how a quotient algebra of the tensor algebra can allow such comparisons to be made, offering the possibility of data-driven models of semantic composition.