SlideShare a Scribd company logo
1 of 7
Download to read offline
Jan Zizka et al. (Eds) : ICAITA, SAI, CDKP, Signal, NCO - 2015
pp. 11–17, 2015. © CS & IT-CSCP 2015 DOI : 10.5121/csit.2015.51502
ANALYSIS OF LEXICO-SYNTACTIC
PATTERNS FOR ANTONYM PAIR
EXTRACTION FROM A TURKISH CORPUS
Gürkan Şahin1
, Banu Diri1
and Tuğba Yıldız2
1
Faculty of Electrical-Electronic, Department of Computer Engineering
Yıdız Technical University, stanbul, Turkey
{gurkans,banu}@ce.yildiz.edu.tr
2
Faculty of Engineering and Natural Sciences,
Department of Computer Engineering
stanbul Bilgi University, stanbul, Turkey
tdalyan@bilgi.edu.tr
ABSTRACT
Extraction of semantic relations from various sources such as corpus, web pages, dictionary
definitions etc. is one of the most important issue in study of Natural Language Processing
(NLP). Various methods have been used to extract semantic relation from various sources.
Pattern-based approach is one of the most popular method among them. In this study, we
propose a model to extract antonym pairs from Turkish corpus automatically. Using a set of
seeds, we automatically extract lexico-syntactic patterns (LSPs) for antonym relation from
corpus. Reliability score is calculated for each pattern. The most reliable patterns are used to
generate new antonym pairs. Study conduct on only adjective-adjective and noun-noun pairs.
Noun and adjective target words are used to measure success of method and candidate
antonyms are generated using reliable patterns. For each antonym pair consisting of candidate
antonym and target word, antonym score is calculated. Pairs that have a certain score are
assigned to antonym pair. The proposed method shows good performance with 77.2% average
accuracy.
KEYWORDS
Natural Language Processing, Semantic relations, Antonym, Pattern-based approach
1. INTRODUCTION
Extraction of semantic relation pairs from corpus is one of the most popular topic in NLP.
Hyponymy, hypernymy, meronymy, holonymy, synonymy, antonymy etc. can be given to
example of semantic relations.
Several resources are used to acquire semantic relations. WordNet [1] is the one of the important
sources for semantic relations. WordNet is a lexical database for English and consists of so many
words and links among these words. Since each word is represented as synonym words called
12 Computer Science & Information Technology (CS & IT)
synsets in WordNet, it can be said that main relations of WordNet is synonymy. Apart from
synonymy relation, words are connected each other via semantic relation links like hyponymy,
hypernymy, meronymy, holonymy, antonymy etc. Words are collected under four different titles
as noun, adjective, verb, adverb, respectively in WordNet.
One of the most important semantic relation in WordNet is antonymy. Antonymy represents
contrast sense between two words. In fact, there is no exactly consensus on the definition of the
antonymy. According to domain experts, some pairs like good-bad, hot-cold etc. represent good
antonymy relation, but some pairs like north-south, woman-man do not exactly represent
antonymy. This makes difficult to detect opposite pairs. In addition, studies have shown that
synonym and antonym words occur with similar context words. This case also reveals difficulty
of distinguishing antonyms from synonyms.
In this study, we propose a pattern-based model to extract antonym pairs from Turkish corpus.
Only lexico syntactic patterns are used to find antonym pairs. Noun-noun and adjective-adjective
antonym initial seeds are prepared and antonym patterns are extracted using seeds. Patterns
having a reliable pattern score are selected to generate new antonym pairs from corpus.
The rest of this paper organized as follows: Section 2 presents related works. Extraction of
antonym patterns and extraction of new antonym pairs are explained in Section 3 and Section 4,
respectively. Finally, we present experimental results in Section 5.
2. RELATED WORKS
Patterns have been widely used to extract semantic relations from corpus. The most popular
pattern-based study was made by Hearst [2] in 1992. Hearst used some patterns like “such X as
Y” to extract hyponym words from corpus. In this pattern, X and Y represent hypernym and
hyponym words, respectively. After experiments, it has been shown that using some patterns,
hyponym words can be extracted from corpus with high accuracy.
Various studies have been conducted on extraction of antonym pairs. Lobanova (2010) [3]
prepared some adjective-adjective antonym initial pairs and generated antonym patterns
occurring with initial pairs from large Dutch corpus. Lobanova used generated antonym patterns
to extract new antonym pairs from corpus. This process repeated iteratively. At each iteration,
new antonym patterns were generated by using initial pairs and new antonym pairs were used to
extract new antonym patterns again. At each iteration, only reliable antonym pairs and patterns
were selected. Thus, sharp accuracy decreasing for generated antonym pairs was prevented.
Turney (2008) [4] used a corpus based supervised classification method to separate antonyms
from synonyms. Only patterns obtained from corpus were used as features. Co-occurrence
frequency between pair and pattern was used as a feature. Support Vector Machines (SVM) was
used as classification algorithm. To measure success of method, English as a second language
(ESL) questions were used and 75.0% classification accuracy was obtained for antonym pair
classification.
Lin (2003) [5] manually prepared some patterns like “from X to Y”, “either X or Y” to
discriminate synonyms from antonyms. It was observed that antonym pairs occur with these two
pattern very frequently but synonym pairs occur with these patterns rarely.
Computer Science & Information Technology (CS & IT) 13
Mohammad (2008) [6] developed an unsupervised method using degree of antonym to
discriminate antonym pairs. According to definition of degree of antonym, the more a pair has
antonym degree, the more the pair represents antonymy. Mohammad used corpus statistical
features and antonym dictionary category words together. Over test pairs 80.0% accuracy was
obtained for antonym pairs.
For Turkish, there are some studies to extract semantic relation pairs from corpus and dictionary
definitions [7], [8]. Hyponym-hypernym [9], [10], meronym-holonym [11] and synonym [12]
pairs have been automatically extracted from Turkish corpus. For hyponym-hypernym,
meronym-holonym and synonym pairs 83.0%, 75.0% and 80.3% accuracies were obtained,
respectively.
Although there are some studies about antonym pair extraction from Turkish dictionary
definitions, there is no study using Turkish corpus and antonym corpus patterns. Our main
motivation is that there is no such a corpus based study for Turkish before.
3. EXTRACTION OF ANTONYM PATTERNS FROM TURKISH CORPUS
LSPs are widely used to extract antonym relation pairs. In this study, antonym patterns are used
to extract antonym pairs. Therefore, we have to generate antonym patterns from corpus. To
extract Turkish antonym patterns, following processing steps are applied.
BOUN web corpus was used [13] as a source. The corpus consists of nearly 10 million
sentences and 500 million words (tokens). Firstly, we remove all punctuation and special
characters from corpus. Corpus is parsed morphologically by Zemberek Turkish NLP tool
[14] and each word in corpus is separated to root, root part-of-speech tag and suffixes. For a
given word, Zemberek generates multiple parsing results, but only first parsing result is used.
Because our corpus is too big, search process can take a long time. For fast search operations,
morphologically parsed corpus is indexed by Apache Lucene 4.2.0 searching tool [15] and
index file is used for all corpus search operations.
To find antonym patterns, we generate noun and adjective target words. Antonym equivalents
of target antonyms are extracted with using Turkish Antonym Dictionary [16]. 184 antonym
pairs called initial seeds are searched in corpus index file and sentences which contain initial
seeds are found. In related sentences, initial seeds are replaced with * (wildcard) character.
We select patterns having maximum two words between two * characters and others are
removed. Thus, we ignore unproductive special patterns.
Reliability score of each pattern is calculated. To calculate pattern reliability score, we used a
formula which is given in equation (1).
Rn =
୔
୘
(1)
In formula, Rn represents reliability score of pattern n. P is total co-occurrence frequency of
pattern n with initial seeds. T represents total co-occurrence frequency of pattern n with other
antonym pairs(other seeds) in corpus. Total co-occurrence frequency of pattern with initial seeds
is divided by total co-occurrence frequency of pattern with other seeds. Then, reliability score is
14 Computer Science & Information Technology (CS & IT)
calculated for each pattern. For example, if pattern X occurs with initial seeds 100 times and
occurs with other seeds 10.000 times in corpus, reliability score of X equals 100/10.000 = 0.01.
But the reliability score may be misleading. If pattern X occurs with initial seeds 7 times and
occurs with other seeds 10 times, reliability score equals 7/10 = 0.7. Although reliability score of
X is high, X occurs with initial seeds only 7 times. Because co-occurrence frequency of X with
initial seeds is too low, pattern X does not have any importance in terms of productivity and
generality. For this reason, we calculate reliability score for patterns occurring with initial seeds
more than 50 times and other patterns are ignored. To determine pattern reliability score, number
of different initial seeds occurring with a pattern is an important parameter. We can say that the
more different initial seeds occur with a pattern, the more the pattern is reliable. We assume that
pattern X occurs with initial seeds 100 times, but only occurs with 5 different initial seeds.
Likewise, pattern Y occurs with initial seeds 100 times, but occurs with 20 different initial seeds.
If total co-occurrence frequency of X and Y with other seeds equals 1000, reliability scores of
both patterns equal 100/1000 = 0.1. Although pattern reliability scores of X and Y equal each
other, Y pattern occurs with more different initial seeds than X. Hence the pattern Y is more
general and productive than X. To tackle this problem, pattern reliability score is calculated for
patterns occurring with more than 20 different initial seeds and other patterns are not assessed.
After calculating reliability score for each pattern according to two conditions given above, all
patterns are sorted according to reliability score. Patterns that have reliability score greater than
0.02 are selected to generate new antonym pairs from corpus. Reliable antonym patterns are
given in Table 1.
Table 1. Antonym patterns extracted from corpus using initial seeds
4. EXTRACTING NEW ANTONYM PAIRS USING PATTERNS
Using antonym patterns in Table 1, antonym equivalent words are extracted for a given target
word. Process steps of new antonym pair extraction are given below.
Computer Science & Information Technology (CS & IT) 15
Firstly, target words are determined and patterns generated by replacing target word with *
characters are searched in corpus. Words corresponding to * characters are extracted as
candidates of target word. Although reliable patterns are used, not antonym pairs can occur in
these patterns. For this reason, antonym equivalents of given a target word are defined as
candidates. In pattern structure, any antonym pairs can show two different sequence like X-Y
and Y-X. Thus, given a target word is searched in two different positions and words in
different * positions are recorded as candidates. For example, target word “iyi” (good) are
searched as;
Turkish patterns English equivalents
# iyi ve * arasındaki # between good and *
# * ve iyi arasındaki # between * and good
# ne iyi ne de * # neither good nor *
# ne * ne de iyi # neither * nor good
…
After extracting candidates of target word, antonym score is calculated for each pair
consisting of target and a candidate. Pairs having a certain antonym score are assigned to
antonym and others are eliminated.
To calculate antonym scores of pairs, we used Lobanova’s antonym score formula given in
equation (2) [17].
Px = 1 - ∏ ቀ1 −
େ୩
୘୩
ቁ
େ୩
୑
୬ୀଵ (2)
In formula, Px represents antonym score for pair x. M is number of reliable pattern and Ck is co-
occurrence frequency of pair x with pattern k. Tk represents co-occurrence frequency of pattern k
with other seeds in corpus.
5. EXPERIMENTAL RESULTS
To measure success of model, 196 noun and adjective target words are utilized. Target words
were searched together with reliable antonym patterns and candidates were extracted. For each
pair, antonym score was calculated. After observations, we defined minimum reliable antonym
score as 0.3. When the minimum reliable antonym score is defined less than 0.3, it is shown that
accuracy of the method falls sharply. For 45 out 196 target words, our method proposed reliable
antonym pairs with 77.2% average accuracy. Class of pairs were manually tagged by 3 Turkish
native speakers. 21 target words and candidates, english equivalents are given in Table 2.
16 Computer Science & Information Technology (CS & IT)
Table 2. Target words, candidates, antonym scores and pair classes
6. CONCLUSIONS
In this study, antonym pairs and patterns were automatically extracted from Turkish corpus.
Noun-noun and adjective-adjective seeds were created and antonym patterns were generated
using these seeds. After generating patterns from initial seeds, reliability score was calculated for
each antonym pattern. 11 patterns having reliability score greater than 0.02 were selected to
produce new antonym pairs. To measure accuracy of method, noun and adjective target words
were used as test words. Using these targets with antonym patterns, candidates were found for
each target words. For each antonym pair, antonym score was calculated. Pairs having antonym
score greater than 0.3 were assigned to antonym and others were eliminated. For 45 out 196
target words, our method proposed reliable antonym pairs with 77.2% average accuracy.
This study has been shown that Turkish antonym relation patterns can be extracted from corpus
easily using some manually created antonym seeds. Candidates also can be easily extracted for a
given target word with high accuracy with using reliable antonym patterns. Because patterns are
used to extract antonym pairs, high co-occurrence frequency of target with patterns in corpus
directly influences success of the method. This is a disadvantage for all of pattern-based methods.
Computer Science & Information Technology (CS & IT) 17
In further studies, we aim to use corpus statistical information with patterns. Thus, antonym pairs
occurring with patterns at low frequency can be extracted from corpus.
REFERENCES
[1] Christiane Fellbaum (1998, ed.) WordNet: An Electronic Lexical Database. Cambridge, MA: MIT
Press.
[2] Hearst, M.A.: Automatic Acquisition of Hyponyms from Large Text Corpora. In: 14th International
Conference on Computational Linguistics, COLING 1992, Nantes, France, pp. 539-545(1992)
[3] Lobanova, A., van der Kleij, T. and J. Spenader (2010). Defining antonymy: a corpus-based study of
opposites by lexico-syntactic patterns. In: International Journal of Lexicography. Vol 23: 19-53.
[4] Turney, P.D. (2008), A uniform approach to analogies, synonyms, antonyms, and associations,
Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008),
Manchester, UK, pp. 905-912.
[5] Dekang Lin, Shaojun Zhao, Lijuan Qin, and Ming Zhou. 2003. Identifying synonyms among
distributionally similar words. In Proceedings of IJCAI 2003. Acapulco, Mexico.
[6] Saif Mohammad, Bonnie Dorr, and Graeme Hirst. 2008. Computing word-pair antonymy. In
EMNLP, pages 982–991. Association for Computational Linguistics.
[7] Yazıcı, E. ve Amasyalı, M.F., (2011). Automatic Extraction of Semantic Relationships Using Turkish
Dictionary Definitions, EMO Bilimsel Dergi, stanbul.
[8] Zeynep Orhan, lknur Pehlivan , Volkan Uslan , Pınar Önder,Automated Extraction of Semantic
Word Relations in Turkish Lexicon, Journal of Mathematical And Computational Applications, 16, 1,
Jan. 2011, pp.13-22,
[9] Yildirim, S., Yildiz, T., (2012). “Corpus-Driven Hyponym Acquisition for Turkish Language”,
CICLing 13th International Conference on Intelligent Text Processig and Computational Linguistics,
2012.
[10] Şahin, G., Diri, B., Yıldız T., “Pattern and Semantic Similarity Based Automatic Extraction of
Hyponym-Hypernym Relation from Turkish Corpus”, 23th Signal Processing and Communications
Applications Conference, Malatya, Turkey, (16-19 May), 2015.
[11] Yıldız, T., Yıldırım, S., Diri, B., “Extraction of Part-Whole Relations from Turkish Corpora”,
Computational Linguistics and Intelligent Text Processing, CICLing, Greece, 2013.
[12] Yıldız, T., Yıldırım, S., Diri, B., “An Integrated Approach to Automatic Synonym Detection in
Turkish Corpus”, 9th International Conference on Natural Language Processing, PolTAL, Springer
LNAI proceedings, Warsaw, Poland, (17-19 September), 2014.
[13] Sak, H., Güngör, T. and Saraçlar. M., (2008). “Turkish Language Resources: Morphological Parser,
Morphological Disambiguator and Web Corpus”, The 6th International Conference on Natural
Language Processing, GOTAL 2008.
[14] http://zemberek-web.appspot.com/
[15] http://lucene.apache.org/core/
[16] http://tdk.gov.tr/
[17] Lobanova, A., van der Kleij, T. and J. Spenader (2010). Defining antonymy: a corpus-based study of
opposites by lexico-syntactic patterns. In: International Journal of Lexicography. Vol 23: 19-53.

