Unsupervised Morphological Expansion of Small Datasets for Improving Word Embeddings

Unsupervised Morphological Expansion of Small Datasets for Improving Word Embeddings

Syed Sarfaraz Akhtar*  Arihant Gupta*  Avijit Vajpayee*   
Arjit Srivastava  Manish Shrivastava
Language Technologies Research Center(LTRC)
Kohli Center On Intelligent Systems (KCIS)
International Institute of Information Technology Hyderabad (IIIT-H) - 500032
   arihant.gupta Language Technologies Research Center(LTRC)
Kohli Center On Intelligent Systems (KCIS)
International Institute of Information Technology Hyderabad (IIIT-H) - 500032
   arjit.srivastava}@research.iiit.ac.in Language Technologies Research Center(LTRC)
Kohli Center On Intelligent Systems (KCIS)
International Institute of Information Technology Hyderabad (IIIT-H) - 500032
Language Technologies Research Center(LTRC)
Kohli Center On Intelligent Systems (KCIS)
International Institute of Information Technology Hyderabad (IIIT-H) - 500032
Language Technologies Research Center(LTRC)
Kohli Center On Intelligent Systems (KCIS)
International Institute of Information Technology Hyderabad (IIIT-H) - 500032

We present a language independent, unsupervised method for building word embeddings using morphological expansion of text. Our model handles the problem of data sparsity and yields improved word embeddings by relying on training word embeddings on artificially generated sentences. We evaluate our method using small sized training sets on eleven test sets for the word similarity task across seven languages. Further, for English, we evaluated the impacts of our approach using a large training set on three standard test sets. Our method improved results across all languages.

Authors’ Instructions

1 Introduction

footnotetext: * These authors contributed equally to this work.

Word representations are being widely used to solve problems of various areas of natural language processing. These include but are not limited to dependency parsing  [15], named entity recognition  [18] and parsing  [17].

Word representations have been shown to contain syntactic as well as semantic regularities  [21]. Such regularities also extend to morphological relations (vector of “ran” is close to the vector resulting from the expression “walked - walk + run”).

The basis of our approach lies in morphological treatment of text before training word embeddings. In this paper, we present a method for learning word representations which, for training, take morphological regularities into consideration by generating artificial sentences. These sentences contain automatically learned morphological variants of words in the corpus. This harnesses morphology to reduce data sparsity by improving the training of low frequency words with the help of their more common morphological variants (as word embeddings train better on high frequency words).

We show that our method performs well on small datasets of seven languages with significant increase across all languages except Arabic (discussed in section 7). We further analyze the impact of our approach on a large training set of English. Our evaluations show that when being applied on large quantities of training data, this method is comparable to models trained on even much larger datasets.

The main contributions of this paper are:

  • We achieved results comparable to models trained on much larger data sets.

  • We are releasing Hin-WS235, a hindi word similarity dataset containing 235 word pairs.

2 Related Work

Mikolov et. al. [20] introduced the Skip-gram (SG) and the continuous bag-of-words (CBOW) models trained on untagged text. Both of them followed a single layered feedforward architecture. CBOW’s training algorithm relied on predicting the current word based on context and SG tried to predict the context using the current word. Mikolov et. al. [21] also showed the semantic and syntactic regularities found in these embeddings.

Pennington et. al. [8] introduced the GloVe (Global Vectors for Word Representations) model in which they analyzed the properties responsible for the morphological regularities in the earlier models. They combined the effects of local context window and global matrix factorization methods resulting in a global log-bilinear regression model. The proposed model out-performed SG and CBOW on standard test sets.

Word Representations, as learned by the above methods, deal with word as the basic unit and do not exploit the morphological relations present between words. However, these relations are present in the embeddings as regularities in the vector space  [21]. These are specially useful for words which are unseen or have a low frequency in the training set and are not trained well. Luong et. al. [14] and Botha and Blunsom [7] used Morfessor [13] for word segmentation and used a combination of morpheme and word level models. Both of these approaches handled rare and unseen words using their basic morpheme units. Luong et. al. [14] used morphological recursive neural networks (RNNs) for constructing representation for a word using its morphemes. Botha and Blunsom [7] used log-bilinear models for building and combining representations of morphemes for constructing representations of rare or unseen words. Luong et. al. [14] also introduced the Stanford Rare-Word Dataset which contains a large number of rare and morphologically complex words.

