Original: V ISUALIZING AND U NDERSTANDING THE S EMANTICS OF E MBEDDING S PACES VIA A LGEBRAIC F ORMULAE
Revised: V ISUALIZING AND U NDERSTANDING THE S EMANTICS OF E MBEDDING S PACES VIA A LGEBRAIC F ORMULAE

Original: Anonymous authors
Revised: Anonymous authors

Original: Paper under double-blind review
Revised: Paper under double-blind review

Original: A BSTRACT
Revised: A BSTRACT

Original: Embeddings are a fundamental component of many modern machine learning and natural language processing models.
Revised: Embeddings are a fundamental component of many modern machine learning and natural language processing models.

Original: Understanding them and visualizing them is essential for gathering insights about the information they capture and the behavior of the models.
Revised: Understanding them and visualizing them is essential for gathering insights about the information they capture and the behavior of the models.

Original: State of the art in analyzing embeddings consists in projecting them in two-dimensional planes without any interpretable semantics associated to the axes of the projection, which makes detailed analyses and comparison among multiple sets of embeddings challenging.
Revised: State of the art in analyzing embeddings consists in projecting them in two-dimensional planes without any interpretable semantics associated to the axes of the projection, which makes detailed analyses and comparison among multiple sets of embeddings challenging.

Original: In this work, we propose to use explicit axes deﬁned as algebraic formulae over embeddings to project them into a lower dimensional, but semantically meaningful subspace, as a simple yet effective analysis and visualization methodology.
Revised: In this work, we propose to use explicit axes deﬁned as algebraic formulae over embeddings to project them into a lower dimensional, but semantically meaningful subspace, as a simple yet effective analysis and visualization methodology.

Original: This methodology assigns an interpretable semantics to the measures of variability and the axes of visualizations, allowing for both comparisons among different sets of embeddings and ﬁne-grained inspection of the embedding spaces.
Revised: This methodology assigns an interpretable semantics to the measures of variability and the axes of visualizations, allowing for both comparisons among different sets of embeddings and ﬁne-grained inspection of the embedding spaces.

Original: We demonstrate the power of the proposed methodology through a series of case studies that make use of visualizations constructed around the underlying methodology and through a user study.
Revised: We demonstrate the power of the proposed methodology through a series of case studies that make use of visualizations constructed around the underlying methodology and through a user study.

Original: The results show how the methodology is effective at providing more profound insights than classical projection methods and how it is widely applicable to many other use cases
Revised: The results show how the methodology is effective at providing more profound insights than classical projection methods and how it is widely applicable to many other use cases

Original:  I NTRODUCTION
Revised:  I NTRODUCTION

Original: Learning representations is an important part of modern machine learning and natural language processing research.
Revised: Learning representations is an important part of modern machine learning and natural language processing research.

Original: Those representations are often real-valued vectors also called embeddings and are obtained both as byproducts of supervised learning or as the direct goal of unsupervised methods.
Revised: Those representations are often real-valued vectors also called embeddings and are obtained both as byproducts of supervised learning or as the direct goal of unsupervised methods.

Original: Independently of how the embeddings are learned, there is much value in understanding what information they capture, how they relate to each other and how the data they are learned from inﬂuences them.
Revised: Independently of how the embeddings are learned, there is much value in understanding what information they capture, how they relate to each other and how the data they are learned from inﬂuences them.

Original: A better understanding of the embedded space may lead to a better understanding of the data, of the problem and the behavior of the model, and may lead to critical insights in improving such models.
Revised: A better understanding of the embedded space may lead to a better understanding of the data, of the problem and the behavior of the model, and may lead to critical insights in improving such models.

Original: Because of their high-dimensional nature, they are hard to visualize effectively, and the most adopted approach is to project them in a bi-dimensional space.
Revised: Because of their high-dimensional nature, they are hard to visualize effectively, and the most adopted approach is to project them in a bi-dimensional space.

Original: Projections have a few shortcomings: 1) they may not preserve distance in the original space, 2) they are not comparable across models and 3) do not provide interpretable dimensions of variability to project to, preventing for more detailed analysis and understanding.
Revised: Projections have a few shortcomings: 1) they may not preserve distance in the original space, 2) they are not comparable across models and 3) do not provide interpretable dimensions of variability to project to, preventing for more detailed analysis and understanding.

Original: For these reasons, there is value in mapping embeddings into a more speciﬁc, controllable and interpretable semantic space.
Revised: For these reasons, there is value in mapping embeddings into a more speciﬁc, controllable and interpretable semantic space.

Original: Principal Component Analysis (PCA) (Pearson, 1901) and t-Distributed Stochastic Neighbor Embedding (t-SNE) (van der Maaten & Hinton, 2008) are two projection techniques often used for visualizing embeddings in two dimensions, although other techniques can be used.
Revised: Principal Component Analysis (PCA) (Pearson, 1901) and t-Distributed Stochastic Neighbor Embedding (t-SNE) (van der Maaten & Hinton, 2008) are two projection techniques often used for visualizing embeddings in two dimensions, although other techniques can be used.

Original: PCA projects embeddings on a lower dimensional space that has the directions of the highest variance in the dataset as axes.
Revised: PCA projects embeddings on a lower dimensional space that has the directions of the highest variance in the dataset as axes.

Original: Those dimensions do not carry any interpretable meaning, making interpretation difﬁcult.
Revised: Those dimensions do not carry any interpretable meaning, making interpretation difﬁcult.

Original: By visualizing the ﬁrst two dimensions of a PCA projection, the only insight obtainable is semantic relatedness (Budanitsky & Hirst, 2006) between points by observing their relative closeness and therefore topical clusters can be identiﬁed.
Revised: By visualizing the ﬁrst two dimensions of a PCA projection, the only insight obtainable is semantic relatedness (Budanitsky & Hirst, 2006) between points by observing their relative closeness and therefore topical clusters can be identiﬁed.

Original: The downside is that embeddings that end up being close in the projected space may not be close in the original embedding space and vice versa.
Revised: The downside is that embeddings that end up being close in the projected space may not be close in the original embedding space and vice versa.

Original: Moreover, as the directions of highest variance are different from embedding space to embedding space, the projections are incompatible among different embeddings spaces, and this makes them not comparable, a common issue among dimensionality reduction techniques.
Revised: Moreover, as the directions of highest variance are different from embedding space to embedding space, the projections are incompatible among different embeddings spaces, and this makes them not comparable, a common issue among dimensionality reduction techniques.

