2013
DOI: 10.1504/ijwet.2013.055713
|View full text |Cite
|
Sign up to set email alerts
|

Worst-case complexity and empirical evaluation of artificial intelligence methods for unsupervised word sense disambiguation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
45
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(45 citation statements)
references
References 25 publications
0
45
0
Order By: Relevance
“…The most accurate techniques are supervised (Iacobacci et al, 2016), but they require annotated training data which is not always available. In order to overcome this limitation, some researchers have proposed various unsupervised or knowledgde-based WSD methods (Banerjee and Pedersen, 2002;Schwab et al, 2012;Nguyen and Ock, 2013;Schwab et al, 2013a;Schwab et al, 2013b;Chen et al, 2014;Agirre et al, 2014;Bhingardive et al, 2015). Since our approach is unsupervised and based on WordNet (Miller, 1995;Fellbaum, 1998), our focus is to present related work in the same direction.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The most accurate techniques are supervised (Iacobacci et al, 2016), but they require annotated training data which is not always available. In order to overcome this limitation, some researchers have proposed various unsupervised or knowledgde-based WSD methods (Banerjee and Pedersen, 2002;Schwab et al, 2012;Nguyen and Ock, 2013;Schwab et al, 2013a;Schwab et al, 2013b;Chen et al, 2014;Agirre et al, 2014;Bhingardive et al, 2015). Since our approach is unsupervised and based on WordNet (Miller, 1995;Fellbaum, 1998), our focus is to present related work in the same direction.…”
Section: Related Workmentioning
confidence: 99%
“…As we select a single context window at every possible location in a text, our algorithm becomes deterministic, obtaining the same global configuration for a given set of parameters and input document. Thus, our algorithm is not affected by random chance, unlike stochastic algorithms such as Ant Colony Optimization (Lafourcade and Guinand, 2010;Schwab et al, 2012;Schwab et al, 2013a).…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Schwab studies the influence of 3 unsupervised algorithms on word sense disambiguation, including genetic algorithm, simulated annealing algorithm and ant colony algorithm. Experiment results show that the performance of ant colony algorithm is better and a shorter time is needed [10]. Imamura combines active learning method with semisupervised learning method to train WSD classifier, in which pseudo negative examples and unlabeled examples are used [11].…”
Section: Introductionmentioning
confidence: 99%
“…Schwab applies three unsupervised stochastic algorithms to word sense disambiguation including genetic algorithms, simulated annealing algorithms and ant colony algorithms. At the same time, comparative experiments are conducted to evaluate these 3 algorithms' performances [11]. Huang gives a position-based algorithm in order to measure the context similarity, in which contextual words are assigned with positional weights.…”
Section: Introductionmentioning
confidence: 99%