In contrast to Luong et. al. [14] and Botha and Blunsom [7] where an external morphological analyzer was used, Soricut and Och [16] induced morphological transformations in an unsupervised manner using SG (Skip-gram) word embeddings. These morphological transformations were represented as word pairs in the same embeddings space and they used simple vector arithmetic to calculate vectors for rare and unseen words. For example, for building the embedding for “nationalism”, they evaluated the expression “functionalism - function + nation”.

3 Datasets

For all the models trained in this paper, we have used the Skip-gram [20] algorithm. The dimensionality has been fixed at 500 with a minimum count of 5 along with negative sampling. These parameters are identical to the ones used by Soricut and Och [16] for the purpose of extracting morphological transformations (Though, they used their own implementation of Word2Vec). Data is pre-processed to replace digits and special characters to avoid sparsity.

As training set for English, we use the Wikipedia data [3]. Soricut and Och [16] and Luong et. al. [14] had used the same training corpus for their models. The cleaned corpus contains about 1 billion tokens. For German and French, we use News Crawl (Articles from 2010) released as a part of ACL 2014 Ninth Workshop on Statistical Machine Translation. For Arabic, Persian and Spanish, we used Wikipedia Monolingual Corpora(2014) which is licensed under ”Creative Commons Attribution-ShareAlike 4.0 International Public License”. For Hindi, we used HindMonocorp0.5 [1].

We use standard word-similarity datasets for testing. For English, we use Stanford English Rare-Word (RW) dataset [14], the WS353  [11] and the RG65 dataset  [6]. The Stanford Rare-Word dataset contains comparatively more rare words and morphological complexity than other datasets and is central to our experiments. For German, we use the Gur350 and ZG222 datasets  [22] and the German RG65 dataset. For French we use the French RG65  [2] dataset. For Spanish and Persian, we use Spanish-RG65 and Persian-RG65 test data-sets  [9].

For Hindi(having second highest number of native speakers in the world after Mandarin) we are releasing a similarity (Hin-WS235) dataset containing 235 word pairs. This data-set was created by manually translating and re-annotating the English WS353  [11] dataset. This dataset is crucial since its used for direct evaluation of word embeddings. This dataset will be helpful for future work on Hindi. Adhering to blind review policy, the link for the dataset will be provided in the final version of this paper.

For rest of the paper, we have calculated the Spearman (multiplied by 100) between human assigned similarity and cosine similarity of our word embeddings for the word-pairs.

4 Morphological Expansion

Since we are generating new sentences using morphology, morphological sets of words that should be replaced have to be constructed. A morphological set of a word contains its ”first cousins”. First cousins are pairs of words which are morphological forms of each other, are semantically similar and also one can be reached from the other by a transformation involving addition/removal/replacement either suffix or prefix. For example, ”nation” and ”national” are first cousins (addition), ”nationalism” and ”national” are first cousins (removal), ”nations” and ”national” are first cousins (replacement), but ”nation” and ”nationalism” are second cousins as they involve two transformation operations. We go about doing this by extracting morphological transformations in a manner similar to that of Soricut and Och [16] using Skip-Gram word embeddings trained on the text.

All the thresholds mentioned have been decided after empirical fine tuning. Even though our experiments were computationally optimized, time and space complexities also played a part in deciding our thresholds.

Figure 1: System Workflow

In order to learn initial representations of the words, we train word embeddings (word2vec) using the parameters described above on the training set. This model is referred to as SG (Skip-gram).

4.1 Morphological Transformations

Morphological transformations are word pairs representing morphological regularities present at large in the corpus. Following Soricut and Och’s [16] methodology, we extract representative candidate word pairs which exhibit same morphological behavior as at least ten other word pairs in the corpus. These candidates allow us to learn rules of morphological transformations which may not be linguistically perfect but capture orthographic regularities. We refer to the final morphological transformations extracted as “transformation rules”.