More Related Content

What's hot

Possible Word Representation
Possible Word RepresentationPossible Word Representation
Possible Word Representationchauhankapil
 
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...Unsupervised Software-Specific Morphological Forms Inference from Informal Di...
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...Chunyang Chen
 
Word Segmentation and Lexical Normalization for Unsegmented Languages
Word Segmentation and Lexical Normalization for Unsegmented LanguagesWord Segmentation and Lexical Normalization for Unsegmented Languages
Word Segmentation and Lexical Normalization for Unsegmented Languageshs0041
 
Usage of regular expressions in nlp
Usage of regular expressions in nlpUsage of regular expressions in nlp
Usage of regular expressions in nlpeSAT Journals
 
Lecture 2: Computational Semantics
Lecture 2: Computational SemanticsLecture 2: Computational Semantics
Lecture 2: Computational SemanticsMarina Santini
 
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUE
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUECOMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUE
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUEJournal For Research
 
Anaphora resolution in hindi language using gazetteer method
Anaphora resolution in hindi language using gazetteer methodAnaphora resolution in hindi language using gazetteer method
Anaphora resolution in hindi language using gazetteer methodijcsa
 
Representation of syntax, semantics and Predicate logics
Representation of syntax, semantics and Predicate logicsRepresentation of syntax, semantics and Predicate logics
Representation of syntax, semantics and Predicate logicschauhankapil
 
