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

23rd International Conference on Computational Linguistics, Coling 2010

作者： Pitler, Emily Bergsma, Shane Lin, Dekang Church, Kenneth Computer and Information Science University of Pennsylvania United States Department of Computing Science University of Alberta Canada Google Inc. United States Human Language Technology Center of Excellence Johns Hopkins University United States

We use web-scale N-grams in a base NP parser that correctly analyzes 95.4% of the base NPs in natural text. Web-scale data improves performance. That is, there is no data like more data. Performance scales log-linearly with the number of parameters in the model (the number of unique N-grams). The web-scale N-grams are particularly helpful in harder cases, such as NPs that contain conjunctions.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Dirt cheap web-scale parallel text from the Common Crawl

Dirt cheap web-scale parallel text from the Common Crawl

引用

51st Annual Meeting of the Association for Computational Linguistics, ACL 2013

作者： Smith, Jason R. Koehn, Philipp Saint-Amand, Herve Callison-Burch, Chris Plamada, Magdalena Lopez, Adam Department of Computer Science Johns Hopkins University United States Human Language Technology Center of Excellence Johns Hopkins University United States School of Informatics University of Edinburgh United Kingdom Institute of Computational Linguistics University of Zurich Switzerland Computer and Information Science Department University of Pennsylvania United States

ISBN: (纸本)9781937284503

Parallel text is the fuel that drives modern machine translation systems. The Web is a comprehensive source of preexisting parallel text, but crawling the entire web is impossible for all but the largest companies. We bring web-scale parallel text to the masses by mining the Common Crawl, a public Web crawl hosted on Amazon's Elastic Cloud. Starting from nothing more than a set of common two-letter language codes, our open-source extension of the STRAND algorithm mined 32 terabytes of the crawl in just under a day, at a cost of about $500. Our large-scale experiment uncovers large amounts of parallel text in dozens of language pairs across a variety of domains and genres, some previously unavailable in curated datasets. Even with minimal cleaning and filtering, the resulting data boosts translation performance across the board for five different language pairs in the news domain, and on open domain test sets we see improvements of up to 5 BLEU. We make our code and data available for other researchers seeking to mine this rich new data resource.1 © 2013 Association for Computational Linguistics.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Towards a predicate-argument evaluation for MT 6

Towards a predicate-argument evaluation for MT

引用

6th Workshop on Syntax, Semantics and Structure in Statistical Translation, SSST 2012 at the 50th Annual Meeting of the Association for Computational Linguistics, ACT 2012

作者： Bojar, Ondřej Wu, Dekai Charles University in Prague Faculty of Mathematics and Physics Institute of Formal and Applied Linguistics Czech Republic HKUST Human Language Technology Center Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

ISBN: (纸本)9781937284381

HMEANT (Lo and Wu, 2011a) is a manual MT evaluation technique that focuses on predicate-argument structure of the sentence. We relate HMEANT to an established linguistic theory, highlighting the possibilities of reusing existing knowledge and resources for interpreting and automating HMEANT. We apply HMEANT to a new language, Czech in particular, by evaluating a set of English-to-Czech MT systems. HMEANT proves to correlate with manual rankings at the sentence level better than a range of automatic metrics. However, the main contribution of this paper is the identification of several issues of HMEANT annotation and our proposal on how to resolve them. © 2012 Association for Computational Linguistics.

关键词：

来源：评论

学校读者我要写书评

暂无评论

"Dead China-make" phones off the grid: Investigating and designing for mobile phone use in rural Africa 12

"Dead China-make" phones off the grid: Investigating and des...

引用

Designing Interactive Systems Conference, DIS '12

作者： Wyche, Susan P. Murphy, Laura L. Center for Human-Computer Interaction Computer Science Department Virginia Tech. Blacksburg VA 24060 United States Department of Global Health Systems and Development School of Public Health Tulane University New Orleans LA 70118 United States

ISBN: (纸本)9781450312103