Original: t-SNE, differently from PCA, optimizes a loss that encourages embeddings that are close in the original high-dimensional space to be close in the lower dimensional projection space.
Revised: t-SNE, differently from PCA, optimizes a loss that encourages embeddings that are close in the original high-dimensional space to be close in the lower dimensional projection space.

Original: This helps in visualizing clusters better than with PCA, as t-SNE puts each point in the projected space so that distance in the original space with respect to its nearest neighbors is preserved as much as possible.
Revised: This helps in visualizing clusters better than with PCA, as t-SNE puts each point in the projected space so that distance in the original space with respect to its nearest neighbors is preserved as much as possible.

Original: Visualizations obtained in this way reﬂect more the original embedding space and topical clusters are more clearly distinguishable, but doesn’t solve the issue of comparability of two different sets of embeddings, nor it solves the lack of interpretability of the axes and still doesn’t allow for ﬁnegrained inspection.
Revised: Visualizations obtained in this way reﬂect more the original embedding space and topical clusters are more clearly distinguishable, but doesn’t solve the issue of comparability of two different sets of embeddings, nor it solves the lack of interpretability of the axes and still doesn’t allow for ﬁnegrained inspection.

Original: Moreover, t-SNE is pretty sensible to hyperparameters, making it unclear how much the projection reﬂects the data.
Revised: Moreover, t-SNE is pretty sensible to hyperparameters, making it unclear how much the projection reﬂects the data.

Original: In this paper, a new and simple method to inspect, explore and debug embedding spaces at a ﬁnegrained level is proposed.
Revised: In this paper, a new and simple method to inspect, explore and debug embedding spaces at a ﬁnegrained level is proposed.

Original: It consists in deﬁning explicitly the axes of projection through formulae in vector algebra over the embeddings themselves.
Revised: It consists in deﬁning explicitly the axes of projection through formulae in vector algebra over the embeddings themselves.

Original: Explicit axis deﬁnition gives an interpretable and ﬁne-grained semantics to the axes of projection.
Revised: Explicit axis deﬁnition gives an interpretable and ﬁne-grained semantics to the axes of projection.

Original: Deﬁning axes explicitly makes it possible to analyze in a detailed way how embeddings relate to each other with respect to interpretable dimensions of variability, as carefully crafted formulas can map (to a certain extent) to semantically meaningful portions of the learned spaces.
Revised: Deﬁning axes explicitly makes it possible to analyze in a detailed way how embeddings relate to each other with respect to interpretable dimensions of variability, as carefully crafted formulas can map (to a certain extent) to semantically meaningful portions of the learned spaces.

Original: The explicit axes deﬁnition also allows for comparing of embeddings obtained from different datasets, as long as they have common labels.
Revised: The explicit axes deﬁnition also allows for comparing of embeddings obtained from different datasets, as long as they have common labels.

Original: We demonstrate three visualizations for analyzing subspaces of interest of embedding spaces and a set of example case studies including bias detection, polysemy analysis and ﬁne-grained embedding analysis.
Revised: We demonstrate three visualizations for analyzing subspaces of interest of embedding spaces and a set of example case studies including bias detection, polysemy analysis and ﬁne-grained embedding analysis.

Original: Additional tasks that may be performed using the proposed methodology and visualization are diachronic analysis and analysis of representations learned from graphs and knowledge bases.
Revised: Additional tasks that may be performed using the proposed methodology and visualization are diachronic analysis and analysis of representations learned from graphs and knowledge bases.

Original: The proposed visualizations can moreover be used for debugging purposes and in general for obtaining a better understanding of the embedding spaces learned by different models and representation learning approaches.
Revised: The proposed visualizations can moreover be used for debugging purposes and in general for obtaining a better understanding of the embedding spaces learned by different models and representation learning approaches.

Original: We are releasing an open-source 1 interactive tool that implements the proposed visualizations, in order to enable researchers in the ﬁelds of machine learning, computational linguistics, natural language processing, social sciences and digital humanities to perform exploratory analysis and better understand the semantics of their embeddings.
Revised: We are releasing an open-source 1 interactive tool that implements the proposed visualizations, in order to enable researchers in the ﬁelds of machine learning, computational linguistics, natural language processing, social sciences and digital humanities to perform exploratory analysis and better understand the semantics of their embeddings.

Revised: The main contribution of this work lies in the use of explicit user-deﬁned algebraic formulae as axes for projecting embedding spaces into semantically-meaningful subspaces that when visualized provide interpretable axes.

Revised: We show how this methodology can be widely used through a series of case studies on well known models and data and we furthermore validate the how the visualizations are more interpretable through a user study.

Original:  R ELATED W ORK 2. E MBEDDING METHODS AND APPLICATIONS
Revised:  R ELATED W ORK 2. E MBEDDING METHODS AND APPLICATIONS

Original: Several methods for learning embeddings from symbolic data have been recently proposed (Pennington et al., 2014; Mikolov et al., 2013; Mnih & Kavukcuoglu, 2013; Lebret & Collobert, 2014;
Revised: Several methods for learning embeddings from symbolic data have been recently proposed (Pennington et al., 2014; Mikolov et al., 2013; Mnih & Kavukcuoglu, 2013; Lebret & Collobert, 2014;

Original: Ji et al., 2016; Rudolph et al., 2016; Nickel et al., 2016).
Revised: Ji et al., 2016; Rudolph et al., 2016; Nickel et al., 2016).

Original: The learned representations have been used for a variety of tasks like recommendation (Barkan & Koenigstein, 2016), link prediction on graphs (Grover & Leskovec, 2016), discovery of drug-drug interaction (Abdelaziz et al., 2017) and many more.
Revised: The learned representations have been used for a variety of tasks like recommendation (Barkan & Koenigstein, 2016), link prediction on graphs (Grover & Leskovec, 2016), discovery of drug-drug interaction (Abdelaziz et al., 2017) and many more.

