DOCSLIB.ORG

A Systematic Study of Semantic Vector Space Model Parameters

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
A Systematic Study of Semantic Vector Space Model Parameters A Systematic Study of Semantic Vector Space Model Parameters Douwe Kiela Stephen Clark University of Cambridge University of Cambridge Computer Laboratory Computer Laboratory [email protected] [email protected] Abstract we use a selection of source corpora. Hence there are two additional “superparameters”: We present a systematic study of parame- dataset for evaluation; ters used in the construction of semantic • source corpus. vector space models. Evaluation is car- • ried out on a variety of similarity tasks, in- Previous studies have been limited to investigat- cluding a compositionality dataset, using ing only a small number of parameters, and us- several source corpora. In addition to rec- ing a limited set of source corpora and tasks for ommendations for optimal parameters, we evaluation (Curran and Moens, 2002a; Curran and present some novel findings, including a Moens, 2002b; Curran, 2004; Grefenstette, 1994; similarity metric that outperforms the al- Pado and Lapata, 2007; Sahlgren, 2006; Turney ternatives on all tasks considered. and Pantel, 2010; Schulte im Walde et al., 2013). 1 Introduction Rohde et al. (2006) considered several weighting schemes for a large variety of tasks, while Weeds Vector space models (VSMs) represent the mean- et al. (2004) did the same for similarity metrics. ings of lexical items as vectors in a “semantic Stone et al. (2008) investigated the effectiveness space”. The benefit of VSMs is that they can eas- of sub-spacing corpora, where a larger corpus is ily be manipulated using linear algebra, allowing queried in order to construct a smaller sub-spaced a degree of similarity between vectors to be com- corpus (Zelikovitz and Kogan, 2006). Blacoe and puted. They rely on the distributional hypothesis Lapata (2012) compare several types of vector rep- (Harris, 1954): the idea that “words that occur in resentations for semantic composition tasks. The similar contexts tend to have similar meanings” most comprehensive existing studies of VSM pa- (Turney and Pantel, 2010; Erk, 2012). The con- rameters — encompassing window sizes, feature struction of a suitable VSM for a particular task is granularity, stopwords and dimensionality reduc- highly parameterised, and there appears to be little tion — are by Bullinaria and Levy (2007; 2012) consensus over which parameter settings to use. and Lapesa and Evert (2013). This paper presents a systematic study of the Section 2 introduces the various parameters of following parameters: vector space model construction. We then attempt, vector size; in Section 3, to answer some of the fundamen- • window size; tal questions for building VSMs through a number • of experiments that consider each of the selected window-based or dependency-based context; • parameters. In Section 4 we examine how these feature granularity; • findings relate to the recent development of dis- similarity metric; • tributional compositional semantics (Baroni et al., weighting scheme; • 2013; Clark, 2014), where vectors for words are stopwords and high frequency cut-off. combined into vectors for phrases. • A representative set of semantic similarity 2 Data and Parameters datasets has been selected from the literature, in- cluding a phrasal similarity dataset for evaluating Two datasets have dominated the literature with compositionality. The choice of source corpus is respect to VSM parameters: WordSim353 (Finkel- likely to influence the quality of the VSM, and so stein et al., 2002) and the TOEFL synonym dataset 21 Proceedings of the 2nd Workshop on Continuous Vector Space Models and their Compositionality (CVSC) @ EACL 2014, pages 21–30, Gothenburg, Sweden, April 26-30 2014. c 2014 Association for Computational Linguistics Dataset Pairings Words Vector size Each component of a vector repre- RG 65 48 sents a context (or perhaps more accurately a “con- MC 30 39 W353 353 437 textual element”, such as second word to the left MEN 3000 751 of the target word).2 The number of components TOEFL 80 400 M&L10 324 314 varies hugely in the literature, but a typical value is in the low thousands. Here we consider vec- Table 1: Datasets for evaluation tor sizes ranging from 50,000 to 500,000, to see whether larger vectors lead to better performance. (Landauer and Dumais, 1997). There is a risk Context There are two main approaches to mod- that semantic similarity studies have been overfit- elling context: window-based and dependency- ting to their idiosyncracies, so in this study we based. For window-based methods, contexts are evaluate on a variety of datasets: in addition to determined by word co-occurrences within a win- WordSim353 (W353) and TOEFL, we also use dow of a given size, where the window simply the Rubenstein & Goodenough (RG) (1965) and spans a number of words occurring around in- Miller & Charles (MC) (1991) data, as well as stances of a target word. For dependency-based a much larger set of similarity ratings: the MEN methods, the contexts are determined by word dataset (Bruni et al., 2012). All these datasets con- co-occurrences in a particular syntactic relation sist of human similarity ratings for word pairings, with a target word (e.g. target word dog is the except TOEFL, which consists of multiple choice subject of run, where run subj is the context). questions where the task is to select the correct We consider different window sizes and compare synonym for a target word. In Section 4 we ex- window-based and dependency-based methods. amine our parameters in the context of distribu- tional compositional semantics, using the evalua- Feature granularity Context words, or “fea- tion dataset from Mitchell and Lapata (2010). Ta- tures”, are often stemmed or lemmatised. We in- ble 1 gives statistics for the number of words and vestigate the effect of stemming and lemmatisa- word pairings in each of the datasets. tion, in particular to see whether the effect varies As well as using a variety of datasets, we also with corpus size. We also consider more fine- consider three different corpora from which to grained features in which each context word is build the vectors, varying in size and domain. paired with a POS tag or a lexical category from These include the BNC (Burnard, 2007) (106 CCG (Steedman, 2000). 8 word types, 10 tokens) and the larger ukWaC Similarity metric A variety of metrics can be 7 9 (Baroni et al., 2009) (10 types, 10 tokens). used to calculate the similarity between two vec- We also include a sub-spaced Wikipedia corpus tors. We consider the similarity metrics in Table 2. (Stone et al., 2008): for all words in the eval- uation datasets, we build a subcorpus by query- Weighting Weighting schemes increase the im- ing the top 10-ranked Wikipedia documents using portance of contexts that are more indicative of the the words as search terms, resulting in a corpus meaning of the target word: the fact that cat co- with 106 word types and 107 tokens. For examin- occurs with purr is much more informative than ing the dependency-based contexts, we include the its co-occurrence with the. Table 3 gives defini- Google Syntactic N-gram corpus (Goldberg and tions of the weighting schemes considered. Orwant, 2013), with 107 types and 1011 tokens. Stopwords, high frequency cut-off Function words and stopwords are often considered too un- 2.1 Parameters informative to be suitable context words. Ignor- We selected the following set of parameters for in- ing them not only leads to a reduction in model vestigation, all of which are fundamental to vector size and computational effort, but also to a more space model construction1. informative distributional vector. Hence we fol- lowed standard practice and did not use stopwords 1Another obvious parameter would be dimensionality re- as context words (using the stoplist in NLTK (Bird duction, which we chose not to include because it does not et al., 2009)). The question we investigated is represent a fundamental aspect of VSM construction: di- mensionality reduction relies on some original non-reduced 2We will use the term “feature” or “context” or “context model, and directly depends on its quality. word” to refer to contextual elements. 22 Measure Definition Scheme Definition Euclidean 1 w = f 1+ Pn (u v )2 None ij ij √ i=1 i− i 1 N Pn TF-IDF wij = log(fij ) log( ) Cityblock 1+ u v nj i=1 | i− i| × 1 N TF-ICF wij = log(fij ) log( ) Chebyshev 1+max u v fj i | i− i| × u v fij N nj +0.5 · Okapi BM25 wij = f log − Cosine u v j fij +0.5 0.5+1.5 +fij | || | × fj (u µ ) (v µ ) j − u · − v f Correlation u v (0.5+0.5 ij ) log( N ) | || | × maxf nj Pn ATC wij = r f 2 i=0 min(ui,vi) PN ij N 2 Dice Pn i=1[(0.5+0.5 max ) log( n )] ui+vi × f j i=0 N (log(fij )+1.0) log( ) u v nj Jaccard Pn · LTU w = i=0 ui+vi ij j 0.8+0.2 fj f Pn × × j i=0 min(ui,vi) Jaccard2 Pn P (tij cj ) i=0 max(ui,vi) | MI wij = log P (t )P (c ) Pn ij j i=0 ui+vi Lin u + v | | | | PosMI max(0, MI) u v Tanimoto u + v· u v P (tij cj ) P (tij )P (cj ) | | | |− · T-Test wij = | − P (t )P (c ) 1 (D(u u+v )+D(v u+v )) √ ij j 2 || 2 || 2 Jensen-Shannon Div 1 √ − 2 log 2 χ2 see (Curran, 2004, p. 83) D(u αv+(1 α)u) || − α-skew 1 √2 log 2 f f − ij × Lin98a wij = f f i× j nj Lin98b wij = 1 log Table 2: Similarity measures between vectors v − × N and u, where vi is the ith component of v log fij +1 Gref94 wij = log nj +1 whether removing more context words, based on a frequency cut-off, can improve performance.
Load more

