In recent years, there have been many Uyghur-Chinese cross language applications, but automatic translation still lack of in-depth study between these two languages. The most traditional Uyghur-Chinese personal name transliteration based on rules, and different from phoneme-based transliteration, this paper achieves Uyghur-Chinese personal name transliteration on the basis of Uyghur syllabification and under Grapheme-based DOM Transliteration Framework.
{"title":"Research and Implementation of the Uyghur-Chinese Personal Name Transliteration Based on Syllabification","authors":"Alim Murat, Azragul Yusup, Yusup Abaydulla","doi":"10.1109/IALP.2013.22","DOIUrl":"https://doi.org/10.1109/IALP.2013.22","url":null,"abstract":"In recent years, there have been many Uyghur-Chinese cross language applications, but automatic translation still lack of in-depth study between these two languages. The most traditional Uyghur-Chinese personal name transliteration based on rules, and different from phoneme-based transliteration, this paper achieves Uyghur-Chinese personal name transliteration on the basis of Uyghur syllabification and under Grapheme-based DOM Transliteration Framework.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123360089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The paper studied the features of the sentence [[V+O] +O] which is a documents title sentence in Mandarin, and found out its process and motivation of its formation. The value of the paper lies in supplying a way to the document title generation and the semantic orientation computing in the NPL.
{"title":"On the Formation and Semantic Meaning of the Title [[V+O]+O] in Mandarin","authors":"Hongwu Xue","doi":"10.1109/IALP.2013.17","DOIUrl":"https://doi.org/10.1109/IALP.2013.17","url":null,"abstract":"The paper studied the features of the sentence [[V+O] +O] which is a documents title sentence in Mandarin, and found out its process and motivation of its formation. The value of the paper lies in supplying a way to the document title generation and the semantic orientation computing in the NPL.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128011338","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We describe our work on pronominal resolution in Tamil using Tree CRFs. Pronominal resolution is the task of identifying the referent of a pronominal. In this work we have studied third person pronouns in Tamil such as 'avan', 'aval', 'athu', 'avar', he, she, it and they respectively. Tamil is a Dravidian language and it is morphologically rich and highly agglutinative language. Tree CRFs is a machine learning method, in which the data is modeled as a graph with edge weights used for learning. The features for learning are developed by using the morphological features of the language. The work is carried out on tourism domain data from the Web. We have obtained 70.8% precision and 66.5% recall. The results are encouraging.
{"title":"Pronominal Resolution in Tamil Using Tree CRFs","authors":"R. Ram, S. L. Devi","doi":"10.1109/IALP.2013.59","DOIUrl":"https://doi.org/10.1109/IALP.2013.59","url":null,"abstract":"We describe our work on pronominal resolution in Tamil using Tree CRFs. Pronominal resolution is the task of identifying the referent of a pronominal. In this work we have studied third person pronouns in Tamil such as 'avan', 'aval', 'athu', 'avar', he, she, it and they respectively. Tamil is a Dravidian language and it is morphologically rich and highly agglutinative language. Tree CRFs is a machine learning method, in which the data is modeled as a graph with edge weights used for learning. The features for learning are developed by using the morphological features of the language. The work is carried out on tourism domain data from the Web. We have obtained 70.8% precision and 66.5% recall. The results are encouraging.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124846380","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The teaching of light tone is in an awkward situation in teaching Chinese as a second language. Disputes on whether or not light tone should be taught, what to teach and how to teach could be heard from time to time. As a special phonetic phenomenon in Chinese Mandarin and dialects, light tone has a certain grammatical function, but more importantly it reveals the rhythm of Chinese, therefore, it should not be ignored in the teaching of Chinese to foreign students. This paper tries to analyze the importance and difficulties of the light tone teaching and figure out acceptable solutions to the difficulties of the light tone teaching.
{"title":"On Teaching Strategies of Light Tone in Chinese to Foreign Students","authors":"Mingyue Wang","doi":"10.1109/IALP.2013.34","DOIUrl":"https://doi.org/10.1109/IALP.2013.34","url":null,"abstract":"The teaching of light tone is in an awkward situation in teaching Chinese as a second language. Disputes on whether or not light tone should be taught, what to teach and how to teach could be heard from time to time. As a special phonetic phenomenon in Chinese Mandarin and dialects, light tone has a certain grammatical function, but more importantly it reveals the rhythm of Chinese, therefore, it should not be ignored in the teaching of Chinese to foreign students. This paper tries to analyze the importance and difficulties of the light tone teaching and figure out acceptable solutions to the difficulties of the light tone teaching.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860869","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The diacritic marks exist in many languages such as French, German, Slovak, Vietnamese, etc. However for some reasons, sometime they are omitted in writing. This phenomenon may lead to the ambiguity for reader when reading a non-diacritic text. The automatic diacritic restoration problem has been proposed and resolved in several languages using the character-based approach, word-based approach, point-wise approach, etc. However, these approaches lean heavily on the linguistics information, size of training corpus and sometime they are language dependent. In this paper, a simple and effective restoration method will be presented. The machine translation approach will be used as a new solution for this problem. The restoration method has been applied for Vietnamese language, and integrated in an Android application named VIVA (Vietnamese Voice Assistant) that reads out the content of incoming text messages on mobile phone. Our experiments show that the proposed restoration method can recover diacritic marks with a 99.0% accuracy rate.
{"title":"Machine Translation Approach for Vietnamese Diacritic Restoration","authors":"T. Do, Duy Binh Nguyen, Dang-Khoa Mac, D. Tran","doi":"10.1109/IALP.2013.30","DOIUrl":"https://doi.org/10.1109/IALP.2013.30","url":null,"abstract":"The diacritic marks exist in many languages such as French, German, Slovak, Vietnamese, etc. However for some reasons, sometime they are omitted in writing. This phenomenon may lead to the ambiguity for reader when reading a non-diacritic text. The automatic diacritic restoration problem has been proposed and resolved in several languages using the character-based approach, word-based approach, point-wise approach, etc. However, these approaches lean heavily on the linguistics information, size of training corpus and sometime they are language dependent. In this paper, a simple and effective restoration method will be presented. The machine translation approach will be used as a new solution for this problem. The restoration method has been applied for Vietnamese language, and integrated in an Android application named VIVA (Vietnamese Voice Assistant) that reads out the content of incoming text messages on mobile phone. Our experiments show that the proposed restoration method can recover diacritic marks with a 99.0% accuracy rate.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"120 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129333056","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
As Chinese expression diversity, there are some shortcomings in traditional algorithms of Chinese entity relationship extraction. For example, workload of labeling by hand on training corpus is too large, the generated relationship schemas usually have poor versatility, and it is difficult to select or integrate high quality domain ontology for extraction task. Moreover, these algorithms don't consider the fact that the entity relationship usually has different meanings with the different topic backgrounds or with the various concept granularities. The paper, utilizing statistical method and linguistics knowledge, carries out the work of crawling, parsing, filling, builds the relational formal concept lattice with Chinese entities context, and acquires entity relationship schemas described by relational formal concept. With these relational schemas and concept built above, we carry out the entry concept correlation computing and the predicate text flexible matching, and get the concept connectivity distance between entities to achieve the non-single and indirect entity relation extraction. The granularities of concept in relation extraction are more flexible, and the relational schema described by formal concept is more versatile and robust. The method in this paper provides a better semantic description for the extracted relationship, and obtains a good relation extraction performance.
{"title":"Relationship Extraction Tactics of Chinese Entity Based on Formal Concept Connectivity Distance","authors":"Chun-ming. Cheng","doi":"10.1109/IALP.2013.12","DOIUrl":"https://doi.org/10.1109/IALP.2013.12","url":null,"abstract":"As Chinese expression diversity, there are some shortcomings in traditional algorithms of Chinese entity relationship extraction. For example, workload of labeling by hand on training corpus is too large, the generated relationship schemas usually have poor versatility, and it is difficult to select or integrate high quality domain ontology for extraction task. Moreover, these algorithms don't consider the fact that the entity relationship usually has different meanings with the different topic backgrounds or with the various concept granularities. The paper, utilizing statistical method and linguistics knowledge, carries out the work of crawling, parsing, filling, builds the relational formal concept lattice with Chinese entities context, and acquires entity relationship schemas described by relational formal concept. With these relational schemas and concept built above, we carry out the entry concept correlation computing and the predicate text flexible matching, and get the concept connectivity distance between entities to achieve the non-single and indirect entity relation extraction. The granularities of concept in relation extraction are more flexible, and the relational schema described by formal concept is more versatile and robust. The method in this paper provides a better semantic description for the extracted relationship, and obtains a good relation extraction performance.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122858660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Existing sort algorithms are difficult to implement Chinese string sort in user-defined sequence. This paper proposes an efficient string sort method in user-defined character order. On the basis of the consecutive numbers which used to define the custom order of characters, the hash table structure is employed to convert each string into corresponding array of integers. By taking the maximum number of characters as the new radix, the Radix sort algorithm is used to implement fast sort of strings in user-defined order. Theory analysis and experiments show that the sort algorithm of this paper can easily achieve Chinese string sort in user-defined order in linear time and space complexity. This sort algorithm has a better time performance than that of Quick Sort algorithm, and it can effortlessly extend to string sort applications of other languages.
{"title":"An Efficient Algorithm of Chinese String Sort in User-Defined Sequence","authors":"Haijun Zhang, Shumin Shi","doi":"10.1109/IALP.2013.33","DOIUrl":"https://doi.org/10.1109/IALP.2013.33","url":null,"abstract":"Existing sort algorithms are difficult to implement Chinese string sort in user-defined sequence. This paper proposes an efficient string sort method in user-defined character order. On the basis of the consecutive numbers which used to define the custom order of characters, the hash table structure is employed to convert each string into corresponding array of integers. By taking the maximum number of characters as the new radix, the Radix sort algorithm is used to implement fast sort of strings in user-defined order. Theory analysis and experiments show that the sort algorithm of this paper can easily achieve Chinese string sort in user-defined order in linear time and space complexity. This sort algorithm has a better time performance than that of Quick Sort algorithm, and it can effortlessly extend to string sort applications of other languages.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128304841","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Zede Zhu, Miao Li, Lei Chen, Zhenxin Yang, Sheng Chen
Key phrase extraction plays a significant role in many language processing tasks such as text summarization, text categorization and information retrieval. However, none study combines several approaches to improve the performance of key phrase extraction. This paper first implements three representative unsupervised algorithms TfIdf, Text Rank and Expand Rank, and then proposes a generalized framework using serial, parallel and voting methods on combining these algorithms for comprehensive analysis of key phrase extraction. Experimental results, carried out on an evaluation dataset including 1040 abstracts from Chinese thesis, demonstrate the remarkable performance of some combination approaches.
{"title":"Combination of Unsupervised Keyphrase Extraction Algorithms","authors":"Zede Zhu, Miao Li, Lei Chen, Zhenxin Yang, Sheng Chen","doi":"10.1109/IALP.2013.14","DOIUrl":"https://doi.org/10.1109/IALP.2013.14","url":null,"abstract":"Key phrase extraction plays a significant role in many language processing tasks such as text summarization, text categorization and information retrieval. However, none study combines several approaches to improve the performance of key phrase extraction. This paper first implements three representative unsupervised algorithms TfIdf, Text Rank and Expand Rank, and then proposes a generalized framework using serial, parallel and voting methods on combining these algorithms for comprehensive analysis of key phrase extraction. Experimental results, carried out on an evaluation dataset including 1040 abstracts from Chinese thesis, demonstrate the remarkable performance of some combination approaches.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128877207","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
There are two major views on the generation of sentential topics in Chinese, of which some are the ones moved from a syntactic position. Disagreement occurs as regards the so-called dangling topics. One view contends that dangling topics are the moved ones, thematically related to a position inside the comment, the other holds that they are base-generated and licensed by the non-empty set resulting from the intersection of the topic set and the set generated by the semantic variable in the comment. Both views help interpret the negation of topics in Chinese sentential negation from the perspective of syntax, semantics and pragmatics. It is suggested that the topic can be negated when the variable or related element in the comment has a co-referential relation with the topic, or has no definite referent.
{"title":"Topic and Its Negation in Chinese Sentences","authors":"Lin He, Qiong Peng","doi":"10.1109/IALP.2013.10","DOIUrl":"https://doi.org/10.1109/IALP.2013.10","url":null,"abstract":"There are two major views on the generation of sentential topics in Chinese, of which some are the ones moved from a syntactic position. Disagreement occurs as regards the so-called dangling topics. One view contends that dangling topics are the moved ones, thematically related to a position inside the comment, the other holds that they are base-generated and licensed by the non-empty set resulting from the intersection of the topic set and the set generated by the semantic variable in the comment. Both views help interpret the negation of topics in Chinese sentential negation from the perspective of syntax, semantics and pragmatics. It is suggested that the topic can be negated when the variable or related element in the comment has a co-referential relation with the topic, or has no definite referent.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128851896","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, we propose a rule-based approach that uses the term and sentence matching criteria for clustering Malay broadcast news to different stories. The proposed clustering method does not require users to predefined number of clusters. The three main stages of the clustering are sentences segmentation, indexing, and also term and sentence matching clustering. The sentences in the transcription will be segmented before indexing. Indexing involves tokenization, stop word removal, stemming, term selection and term representation. A vector space model (VSM) is used to represent the terms and sentences in the form of vectors. The sentences will then be grouped into clusters by using term and sentence matching thresholds. The proposed approach shows a significantly better accuracy than the baseline approaches.
{"title":"Broadcast News Story Clustering via Term and Sentence Matching","authors":"Foong Kuin Yow, T. Tan","doi":"10.1109/IALP.2013.62","DOIUrl":"https://doi.org/10.1109/IALP.2013.62","url":null,"abstract":"In this paper, we propose a rule-based approach that uses the term and sentence matching criteria for clustering Malay broadcast news to different stories. The proposed clustering method does not require users to predefined number of clusters. The three main stages of the clustering are sentences segmentation, indexing, and also term and sentence matching clustering. The sentences in the transcription will be segmented before indexing. Indexing involves tokenization, stop word removal, stemming, term selection and term representation. A vector space model (VSM) is used to represent the terms and sentences in the form of vectors. The sentences will then be grouped into clusters by using term and sentence matching thresholds. The proposed approach shows a significantly better accuracy than the baseline approaches.","PeriodicalId":413833,"journal":{"name":"2013 International Conference on Asian Language Processing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121093351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：