Ontology Mapping
Ontology MappingOntology Mapping
Ontology Mappingsamhati27
 
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMS
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMSCOMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMS
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMSIJMIT JOURNAL
 
A deep analysis of Multi-word Expression and Machine Translation
A deep analysis of Multi-word Expression and Machine TranslationA deep analysis of Multi-word Expression and Machine Translation
A deep analysis of Multi-word Expression and Machine TranslationLifeng (Aaron) Han
 
Implementation Of Syntax Parser For English Language Using Grammar Rules
Implementation Of Syntax Parser For English Language Using Grammar RulesImplementation Of Syntax Parser For English Language Using Grammar Rules
Implementation Of Syntax Parser For English Language Using Grammar RulesIJERA Editor
 
Representing and Reasoning with Modular Ontologies (2007)
Representing and Reasoning with Modular Ontologies (2007)Representing and Reasoning with Modular Ontologies (2007)
Representing and Reasoning with Modular Ontologies (2007)Jie Bao
 
Ontology engineering: Ontology alignment
Ontology engineering: Ontology alignmentOntology engineering: Ontology alignment
Ontology engineering: Ontology alignmentGuus Schreiber
 

What's hot (20)

Possible Word Representation
Possible Word RepresentationPossible Word Representation
Possible Word Representation
 