Original: In particular, positive results in learning embeddings for words using a surrogate prediction task (Mikolov et al., 2013) started the resurgence of interest in those methods, while a substantial body of research from the distributional semantics community using count and matrix factorization based methods (Deerwester et al., 1990; Baroni & Lenci, 2010; Kanerva et al., 2000; Levy & Goldberg, 2014; Biemann & Riedl, 2013; Gabrilovich & Markovitch, 2007) was previously developed.
Revised: In particular, positive results in learning embeddings for words using a surrogate prediction task (Mikolov et al., 2013) started the resurgence of interest in those methods, while a substantial body of research from the distributional semantics community using count and matrix factorization based methods (Deerwester et al., 1990; Baroni & Lenci, 2010; Kanerva et al., 2000; Levy & Goldberg, 2014; Biemann & Riedl, 2013; Gabrilovich & Markovitch, 2007) was previously developed.

Original: Refer to Lenci (2018) for a comprehensive overview.
Revised: Refer to Lenci (2018) for a comprehensive overview.

Original: 2. E MBEDDING VISUALIZATION
Revised: 2. E MBEDDING VISUALIZATION

Original: In their recent paper, Heimerl & Gleicher (2018) extracted a list of routinely conducted tasks where embeddings are employed in visual analytics for NLP, such as compare concepts , ﬁnding analogies , and predict contexts .
Revised: In their recent paper, Heimerl & Gleicher (2018) extracted a list of routinely conducted tasks where embeddings are employed in visual analytics for NLP, such as compare concepts , ﬁnding analogies , and predict contexts .

Original: iVisClustering (Lee et al., 2012) represents topic clusters as their most representative keywords and displays them as a 2D scatter plot and a set of linked visualization components supporting interactively constructing topic hierarchies.
Revised: iVisClustering (Lee et al., 2012) represents topic clusters as their most representative keywords and displays them as a 2D scatter plot and a set of linked visualization components supporting interactively constructing topic hierarchies.

Original: ConceptVector (Park et al., 2018) makes use of multiple keyword sets to encode the relevance scores of documents and topics: positive words, negative words, and irrelevant words.
Revised: ConceptVector (Park et al., 2018) makes use of multiple keyword sets to encode the relevance scores of documents and topics: positive words, negative words, and irrelevant words.

Original: It allows users to select and build a concept iteratively.
Revised: It allows users to select and build a concept iteratively.

Original: Liu et al.
Revised: Liu et al.

Original: (2018) display pairs of analogous words obtained through analogy by projecting them on a 2D plane obtained through a PCA and an SVM to ﬁnd the plane that separates words on the two sides of the analogy.
Revised: (2018) display pairs of analogous words obtained through analogy by projecting them on a 2D plane obtained through a PCA and an SVM to ﬁnd the plane that separates words on the two sides of the analogy.

Original: Besides word embedding, textual visualization has been used to understand topic modeling (Chuang et al., 2012) and how topic models evolve over time (Havre et al., 2002).
Revised: Besides word embedding, textual visualization has been used to understand topic modeling (Chuang et al., 2012) and how topic models evolve over time (Havre et al., 2002).

Original: Compared to literature, our work allows more ﬁne-grained control over the conceptual axes and the ﬁltering logic, e.g., allowing users to deﬁne concept based on explicit algebraic formulae beyond single keywords (Section 3), metadata based ﬁltering, as well as multidimensional and multi-data source comparison beyond the common 2D scatter plot view.
Revised: Compared to literature, our work allows more ﬁne-grained control over the conceptual axes and the ﬁltering logic, e.g., allowing users to deﬁne concept based on explicit algebraic formulae beyond single keywords (Section 3), metadata based ﬁltering, as well as multidimensional and multi-data source comparison beyond the common 2D scatter plot view.

Original: (Sec 4)
Revised: (Sec 4)

Original:  M ETHODOLOGY
Revised:  M ETHODOLOGY

Original: The basic insight of this work is that goal-oriented inspection of embedding spaces can be deﬁned in terms of items and dimensions of variability.
Revised: The basic insight of this work is that goal-oriented inspection of embedding spaces can be deﬁned in terms of items and dimensions of variability.

Original: For instance, if the goal is to discover if a dataset (and by consequence an embedding model trained on it) includes gender bias, a user may deﬁne professions as speciﬁc items of interest and analyze how they are distributed among the concept of “male” and “female”, the two dimensions of variability.
Revised: For instance, if the goal is to discover if a dataset (and by consequence an embedding model trained on it) includes gender bias, a user may deﬁne professions as speciﬁc items of interest and analyze how they are distributed among the concept of “male” and “female”, the two dimensions of variability.

Original: We use this as a running example in this section, while in the next section we present how to turn goal deﬁnitions into visualizations.
Revised: We use this as a running example in this section, while in the next section we present how to turn goal deﬁnitions into visualizations.

Original: The dimensions of variability are deﬁned as algebraic formulae that use embedding labels as atoms.
Revised: The dimensions of variability are deﬁned as algebraic formulae that use embedding labels as atoms.

Revised: Algebraic formulae are a composition vector math operators (e.g., add, sub, mul) to be applied on vectors (referenced by their label in the data, i.e. the vector of “apple” is obtained by using using the keyword “apple” in the formula).

Original: They are used as the axes of a subspace of the entire embedding space and can be interpreted as concepts.
Revised: They are used as the axes of a subspace of the entire embedding space and can be interpreted as concepts.

Original: In our example we can deﬁne two axes a male = man and a female = woman .
Revised: In our example we can deﬁne two axes a male = man and a female = woman .

Original: These are the most simple formulae as they are made of only one literal, but any formula using algebraic operation can be used instead.
Revised: These are the most simple formulae as they are made of only one literal, but any formula using algebraic operation can be used instead.

Original: For instance a male = man + him and a female = woman + her could be used instead.
Revised: For instance a male = man + him and a female = woman + her could be used instead.

Original: Deﬁning axes explicitly as algebraic formulae gives an interpretable semantics to the dimensions of variability and by consequence to the axes of the visualization.
Revised: Deﬁning axes explicitly as algebraic formulae gives an interpretable semantics to the dimensions of variability and by consequence to the axes of the visualization.

Original: To project on the axes, different distance and similarity measures can be used (euclidean distance, correlation, dot product), in particular we will use cosine similarity in the remaining of the paper, deﬁned as cossim ( a , b ) = 
Revised: To project on the axes, different distance and similarity measures can be used (euclidean distance, correlation, dot product), in particular we will use cosine similarity in the remaining of the paper, deﬁned as cossim ( a , b ) = [Figure] [Table] [Figure]

Revised: [Table]

Original: [Equation]
Revised: [Figure]

Original: [Table]
Revised: [Table]