Regularity Set of Stems Regularity Type
ed reduc, unannounc, walk, … Suffix
ly on, unstab, respectab, … Suffix
un clear, dress, derstand, … Prefix
dis assemble, close, connect, … Prefix
Table 1: Examples of Regularities Sets

For extracting these transformation rules, we follow these steps:

  • Extract Regularities - Regularities sets (see Table 1) are the set of stems associated with each candidate prefix/suffix.

    Regularities Sets: We use a TRIE for the extraction of candidate suffixes/prefixes. We insert all the words of the training set into the TRIE and then extract candidate prefixes. A candidate prefix is one which has more than 10 children in the TRIE. For candidate suffixes, we follow the same procedure with the only change being that the TRIE is constructed with all the words reversed. The output of this step is a candidate prefix/suffix and a set of all its stems. We call this a regularities set. As can be surmised, a number of these sets may not be linguistically correct. Also, some of these may not be true regularities and might just be data artifacts.

  • Construct Transition Sets using these morpheme sets - Transitions sets (see Table 2) are the set of word pairs which follow the same syntactic transformation.

    Transition Sets: There are two types of transition sets. One of them involving a prefix/suffix going to null and the other is a transition in which we have to both add and delete characters to get one word from the other. We call them null transitions and cross transitions, respectively. For evaluating null transitions, we find the intersection of each regularities set with the vocabulary of the training set. For extracting cross transitions, we find the set intersection between regularities sets. Since this leads to a large number of combinations, we evaluate only those cross sets in which both the regularities sets are large (a frequency greater than or equal to 500 for small training sets and 30000 for large training sets were used for our experiments). For both the null and cross transitions, we evaluate only those sets whose sizes are greater than 10. Also, we down-sample the transition sets thus generated to 1000 for time optimization.

    Transition Set of Words Regularity
    null, ed succeed, seem,.. Suffix
    null, ing read, poison,.. Suffix
    ed, ing viewed, documented,.. Suffix
    able,null sustainable, reasonable,.. Suffix
    null, un acceptably, accounted,.. Prefix
    Table 2: Examples of Transition Sets
  • Extract Transformation Rules from these transition sets - Transformation rules (see Table 3) capture word pairs which are morphologically similar (belong to same transition sets) apart from being syntactically similar according to initial word embeddings learned in SG.

    Transformation Rules: For a word pair to be considered as a part of the transformation rules, both of its words should be frequent; a frequency threshold of 500 for small training sets and 1000 for large training set. This ensures that both the words of the pair are trained well.

    For every transition set, we find out which pair represents the maximum number of word pairs (the cosine similarity of their vector differences is above a threshold: 0.15 for prefix rules and 0.25 for suffix rules). If the count is greater than 10, we make it a transformation rule and remove it along with the other word pairs it represents from the transition set (because we want a limited number of morphological transformations representing similar morphological regularities). We then recursively follow the said technique for the transition set until we stop getting transformation rules from it. This approach results in multiple transformation rules from the same transition set. We see that it is needed because different forms of same transition exist (walk-walks, invention-inventions, object-objects - both verbs and nouns in this case).

    Word Pair Regularity Type
    side, beside Prefix
    eighty, eight Suffix
    transmitted, transmit Suffix
    cinematic, cinema Suffix
    reminder, remind Suffix
    after, afterward Suffix
    Table 3: Examples of Transformation Rules

We observed that there were more impurities in words of smaller length. They were not removed at the time of extraction of transformation rules because these words are large in number. In this step, those rules in which either or both of the words have a length of less than or equal to three are eliminated. We also know that words which are morphological forms of each other have similar word embeddings and our aim is to create new sentences similar to the original sentence, so, we used a cosine similarity threshold of 0.1 for filtering the transformation rules.

4.2 Morphological Sets