Detecting Paraphrases in Marathi Language
Detecting Paraphrases in Marathi LanguageDetecting Paraphrases in Marathi Language
Detecting Paraphrases in Marathi Language
 
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...Unsupervised Software-Specific Morphological Forms Inference from Informal Di...
Unsupervised Software-Specific Morphological Forms Inference from Informal Di...
 
Interpreter
InterpreterInterpreter
Interpreter
 
Word Segmentation and Lexical Normalization for Unsegmented Languages
Word Segmentation and Lexical Normalization for Unsegmented LanguagesWord Segmentation and Lexical Normalization for Unsegmented Languages
Word Segmentation and Lexical Normalization for Unsegmented Languages
 
Usage of regular expressions in nlp
Usage of regular expressions in nlpUsage of regular expressions in nlp
Usage of regular expressions in nlp
 
Usage of regular expressions in nlp
Usage of regular expressions in nlpUsage of regular expressions in nlp
Usage of regular expressions in nlp
 
Lecture 2: Computational Semantics
Lecture 2: Computational SemanticsLecture 2: Computational Semantics
Lecture 2: Computational Semantics
 
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUE
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUECOMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUE
COMPREHENSIVE ANALYSIS OF NATURAL LANGUAGE PROCESSING TECHNIQUE
 
Anaphora resolution in hindi language using gazetteer method
Anaphora resolution in hindi language using gazetteer methodAnaphora resolution in hindi language using gazetteer method
Anaphora resolution in hindi language using gazetteer method
 
Representation of syntax, semantics and Predicate logics
Representation of syntax, semantics and Predicate logicsRepresentation of syntax, semantics and Predicate logics
Representation of syntax, semantics and Predicate logics
 
Ontology Mapping
Ontology MappingOntology Mapping
Ontology Mapping
 
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMS
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMSCOMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMS
COMPARATIVE ANALYSIS OF ARABIC STEMMING ALGORITHMS
 
Pxc3898474
Pxc3898474Pxc3898474
Pxc3898474
 
A deep analysis of Multi-word Expression and Machine Translation
A deep analysis of Multi-word Expression and Machine TranslationA deep analysis of Multi-word Expression and Machine Translation
A deep analysis of Multi-word Expression and Machine Translation
 
Implementation Of Syntax Parser For English Language Using Grammar Rules
Implementation Of Syntax Parser For English Language Using Grammar RulesImplementation Of Syntax Parser For English Language Using Grammar Rules
Implementation Of Syntax Parser For English Language Using Grammar Rules
 
Representing and Reasoning with Modular Ontologies (2007)
Representing and Reasoning with Modular Ontologies (2007)Representing and Reasoning with Modular Ontologies (2007)
Representing and Reasoning with Modular Ontologies (2007)
 
Ontology matching
Ontology matchingOntology matching
Ontology matching
 
Ontology engineering: Ontology alignment
Ontology engineering: Ontology alignmentOntology engineering: Ontology alignment
Ontology engineering: Ontology alignment
 
I1 geetha3 revathi
I1 geetha3 revathiI1 geetha3 revathi
I1 geetha3 revathi
 

Similar to ANALYSIS OF LEXICO-SYNTACTIC PATTERNS FOR ANTONYM PAIR EXTRACTION FROM A TURKISH CORPUS

IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATA
IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATAIDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATA
IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATAijistjournal
 
Automatic multiple choice question generation system for
Automatic multiple choice question generation system forAutomatic multiple choice question generation system for
Automatic multiple choice question generation system forAlexander Decker
 
Word sense disambiguation using wsd specific wordnet of polysemy words
Word sense disambiguation using wsd specific wordnet of polysemy wordsWord sense disambiguation using wsd specific wordnet of polysemy words
Word sense disambiguation using wsd specific wordnet of polysemy wordsijnlc
 
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...dannyijwest
 
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEY
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEYEXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEY
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEYijnlc
 
Paper id 25201466
Paper id 25201466Paper id 25201466
Paper id 25201466IJRAT
 
Introduction to development of lexical databases
Introduction to development of lexical databasesIntroduction to development of lexical databases
Introduction to development of lexical databasesMuhammad Shoaib Chaudhary
 
Phonetic Recognition In Words For Persian Text To Speech Systems
Phonetic Recognition In Words For Persian Text To Speech SystemsPhonetic Recognition In Words For Persian Text To Speech Systems
Phonetic Recognition In Words For Persian Text To Speech Systemspaperpublications3
 
DETECTING OXYMORON IN A SINGLE STATEMENT
DETECTING OXYMORON IN A SINGLE STATEMENTDETECTING OXYMORON IN A SINGLE STATEMENT
DETECTING OXYMORON IN A SINGLE STATEMENTWarNik Chow
 
PERSONAL IDENTITY MATCHING
PERSONAL IDENTITY MATCHINGPERSONAL IDENTITY MATCHING
PERSONAL IDENTITY MATCHINGcscpconf
 
Personal identity matching
Personal identity matchingPersonal identity matching
Personal identity matchingcsandit
 
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHDICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHcscpconf
 
Ijarcet vol-3-issue-1-9-11
Ijarcet vol-3-issue-1-9-11Ijarcet vol-3-issue-1-9-11
Ijarcet vol-3-issue-1-9-11Dhabal Sethi
 
AMBIGUITY-AWARE DOCUMENT SIMILARITY
AMBIGUITY-AWARE DOCUMENT SIMILARITYAMBIGUITY-AWARE DOCUMENT SIMILARITY
AMBIGUITY-AWARE DOCUMENT SIMILARITYijnlc
 
Dictionary based concept mining an application for turkish
Dictionary based concept mining  an application for turkishDictionary based concept mining  an application for turkish
Dictionary based concept mining an application for turkishcsandit
 
EXTRACTING ARABIC RELATIONS FROM THE WEB
EXTRACTING ARABIC RELATIONS FROM THE WEBEXTRACTING ARABIC RELATIONS FROM THE WEB
EXTRACTING ARABIC RELATIONS FROM THE WEBijcsit
 
Sentence analysis
Sentence analysisSentence analysis
Sentence analysiskrukob9
 
Hps a hierarchical persian stemming method
Hps a hierarchical persian stemming methodHps a hierarchical persian stemming method
Hps a hierarchical persian stemming methodijnlc
 