Original: The items of the goal are a set deﬁned by extention ( items = { item 1 , . .
Revised: The items of the goal are a set deﬁned by extention ( items = { item 1 , . .

Original: , item n } ) or by intention (with rules).
Revised: , item n } ) or by intention (with rules).

Original: The rules use items’ embeddings or items’ metadata, like word frequencies, parts of speech, sentiment or categories the label belongs to.
Revised: The rules use items’ embeddings or items’ metadata, like word frequencies, parts of speech, sentiment or categories the label belongs to.

Original: Intentions identify a semantically coherent region of the embedding space through logical formulae.
Revised: Intentions identify a semantically coherent region of the embedding space through logical formulae.

Original: Rules using item’s embeddings are deﬁned as r e = (cid:104) d, e, c, v (cid:105) where d is a distance or similarity function, e is an algebraic formula that uses embeddings names as atoms and is resolved into a vector, c ∈ { <, ≤ , = , ≥ , > } , v is a numeric value.
Revised: Rules using item’s embeddings are deﬁned as r e = (cid:104) d, e, c, v (cid:105) where d is a distance or similarity function, e is an algebraic formula that uses embeddings names as atoms and is resolved into a vector, c ∈ { <, ≤ , = , ≥ , > } , v is a numeric value.

Original: They can be used, for instance, to select all the items that have a d = cosinesimilarity with respect to e = job + profession that is c = ≥ then v = 0 .
Revised: They can be used, for instance, to select all the items that have a d = cosinesimilarity with respect to e = job + profession that is c = ≥ then v = 0 .

Original: Rules using item’s metadata instead use typed metadata associated with each item.
Revised: Rules using item’s metadata instead use typed metadata associated with each item.

Original: An item can have categorical ﬁelds (e.g., words can be stop-words or not), set ﬁelds (e.g., the parts of speech a word can belongs to) and numerical ﬁelds (e.g., unigram frequencies in a corpus) associated with it.
Revised: An item can have categorical ﬁelds (e.g., words can be stop-words or not), set ﬁelds (e.g., the parts of speech a word can belongs to) and numerical ﬁelds (e.g., unigram frequencies in a corpus) associated with it.

Original: Rules are be deﬁned as inclusion in a set: r m = i cat ∩ set (cid:54)
Revised: Rules are be deﬁned as inclusion in a set: r m = i cat ∩ set (cid:54)

Original: = ∅ where i cat is the set of categories associated with an item, containing only one element in the case of categorical ﬁelds or multiple values in the case of set ﬁelds, while for numerical ﬁelds they are deﬁned as ranges.
Revised: = ∅ where i cat is the set of categories associated with an item, containing only one element in the case of categorical ﬁelds or multiple values in the case of set ﬁelds, while for numerical ﬁelds they are deﬁned as ranges.

Original: Following on with our example, we can select some professions like “doctor”, “nurse”, “teacher” and “astronaut” as our items, or we can deﬁne the items of interest as the set of all words in the embedding space that are close to the word “profession” (e.g., cosine similarity greater than 0.7), that are not too frequent (inside a range of frequency from 100 to 1000) and that are not stop-words.
Revised: Following on with our example, we can select some professions like “doctor”, “nurse”, “teacher” and “astronaut” as our items, or we can deﬁne the items of interest as the set of all words in the embedding space that are close to the word “profession” (e.g., cosine similarity greater than 0.7), that are not too frequent (inside a range of frequency from 100 to 1000) and that are not stop-words.

Original:  V ISUALIZATIONS
Revised:  V ISUALIZATIONS

Original: Goals deﬁned in terms of dimensions of variability and items identify a subspace of the entire embedding space to visualize and the best way to visualize it depends on some characteristics of the goal.
Revised: Goals deﬁned in terms of dimensions of variability and items identify a subspace of the entire embedding space to visualize and the best way to visualize it depends on some characteristics of the goal.

Original: In the case of few dimensions of variability (one to three) and potentially many items of interest, like the ones obtained by an empty set of rules, a Cartesian view is ideal, where each axis is the vector obtained by evaluating the algebraic formula it is associated with and the coordinates displayed are similarities or distances of the items with respect to each axis.
Revised: In the case of few dimensions of variability (one to three) and potentially many items of interest, like the ones obtained by an empty set of rules, a Cartesian view is ideal, where each axis is the vector obtained by evaluating the algebraic formula it is associated with and the coordinates displayed are similarities or distances of the items with respect to each axis.

Original: An example of a bi-dimensional
Revised: An example of a bi-dimensional

Original: Cartesian view is depicted in the left side of Figure 1.
Revised: Cartesian view is depicted in the left side of Figure 1.

Original: In the case where the goal is deﬁned in terms of many dimensions of variability, the Cartesian view can’t be used, and a polar view is preferred.
Revised: In the case where the goal is deﬁned in terms of many dimensions of variability, the Cartesian view can’t be used, and a polar view is preferred.

Original: By visualizing each dimension of variability in circle, the polar view can visualize many more axes, but it is limited in the number of items it can display, as each item will be displayed as a polygon with each vertex lying on the axis deﬁned for each dimension of variability and many overlapping polygons make the visualization cluttered.
Revised: By visualizing each dimension of variability in circle, the polar view can visualize many more axes, but it is limited in the number of items it can display, as each item will be displayed as a polygon with each vertex lying on the axis deﬁned for each dimension of variability and many overlapping polygons make the visualization cluttered.

Original: An example of a ﬁve-dimensional polar view is depicted in Figure 5.
Revised: An example of a ﬁve-dimensional polar view is depicted in Figure 5.

Original: The use of explicit axes allows for straightforward and interpretable comparison of different embedding spaces.
Revised: The use of explicit axes allows for straightforward and interpretable comparison of different embedding spaces.

Original: For instance, embeddings trained on different corpora or on the same corpora but with different models.
Revised: For instance, embeddings trained on different corpora or on the same corpora but with different models.

Original: The only requirement for embedding spaces to be comparable is that they contain embeddings for all labels present in the formulae deﬁning the axes.
Revised: The only requirement for embedding spaces to be comparable is that they contain embeddings for all labels present in the formulae deﬁning the axes.

Original: Moreover, embeddings in the two spaces do not need to be of the same dimension.
Revised: Moreover, embeddings in the two spaces do not need to be of the same dimension.