A morphological set (see Table 4) of a word is a collection of all morphological forms we detect. For words with frequency more than a threshold (100 for small and 1000 for large training sets were used in our experiments) and length greater than three, we attempt to construct morphological sets. We apply all the transformation rules on the word. For every resultant word with frequency more than or equal to 5 (hence has a trained word embedding in SG), we check if it is similar to the original word (cosine similarity greater than 0.15) and add it to the set.

Word Morphological Set
comically comical, comic
hanging hang, overhanging, rehanging, hangings
woody non-woody
localized unlocalized, localize, non-localized, local
cityhood city
trawling trawl
Table 4: Examples of Morphological sets of some words

Now, we proceed to evaluating the morphological set. There may be many issues with the morphological set, homo-morphs being one. A homo-morph is a word which has more than one meaning. An example of a homo-morph is the word “state” with its morph set {stately, state-hood, stated, re-stated}. We observe that using cosine similarity, we are able to eliminate such sets as they can be broken up into more than one subsets ({stately, state-hood}, {stated,re-stated}) whose words are not similar to each other. We select another random word from the set and assure that its cosine similarity with every word in the morph set is more than 0.15. This technique also removes morphologically unrelated words sharing a common prefix/suffix that may have crept in. For example, the word “define” has {definition, defined, fine} as its morph set. We found that large morph sets usually contained more impurities. As we had only applied a single level of transformation for extracting these sets, we discard those sets whose size is greater than 6.

4.3 Text Expansion

Now that we have an approximation of word similarities based on morphology, we would like to use this information to learn better word embeddings. We know that rare words’ embeddings are not learned well due to lack of context. Based on words’ morphological similarities we would want to overcome this shortfall by training embeddings on corpus augmented with artificially generated sentences. We want to generate new sentences using the morphological sets that we have generated. However, a brute force approach results in combinatorial explosion with a single sentence expanding to thousands of sentences. Therefore, we use a random function to choose which sentences to generate to prevent bias towards any specific morphological form.

In this step, for each sentence in the training set, we attempt to create a maximum of one new sentence using a random function and morphological sets. For each word in the sentence, if that word has a morphological set, we choose with 50 percent probability to replace that word with a random word from its morph set. If the sentence thus generated is different from the original sentence, it becomes a part of our new training set upon which we train word embeddings in the next step.
In model SG + 2-Exp, we try to generate a maximum of two sentences from each sentence and a maximum of three new sentences in 3-Exp. Shown below is a sample sentence of the original text.

Maintenance is necessary for a software product to be successful

Now in expanded text (Exp).

Maintenance is necessary for a software product to be successful
High-Maintenance is necessary for a software production to be successful

In expanded text (2-Exp).

Maintenance is necessary for a software product to be successful
Maintenance is unnecessary for a software product to be successful
Maintenance is necessary for a software production to be unsuccessful

In expanded text (3-Exp).

Maintenance is necessary for a software product to be successful
Self-Maintenance is unnecessary for a software product to be successful
Maintenance is unnecessary for a software production to be unsuccessful
High-Maintenance is necessary for a software production to be successful

We observe ”necessary” and ”successful” were replaced by their negation forms. This happened because their word vectors are similar which is due to the fact that they are often used interchangeably in natural language.

4.4 Word Embeddings on Expanded Text (SG+Exp)

We train word embeddings on the expanded text to train a new model. We will call this model SG + Exp (Skip-gram + Expansion). For exploring the effects of this method, we also train models SG + 2-Exp and SG + 3-Exp on the large dataset of English. For all the models tested, we have initialized vectors of unseen words with zero vectors.

