Aibek Makazhanov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Aibek Makazhanov has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Zhandos Yessenbayev
Bina Nusantara University
4 shared publications Islam Sabyrgaliyev
Nazarbayev University Research and Innovation System
3 shared publicationsDavood Rafiei
University of Alberta, Edmonton, AB, Canada
2 shared publicationsOlzhas Makhambetov
National Information Technologies 8 Orynbor str., Astana, Kazakhstan
2 shared publications- Olzhas Makhambetov
Nazarbayev University Research and Innovation System
2 shared publications Aitolkyn Sultangazina
National Laboratory Astana 53 Kabanbay batyr ave., Astana, Kazakhstan
1 shared publication
Latest Publications
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Character-based feature extraction with LSTM networks for POS-tagging task
In this paper we describe a work in progress on designing the continuous vector space word representations able to map unseen data adequately. We propose a LSTM-based feature extraction layer that reads in a sequence of characters corresponding to a word and outputs a single fixed-length real-valued vector. We then test our model on a POS tagging task on four typologically different languages. The results of the experiments suggest that the model can offer a solution to the out-of-vocabulary words problem, as in a comparable setting its OOV accuracy improves over that of a state of the art tagger.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Character-based feature extraction with LSTM networks for POS-tagging task
In this paper we describe a work in progress on designing the continuous vector space word representations able to map unseen data adequately. We propose a LSTM-based feature extraction layer that reads in a sequence of characters corresponding to a word and outputs a single fixed-length real-valued vector. We then test our model on a POS tagging task on four typologically different languages. The results of the experiments suggest that the model can offer a solution to the out-of-vocabulary words problem, as in a comparable setting its OOV accuracy improves over that of a state of the art tagger.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Identification of the parallel documents from multilingual news websites
We present the initial results of our experiments on document alignment for the online news domain. Specifically, as apposed to cross-site comparable news alignment, we focus on the identification of parallel documents from within the same multilingual websites. In such a setting parallel news stories oftentimes turn out to be direct translations of each other with a tendency of sharing common media and displaying proximity in publication date. We leverage this domain-specific property of the data and propose a straightforward yet competitive heuristic that performs on par with a machine learning-based method in terms of precision, and outperforms a widely used bitext extraction system on a range of metrics. Moreover, this heuristic has allowed us to identify comparable documents overlooked by a human annotator. Although both rule- and learning-based methods that we present are language independent, we specifically focus on the Russian-Kazakh language pair as the present study is one of the initial steps towards a greater objective of building a corresponding parallel corpus and a machine translation system.
- 1 October 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-5
Identification of the parallel documents from multilingual news websites
We present the initial results of our experiments on document alignment for the online news domain. Specifically, as apposed to cross-site comparable news alignment, we focus on the identification of parallel documents from within the same multilingual websites. In such a setting parallel news stories oftentimes turn out to be direct translations of each other with a tendency of sharing common media and displaying proximity in publication date. We leverage this domain-specific property of the data and propose a straightforward yet competitive heuristic that performs on par with a machine learning-based method in terms of precision, and outperforms a widely used bitext extraction system on a range of metrics. Moreover, this heuristic has allowed us to identify comparable documents overlooked by a human annotator. Although both rule- and learning-based methods that we present are language independent, we specifically focus on the Russian-Kazakh language pair as the present study is one of the initial steps towards a greater objective of building a corresponding parallel corpus and a machine translation system.
- 1 January 2015
- Published by Springer Nature
- p. 151-163
Data-Driven Morphological Analysis and Disambiguation for Kazakh
- 1 January 2015
- Published by Springer Nature
- p. 151-163
Data-Driven Morphological Analysis and Disambiguation for Kazakh
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
On certain aspects of Kazakh part-of-speech tagging
We compare and discuss various approaches to the problem of part of speech (POS) tagging of texts written in Kazakh, an agglutinative and highly inflectional Turkic language. In Kazakh a single root may produce hundreds of word forms, and it is difficult, if at all possible, to label enough training data to account for a vast set of all possible word forms in the language. Thus, current state of the art statistical POS taggers may not be as effective for Kazakh as for morphologically less complex languages, e.g. English. Also the choice of a POS tag set may influence the informativeness and the accuracy of tagging.
- 1 October 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-4
On certain aspects of Kazakh part-of-speech tagging
We compare and discuss various approaches to the problem of part of speech (POS) tagging of texts written in Kazakh, an agglutinative and highly inflectional Turkic language. In Kazakh a single root may produce hundreds of word forms, and it is difficult, if at all possible, to label enough training data to account for a vast set of all possible word forms in the language. Thus, current state of the art statistical POS taggers may not be as effective for Kazakh as for morphologically less complex languages, e.g. English. Also the choice of a POS tag set may influence the informativeness and the accuracy of tagging.
- 6 May 2014
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 4 (1) , 1-15
Predicting political preference of Twitter users
- 6 May 2014
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 4 (1) , 1-15
Predicting political preference of Twitter users
- Open Access
Extracting Family Relationship Networks from Novels
We present an approach to the extraction of family relations from literary narrative, which incorporates a technique for utterance attribution proposed recently by Elson and McKeown (2010). In our work this technique is used in combination with the detection of vocatives - the explicit forms of address used by the characters in a novel. We take advantage of the fact that certain vocatives indicate family relations between speakers. The extracted relations are then propagated using a set of rules. We report the results of the application of our method to Jane Austen's Pride and Prejudice.
Open AccessExtracting Family Relationship Networks from Novels
We present an approach to the extraction of family relations from literary narrative, which incorporates a technique for utterance attribution proposed recently by Elson and McKeown (2010). In our work this technique is used in combination with the detection of vocatives - the explicit forms of address used by the characters in a novel. We take advantage of the fact that certain vocatives indicate family relations between speakers. The extracted relations are then propagated using a set of rules. We report the results of the application of our method to Jane Austen's Pride and Prejudice.
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 533-541
Spelling Correction for Kazakh
- 1 January 2014
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 533-541
Spelling Correction for Kazakh
- Open Access
- 25 August 2013
- Published by Association for Computing Machinery (ACM)
- p. 298-305
Predicting political preference of Twitter users
We study the problem of predicting the political preference of users on the Twitter network, showing that the political preference of users can be predicted from their interaction with political parties. We show this by building prediction models based on a variety of contextual and behavioural features, training the models by resorting to a distant supervision approach and considering party candidates to have a predefined preference towards their parties. A language model for each party is learned from the content of the tweets by the party candidates, and the preference of a user is assessed based on the alignment of user tweets with the language models of the parties. We evaluate our work in the context of Alberta 2012 general election, and show that our model outperforms, in terms of the F-measure, sentiment and text classification approaches and is in par with the human annotators. We further use our model to analyze the preference changes over the course of the election campaign and report results that would be difficult to attain by human annotators.
- 25 August 2013
- Published by Association for Computing Machinery (ACM)
- p. 298-305
Open AccessPredicting political preference of Twitter users
We study the problem of predicting the political preference of users on the Twitter network, showing that the political preference of users can be predicted from their interaction with political parties. We show this by building prediction models based on a variety of contextual and behavioural features, training the models by resorting to a distant supervision approach and considering party candidates to have a predefined preference towards their parties. A language model for each party is learned from the content of the tweets by the party candidates, and the preference of a user is assessed based on the alignment of user tweets with the language models of the parties. We evaluate our work in the context of Alberta 2012 general election, and show that our model outperforms, in terms of the F-measure, sentiment and text classification approaches and is in par with the human annotators. We further use our model to analyze the preference changes over the course of the election campaign and report results that would be difficult to attain by human annotators.
- Open Access
- 1 January 2013
- Published by Association for Computational Linguistics (ACL)
- p. 1022-1031
Assembling the Kazakh Language Corpus
Olzhas Makhambetov, Aibek Makazhanov, Zhandos Yessenbayev, Bakhyt Matkarimov, Islam Sabyrgaliyev, Anuar Sharafudinov. Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing. 2013.
- 1 January 2013
- Published by Association for Computational Linguistics (ACL)
- p. 1022-1031
Open AccessAssembling the Kazakh Language Corpus
Olzhas Makhambetov, Aibek Makazhanov, Zhandos Yessenbayev, Bakhyt Matkarimov, Islam Sabyrgaliyev, Anuar Sharafudinov. Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing. 2013.
- Open Access
- 25 June 2012
- Published by Association for Computing Machinery (ACM)
- p. 13-22
Leveraging editor collaboration patterns in wikipedia
Predicting the positive or negative attitude of individuals towards each other in a social environment has long been of interest, with applications in many domains. We investigate this problem in the context of the collaborative editing of articles in Wikipedia, showing that there is enough information in the edit history of the articles that can be utilized for predicting the attitude of co-editors. We train a model using a distant supervision approach, by labeling interactions between editors as positive or negative depending on how these editors vote for each other in Wikipedia admin elections. We use the model to predict the attitude among other editors, who have neither run nor voted in an election. We validate our model by assessing its accuracy in the tasks of predicting the results of the actual elections, and identifying controversial articles. Our analysis reveals that the interactions in co-editing articles can accurately predict votes, although there are differences between positive and negative votes. For instance, the accuracy when predicting negative votes substantially increases by considering longer traces of the edit history. As for predicting controversial articles, we show that exploiting positive and negative interactions during the production of an article provides substantial improvements on previous attempts at detecting controversial articles in Wikipedia.
- 25 June 2012
- Published by Association for Computing Machinery (ACM)
- p. 13-22
Open AccessLeveraging editor collaboration patterns in wikipedia
Predicting the positive or negative attitude of individuals towards each other in a social environment has long been of interest, with applications in many domains. We investigate this problem in the context of the collaborative editing of articles in Wikipedia, showing that there is enough information in the edit history of the articles that can be utilized for predicting the attitude of co-editors. We train a model using a distant supervision approach, by labeling interactions between editors as positive or negative depending on how these editors vote for each other in Wikipedia admin elections. We use the model to predict the attitude among other editors, who have neither run nor voted in an election. We validate our model by assessing its accuracy in the tasks of predicting the results of the actual elections, and identifying controversial articles. Our analysis reveals that the interactions in co-editing articles can accurately predict votes, although there are differences between positive and negative votes. For instance, the accuracy when predicting negative votes substantially increases by considering longer traces of the edit history. As for predicting controversial articles, we show that exploiting positive and negative interactions during the production of an article provides substantial improvements on previous attempts at detecting controversial articles in Wikipedia.