Mobile phone users in rural parts of the developing world, especially Africa, adapt to lack of electricity, poverty, remote locations, unpredictable services, and second-hand technology. Meanwhile, the technology developers are forging ahead, designing for "smartphones," high-speed data packets, and Internet access, not the "dumb" phones and parsimonious voice calls of the rural householder. We draw from fieldwork in Kenya with mobile phone owners to relate specific practices and issues facing rural users. Problems such as "spoiled" phone batteries and "China-makes" suggest larger design implications. We use our findings to motivate a design agenda for the rural poor built on the assumption of off-grid use and limited power, simple cheap phones, and Unstructured Supplementary Service Data (USSD) protocol. A key part of this agenda calls for developing usable technologies aimed at the infrastructure rather than mobile phone interface level. © 2012 ACM.

关键词： Developing countries

来源：评论

学校读者我要写书评

暂无评论

The recency and geographical origins of the bat viruses ancestral to SARS-CoV and SARS-CoV-2

引用

Cell 2025年

作者： Pekar, Jonathan E. Lytras, Spyros Ghafari, Mahan Magee, Andrew F. Parker, Edyth Wang, Yu Ji, Xiang Havens, Jennifer L. Katzourakis, Aris Vasylyeva, Tetyana I. Suchard, Marc A. Hughes, Alice C. Hughes, Joseph Rambaut, Andrew Robertson, David L. Dellicour, Simon Worobey, Michael Wertheim, Joel O. Lemey, Philippe Institute of Ecology and Evolution University of Edinburgh Edinburgh United Kingdom Bioinformatics and Systems Biology Graduate Program University of California San Diego La Jolla 92093 CA United States Department of Biomedical Informatics University of California San Diego La Jolla 92093 CA United States Department of Medicine University of California San Diego La Jolla 92093 CA United States Division of Systems Virology Department of Microbiology and Immunology The Institute of Medical Science The University of Tokyo Tokyo Japan Medical Research Council University of Glasgow Centre for Virus Research Glasgow United Kingdom Department of Biology University of Oxford Oxford United Kingdom Department of Human Genetics David Geffen School of Medicine University of California Los Angeles Los Angeles 90095 CA United States Department of Immunology and Microbiology The Scripps Research Institute La Jolla 92037 CA United States Institute of Genomics and Global Health Redeemer's University Osun State Ede Nigeria Department of Computer Science and Engineering University of California San Diego La Jolla 92093 CA United States Department of Mathematics School of Science and Engineering Tulane University New Orleans LA United States Department of Population Health and Disease Prevention University of California Irvine Irvine 92617 CA United States Department of Biostatistics Fielding School of Public Health University of California Los Angeles Los Angeles 90095 CA United States Department of Computational Medicine David Geffen School of Medicine University of California Los Angeles Los Angeles 90095 CA United States School of Biological Sciences University of Hong Kong Hong Kong Hong Kong China Biodiversity Green Development Foundation Beijing China Spatial Epidemiology Lab (SpELL) Université Libre de Bruxelles CP160/12 50 av. FD Roosevelt Bruxelles 1050 Belgium Department of Microbiology Immunology and Transplantation Rega Institute

The emergence of SARS-CoV in 2002 and SARS-CoV-2 in 2019 led to increased sampling of sarbecoviruses circulating in horseshoe bats. Employing phylogenetic inference while accounting for recombination of bat sarbecoviruses, we find that the closest-inferred bat virus ancestors of SARS-CoV and SARS-CoV-2 existed less than a decade prior to their emergence in humans. Phylogeographic analyses show bat sarbecoviruses traveled at rates approximating their horseshoe bat hosts and circulated in Asia for millennia. We find that the direct ancestors of SARS-CoV and SARS-CoV-2 are unlikely to have reached their respective sites of emergence via dispersal in the bat reservoir alone, supporting interactions with intermediate hosts through wildlife trade playing a role in zoonotic spillover. These results can guide future sampling efforts and demonstrate that viral genomic regions extremely closely related to SARS-CoV and SARS-CoV-2 were circulating in horseshoe bats, confirming their importance as the reservoir species for SARS viruses. © 2025 The Authors