Language Size SG OOV SG+EXP OOV
Hindi 34M 50.3 0 56.8 0
Arabic 34M 46.17 9 46.12 6
Persian 43M 20.5 15 22.7 15
Spanish 44M 61 4 73.1 0
DE Gur 44M 38.8 54 47.5 32
DE RG 44M 14.7 1 28.2 0
DE ZG 44M 22 74 27.8 55
French 39M 48.2 3 61.4 2
EN WS 53M 71.6 0 74.1 0
EN RG 53M 64.5 0 71.3 0
EN RW 53M 18.7 719 22 255
Table 5: Small training samples (Spearman ). OOV represents Out of Vocabulary words encountered while testing.
Language Size SG OOV SO [16] Size (SO)
Hindi 0.75b 61 0 - -
Arabic 63M 48.3 4 43.1 0.45b
Persian 59M 22.1 15 - -
Spanish 0.45b 82.5 0 47.3 0.56b
DE Gur 0.5b 57.1 23 64.1 1.2b
DE RG 0.5b 67.1 1 - -
DE ZG 0.5b 28.1 38 21.5 1.2b
French 0.2b 64.6 1 67.3 1.5b
EN WS 1b 74.4 0 71.2 1.1b
EN RG 1b 77.9 0 75.1 1.1b
EN RW 1b 42.1 66 41.8 1.1b
Table 6: Large training samples (Spearman ). SO[16] and Size (SO) represents scores of  [16] and size of datasets used respectively. These scores act as reference for our scores on small training samples.
System RW WS RG
SG 42.1 74.4 77.9
SG + Exp 45.6 73.8 80.4
SG + 2-Exp 45.9 72.9 80.3
SG + 3-Exp 45.3 71.3 78.3
Table 7: Trained on 1B tokens(English) - Comparison between different degrees of expansion (Spearman )

Table 8 gives an insight into the effectiveness of the proposed method. We see that the words “censorship” and its rarer morphological variant “censorships” have very low similarity score and the similar words for “censorships” are also not very informative. By training new embeddings on the expanded corpus we find that not only does the similarity score increase but the other moprhological variants also come closer to the word.

Model Sim Closest to “censorships”
SG 0.43 POVs, normies
SG + Exp 0.87 censorship, self-censorship
Table 8: Comparison between SG and SG + Exp regarding word pair censorship,censorships

5 Handling Rare and Unseen Words

Since we assume rare words – frequency lower than a threshold, have unreliable word embeddings, in this section, we explain how we build word embeddings of rare and unseen words at the time of evaluation using the transformation rules. Our approach relies on the regularities illustrated by Mikolov et. al. [21] which were used successfully by Soricut and Och [16].

System RW WS RG
SG + Morph 45.1 74.4 77.9
SG + Exp + Morph 47.9 73.8 80.4
SG + 2-Exp + Morph 47.6 72.9 80.3
SG + 3-Exp + Morph 46.8 71.3 78.3
Table 9: Tranined on 1B tokens(English) - Comparison between different systems after Morph step (Spearman ). Note that the scores on WS and RG are unchanged because the frequencies of all the words are above the threshold

In our experiments, we classify a word as rare if its frequency is less than 20. For building word embeddings for such words, we first find a reliable base word using Algorithm  1, from which rare word can be generated after successive application of transformation rule vectors.

1:procedure Explore Level(curWords)
3:     for each word  do
4:         for each rule  do
7:     return
9:procedure Find Reliable Base(rareWord)
11:     for level  do
15:         if  then
16:              return               
Algorithm 1 Find Reliable Base Word

Our algorithm uses level order search, and returns us the most reliable base word (if any) along with the transformation rules required to generate our rare word from the base word.

We increase our reliability threshold (Reliable) as the search level increases. This is done to because application of multiple transformation rules generally results in more errors. If even after searching for three levels we do not get our embedding, we use the embedding of the word itself if its present in the model (even though its probably poorly trained). In case the word is not present in the model, we try the above mentioned technique of level order search after capitalisation, followed by the lower case form of the word.

If we still do not have any embedding of the word, we recursively remove characters from the beginning and end of the word and generate all words with a frequency greater than 50 and a length greater than 3 (as the probability of error increases with small lengths) . We use the embedding of the word with the maximum length and use frequency in case of a tie. The same technique is applied on after capitalization and then the lowercase version of the word in case we do not get any embedding.

If we fail to get any embedding, we assign it a zero vector. This step is referred to as “Morph”. The system SG + Morph indicates that we have handled rare and unknown words using transformation rules when evaluating the model SG.