Original: Items will now have two sets of coordinates, one for each embedding space, thus they will be displayed as lines.
Revised: Items will now have two sets of coordinates, one for each embedding space, thus they will be displayed as lines.

Original: Short lines are interpreted as items being embedded similarly in the subspaces deﬁned by the axes in both original embedding spaces, while long lines can be interpreted as really different locations in the subspaces, and their direction gives insight on how items shift in the two subspaces.
Revised: Short lines are interpreted as items being embedded similarly in the subspaces deﬁned by the axes in both original embedding spaces, while long lines can be interpreted as really different locations in the subspaces, and their direction gives insight on how items shift in the two subspaces.

Original: Those two embedding spaces could be, for instance, embeddings trained on a clean corpus like Wikipedia as opposed to a noisy corpus like tweets from Twitter, or the two corpora could be two different time slices of the same corpus, in order to compare how words changed over time.
Revised: Those two embedding spaces could be, for instance, embeddings trained on a clean corpus like Wikipedia as opposed to a noisy corpus like tweets from Twitter, or the two corpora could be two different time slices of the same corpus, in order to compare how words changed over time.

Original: The right side of Figure 1 shows an example of how to use the Cartesian comparison view to compare two datasets.
Revised: The right side of Figure 1 shows an example of how to use the Cartesian comparison view to compare two datasets.

Original:  C ASE S TUDIES
Revised:  C ASE S TUDIES

Original: The methodology and visualizations can be used fruitfully in many analysis tasks in linguistics, digital humanities, in social studies based on empirical methods, and can also be used by researchers in computational linguistics and machine learning to inspect, debug and ultimately better understand the representations learned by their models.
Revised: The methodology and visualizations can be used fruitfully in many analysis tasks in linguistics, digital humanities, in social studies based on empirical methods, and can also be used by researchers in computational linguistics and machine learning to inspect, debug and ultimately better understand the representations learned by their models.

Original: Here few of those use cases are presented, but the methodology is ﬂexible enough to allow many other unforeseen uses.
Revised: Here few of those use cases are presented, but the methodology is ﬂexible enough to allow many other unforeseen uses.

Original: For those tasks, we used 50-dimensional publicly available GloVe (Pennington et al., 2014) embeddings trained on a corpus obtained concatenating a 2014 dump of Wikipedia and Gigaword 5 containing 6 billion tokens (for short Wikipedia ) and a set of 2 billion tweets containing 27 billion tokens (for short Twitter ).
Revised: For those tasks, we used 50-dimensional publicly available GloVe (Pennington et al., 2014) embeddings trained on a corpus obtained concatenating a 2014 dump of Wikipedia and Gigaword 5 containing 6 billion tokens (for short Wikipedia ) and a set of 2 billion tweets containing 27 billion tokens (for short Twitter ).

Original: 5. B IAS DETECTION
Revised: 5. B IAS DETECTION

Original: The task of bias detection is to identify, and in some cases correct for, bias in data that is reﬂected in the embeddings trained on such data.
Revised: The task of bias detection is to identify, and in some cases correct for, bias in data that is reﬂected in the embeddings trained on such data.