Similar to ANALYSIS OF LEXICO-SYNTACTIC PATTERNS FOR ANTONYM PAIR EXTRACTION FROM A TURKISH CORPUS (20)

IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATA
IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATAIDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATA
IDENTIFYING THE SEMANTIC RELATIONS ON UNSTRUCTURED DATA
 
Automatic multiple choice question generation system for
Automatic multiple choice question generation system forAutomatic multiple choice question generation system for
Automatic multiple choice question generation system for
 
Word sense disambiguation using wsd specific wordnet of polysemy words
Word sense disambiguation using wsd specific wordnet of polysemy wordsWord sense disambiguation using wsd specific wordnet of polysemy words
Word sense disambiguation using wsd specific wordnet of polysemy words
 
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...
Ontology Matching Based on hypernym, hyponym, holonym, and meronym Sets in Wo...
 
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEY
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEYEXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEY
EXTRACTION OF HYPONYMY, MERONYMY, AND ANTONYMY RELATION PAIRS: A BRIEF SURVEY
 
Paper id 25201466
Paper id 25201466Paper id 25201466
Paper id 25201466
 
Introduction to development of lexical databases
Introduction to development of lexical databasesIntroduction to development of lexical databases
Introduction to development of lexical databases
 
Phonetic Recognition In Words For Persian Text To Speech Systems
Phonetic Recognition In Words For Persian Text To Speech SystemsPhonetic Recognition In Words For Persian Text To Speech Systems
Phonetic Recognition In Words For Persian Text To Speech Systems
 
DETECTING OXYMORON IN A SINGLE STATEMENT
DETECTING OXYMORON IN A SINGLE STATEMENTDETECTING OXYMORON IN A SINGLE STATEMENT
DETECTING OXYMORON IN A SINGLE STATEMENT
 
PERSONAL IDENTITY MATCHING
PERSONAL IDENTITY MATCHINGPERSONAL IDENTITY MATCHING
PERSONAL IDENTITY MATCHING
 
Personal identity matching
Personal identity matchingPersonal identity matching
Personal identity matching
 
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISHDICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
DICTIONARY-BASED CONCEPT MINING: AN APPLICATION FOR TURKISH
 
Ny3424442448
Ny3424442448Ny3424442448
Ny3424442448
 
Ijarcet vol-3-issue-1-9-11
Ijarcet vol-3-issue-1-9-11Ijarcet vol-3-issue-1-9-11
Ijarcet vol-3-issue-1-9-11
 
Ceis 3
Ceis 3Ceis 3
Ceis 3
 
AMBIGUITY-AWARE DOCUMENT SIMILARITY
AMBIGUITY-AWARE DOCUMENT SIMILARITYAMBIGUITY-AWARE DOCUMENT SIMILARITY
AMBIGUITY-AWARE DOCUMENT SIMILARITY
 
Dictionary based concept mining an application for turkish
Dictionary based concept mining  an application for turkishDictionary based concept mining  an application for turkish
Dictionary based concept mining an application for turkish
 
EXTRACTING ARABIC RELATIONS FROM THE WEB
EXTRACTING ARABIC RELATIONS FROM THE WEBEXTRACTING ARABIC RELATIONS FROM THE WEB
EXTRACTING ARABIC RELATIONS FROM THE WEB
 
Sentence analysis
Sentence analysisSentence analysis
Sentence analysis
 
Hps a hierarchical persian stemming method
Hps a hierarchical persian stemming methodHps a hierarchical persian stemming method
Hps a hierarchical persian stemming method
 

More from cscpconf

ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
 
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
 
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
 
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIES
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIESPROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIES
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
 
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGIC
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICA SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGIC
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
 
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
 
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
 
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTIC
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICTWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTIC
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
 
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAIN
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINDETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAIN
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
 
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
 
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEM
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMIMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEM
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
 
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
 
AUTOMATED PENETRATION TESTING: AN OVERVIEW
AUTOMATED PENETRATION TESTING: AN OVERVIEWAUTOMATED PENETRATION TESTING: AN OVERVIEW
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
 
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORK
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKCLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORK
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
 
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
 
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATA
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAPROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATA
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
 
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCH
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHCHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCH
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
 
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
 
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGESOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
 
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXT
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTGENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXT
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
 

More from cscpconf (20)

ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR
 
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATION
 
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...
 
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIES
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIESPROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIES
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIES
 
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGIC
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICA SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGIC
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGIC
 
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS
 
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS
 
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTIC
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICTWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTIC
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTIC
 
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAIN
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINDETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAIN
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAIN
 
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...
 
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEM
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMIMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEM
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEM
 
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...
 
AUTOMATED PENETRATION TESTING: AN OVERVIEW
AUTOMATED PENETRATION TESTING: AN OVERVIEWAUTOMATED PENETRATION TESTING: AN OVERVIEW
AUTOMATED PENETRATION TESTING: AN OVERVIEW
 
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORK
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKCLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORK
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORK
 
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...
 
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATA
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAPROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATA
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATA
 
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCH
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHCHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCH
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCH
 
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...
 
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGESOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGE
 
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXT
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTGENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXT
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXT
 

Recently uploaded

Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationSafe Software
 
AI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsAI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsMemoori
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Enterprise Knowledge
 
Human Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR SystemsHuman Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR SystemsMark Billinghurst
 
Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Neo4j
 
Science&tech:THE INFORMATION AGE STS.pdf
Science&tech:THE INFORMATION AGE STS.pdfScience&tech:THE INFORMATION AGE STS.pdf
Science&tech:THE INFORMATION AGE STS.pdfjimielynbastida
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machinePadma Pradeep
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesSinan KOZAK
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraDeakin University
 
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 3652toLead Limited
 
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024BookNet Canada
 
Benefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksBenefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksSoftradix Technologies
 
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr LapshynFwdays
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubKalema Edgar
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Scott Keck-Warren
 
Bluetooth Controlled Car with Arduino.pdf
Bluetooth Controlled Car with Arduino.pdfBluetooth Controlled Car with Arduino.pdf
Bluetooth Controlled Car with Arduino.pdfngoud9212
 
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticsKotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticsAndrey Dotsenko
 

Recently uploaded (20)

Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry InnovationBeyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
Beyond Boundaries: Leveraging No-Code Solutions for Industry Innovation
 