System Size RW WS RG
LSM13 [14] 1B 34.4 64.6 65.5
Glove [8] 6B 38.1 65.8 77.8
Glove [8] 42B 47.8 75.9 82.9
SO15 [16] w/o M 1.1B 35.8 71.2 75.1
SO15 [16] w/ M 1.1B 41.8 71.2 75.1
LTM16 [12] 0.3B 47.1 - -
SG 1B 42.1 74.4 77.9
SG + Morph 1B 45.1 74.4 77.9
SG + Exp 1B 45.6 73.8 80.4
SG + Exp + Morph 1B 47.9 73.8 80.4

6 Result and Analysis

The method seems to perform well on small datasets with an increase in accuracy on all datasets across all languages - English, German, French, Spanish, Persian and Hindi. Morphologically richer languages show more increase with respect to others. (see Table 5).

We see that the embeddings trained on a large dataset also tackles the data sparsity present in them (in the form of low frequency words). This is seen by the increase in the accuracies of RW and RG datasets which contain more low frequency words.

After analyzing these three datasets, we compute their rarity which is the average of the frequencies of the rarer word of the pair. The order of rarity of the datasets is RW(2253) RG(6505) WS(34152). The order helps in explaining the observation in terms of better word embeddings for low frequency words. For RW dataset, accuracy increases on expansion and the highest accuracy is found on SG + 2-Exp; for RG dataset, accuracy increases on expansion and the highest is found on SG + Exp. While for the WS dataset, accuracy decreases with any expansion.

We observe that the accuracy of SG + Exp + Morph SG + 2-Exp + Morph (see Table 9) on RW dataset even though the accuracy of SG + 2-Exp SG + Exp (see Table 9). This happens because of decrease in analogical regularities as more artificial sentences are introduced.

7 Conclusion and Future Work

Our method successfully exploits morphological regularities to produce high quality of word embeddings. Evaluations show that the method may be used to deal with the problem of data sparsity across different languages, the effect is particularly noticeable for morphologically rich languages. Our results are comparable to the ones presented earlier [8] which was trained on a much larger dataset (42 billion tokens) compared to a much smaller training data (1 billion tokens) used in this method.

While synthesizing artificial sentences, a lot of sentences generated were grammatically incorrect. But since our initial word embeddings were poorly trained due to lack of data, these grammatically incorrect sentences do help in improving corresponding word embeddings since their main purpose is to provide more training samples, or artificial data for word2vec to train on. We will further explore how this artificially generated data might help us in other linguistic tasks, but for languages that are computationally poor, it helped in improving their word embeddings. We also evaluated our approach on languages that are resource rich, and as expected, word embeddings were affected negatively by our artificial sentences because initial word embeddings were already well trained. For languages that are resource rich, we will apply techniques like HMM or doc2vec on synthesized sentences to keep only those which are correct to a certain degree and study their impact on the word embeddings.