Recommended publications
  • Document and Topic Models: Plsa
    10/4/2018 Document and Topic Models: pLSA and LDA Andrew Levandoski and Jonathan Lobo CS 3750 Advanced Topics in Machine Learning 2 October 2018 Outline • Topic Models • pLSA • LSA • Model • Fitting via EM • pHITS: link analysis • LDA • Dirichlet distribution • Generative process • Model • Geometric Interpretation • Inference 2 1 10/4/2018 Topic Models: Visual Representation Topic proportions and Topics Documents assignments 3 Topic Models: Importance • For a given corpus, we learn two things: 1. Topic: from full vocabulary set, we learn important subsets 2. Topic proportion: we learn what each document is about • This can be viewed as a form of dimensionality reduction • From large vocabulary set, extract basis vectors (topics) • Represent document in topic space (topic proportions) 푁 퐾 • Dimensionality is reduced from 푤푖 ∈ ℤ푉 to 휃 ∈ ℝ • Topic proportion is useful for several applications including document classification, discovery of semantic structures, sentiment analysis, object localization in images, etc. 4 2 10/4/2018 Topic Models: Terminology • Document Model • Word: element in a vocabulary set • Document: collection of words • Corpus: collection of documents • Topic Model • Topic: collection of words (subset of vocabulary) • Document is represented by (latent) mixture of topics • 푝 푤 푑 = 푝 푤 푧 푝(푧|푑) (푧 : topic) • Note: document is a collection of words (not a sequence) • ‘Bag of words’ assumption • In probability, we call this the exchangeability assumption • 푝 푤1, … , 푤푁 = 푝(푤휎 1 , … , 푤휎 푁 ) (휎: permutation) 5 Topic Models: Terminology (cont’d) • Represent each document as a vector space • A word is an item from a vocabulary indexed by {1, … , 푉}. We represent words using unit‐basis vectors.
    [Show full text]
  • Redalyc.Latent Dirichlet Allocation Complement in the Vector Space Model for Multi-Label Text Classification
    International Journal of Combinatorial Optimization Problems and Informatics E-ISSN: 2007-1558 [email protected] International Journal of Combinatorial Optimization Problems and Informatics México Carrera-Trejo, Víctor; Sidorov, Grigori; Miranda-Jiménez, Sabino; Moreno Ibarra, Marco; Cadena Martínez, Rodrigo Latent Dirichlet Allocation complement in the vector space model for Multi-Label Text Classification International Journal of Combinatorial Optimization Problems and Informatics, vol. 6, núm. 1, enero-abril, 2015, pp. 7-19 International Journal of Combinatorial Optimization Problems and Informatics Morelos, México Available in: http://www.redalyc.org/articulo.oa?id=265239212002 How to cite Complete issue Scientific Information System More information about this article Network of Scientific Journals from Latin America, the Caribbean, Spain and Portugal Journal's homepage in redalyc.org Non-profit academic project, developed under the open access initiative © International Journal of Combinatorial Optimization Problems and Informatics, Vol. 6, No. 1, Jan-April 2015, pp. 7-19. ISSN: 2007-1558. Latent Dirichlet Allocation complement in the vector space model for Multi-Label Text Classification Víctor Carrera-Trejo1, Grigori Sidorov1, Sabino Miranda-Jiménez2, Marco Moreno Ibarra1 and Rodrigo Cadena Martínez3 Centro de Investigación en Computación1, Instituto Politécnico Nacional, México DF, México Centro de Investigación e Innovación en Tecnologías de la Información y Comunicación (INFOTEC)2, Ags., México Universidad Tecnológica de México3 – UNITEC MÉXICO [email protected], {sidorov,marcomoreno}@cic.ipn.mx, [email protected] [email protected] Abstract. In text classification task one of the main problems is to choose which features give the best results. Various features can be used like words, n-grams, syntactic n-grams of various types (POS tags, dependency relations, mixed, etc.), or a combinations of these features can be considered.
    [Show full text]
  • Evaluating Vector-Space Models of Word Representation, Or, the Unreasonable Effectiveness of Counting Words Near Other Words
    Evaluating Vector-Space Models of Word Representation, or, The Unreasonable Effectiveness of Counting Words Near Other Words Aida Nematzadeh, Stephan C. Meylan, and Thomas L. Griffiths University of California, Berkeley fnematzadeh, smeylan, tom griffi[email protected] Abstract angle between word vectors (e.g., Mikolov et al., 2013b; Pen- nington et al., 2014). Vector-space models of semantics represent words as continuously-valued vectors and measure similarity based on In this paper, we examine whether these constraints im- the distance or angle between those vectors. Such representa- ply that Word2Vec and GloVe representations suffer from the tions have become increasingly popular due to the recent de- same difficulty as previous vector-space models in capturing velopment of methods that allow them to be efficiently esti- mated from very large amounts of data. However, the idea human similarity judgments. To this end, we evaluate these of relating similarity to distance in a spatial representation representations on a set of tasks adopted from Griffiths et al. has been criticized by cognitive scientists, as human similar- (2007) in which the authors showed that the representations ity judgments have many properties that are inconsistent with the geometric constraints that a distance metric must obey. We learned by another well-known vector-space model, Latent show that two popular vector-space models, Word2Vec and Semantic Analysis (Landauer and Dumais, 1997), were in- GloVe, are unable to capture certain critical aspects of human consistent with patterns of semantic similarity demonstrated word association data as a consequence of these constraints. However, a probabilistic topic model estimated from a rela- in human word association data.
    [Show full text]
  • Gensim Is Robust in Nature and Has Been in Use in Various Systems by Various People As Well As Organisations for Over 4 Years
    Gensim i Gensim About the Tutorial Gensim = “Generate Similar” is a popular open source natural language processing library used for unsupervised topic modeling. It uses top academic models and modern statistical machine learning to perform various complex tasks such as Building document or word vectors, Corpora, performing topic identification, performing document comparison (retrieving semantically similar documents), analysing plain-text documents for semantic structure. Audience This tutorial will be useful for graduates, post-graduates, and research students who either have an interest in Natural Language Processing (NLP), Topic Modeling or have these subjects as a part of their curriculum. The reader can be a beginner or an advanced learner. Prerequisites The reader must have basic knowledge about NLP and should also be aware of Python programming concepts. Copyright & Disclaimer Copyright 2020 by Tutorials Point (I) Pvt. Ltd. All the content and graphics published in this e-book are the property of Tutorials Point (I) Pvt. Ltd. The user of this e-book is prohibited to reuse, retain, copy, distribute or republish any contents or a part of contents of this e-book in any manner without written consent of the publisher. We strive to update the contents of our website and tutorials as timely and as precisely as possible, however, the contents may contain inaccuracies or errors. Tutorials Point (I) Pvt. Ltd. provides no guarantee regarding the accuracy, timeliness or completeness of our website or its contents including this tutorial. If you discover any errors on our website or in this tutorial, please notify us at [email protected] ii Gensim Table of Contents About the Tutorial ..........................................................................................................................................
    [Show full text]
  • Deconstructing Word Embedding Models
    Deconstructing Word Embedding Models Koushik K. Varma Ashoka University, [email protected] Abstract – Analysis of Word Embedding Models through Analysis, one must be certain that all linguistic aspects of a a deconstructive approach reveals their several word are captured within the vector representations because shortcomings and inconsistencies. These include any discrepancies could be further amplified in practical instability of the vector representations, a distorted applications. While these vector representations have analogical reasoning, geometric incompatibility with widespread use in modern natural language processing, it is linguistic features, and the inconsistencies in the corpus unclear as to what degree they accurately encode the data. A new theoretical embedding model, ‘Derridian essence of language in its structural, contextual, cultural and Embedding,’ is proposed in this paper. Contemporary ethical assimilation. Surface evaluations on training-test embedding models are evaluated qualitatively in terms data provide efficiency measures for a specific of how adequate they are in relation to the capabilities of implementation but do not explicitly give insights on the a Derridian Embedding. factors causing the existing efficiency (or the lack there of). We henceforth present a deconstructive review of 1. INTRODUCTION contemporary word embeddings using available literature to clarify certain misconceptions and inconsistencies Saussure, in the Course in General Linguistics, concerning them. argued that there is no substance in language and that all language consists of differences. In language there are only forms, not substances, and by that he meant that all 1.1 DECONSTRUCTIVE APPROACH apparently substantive units of language are generated by other things that lie outside them, but these external Derrida, a post-structualist French philosopher, characteristics are actually internal to their make-up.
    [Show full text]
  • Vector Space Models for Words and Documents Statistical Natural Language Processing ELEC-E5550 Jan 30, 2019 Tiina Lindh-Knuutila D.Sc
    Vector space models for words and documents Statistical Natural Language Processing ELEC-E5550 Jan 30, 2019 Tiina Lindh-Knuutila D.Sc. (Tech) Lingsoft Language Services & Aalto University tiina.lindh-knuutila -at- aalto dot fi Material also by Mari-Sanna Paukkeri (mari-sanna.paukkeri -at- utopiaanalytics dot com) Today’s Agenda • Vector space models • word-document matrices • word vectors • stemming, weighting, dimensionality reduction • similarity measures • Count models vs. predictive models • Word2vec • Information retrieval (Briefly) • Course project details You shall know the word by the company it keeps • Language is symbolic in nature • Surface form is in an arbitrary relation with the meaning of the word • Hat vs. cat • One substitution: Levenshtein distance of 1 • Does not measure the semantic similarity of the words • Distributional semantics • Linguistic items which appear in similar contexts in large samples of language data tend to have similar meanings Firth, John R. 1957. A synopsis of linguistic theory 1930–1955. In Studies in linguistic analysis, 1–32. Oxford: Blackwell. George Miller and Walter Charles. 1991. Contextual correlates of semantic similarity. Language and Cognitive Processes, 6(1):1–28. Vector space models (VSM) • The use of a high-dimensional space of documents (or words) • Closeness in the vector space resembles closeness in the semantics or structure of the documents (depending on the features extracted). • Makes the use of data mining possible • Applications: – Document clustering/classification/… • Finding similar documents • Finding similar words – Word disambiguation – Information retrieval • Term discrimination: ranking keywords in the order of usefulness Vector space models (VSM) • Steps to build a vector space model 1. Preprocessing 2.
    [Show full text]
  • Word Embeddings: History & Behind the Scene
    Word Embeddings: History & Behind the Scene Alfan F. Wicaksono Information Retrieval Lab. Faculty of Computer Science Universitas Indonesia References • Bengio, Y., Ducharme, R., Vincent, P., & Janvin, C. (2003). A Neural Probabilistic Language Model. The Journal of Machine Learning Research, 3, 1137–1155. • Mikolov, T., Corrado, G., Chen, K., & Dean, J. (2013). Efficient Estimation of Word Representations in Vector Space. Proceedings of the International Conference on Learning Representations (ICLR 2013), 1–12 • Mikolov, T., Chen, K., Corrado, G., & Dean, J. (2013). Distributed Representations of Words and Phrases and their Compositionality. NIPS, 1–9. • Morin, F., & Bengio, Y. (2005). Hierarchical Probabilistic Neural Network Language Model. Aistats, 5. References Good weblogs for high-level understanding: • http://sebastianruder.com/word-embeddings-1/ • Sebastian Ruder. On word embeddings - Part 2: Approximating the Softmax. http://sebastianruder.com/word- embeddings-softmax • https://www.tensorflow.org/tutorials/word2vec • https://www.gavagai.se/blog/2015/09/30/a-brief-history-of- word-embeddings/ Some slides were also borrowed from From Dan Jurafsky’s course slide: Word Meaning and Similarity. Stanford University. Terminology • The term “Word Embedding” came from deep learning community • For computational linguistic community, they prefer “Distributional Semantic Model” • Other terms: – Distributed Representation – Semantic Vector Space – Word Space https://www.gavagai.se/blog/2015/09/30/a-brief-history-of-word-embeddings/ Before we learn Word Embeddings... Semantic Similarity • Word Similarity – Near-synonyms – “boat” and “ship”, “car” and “bicycle” • Word Relatedness – Can be related any way – Similar: “boat” and “ship” – Topical Similarity: • “boat” and “water” • “car” and “gasoline” Why Word Similarity? • Document Classification • Document Clustering • Language Modeling • Information Retrieval • ..
    [Show full text]
  • UNIVERSITY of CALIFORNIA, SAN DIEGO Bag-Of-Concepts As a Movie
    UNIVERSITY OF CALIFORNIA, SAN DIEGO Bag-of-Concepts as a Movie Genome and Representation A Thesis submitted in partial satisfaction of the requirements for the degree Master of Science in Computer Science by Colin Zhou Committee in charge: Professor Shlomo Dubnov, Chair Professor Sanjoy Dasgupta Professor Lawrence Saul 2016 The Thesis of Colin Zhou is approved, and it is acceptable in quality and form for publication on microfilm and electronically: Chair University of California, San Diego 2016 iii DEDICATION For Mom and Dad iv TABLE OF CONTENTS Signature Page........................................................................................................... iii Dedication.................................................................................................................. iv Table of Contents....................................................................................................... v List of Figures and Tables.......................................................................................... vi Abstract of the Thesis................................................................................................ vii Introduction................................................................................................................ 1 Chapter 1 Background............................................................................................... 3 1.1 Vector Space Models............................................................................... 3 1.1.1. Bag-of-Words........................................................................
    [Show full text]
  • Analysis of a Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for Information Retrieval
    BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES • Volume 12, No 1 Sofia • 2012 Analysis of a Vector Space Model, Latent Semantic Indexing and Formal Concept Analysis for Information Retrieval Ch. Aswani Kumar1, M. Radvansky2, J. Annapurna3 1School of Information Technology and Engineering, VIT University, Vellore, India 2VSB Technical University of Ostrava, Ostrava, Czech Republic 3School of Computing Science and Engineering, VIT University, Vellore, India Email: [email protected] Abstract: Latent Semantic Indexing (LSI), a variant of classical Vector Space Model (VSM), is an Information Retrieval (IR) model that attempts to capture the latent semantic relationship between the data items. Mathematical lattices, under the framework of Formal Concept Analysis (FCA), represent conceptual hierarchies in data and retrieve the information. However, both LSI and FCA use the data represented in the form of matrices. The objective of this paper is to systematically analyze VSM, LSI and FCA for the task of IR using standard and real life datasets. Keywords: Formal concept analysis, Information Retrieval, latent semantic indexing, vector space model. 1. Introduction Information Retrieval (IR) deals with the representation, storage, organization and access to information items. IR is highly iterative in human interactive process aimed at retrieving the documents that are related to users’ information needs. The human interaction consists in submitting information needed as a query, analyzing the ranked and retrieved documents, modifying the query and submitting iteratively until the actual documents related to the need are found or the search process is terminated by the user. Several techniques including a simple keyword to advanced NLP are available for developing IR systems.
    [Show full text]
  • Ontology Alignment Based on Word Embedding and Random Forest Classification
    Ontology alignment based on word embedding and random forest classification Ikechukwu Nkisi-Orji1[0000−0001−9734−9978], Nirmalie Wiratunga1, Stewart Massie1, Kit-Ying Hui1, and Rachel Heaven2 1 Robert Gordon University, Aberdeen, UK {i.o.nkisi-orji , n.wiratunga, s.massie, k.hui}@rgu.ac.uk 2 British Geological Survey, Nottingham, UK [email protected] Abstract. Ontology alignment is crucial for integrating heterogeneous data sources and forms an important component of the semantic web. Accordingly, several ontology alignment techniques have been proposed and used for discovering correspondences between the concepts (or enti- ties) of different ontologies. Most alignment techniques depend on string- based similarities which are unable to handle the vocabulary mismatch problem. Also, determining which similarity measures to use and how to effectively combine them in alignment systems are challenges that have persisted in this area. In this work, we introduce a random forest classifier approach for ontology alignment which relies on word embed- ding for determining a variety of semantic similarities features between concepts. Specifically, we combine string-based and semantic similarity measures to form feature vectors that are used by the classifier model to determine when concepts match. By harnessing background knowledge and relying on minimal information from the ontologies, our approach can handle knowledge-light ontological resources. It also eliminates the need for learning the aggregation weights of a composition of similarity measures. Experiments using Ontology Alignment Evaluation Initiative (OAEI) dataset and real-world ontologies highlight the utility of our approach and show that it can outperform state-of-the-art alignment systems. Keywords: Ontology alignment · Word embedding · Machine classifi- cation · Semantic web.
    [Show full text]
  • A Structured Vector Space Model for Word Meaning in Context
    A Structured Vector Space Model for Word Meaning in Context Katrin Erk Sebastian Pado´ Department of Linguistics Department of Linguistics University of Texas at Austin Stanford University [email protected] [email protected] Abstract all its possible usages (Landauer and Dumais, 1997; Lund and Burgess, 1996). Since the meaning of We address the task of computing vector space words can vary substantially between occurrences representations for the meaning of word oc- (e.g., for polysemous words), the next necessary step currences, which can vary widely according to context. This task is a crucial step towards a is to characterize the meaning of individual words in robust, vector-based compositional account of context. sentence meaning. We argue that existing mod- There have been several approaches in the liter- els for this task do not take syntactic structure ature (Smolensky, 1990; Schutze,¨ 1998; Kintsch, sufficiently into account. 2001; McDonald and Brew, 2004; Mitchell and La- We present a novel structured vector space pata, 2008) that compute meaning in context from model that addresses these issues by incorpo- lemma vectors. Most of these studies phrase the prob- rating the selectional preferences for words’ lem as one of vector composition: The meaning of a argument positions. This makes it possible to target occurrence a in context b is a single new vector integrate syntax into the computation of word c that is a function (for example, the centroid) of the meaning in context. In addition, the model per- forms at and above the state of the art for mod- vectors: c = a b.
    [Show full text]
  • Graph-Based Word Embedding Learning and Cross-Lingual Contextual Word Embedding Learning Zheng Zhang
    Explorations in Word Embeddings : graph-based word embedding learning and cross-lingual contextual word embedding learning Zheng Zhang To cite this version: Zheng Zhang. Explorations in Word Embeddings : graph-based word embedding learning and cross- lingual contextual word embedding learning. Computation and Language [cs.CL]. Université Paris Saclay (COmUE), 2019. English. NNT : 2019SACLS369. tel-02366013 HAL Id: tel-02366013 https://tel.archives-ouvertes.fr/tel-02366013 Submitted on 15 Nov 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Explorations in word embeddings: S369 graph-based word embedding learning SACL and cross-lingual contextual word 9 embedding learning : 201 NNT Thèse de doctorat de l'Université Paris-Saclay préparée à Université Paris-Sud École doctorale n°580 Sciences et technologies de l’information et de la communication (STIC) Spécialité de doctorat : Informatique Thèse présentée et soutenue à Orsay, le 18/10/2019, par Zheng Zhang Composition du Jury : François Yvon Senior Researcher, LIMSI-CNRS Président Mathieu Lafourcade Associate Professor, Université de Montpellier Rapporteur Emmanuel Morin Professor, Université de Nantes Rapporteur Armand Joulin Research Scientist, Facebook Artificial Intelligence Research Examinateur Pierre Zweigenbaum Senior Researcher, LIMSI-CNRS Directeur de thèse Yue Ma Associate Professor, Université Paris-Sud Co-encadrant Acknowledgements Word embedding learning is a fast-moving domain.
    [Show full text]