关键词： molecular epidemiology phylogeography sarbecoviruses virus evolution

来源：评论

学校读者我要写书评

暂无评论

Fast and scalable decoding with language model look-ahead for phrase-based statistical machine translation

Fast and scalable decoding with language model look-ahead fo...

引用

50th Annual Meeting of the Association for Computational Linguistics, ACL 2012

作者： Wuebker, Joern Ney, Hermann Zens, Richard Computer Science Department Human Language Technology and Pattern Recognition Group RWTH Aachen University Germany Google Inc. 1600 Amphitheatre Parkway Mountain View CA 94043 United States

ISBN: (纸本)9781937284251

In this work we present two extensions to the well-known dynamic programming beam search in phrase-based statistical machine translation (SMT), aiming at increased efficiency of decoding by minimizing the number of language model computations and hypothesis expansions. Our results show that language model based pre-sorting yields a small improvement in translation quality and a speedup by a factor of 2. Two look-ahead methods are shown to further increase translation speed by a factor of 2 without changing the search space and a factor of 4 with the side-effect of some additional search errors. We compare our approach with Moses and observe the same performance, but a substantially better trade-off between translation quality and speed. At a speed of roughly 70 words per second, Moses reaches 17.2% BLEU, whereas our approach yields 20.0% with identical models. © 2012 Association for Computational Linguistics.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

An energy-aware routing scheme based on a virtual relay tunnel in flying ad hoc networks

引用

Alexandria Engineering Journal 2024年 91卷 249-260页

作者： Hosseinzadeh, Mehdi Ali, Saqib Mohammed, Adil Hussein Lansky, Jan Mildeova, Stanislava Yousefpoor, Mohammad Sadegh Yousefpoor, Efat Hassan Ahmed, Omed Rahmani, Amir Masoud Mehmood, Asif Institute of Research and Development Duy Tan University Da Nang Viet Nam School of Medicine and Pharmacy Duy Tan University Da Nang Viet Nam Department of Information Systems College of Economics and Political Science Sultan Qaboos University Al Khoudh Muscat Oman Department of Communication and Computer Engineering Faculty of Engineering Cihan University-Erbil Kurdistan Region Iraq Department of Computer Science and Mathematics Faculty of Economic Studies University of Finance and Administration Prague Czech Republic Department of Computer Engineering Dezful Branch Islamic Azad University Dezful Iran Department of Information Technology University of Human Development Sulaymaniyah Iraq Future Technology Research Center National Yunlin University of Science and Technology Yunlin Taiwan Department of Biomedical Engineering Gachon University Gyeonggi-do Seongnam-si13120 Korea Republic of

Flying ad hoc networks (FANETs) tackle diverse challenges, for example, dynamic topological structure, high mobility of nodes, low density, and energy restrictions. These challenges make problems in designing reliable and stable routing in FANETs. Hence, the design of a routing algorithm is essential for transferring data between drones. In this paper, an energy-aware routing scheme based on a virtual relay tunnel (EARVRT) is proposed in flying ad hoc networks. EARVRT includes a virtual relay tunnel (VRT) that manages relay nodes in the route discovery process and lowers network overhead. Moreover, three metrics, namely route energy, hop counts, and a new metric called path correlation are regarded in the path selection operation. Note that correlation is defined with regard to two scales, including the cosine similarity of two nodes and their distance. EARVRT is evaluated according to delay, network longevity, consumed energy, and packet delivery rate. Then, our scheme is compared with three methods, namely LoCaL, O-LAR, and PSO-GLFR. These results show the superiority and success of EARVRT in comparison with other algorithms. © 2024 The Author(s)

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

Mobile Charger Planning for Wireless Rechargeable Sensor Network Based on Ant Colony Optimization 11th

Mobile Charger Planning for Wireless Rechargeable Sensor Net...

引用