As expected, the results for Arabic show the inherent complex nature of the language and can be accounted to the method being unable to reconcile infixes as opposed to suffixes and prefixes resulting in incorrect morphological sets. Future work will be directed towards generating transformations which involve changes inside the word (apart from just changes to starting and endings)


  • [1] Bojar, Ondřej and Diatka, Vojtěch and Rychlý, Pavel and Straňák, Pavel and Suchomel, Vít and Tamchyna, Aleš and Zeman, Daniel 2014. HindMonoCorp 0.5. LINDAT/CLARIN digital library at the Institute of Formal and Applied Linguistics, Charles University in Prague.
  • [2] Colette Joubarne and Diana Inkpen. 2011. Comparison of semantic similarity for different languages using the Google n-gram corpus and second-order co-occurrence measures. In Advances in Artificial Intelligence - 24th Canadian Conference on Artificial Intelligence, pages 216-221.
  • [3] Cyrus Shaoul and Chris Westbury. 2010. The Westbury lab Wikipedia corpus. In Edmonton, AB: University of Alberta.
  • [4] Fabrizio Sebastiani. 2002. Machine learning in automated text categorization. ACM Computing Surveys (CSUR), volume 34, pages 1-47.
  • [5] Fei Huang, Arun Ahuja, Doug Downey, Yi Yang, Yuhong Guo, and Alexander Yates. 2014. Learning representations for weakly supervised natural language processing tasks. Computational Linguistics, volume 40, number 1, pages 85-120.
  • [6] Herbert Rubenstein and John B. Goodenough. 2006. Contextual correlates of synonym. Communications of the ACM, volume 8, number 10, pages 627-633.
  • [7] Jan A. Botha and Phil Blunsom. 2014. Compositional Morphology for Word Representations and Language Modelling. In ICML, pages 1899-1907
  • [8] Jeffrey Pennington, Richard Socher and Christopher D. Manning. 2014. GloVe: Global Vectors for Word Representation. In EMNLP, volume 14, pages 1532-43.
  • [9] José Camacho-Collados, Mohammad Taher Pilehvar and Roberto Navigli 2015. A Framework for the Construction of Monolingual and Cross-lingual Word Similarity Datasets. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics (ACL 2015), Beijing, China, July 27-29, 2015.
  • [10] Joseph Turian, Lev-Arie Ratinov, and Yoshua Bengio. 2010. Word representations: A simple and general method for semi-supervised learning. In Proceedings of ACL.
  • [11] Lev Finkelstein, Evgeniy Gabrilovich, Yossi Matias, Ehud Rivlin, Zach Solan, Gadi Wolfman and Eytan Ruppin. 2002. Placing search in context: The concept revisited. Proceedings of the 10th international conference on World Wide Web, pages 406-414.
  • [12] Luong, Minh-Thang, and Christopher D. Manning. 2016. Achieving open vocabulary neural machine translation with hybrid word-character models. arXiv preprint arXiv:1604.00788.
  • [13] Mathias Creutz and Krista Lagu. 2007. Unsupervised models for morpheme segmentation and morphology learning. In ACM Transactions on Speech and Language Processing (TSLP), version 4, number 1, page 3
  • [14] Minh-Thang Luong, Richard Socher and Christopher D. Manning. 2013. Better Word Representations with Recursive Neural Networks for Morphology. In CoNLL. Pages 104-113.
  • [15] Mohit Bansal, Kevin Gimpel, and Karen Livescu. 2014. Tailoring continuous word representations for dependency parsing. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, ACL 2014, June 22-27, Baltimore, MD, USA, Volume 2: Short Papers, pages 809–815.
  • [16] Radu Soricut and Franz Och. 2015. Unsupervised Morphology Induction using Word Embeddings. In Proceedings of NAACL.
  • [17] Richard Socher, John Bauer, Christopher D. Manning, and Andrew Y. Ng. 2013. Parsing With Compositional Vector Grammars. In ACL, pages 455-465.
  • [18] Scott Miller, Jethran Guinness, and Alex Zamanian. 2004. Name tagging with word clusters and discriminative training. In Proceedings of HLT-NAACL, volume 4, pages 337-342.
  • [19] Stefanie Tellex, Boris Katz, Jimmy Lin, Aaron Fernandes, and Gregory Marton. 2003. Quantitative evaluation of passage retrieval algorithms for question answering. In Proceedings of the 26th annual international ACM SIGIR conference on Research and development in information retrieval, pages 41-47.
  • [20] Tomas Mikolov, Kai Chen, Greg Corrado, and Jeff Dean. 2006. Efficient estimation of word representations in vector space. In In arXiv preprint arXiv:1301.3781
  • [21] Tomas Mikolov, Wen-tau Yih, and Geoffrey Zweig. 2013. Linguistic regularities in continuous space word representations. In Proceedings of HLT-NAACL, volume 13, pages 746-751.
  • [22] Torsten Zesch and Iryna Gurevyc. 2006. Automatically creating datasets for measures of semantic relatedness. In Proceedings of the Workshop on Linguistic Distances, pages 16-24.
Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
Add comment
Loading ...
This is a comment super asjknd jkasnjk adsnkj
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test description