AI as an Interface for Commercial Buildings
AI as an Interface for Commercial BuildingsAI as an Interface for Commercial Buildings
AI as an Interface for Commercial Buildings
 
The transition to renewables in India.pdf
The transition to renewables in India.pdfThe transition to renewables in India.pdf
The transition to renewables in India.pdf
 
Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024Designing IA for AI - Information Architecture Conference 2024
Designing IA for AI - Information Architecture Conference 2024
 
Human Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR SystemsHuman Factors of XR: Using Human Factors to Design XR Systems
Human Factors of XR: Using Human Factors to Design XR Systems
 
Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024Build your next Gen AI Breakthrough - April 2024
Build your next Gen AI Breakthrough - April 2024
 
Science&tech:THE INFORMATION AGE STS.pdf
Science&tech:THE INFORMATION AGE STS.pdfScience&tech:THE INFORMATION AGE STS.pdf
Science&tech:THE INFORMATION AGE STS.pdf
 
Install Stable Diffusion in windows machine
Install Stable Diffusion in windows machineInstall Stable Diffusion in windows machine
Install Stable Diffusion in windows machine
 
Unblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen FramesUnblocking The Main Thread Solving ANRs and Frozen Frames
Unblocking The Main Thread Solving ANRs and Frozen Frames
 
Artificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning eraArtificial intelligence in the post-deep learning era
Artificial intelligence in the post-deep learning era
 
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
Tech-Forward - Achieving Business Readiness For Copilot in Microsoft 365
 
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
#StandardsGoals for 2024: What’s new for BISAC - Tech Forum 2024
 
Benefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other FrameworksBenefits Of Flutter Compared To Other Frameworks
Benefits Of Flutter Compared To Other Frameworks
 
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
"Federated learning: out of reach no matter how close",Oleksandr Lapshyn
 
Unleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding ClubUnleash Your Potential - Namagunga Girls Coding Club
Unleash Your Potential - Namagunga Girls Coding Club
 
Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024Advanced Test Driven-Development @ php[tek] 2024
Advanced Test Driven-Development @ php[tek] 2024
 
Vulnerability_Management_GRC_by Sohang Sengupta.pptx
Vulnerability_Management_GRC_by Sohang Sengupta.pptxVulnerability_Management_GRC_by Sohang Sengupta.pptx
Vulnerability_Management_GRC_by Sohang Sengupta.pptx
 
Bluetooth Controlled Car with Arduino.pdf
Bluetooth Controlled Car with Arduino.pdfBluetooth Controlled Car with Arduino.pdf
Bluetooth Controlled Car with Arduino.pdf
 
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmaticsKotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
Kotlin Multiplatform & Compose Multiplatform - Starter kit for pragmatics
 
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort ServiceHot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
Hot Sexy call girls in Panjabi Bagh 🔝 9953056974 🔝 Delhi escort Service
 