Original: Studies have shown how embeddings incorporate gender and ethnic biases (Garg et al.
Revised: Studies have shown how embeddings incorporate gender and ethnic biases (Garg et al.

Original: ; Bolukbasi et al.
Revised: ; Bolukbasi et al.

Original: ; Islam et al.
Revised: ; Islam et al.

Original: (2017)), while other studies focused on warping spaces in order to de-bias the resulting embeddings (Bolukbasi et al.
Revised: (2017)), while other studies focused on warping spaces in order to de-bias the resulting embeddings (Bolukbasi et al.

Original: Zhao et al.
Revised: Zhao et al.

Original: We show how our proposed methodology can help visualize biases.
Revised: We show how our proposed methodology can help visualize biases.

Original: To visualize gender bias with respect to professions, the goal is deﬁned with the formulae avg ( he, him ) and avg ( she, her ) as two dimensions of variability, in a similar vein to Garg et al.
Revised: To visualize gender bias with respect to professions, the goal is deﬁned with the formulae avg ( he, him ) and avg ( she, her ) as two dimensions of variability, in a similar vein to Garg et al.

Original: A subset of the professions used by Bolukbasi et al.
Revised: A subset of the professions used by Bolukbasi et al.

Original: (2016) is selected as items and cosine similarity is adopted as the measure for the projection.
Revised: (2016) is selected as items and cosine similarity is adopted as the measure for the projection.

Original: The Cartesian view visualizing Wikipedia embeddings is shown in the left side of Figure 1.
Revised: The Cartesian view visualizing Wikipedia embeddings is shown in the left side of Figure 1.

Original: Nurse , dancer , and maid are the professions that end up closer to the “female” axis, while boss , captain , and commander end up closer to the “male” axis.
Revised: Nurse , dancer , and maid are the professions that end up closer to the “female” axis, while boss , captain , and commander end up closer to the “male” axis.

Original: The Cartesian comparison view comparing the embeddings trained on Wikipedia and Twitter is shown in the right side of Figure 1.
Revised: The Cartesian comparison view comparing the embeddings trained on Wikipedia and Twitter is shown in the right side of Figure 1.

Original: Only the embeddings with a line length above 0 .
Revised: Only the embeddings with a line length above 0 .

Original: 05 are displayed.
Revised: 05 are displayed.

Original: The most interesting words in this visualization are the ones that shift the most in the direction of negative slope.
Revised: The most interesting words in this visualization are the ones that shift the most in the direction of negative slope.

Original: In this case, are chef and doctor are closer to the “male” axis in Twitter than in
Revised: In this case, are chef and doctor are closer to the “male” axis in Twitter than in

Original: Wikipedia , while dancer and secretary are closer to the bisector in Twitter than in Wikipedia .
Revised: Wikipedia , while dancer and secretary are closer to the bisector in Twitter than in Wikipedia .

Original: Additional analysis of how words tend to shift in the two embedding spaces would be needed in order to derive provable conclusions about the signiﬁcance of the shift, for instance through a permutation test with respect to all possible pairs, but the visualization can help inform the most promising words to perform the test on.
Revised: Additional analysis of how words tend to shift in the two embedding spaces would be needed in order to derive provable conclusions about the signiﬁcance of the shift, for instance through a permutation test with respect to all possible pairs, but the visualization can help inform the most promising words to perform the test on.

Original: 5. P OLYSEMY ANALYSIS
Revised: 5. P OLYSEMY ANALYSIS

Original: Embedding methods conﬂate different meanings of a word into the same vector A few methods have been proposed to obtain more ﬁne-grained representations by clustering contexts and representing words with multiple vectors (Huang et al., 2012; Neelakantan et al., 2014), but widely used pretrained GloVe vectors still conﬂate different meanings in the same embedding.
Revised: Embedding methods conﬂate different meanings of a word into the same vector A few methods have been proposed to obtain more ﬁne-grained representations by clustering contexts and representing words with multiple vectors (Huang et al., 2012; Neelakantan et al., 2014), but widely used pretrained GloVe vectors still conﬂate different meanings in the same embedding.

Original: Widdows (2003) showed how using a binary orthonormalization operator that has ties with the quantum logic not operator it is possible to remove from the embedding of a polysemous word part of the conﬂated meaning.
Revised: Widdows (2003) showed how using a binary orthonormalization operator that has ties with the quantum logic not operator it is possible to remove from the embedding of a polysemous word part of the conﬂated meaning.

Original: The authors deﬁne the operator nqnot ( a, b ) =
Revised: The authors deﬁne the operator nqnot ( a, b ) =

Original: a − a · b | b | 2 b
Revised: a − a · b | b | 2 b

Original: and we show with a comparison plot how it can help distinguish the different meanings of a word.
Revised: and we show with a comparison plot how it can help distinguish the different meanings of a word.

Original: For illustrative purposes we choose the same polysemous word used by Widdows (2003), suit , and use the nqnot operator to orthonormalize with respect to lawsuit and dress , the two main meanings used as dimensions of variability.
Revised: For illustrative purposes we choose the same polysemous word used by Widdows (2003), suit , and use the nqnot operator to orthonormalize with respect to lawsuit and dress , the two main meanings used as dimensions of variability.

Original: The items in our goal are the 20000 most frequent words in the
Revised: The items in our goal are the 20000 most frequent words in the

Original: Wikipedia embedding space removing stop-words.
Revised: Wikipedia embedding space removing stop-words.

Original: In the top of Figure 2 we show the overall plot and we zoom on the items that are closer to each axis.
Revised: In the top of Figure 2 we show the overall plot and we zoom on the items that are closer to each axis.

Original: Words closer to the axis negating lawsuit are all related to dresses and the act of wearing something, while words closer to the axis negating dress are related to law.
Revised: Words closer to the axis negating lawsuit are all related to dresses and the act of wearing something, while words closer to the axis negating dress are related to law.

Original: We chose another polysemous word, apple , and orthonornalized with respect to fruit and computer .
Revised: We chose another polysemous word, apple , and orthonornalized with respect to fruit and computer .

Original: In the bottom of Figure 2 words that have a higher similarity with respect to the ﬁrst axis are all tech related, while the ones that have a higher similarity with respect to the second axis are mostly other fruits or food.
Revised: In the bottom of Figure 2 words that have a higher similarity with respect to the ﬁrst axis are all tech related, while the ones that have a higher similarity with respect to the second axis are mostly other fruits or food.

Original: Both examples conﬁrm the ability of the nqnot operator to disentangle multiple meanings from polysemous embeddings and show how the proposed visualizations are able to show it clearly.
Revised: Both examples conﬁrm the ability of the nqnot operator to disentangle multiple meanings from polysemous embeddings and show how the proposed visualizations are able to show it clearly.

Original: 5. F INE - GRAINED EMBEDDING ANALYSIS
Revised: 5. F INE - GRAINED EMBEDDING ANALYSIS

Original: We consider embeddings that are close in the embedding space to be semantically related, but even close embeddings may have nuances that distinguish them.
Revised: We consider embeddings that are close in the embedding space to be semantically related but even close embeddings may have nuances that distinguish them.

Original: When projecting in two dimensions through PCA or t-SNE we are conﬂating a multidimensional notion of similarity to a bi-dimensional one, loosing the ﬁne grained distinctions among different embeddings.
Revised: When projecting in two dimensions through PCA or t-SNE we are conﬂating a multidimensional notion of similarity to a bi-dimensional one, loosing the ﬁne grained distinctions among different embeddings.

Original: The Cartesian view allows for a more ﬁne-grained visualization of similarities and differences among embeddings that emphasizes nuances that could go otherwise unnoticed.
Revised: The Cartesian view allows for a more ﬁne-grained visualization of similarities and differences among embeddings that emphasizes nuances that could go otherwise unnoticed.

Original: To demonstrate this capability we select as dimensions of variability formulae made of just single words that are in close vicinity to each other in the Wikipedia embedding space: google and microsoft , as google is the closest word to microsoft and microsoft is the 3 rd closest word to google .
Revised: To demonstrate this capability we select as dimensions of variability formulae made of just single words that are in close vicinity to each other in the Wikipedia embedding space: google and microsoft , as google is the closest word to microsoft and microsoft is the 3 rd closest word to google .

Original: As items we pick the 30000 most frequent words removing stop-words and the 500 most frequent words (as they are too generic) and keeping only the words that have a cosine similarity of at least 0 .
Revised: As items we pick the 30000 most frequent words removing stop-words and the 500 most frequent words (as they are too generic) and keeping only the words that have a cosine similarity of at least 0 .

Original: 4 with both google and microsoft while having a cosine similarity below 0 .
Revised: 4 with both google and microsoft while having a cosine similarity below 0 .

Original: 75 with respect to the formula google + microsoft , as we are interested in the most polarized words.
Revised: 75 with respect to the formula google + microsoft , as we are interested in the most polarized words.

Original: The left side of Figure 3 shows how even if those embeddings are close to each other it is easy to identify peculiar words (highlighted with red dots).
Revised: The left side of Figure 3 shows how even if those embeddings are close to each other it is easy to identify peculiar words (highlighted with red dots).

Original: The ones that relate to web companies and services ( twitter , youtube , myspace ) are much closer to the google axis.
Revised: The ones that relate to web companies and services ( twitter , youtube , myspace ) are much closer to the google axis.

Original: Words related to both legal issues ( lawsuit , antitrust ) and videogames ( ps3 , nintendo , xbox ) and traditional IT companies are closer to the microsoft axis.
Revised: Words related to both legal issues ( lawsuit , antitrust ) and videogames ( ps3 , nintendo , xbox ) and traditional IT companies are closer to the microsoft axis.

Original: In Figure 4 we the same words using google and microsoft orthonormalized with respect to each other as axes.
Revised: In Figure 4 we the same words using google and microsoft orthonormalized with respect to each other as axes.

Original: The top left and the bottom right corners are the most interesting ones, as they contain terms that are related to one word after having negated the other.
Revised: The top left and the bottom right corners are the most interesting ones, as they contain terms that are related to one word after having negated the other.

Original: The pattern that emerges is similar to the one highlighted in the left side of Figure 3, but now also operating systems terms ( unix , os/2 ) appear in the microsoft corner, while advertisement and tracking appear in the google corner.
Revised: The pattern that emerges is similar to the one highlighted in the left side of Figure 3, but now also operating systems terms ( unix , os/2 ) appear in the microsoft corner, while advertisement and tracking appear in the google corner.

Original: For contrast, the t-SNE projection is shown in the right side of Figure 3: it is hard to appreciate the similarities and differences among those embeddings other than seeing them being close in the projected space.
Revised: For contrast, the t-SNE projection is shown in the right side of Figure 3: it is hard to appreciate the similarities and differences among those embeddings other than seeing them being close in the projected space.

Original: This conﬁrms on one hand that the notion of similarity between terms in an  embedding space hides many nuances that are captured in those representations and on the other hand that the proposed methodology enables for a more detailed inspection of the embedded space.
Revised: This conﬁrms on one hand that the notion of similarity between terms in an [Table] embedding space hides many nuances that are captured in those representations and on the other hand that the proposed methodology enables for a more detailed inspection of the embedded space.

Original: Multi-dimensional similarity nuances can be visualized using the polar view.
Revised: Multi-dimensional similarity nuances can be visualized using the polar view.

Original: In Figure 5 we show an example of how to visualize a small number of items on more than two axes, speciﬁcally ﬁve foodrelated items compared over ﬁve countries axes.
Revised: In Figure 5 we show an example of how to visualize a small number of items on more than two axes, speciﬁcally ﬁve foodrelated items compared over ﬁve countries axes.

Original: The most typical food from a speciﬁc country is the closest to the country axis, with sushi being predominantly close to Japan and China , dumplings being close to both Asian countries and Italy , pasta being predominantly closer to Italy ’s axis, chocolate being close to European countries and champagne being closer to France and Italy .This [Table]
Revised: The most typical food from a speciﬁc country is the closest to the country axis, with sushi being predominantly close to Japan and China , dumplings being close to both Asian countries and Italy , pasta being predominantly closer to Italy ’s axis, chocolate being close to European countries and champagne being closer to France and Italy .

Original:  same approach could be used also for bias detection where the axes are concepts capturing the notion of ethnicity and items could be adjectives, or the two could be swapped, depending.
Revised: This same approach could be used also for bias detection where the axes are concepts capturing the notion of ethnicity and items could be adjectives, or the two could be swapped, depending.

Original:  U SER S TUDY
Revised:  U SER S TUDY

Original: We conducted a series of user studies to quantify the effectiveness of the proposed methods.
Revised: We conducted a series of user studies to quantify the effectiveness of the proposed method.

Revised: The goal is to ﬁnd out if and how visualizations using user-deﬁned semantically meaningful algebraic formulae as their axes help users achieve their analysis goals.

Revised: What we are not testing for is the quality of projection itself, as in PCA AND t-SNE the projection axes are obtained algorithmically, while in our case they are explicitly deﬁned by the user.

Original: We formalized the research questions as: Q1)
Revised: We formalized the research questions as: Q1)

