• No results found

Using Graphs for Word Embedding with Enhanced Semantic Relations

N/A
N/A
Info
Download
Protected

Academic year: 2020

Share "Using Graphs for Word Embedding with Enhanced Semantic Relations"

Copied!
10
0
0

Loading.... (view fulltext now)

Download now ( 10 Page )

Full text

Loading

Figure

Table 1: Wikipedia dump statistic.
Table 3:datasets information, columns are the num-ber of classes in the dataset, number of samples in thetraining set and number of samples in the testing set,respectively.
Figure 4: Word ranking positions vs. word frequencies.
Figure 5: Accuracy ranking results for the best config-uration of the proposed algorithm and the competingbaselines

References

Download now ( PDF - 10 Page - 417.91 KB )

Related documents

An Enhanced Lesk Word Sense Disambiguation Algorithm through a Distributional Semantic Model

The overlap-based algorithms stem from the Lesk (1986) one, which inspired a whole family of meth- ods that exploit the number of common words in two sense definitions ( glosses )

Word Sense Induction & Disambiguation Using Hierarchical Random Graphs

For in- stance, in unsupervised WSD a number of methods (Widdows and Dorow, 2002; V´eronis, 2004; Agirre et al., 2006) have constructed word co-occurrence graphs for a target

Enhanced Steganographic Method using 3-bit Grayscale Arithmetic Texture Synthesizer

C: cipher text, which is an encrypted secret message using AES algorithm and streamed as 3-bit words, k: constant value to signify the embedded pixels.. T: number of left

Semantic Word Categorization using Feature Similarity based K Nearest Neighbor

In almost cases of applying machine learning algorithms to text mining texts, texts or words are encoded into numerical vectors.. In order to solve the problems in encoding