ANALYSIS OF LEXICO-SYNTACTIC PATTERNS FOR ANTONYM PAIR EXTRACTION FROM A TURKISH CORPUS

  • 1. Jan Zizka et al. (Eds) : ICAITA, SAI, CDKP, Signal, NCO - 2015 pp. 11–17, 2015. © CS & IT-CSCP 2015 DOI : 10.5121/csit.2015.51502 ANALYSIS OF LEXICO-SYNTACTIC PATTERNS FOR ANTONYM PAIR EXTRACTION FROM A TURKISH CORPUS Gürkan Şahin1 , Banu Diri1 and Tuğba Yıldız2 1 Faculty of Electrical-Electronic, Department of Computer Engineering Yıdız Technical University, stanbul, Turkey {gurkans,banu}@ce.yildiz.edu.tr 2 Faculty of Engineering and Natural Sciences, Department of Computer Engineering stanbul Bilgi University, stanbul, Turkey tdalyan@bilgi.edu.tr ABSTRACT Extraction of semantic relations from various sources such as corpus, web pages, dictionary definitions etc. is one of the most important issue in study of Natural Language Processing (NLP). Various methods have been used to extract semantic relation from various sources. Pattern-based approach is one of the most popular method among them. In this study, we propose a model to extract antonym pairs from Turkish corpus automatically. Using a set of seeds, we automatically extract lexico-syntactic patterns (LSPs) for antonym relation from corpus. Reliability score is calculated for each pattern. The most reliable patterns are used to generate new antonym pairs. Study conduct on only adjective-adjective and noun-noun pairs. Noun and adjective target words are used to measure success of method and candidate antonyms are generated using reliable patterns. For each antonym pair consisting of candidate antonym and target word, antonym score is calculated. Pairs that have a certain score are assigned to antonym pair. The proposed method shows good performance with 77.2% average accuracy. KEYWORDS Natural Language Processing, Semantic relations, Antonym, Pattern-based approach 1. INTRODUCTION Extraction of semantic relation pairs from corpus is one of the most popular topic in NLP. Hyponymy, hypernymy, meronymy, holonymy, synonymy, antonymy etc. can be given to example of semantic relations. Several resources are used to acquire semantic relations. WordNet [1] is the one of the important sources for semantic relations. WordNet is a lexical database for English and consists of so many words and links among these words. Since each word is represented as synonym words called
  • 2. 12 Computer Science & Information Technology (CS & IT) synsets in WordNet, it can be said that main relations of WordNet is synonymy. Apart from synonymy relation, words are connected each other via semantic relation links like hyponymy, hypernymy, meronymy, holonymy, antonymy etc. Words are collected under four different titles as noun, adjective, verb, adverb, respectively in WordNet. One of the most important semantic relation in WordNet is antonymy. Antonymy represents contrast sense between two words. In fact, there is no exactly consensus on the definition of the antonymy. According to domain experts, some pairs like good-bad, hot-cold etc. represent good antonymy relation, but some pairs like north-south, woman-man do not exactly represent antonymy. This makes difficult to detect opposite pairs. In addition, studies have shown that synonym and antonym words occur with similar context words. This case also reveals difficulty of distinguishing antonyms from synonyms. In this study, we propose a pattern-based model to extract antonym pairs from Turkish corpus. Only lexico syntactic patterns are used to find antonym pairs. Noun-noun and adjective-adjective antonym initial seeds are prepared and antonym patterns are extracted using seeds. Patterns having a reliable pattern score are selected to generate new antonym pairs from corpus. The rest of this paper organized as follows: Section 2 presents related works. Extraction of antonym patterns and extraction of new antonym pairs are explained in Section 3 and Section 4, respectively. Finally, we present experimental results in Section 5. 2. RELATED WORKS Patterns have been widely used to extract semantic relations from corpus. The most popular pattern-based study was made by Hearst [2] in 1992. Hearst used some patterns like “such X as Y” to extract hyponym words from corpus. In this pattern, X and Y represent hypernym and hyponym words, respectively. After experiments, it has been shown that using some patterns, hyponym words can be extracted from corpus with high accuracy. Various studies have been conducted on extraction of antonym pairs. Lobanova (2010) [3] prepared some adjective-adjective antonym initial pairs and generated antonym patterns occurring with initial pairs from large Dutch corpus. Lobanova used generated antonym patterns to extract new antonym pairs from corpus. This process repeated iteratively. At each iteration, new antonym patterns were generated by using initial pairs and new antonym pairs were used to extract new antonym patterns again. At each iteration, only reliable antonym pairs and patterns were selected. Thus, sharp accuracy decreasing for generated antonym pairs was prevented. Turney (2008) [4] used a corpus based supervised classification method to separate antonyms from synonyms. Only patterns obtained from corpus were used as features. Co-occurrence frequency between pair and pattern was used as a feature. Support Vector Machines (SVM) was used as classification algorithm. To measure success of method, English as a second language (ESL) questions were used and 75.0% classification accuracy was obtained for antonym pair classification. Lin (2003) [5] manually prepared some patterns like “from X to Y”, “either X or Y” to discriminate synonyms from antonyms. It was observed that antonym pairs occur with these two pattern very frequently but synonym pairs occur with these patterns rarely.
  • 3. Computer Science & Information Technology (CS & IT) 13 Mohammad (2008) [6] developed an unsupervised method using degree of antonym to discriminate antonym pairs. According to definition of degree of antonym, the more a pair has antonym degree, the more the pair represents antonymy. Mohammad used corpus statistical features and antonym dictionary category words together. Over test pairs 80.0% accuracy was obtained for antonym pairs. For Turkish, there are some studies to extract semantic relation pairs from corpus and dictionary definitions [7], [8]. Hyponym-hypernym [9], [10], meronym-holonym [11] and synonym [12] pairs have been automatically extracted from Turkish corpus. For hyponym-hypernym, meronym-holonym and synonym pairs 83.0%, 75.0% and 80.3% accuracies were obtained, respectively. Although there are some studies about antonym pair extraction from Turkish dictionary definitions, there is no study using Turkish corpus and antonym corpus patterns. Our main motivation is that there is no such a corpus based study for Turkish before. 3. EXTRACTION OF ANTONYM PATTERNS FROM TURKISH CORPUS LSPs are widely used to extract antonym relation pairs. In this study, antonym patterns are used to extract antonym pairs. Therefore, we have to generate antonym patterns from corpus. To extract Turkish antonym patterns, following processing steps are applied. BOUN web corpus was used [13] as a source. The corpus consists of nearly 10 million sentences and 500 million words (tokens). Firstly, we remove all punctuation and special characters from corpus. Corpus is parsed morphologically by Zemberek Turkish NLP tool [14] and each word in corpus is separated to root, root part-of-speech tag and suffixes. For a given word, Zemberek generates multiple parsing results, but only first parsing result is used. Because our corpus is too big, search process can take a long time. For fast search operations, morphologically parsed corpus is indexed by Apache Lucene 4.2.0 searching tool [15] and index file is used for all corpus search operations. To find antonym patterns, we generate noun and adjective target words. Antonym equivalents of target antonyms are extracted with using Turkish Antonym Dictionary [16]. 184 antonym pairs called initial seeds are searched in corpus index file and sentences which contain initial seeds are found. In related sentences, initial seeds are replaced with * (wildcard) character. We select patterns having maximum two words between two * characters and others are removed. Thus, we ignore unproductive special patterns. Reliability score of each pattern is calculated. To calculate pattern reliability score, we used a formula which is given in equation (1). Rn = ୔ ୘ (1) In formula, Rn represents reliability score of pattern n. P is total co-occurrence frequency of pattern n with initial seeds. T represents total co-occurrence frequency of pattern n with other antonym pairs(other seeds) in corpus. Total co-occurrence frequency of pattern with initial seeds is divided by total co-occurrence frequency of pattern with other seeds. Then, reliability score is
  • 4. 14 Computer Science & Information Technology (CS & IT) calculated for each pattern. For example, if pattern X occurs with initial seeds 100 times and occurs with other seeds 10.000 times in corpus, reliability score of X equals 100/10.000 = 0.01. But the reliability score may be misleading. If pattern X occurs with initial seeds 7 times and occurs with other seeds 10 times, reliability score equals 7/10 = 0.7. Although reliability score of X is high, X occurs with initial seeds only 7 times. Because co-occurrence frequency of X with initial seeds is too low, pattern X does not have any importance in terms of productivity and generality. For this reason, we calculate reliability score for patterns occurring with initial seeds more than 50 times and other patterns are ignored. To determine pattern reliability score, number of different initial seeds occurring with a pattern is an important parameter. We can say that the more different initial seeds occur with a pattern, the more the pattern is reliable. We assume that pattern X occurs with initial seeds 100 times, but only occurs with 5 different initial seeds. Likewise, pattern Y occurs with initial seeds 100 times, but occurs with 20 different initial seeds. If total co-occurrence frequency of X and Y with other seeds equals 1000, reliability scores of both patterns equal 100/1000 = 0.1. Although pattern reliability scores of X and Y equal each other, Y pattern occurs with more different initial seeds than X. Hence the pattern Y is more general and productive than X. To tackle this problem, pattern reliability score is calculated for patterns occurring with more than 20 different initial seeds and other patterns are not assessed. After calculating reliability score for each pattern according to two conditions given above, all patterns are sorted according to reliability score. Patterns that have reliability score greater than 0.02 are selected to generate new antonym pairs from corpus. Reliable antonym patterns are given in Table 1. Table 1. Antonym patterns extracted from corpus using initial seeds 4. EXTRACTING NEW ANTONYM PAIRS USING PATTERNS Using antonym patterns in Table 1, antonym equivalent words are extracted for a given target word. Process steps of new antonym pair extraction are given below.
  • 5. Computer Science & Information Technology (CS & IT) 15 Firstly, target words are determined and patterns generated by replacing target word with * characters are searched in corpus. Words corresponding to * characters are extracted as candidates of target word. Although reliable patterns are used, not antonym pairs can occur in these patterns. For this reason, antonym equivalents of given a target word are defined as candidates. In pattern structure, any antonym pairs can show two different sequence like X-Y and Y-X. Thus, given a target word is searched in two different positions and words in different * positions are recorded as candidates. For example, target word “iyi” (good) are searched as; Turkish patterns English equivalents # iyi ve * arasındaki # between good and * # * ve iyi arasındaki # between * and good # ne iyi ne de * # neither good nor * # ne * ne de iyi # neither * nor good … After extracting candidates of target word, antonym score is calculated for each pair consisting of target and a candidate. Pairs having a certain antonym score are assigned to antonym and others are eliminated. To calculate antonym scores of pairs, we used Lobanova’s antonym score formula given in equation (2) [17]. Px = 1 - ∏ ቀ1 − େ୩ ୘୩ ቁ େ୩ ୑ ୬ୀଵ (2) In formula, Px represents antonym score for pair x. M is number of reliable pattern and Ck is co- occurrence frequency of pair x with pattern k. Tk represents co-occurrence frequency of pattern k with other seeds in corpus. 5. EXPERIMENTAL RESULTS To measure success of model, 196 noun and adjective target words are utilized. Target words were searched together with reliable antonym patterns and candidates were extracted. For each pair, antonym score was calculated. After observations, we defined minimum reliable antonym score as 0.3. When the minimum reliable antonym score is defined less than 0.3, it is shown that accuracy of the method falls sharply. For 45 out 196 target words, our method proposed reliable antonym pairs with 77.2% average accuracy. Class of pairs were manually tagged by 3 Turkish native speakers. 21 target words and candidates, english equivalents are given in Table 2.
  • 6. 16 Computer Science & Information Technology (CS & IT) Table 2. Target words, candidates, antonym scores and pair classes 6. CONCLUSIONS In this study, antonym pairs and patterns were automatically extracted from Turkish corpus. Noun-noun and adjective-adjective seeds were created and antonym patterns were generated using these seeds. After generating patterns from initial seeds, reliability score was calculated for each antonym pattern. 11 patterns having reliability score greater than 0.02 were selected to produce new antonym pairs. To measure accuracy of method, noun and adjective target words were used as test words. Using these targets with antonym patterns, candidates were found for each target words. For each antonym pair, antonym score was calculated. Pairs having antonym score greater than 0.3 were assigned to antonym and others were eliminated. For 45 out 196 target words, our method proposed reliable antonym pairs with 77.2% average accuracy. This study has been shown that Turkish antonym relation patterns can be extracted from corpus easily using some manually created antonym seeds. Candidates also can be easily extracted for a given target word with high accuracy with using reliable antonym patterns. Because patterns are used to extract antonym pairs, high co-occurrence frequency of target with patterns in corpus directly influences success of the method. This is a disadvantage for all of pattern-based methods.
  • 7. Computer Science & Information Technology (CS & IT) 17 In further studies, we aim to use corpus statistical information with patterns. Thus, antonym pairs occurring with patterns at low frequency can be extracted from corpus. REFERENCES [1] Christiane Fellbaum (1998, ed.) WordNet: An Electronic Lexical Database. Cambridge, MA: MIT Press. [2] Hearst, M.A.: Automatic Acquisition of Hyponyms from Large Text Corpora. In: 14th International Conference on Computational Linguistics, COLING 1992, Nantes, France, pp. 539-545(1992) [3] Lobanova, A., van der Kleij, T. and J. Spenader (2010). Defining antonymy: a corpus-based study of opposites by lexico-syntactic patterns. In: International Journal of Lexicography. Vol 23: 19-53. [4] Turney, P.D. (2008), A uniform approach to analogies, synonyms, antonyms, and associations, Proceedings of the 22nd International Conference on Computational Linguistics (Coling 2008), Manchester, UK, pp. 905-912. [5] Dekang Lin, Shaojun Zhao, Lijuan Qin, and Ming Zhou. 2003. Identifying synonyms among distributionally similar words. In Proceedings of IJCAI 2003. Acapulco, Mexico. [6] Saif Mohammad, Bonnie Dorr, and Graeme Hirst. 2008. Computing word-pair antonymy. In EMNLP, pages 982–991. Association for Computational Linguistics. [7] Yazıcı, E. ve Amasyalı, M.F., (2011). Automatic Extraction of Semantic Relationships Using Turkish Dictionary Definitions, EMO Bilimsel Dergi, stanbul. [8] Zeynep Orhan, lknur Pehlivan , Volkan Uslan , Pınar Önder,Automated Extraction of Semantic Word Relations in Turkish Lexicon, Journal of Mathematical And Computational Applications, 16, 1, Jan. 2011, pp.13-22, [9] Yildirim, S., Yildiz, T., (2012). “Corpus-Driven Hyponym Acquisition for Turkish Language”, CICLing 13th International Conference on Intelligent Text Processig and Computational Linguistics, 2012. [10] Şahin, G., Diri, B., Yıldız T., “Pattern and Semantic Similarity Based Automatic Extraction of Hyponym-Hypernym Relation from Turkish Corpus”, 23th Signal Processing and Communications Applications Conference, Malatya, Turkey, (16-19 May), 2015. [11] Yıldız, T., Yıldırım, S., Diri, B., “Extraction of Part-Whole Relations from Turkish Corpora”, Computational Linguistics and Intelligent Text Processing, CICLing, Greece, 2013. [12] Yıldız, T., Yıldırım, S., Diri, B., “An Integrated Approach to Automatic Synonym Detection in Turkish Corpus”, 9th International Conference on Natural Language Processing, PolTAL, Springer LNAI proceedings, Warsaw, Poland, (17-19 September), 2014. [13] Sak, H., Güngör, T. and Saraçlar. M., (2008). “Turkish Language Resources: Morphological Parser, Morphological Disambiguator and Web Corpus”, The 6th International Conference on Natural Language Processing, GOTAL 2008. [14] http://zemberek-web.appspot.com/ [15] http://lucene.apache.org/core/ [16] http://tdk.gov.tr/ [17] Lobanova, A., van der Kleij, T. and J. Spenader (2010). Defining antonymy: a corpus-based study of opposites by lexico-syntactic patterns. In: International Journal of Lexicography. Vol 23: 19-53.