Original: Does Explicit Formulae outperform t-SNE in goal-oriented tasks?
Revised: Does Explicit Formulae outperform t-SNE in goal-oriented tasks?

Original: Q2)
Revised: Q2)

Original: Can Explicit Formulae reduce time to complete goal-oriented tasks wrt.
Revised: Can Explicit Formulae reduce time to complete goal-oriented tasks wrt.

Original: t-SNE?
Revised: t-SNE?

Original: Q3)
Revised: Q3)

Original: Which visualization do users prefer?
Revised: Which visualization do users prefer?

Original: To answer these questions we invited twelve subjects among data scientists and machine learning researchers, all acquainted with interpreting dimensionality reduction results.
Revised: To answer these questions we invited twelve subjects among data scientists and machine learning researchers, all acquainted with interpreting dimensionality reduction results.

Original: We deﬁned two types of tasks, namely Commonality and Polarization, in which subjects were given a visualization together with a pair of words (used as axes in Explicit Formulae or highlighted with a big font and red dot in case of t-SNE).
Revised: We deﬁned two types of tasks, namely Commonality and Polarization, in which subjects were given a visualization together with a pair of words (used as axes in Explicit Formulae or highlighted with a big font and red dot in case of t-SNE).

Original: We asked the subjects to identify either common or polarized words w.r.t.
Revised: We asked the subjects to identify either common or polarized words w.r.t.

Original: the two provided ones.
Revised: the two provided ones.

Revised: The provided pairs were: banana & strawberry, google & microsoft, nerd & geek, book & magazine.

Original: The test subjects were given a list of eight questions, four per task type, and their proposed lists of ﬁve words are compared with a gold standard provided by a committee of two computational linguistics experts.
Revised: The test subjects were given a list of eight questions, four per task type, and their proposed lists of ﬁve words are compared with a gold standard provided by a committee of two computational linguistics experts.

Original: The tasks are fully randomized within the subject to prevent from learning effects.
Revised: The tasks are fully randomized within the subject to prevent from learning effects.

Original: In addition, we obfuscated half of our questions by replacing the words with a random numeric ID to prevent prior knowledge from affecting the judgment.
Revised: In addition, we obfuscated half of our questions by replacing the words with a random numeric ID to prevent prior knowledge from affecting the judgment.

Original: We employed three measures: accuracy in which we calculate the number of words provided by the subjects that are present in the gold standard set, speed recording the amount of time users spend to answer the questions normalized by the number of words (commonality: 1, polarization: 2), and we also collected an overall preference for either visualizations.
Revised: We employed three measures: accuracy in which we calculate the number of words provided by the subjects that are present in the gold standard set, speed recording the amount of time users spend to answer the questions normalized by the number of words (commonality: 1, polarization: 2), and we also collected an overall preference for either visualizations.

