检索结果-内蒙古大学图书馆

2011 International Conference on Asian Language processing, IALP 2011

作者： Xu, Hua Liu, Dandan Qian, Longhua Zhou, Guodong Natural Language Processing Lab. School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9780769545547

Currently context-based approach is a popular approach for constructing bilingual lexicons from comparable corpora. Following this line of research, this paper proposes a dependency relationship mapping model and investigates its effect on bilingual lexicon construction. The experiments show that, by mapping context words, dependency relationship types and directions simultaneously when calculating the similarity between two words in the source and target languages respectively, our approach significantly outperforms a state-of-the-art system in bilingual lexicon construction from either Chinese-English or English-Chinese. This justifies the effectiveness of our dependency relationship mapping model on bilingual lexicon construction. © 2011 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

A robust keyword spotting system for Persian conversational telephone speech using feature and score normalization and ARMA filter

A robust keyword spotting system for Persian conversational ...

引用

IEEE GCC Conference and Exhibition

作者： Shokri, Akram Tabibian, Shima Akbari, Ahmad Nasersharif, Babak Kabudian, Jahanshah Audio and Signal Processing Lab Computer Engineering Department Iran University of Science and Technology Iran Computer Engineering Department Faculty of Engineering University of Guilan Rasht Iran Research Center for Intelligent Signal Processing Tehran Iran

ISBN: (纸本)9781612841199

Keyword spotting (KWS) refers to detection of a limited number of given keywords in speech utterances. In this paper, we evaluate a robust keyword spotting system based on hidden markov models for speaker independent Persian conversational telephone speech. Performance of base line keyword spotter is improved by means of normalizing features using cepstral mean and variance normalization (CMVN) and cepstral gain normalization (CGN). And better performance is gained by applying auto-regressive moving average (ARMA) filter on normalized features. Experimental results show that although all these methods improve keyword spotting performance, CMVN and ARMA (MVA) processing of PLP features works much better on our Persian conversational telephone speech database and 41% improvement to baseline system is achieved at false alarm (FA) rate equal to 8.6 FA/KW/Hour. © 2011 IEEE.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

An approach to content-independent feature extraction for Chinese-Korean spoken language identification

An approach to content-independent feature extraction for Ch...

引用

2011 IEEE International Conference on computer Science and Automation Engineering, CSAE 2011

作者： Lu, Shi-Dan Cui, Rong-Yi Intelligent Information Processing Lab. Department of Computer Science and Technology Yanbian University Yanji Yanji China

ISBN: (纸本)9781424487257

A new classification feature extraction method for Chinese-Korean spoken language identification was proposed in this paper. Firstly, speech signal was divided into frame serial and the number of frames was counted. Furthermore, the ratio between short-time zero-crossing rate and short-time energy, i.e. short-time-frequency-energy-ratio (STFER), was computed, and the mean STFER per frame was treated as the classification feature to implement Chinese-Korean spoken language identification. Finally, the classification threshold was determined using information gain. Experimental results show that the proposed method is simpler than MFCC feature parameters and has better ability to identify spoken language with lower complexity, can be adopted in preprocessing procedure of language recognition. © 2011 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Tissue P systems with cell separation: attacking the partition problem

引用

Science China(Information Sciences) 2011年第2期54卷 293-304页

作者： ZHANG XingYi1, WANG Shuo2, NIU YunYun2 & PAN LinQiang2 1Key lab.of Intelligent Computing and signal processing of Ministry of Education, School of computer Science and technology, Anhui University, Hefei 230039, China 2Image processing and Intelligent Control Key lab.ratory of Education Ministry of China, Department of Control Science and Engineering, Huazhong University of Science and technology, Wuhan 430074, China 1. Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China2. Image Processing and Intelligent Control Key Laboratory of Education Ministry of China Department of Control Science and Engineering Huazhong University of Science and Technology Wuhan 430074 China

Tissue P systems are distributed parallel and non-deterministic computing models in the framework of membrane computing, which are inspired by intercellular communication and cooperation between neurons. Recently, cell separation is introduced into tissue P systems, which enables systems to generate an exponential workspace in a polynomial time. In this work, the computational power of tissue P systems with cell separation is investigated. Specifically, a uniform family of tissue P systems with cell separation is constructed for effciently solving a well-known NP-complete problem, the partition problem.

关键词： membrane computing tissue P system cell separation partition problem

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised geometric mean of Kullback-Leibler divergences for subspace selection

Semi-supervised geometric mean of Kullback-Leibler divergenc...

引用

2011 8th International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2011, Jointly with the 2011 7th International Conference on Natural Computation, ICNC'11

作者： Chen, Si-Bao Wang, Hai-Xian Zhang, Xing-Yi Luo, Bin Key Lab of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Anhui University Hefei 230039 China

ISBN: (纸本)9781612841816

Subspace selection is widely adopted in many areas of pattern recognition. A recent result, named maximizing the geometric mean of Kullback-Leibler (KL) divergences of class pairs (MGMD), is a successful method for subspace selection, which can significantly reduce the class separation problem. However, in many applications, lab.led data are very limited while unlab.led data can be easily obtained. The estimation of divergences of class pairs is unstable using inadequate lab.led data. To take advantage of unlab.led data for subspace selection, semi-supervised MGMD (SSMGMD) is proposed using graph Laplacian as normalization. Quasi-Newton method is adopted to solve the optimization problem. Experiments on synthetic data and real image data show the validity of SSMGMD. © 2011 IEEE.

