Gaussianity and typicality in matrix distributional semantics

12/19/2019
by   Sanjaye Ramgoolam, et al.
0

Constructions in type-driven compositional distributional semantics associate large collections of matrices of size D to linguistic corpora. We develop the proposal of analysing the statistical characteristics of this data in the framework of permutation invariant matrix models. The observables in this framework are permutation invariant polynomial functions of the matrix entries, which correspond to directed graphs. Using the general 13-parameter permutation invariant Gaussian matrix models recently solved, we find, using a dataset of matrices constructed via standard techniques in distributional semantics, that the expectation values of a large class of cubic and quartic observables show high gaussianity at levels between 90 to 99 percent. Beyond expectation values, which are averages over words, the dataset allows the computation of standard deviations for each observable, which can be viewed as a measure of typicality for each observable. There is a wide range of magnitudes in the measures of typicality. The permutation invariant matrix models, considered as functions of random couplings, give a very good prediction of the magnitude of the typicality for different observables. We find evidence that observables with similar matrix model characteristics of Gaussianity and typicality also have high degrees of correlation between the ranked lists of words associated to these observables.

READ FULL TEXT
research
02/14/2022

Permutation invariant matrix statistics and computational language tasks

The Linguistic Matrix Theory programme introduced by Kartsaklis, Ramgool...
research
09/20/2018

Permutation Invariant Gaussian Matrix Models

Permutation invariant Gaussian matrix models were recently developed for...
research
03/28/2017

Linguistic Matrix Theory

Recent research in computational linguistics has developed algorithms wh...
research
09/14/2023

On Supmodular Matrices

We consider the problem of determining which matrices are permutable to ...
research
11/05/2018

Janossy Pooling: Learning Deep Permutation-Invariant Functions for Variable-Size Inputs

We consider a simple and overarching representation for permutation-inva...
research
08/25/2023

Kissing to Find a Match: Efficient Low-Rank Permutation Representation

Permutation matrices play a key role in matching and assignment problems...
research
05/08/2023

In Honour of Ted Swart

This is a tribute to my dear life-long friend, mentor and colleague Ted ...

Please sign up or login with your details

Forgot password? Click here to reset