Original: As reported in Table 1, two-way ANOVA tests revealed signiﬁcant differences in Accuracy for the factor of Projection (Explicit Formulae ( µ = 2 .
Revised: As reported in Table 1, two-way ANOVA tests revealed signiﬁcant differences in Accuracy for the factor of Projection (Explicit Formulae ( µ = 2 .

Original: 02 , σ = 1 . 40 ) and t-SNE ( µ = 0 .
Revised: 02 , σ = 1 . 40 ) and t-SNE ( µ = 0 .

Original: 50 , σ = 0 . 71 )) against both Task ( F 1 , 91 = 46 .
Revised: 50 , σ = 0 . 71 )) against both Task ( F 1 , 91 = 46 .

Original: 11 , p = 1 .
Revised: 11 , p = 1 .

Original: 078 × 10 − 9 ) and Obfuscation ( F 1 , 91 = 57 .
Revised: 078 × 10 − 9 ) and Obfuscation ( F 1 , 91 = 57 .

Original: 73 , p = 2 .
Revised: 73 , p = 2 .

Original: 446 × 10 − 11 ), which is a strong indicator that the proposed Explicit Formulae method outperforms t-SNE in terms of accuracy in both Commonality and Polarization tasks.
Revised: 446 × 10 − 11 ), which is a strong indicator that the proposed Explicit Formulae method outperforms t-SNE in terms of accuracy in both Commonality and Polarization tasks.

Original: We also observed signiﬁcant differences ( F 1 , 91 = 23 .
Revised: We also observed signiﬁcant differences ( F 1 , 91 = 23 .

Original: 93 , p = 4 . 

Revised: 93 , p = 4 .

Original: × 10 − 6 ) in Obfuscation: subjects tend to have better accuracy when the words are not obfuscated ( µ = 1 .
Revised: × 10 − 6 ) in Obfuscation: subjects tend to have better accuracy when the words are not obfuscated ( µ = 1 .

Original: 75 , σ = 1 . 55 vs. µ = 0 .
Revised: 75 , σ = 1 . 55 vs. µ = 0 .

Original: 77 , σ = 0 .when obfuscated), but are signiﬁcantly slower ( F 1 , 91 = 5 .
Revised: 77 , σ = 0 . when obfuscated), but are signiﬁcantly slower ( F 1 , 91 = 5 .

Original: 901 , p = 0 .
Revised: 901 , p = 0 .

Original: We run post-hoc t-tests that conﬁrmed how accuracy of Explicit Formulae on Non-obfuscated is better than Obfuscated ( t = 4 .
Revised: We run post-hoc t-tests that conﬁrmed how accuracy of Explicit Formulae on Non-obfuscated is better than Obfuscated ( t = 4 .

Original: 172 , p < 0 . 0001 ), which in turn is better that t-SNE Non-obfuscated ( t = 2 . 137 , p = 0 . 0190 ), which is better than t-SNE Obfuscated ( t = 2 . 563 , p = 0 .
Revised: 172 , p < 0 . 0001 ), which in turn is better that t-SNE Non-obfuscated ( t = 2 . 137 , p = 0 . 0190 ), which is better than t-SNE Obfuscated ( t = 2 . 563 , p = 0 .

Original: One explanation is that the subjects relied on both the visualization and linguistic knowledge to perform the task, but the fact that Explicit Formulae Obfuscated is still better than t-SNE Non-obfuscated suggests that Explicit Formulae, even with obfuscated labels, is consistently more reliable than t-SNE.
Revised: One explanation is that the subjects relied on both the visualization and linguistic knowledge to perform the task, but the fact that Explicit Formulae Obfuscated is still better than t-SNE Non-obfuscated suggests that Explicit Formulae, even with obfuscated labels, is consistently more reliable than t-SNE.

Original: Concerning Speed, we did not observe signs that the subjects performed faster with Explicit Formulae comparing to t-SNE.
Revised: Concerning Speed, we did not observe signs that the subjects performed faster with Explicit Formulae comparing to t-SNE.

Original: Concerning Preference, nine out of all twelve (75%) subjects chose Explicit
Revised: Concerning Preference, nine out of all twelve (75%) subjects chose Explicit

Original: Formulae over t-SNE, while the rest three prefers t-SNE because of familiarity, indicating there is still non-negligible learning curve of our proposed methods.
Revised: Formulae over t-SNE, while the rest three prefers t-SNE because of familiarity, indicating there is still non-negligible learning curve of our proposed methods.

Original: In conclusion, our answers to the research questions are that (Q1)
Revised: In conclusion, our answers to the research questions are that (Q1)

Original: Explicit Formulae leads to better ac curacy in goal-oriented tasks, (Q2) there is no signiﬁcant difference between the two techniques in terms of speed and (Q3)
Revised: Explicit Formulae leads to better ac curacy in goal-oriented tasks, (Q2) there is no signiﬁcant difference between the two techniques in terms of speed and (Q3)

Original: users prefer Explicit Formulae over t-SNE
Revised: users prefer Explicit Formulae over t-SNE.

Original:  C ONCLUSIONS
Revised:  C ONCLUSIONS

Original: We presented a simple methodology for projecting embeddings into lower-dimensional semantically-meaningful subspaces through explicit vector algebra formulae operating on the embedding themselves.
Revised: We presented a simple methodology for projecting embeddings into lower-dimensional semantically-meaningful subspaces through explicit vector algebra formulae operating on the embedding themselves.

Original: Classical projection methods are useful to gather on overall coarse-grained view of the embedding space and how embeddings cluster, but we showed how our approach allows goal-oriented analyses with more ﬁne-grained comparison and enables cross-dataset comparison through a series of case studies and a user study.
Revised: Classical projection methods are useful to gather on overall coarse-grained view of the embedding space and how embeddings cluster, but we showed how our approach allows goal-oriented analyses with more ﬁne-grained comparison and enables cross-dataset comparison through a series of case studies and a user study.

Original: This is possible thanks to the ability of the proposed methodology to assign an explicit semantics to the measures of variability used as axes of the visualization that in turns makes them interpretable and widely applicable to many use cases in computational linguistics, natural language processing, machine learning, social sciences and digital humanities.
Revised: This is possible thanks to the ability of the proposed methodology to assign an explicit semantics to the measures of variability used as axes of the visualization that in turns makes them interpretable and widely applicable to many use cases in computational linguistics, natural language processing, machine learning, social sciences and digital humanities.