11th International Conference on computer science and its Applications, CSA 2019 and 14th KIPS International Conference on Ubiquitous Information Technologies and Applications, CUTE 2019

作者： Tseng, Fan-Hsun Cho, Hsin-Hung Lai, Chin-Feng Department of Technology Application and Human Resource Development National Taiwan Normal University Taipei16010 Taiwan Department of Computer Science and Information Engineering National Ilan University Yilan26047 Taiwan Department of Engineering Science National Cheng Kung University Tainan70101 Taiwan

ISBN: (纸本)9789811593420

In order to provide a more flexible wireless rechargeable sensor network, a charger and a self-propelled vehicle are integrated into one vehicle in recent years. The path selection problem of mobile chargers can be formulated as the well-known travelling salesman problem. Therefore, metaheuristic algorithms can be applied to solve the planning problem of mobile chargers. Some researches presented planning methods based on the Simulated Annealing (SA) and Tabu Search (TS) algorithms but the results are not satisfied. In this paper, we not only design a novel encoding approach but also the fitness function for proposing an efficient planning algorithm based on the Ant Colony Optimization (ACO) algorithm. Simulation results show that the proposed ACO-based algorithm achieves a shorter planning path for a longer network lifetime compared with that generated by the SA and TS algorithms. © 2021, Springer Nature Singapore Pte Ltd.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

Multi-layered features with SVM for Chinese accent identification

Multi-layered features with SVM for Chinese accent identific...

引用

2010 International Conference on Audio, language and Image Processing, ICALIP 2010

作者： Hou, Jue Liu, Yi Zheng, Thomas Fang Olsen, Jesper Tian, Jilei Center for Speech and Language Technologies Division of Technology Innovation and Development Tsinghua National Laboratory for Information Science and Technology Beijing China Department of Computer Science and Technology Tsinghua University Beijing China Nokia Research Center Beijing China

ISBN: (纸本)9781424458653

In this paper, we propose an approach of multilayered feature combination associated with support vector machine (SVM) for Chinese accent identification. The multi-layered features include both segmental and suprasegmental information, such as MFCC and pitch contour, to capture the diversity of variations in Chinese accented speech. The pitch contour is estimated using cubic polynomial method to model the variant characters in different accents in Chinese. We train two GMM acoustic models in order to express the features of a certain accent. As the original criterion of the GMM model cannot deal with such multi-layered features, the SVM is utilized to make the decision. The effectiveness of the proposed approach was evaluated on the 863 Chinese accent corpus. Our approach yields a significant 10% relative error rate reduction compared with traditional approaches using sole feature at single level in Chinese accented speech identification. ©2010 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

A discriminative performance metric for GMM-UBM speaker identification

A discriminative performance metric for GMM-UBM speaker iden...

引用

作者： Dehzangi, Omid Ma, Bin Chng, Eng Siong Li, Haizhou School of Computer Engineering Nanyang Technological University Singapore Singapore Human Language Technology Department Institute for Infocomm Research A-STAR Singapore 138632 Singapore Department of Computer Science and Statistics University of Eastern Finland FI-80101 Joensuu Finland

Gaussian mixture modeling with universal background model (GMM-UBM) is a widely used method for speaker identification, where the GMM model is used to characterize a specific speaker's voice. The estimation of model parameters is generally performed based on the maximum likelihood (ML) or maximum a posteriori (MAP) criteria. In this way, interspeaker information that discriminates between different speakers is not taken into account. To overcome this limitation, we design a discriminative performance metric to capture interspeaker variabilities leading to improve the classification capability of speaker models. A learning algorithm is presented to tune the Gaussian mixture weights by optimizing the frame classification accuracy of GMM classifiers. We design an objective function to directly relate the model parameters to the performance metric. The comparative study of the proposed method is done with the basic GMM-UBM system on the 2001 NIST SRE corpus. Experimental results demonstrate that the proposed learning algorithm considerably improves the GMM-UBM system on speaker identification. © 2010 ISCA.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：