关键词： Newton-Raphson method

来源：评论

学校读者我要写书评

暂无评论

Research of event pronoun resolution

Research of event pronoun resolution

引用

2011 International Conference on Asian Language processing, IALP 2011

作者： Zhang, Ning Kong, Fang Li, Peifeng JiangSu Provincial Key Lab. for Computer Information Processing Technology Soochow University Suzhou China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9780769545547

Event anaphora resolution plays an important role in discourse analysis. In comparison with general noun phrases, pronouns carry little information of themselves, resolving the event pronouns is a more difficult task. This paper proposes a machine learning-based framework for event pronoun resolution. All kinds of features, including both flat and structural features, are explored for event pronoun resolution. Experiments on OntoNotes corpus show that both flat and structural features are very effective for this task. © 2011 IEEE.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

Research of noun phrase coreference resolution

Research of noun phrase coreference resolution

引用

2011 International Conference on Asian Language processing, IALP 2011

作者： Gao, Junwei Kong, Fang Li, Peifeng Zhu, Qiaoming JiangSu Provincial Key Lab. for Computer Information Processing Technology Soochow University Suzhou China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9780769545547

Coreference resolution is an important subtask in natural language processing systems. The process of it is to find whether two expressions in natural language refer to the same entity in the world. Machine learning approaches to this problem have been reasonably successful, operating primarily by recasting the problem as a classification task. A great deal of research has been done on this task in English, using approaches ranging from those based on linguistics to those based on machine learning. In Chinese, however, much less work has been done in this area. The lack of public resources is a big problem in the research of Chinese NLP. The other problem is that some features are more difficult to get than those features of English. In this paper, We present a noun phrase coreference system that refers to the work of Soon et al. (2001). We also explore the impact of various features on our system's performance. Experiments on the Chinese portion of OntoNotes 3.0 show that the platform achieves a good performance. © 2011 IEEE.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Research on cross-document coreference of Chinese person name

Research on cross-document coreference of Chinese person nam...

引用

2011 International Conference on Asian Language processing, IALP 2011

作者： Ni, Ji Kong, Fang Li, Peifeng Zhu, Qiaoming JiangSu Provincial Key Lab. for Computer Information Processing Technology Soochow University Suzhou China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9780769545547

In reality, different persons often have the same person name. The Person Cross Document Co-reference Resolution is a task, which requires that all and only the textual mentions of an entity of type Person be individuated in a collection of text documents. In this paper, we implement a Chinese Person Name Cross Document Co-reference Resolution System. First, we utilize name identification module to recognize all person names of the texts, and then classify the document collection of same person name by rules preliminarily, and at last, we compute similarities of each classification based on VSM, according to the prior similarities, the system get the final classification results. We test the system on 30 usual Chinese names of the corpus provided by CLP, and average F measure is 85.9%. © 2011 IEEE.

关键词： Information retrieval systems

来源：评论

学校读者我要写书评

暂无评论

Chinese zero anaphor detection: Rule-based approach

Chinese zero anaphor detection: Rule-based approach

引用

作者： Qin, Kaiwei Kong, Fang Li, Peifeng Zhu, Qiaoming School of Computer Science and Technology Soochow University Jiangsu 215006 China Key Lab. of Computer Information Processing Technology of Jiangsu Province Suzhou Jiangsu 215006 China

ISBN: (纸本)9783642256608

A rule-based approach for Chinese zero anaphor detection is proposed. Given a parse tree, the smallest IP sub-tree covering the current predicate is captured. Based on this IP sub-tree, some rules are proposed for detecting whether a Chinese zero anaphor exists. This paper also systematically evaluates the rule-based method on OntoNotes corpus. Using golden parse tree, our method achieves 82.45 in F-measure. And the F-measure is 63.84 using automatic parser. The experiment results show that our method is very effective on Chinese zero anaphor detection. © 2011 Springer-Verlag Berlin Heidelberg.

关键词： Forestry

来源：评论

学校读者我要写书评

暂无评论

Error analysis and precision estimation for floating-point dot-products using affine arithmetic

Error analysis and precision estimation for floating-point d...

引用

4th Annual International Conference on Advanced Technologies for Communications, ATC2011

作者： Huynh, Thang Viet Mücke, Manfred Graz University of Technology Signal Processing and Speech Communication Laboratory Graz Austria University of Vienna Research Lab. Computational Technologies and Applications Vienna Austria

ISBN: (纸本)9781457712043

One challenging task for VLSI and reconfigurable system design is the identification of the smallest number format possible to implement a given numerical algorithm guaranteeing some final accuracy while minimising area used, execution time and power. We apply affine arithmetic, an extension to interval arithmetic, to estimate the rounding error of different floating-point dot-product variants. The validity of the estimated error bounds is demonstrated using extensive simulations. We derive the analytical models for rounding errors over a wide range of parameters and show that affine arithmetic with a probabilistic bounding operator is able to provide a tighter bound compared to conventional forward error analysis. Due to the tight bounds, minimum mantissa bit width for hardware implementation can be determined and comparison of different dot-product variants is possible. Our presented models allow for an efficient design space exploration and are key to specialised code generators. © 2011 IEEE.

关键词： Error analysis

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：