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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

286 篇 会议
134 篇 期刊文献

馆藏范围

420 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

288 篇 工学
- 211 篇 计算机科学与技术...
- 191 篇 软件工程
- 74 篇 信息与通信工程
- 25 篇 机械工程
- 24 篇 生物工程
- 20 篇 电气工程
- 19 篇 电子科学与技术（可...
- 18 篇 控制科学与工程
- 13 篇 光学工程
- 10 篇 化学工程与技术
- 9 篇 生物医学工程（可授...
- 5 篇 仪器科学与技术
- 3 篇 动力工程及工程热...
- 3 篇 交通运输工程
- 2 篇 材料科学与工程（可...
178 篇 理学
- 119 篇 物理学
- 71 篇 数学
- 40 篇 统计学（可授理学、...
- 29 篇 生物学
- 20 篇 系统科学
- 11 篇 化学
40 篇 管理学
- 27 篇 图书情报与档案管...
- 12 篇 管理科学与工程(可...
- 5 篇 工商管理
8 篇 法学
- 7 篇 社会学
5 篇 文学
- 3 篇 外国语言文学
- 2 篇 中国语言文学
- 2 篇 新闻传播学
4 篇 医学
- 4 篇 临床医学
2 篇 经济学
- 2 篇 应用经济学
2 篇 农学
1 篇 艺术学

主题

70 篇 speech recogniti...
41 篇 hidden markov mo...
40 篇 training
30 篇 neural machine t...
23 篇 machine translat...
20 篇 decoding
19 篇 handwriting reco...
18 篇 computer aided l...
17 篇 recurrent neural...
15 篇 feature extracti...
15 篇 transducers
14 篇 vocabulary
12 篇 databases
12 篇 error analysis
11 篇 speech
10 篇 pattern recognit...
10 篇 humans
9 篇 training data
9 篇 optimization
9 篇 context

机构

52 篇 human language t...
40 篇 human language t...
37 篇 apptek gmbh aach...
32 篇 human language t...
31 篇 human language t...
23 篇 apptek gmbh aach...
20 篇 human language t...
16 篇 human language t...
13 篇 human language t...
12 篇 pattern recognit...
10 篇 human language t...
9 篇 spoken language ...
9 篇 human language t...
8 篇 computer science...
8 篇 human language t...
7 篇 pattern recognit...
6 篇 pattern recognit...
6 篇 human language t...
6 篇 human language t...
6 篇 human language t...

作者

210 篇 ney hermann
80 篇 hermann ney
61 篇 schlüter ralf
22 篇 ralf schluter
21 篇 ralf schlüter
19 篇 wuebker joern
18 篇 casacuberta fran...
18 篇 zeyer albert
17 篇 zhou wei
16 篇 gao yingbo
14 篇 kim yunsu
14 篇 herold christian
13 篇 mansour saab
13 篇 zeineldeen moham...
13 篇 patrick doetsch
12 篇 peris álvaro
12 篇 peter jan-thorst...
12 篇 michel wilfried
12 篇 peitz stephan
12 篇 huck matthias

语言

417 篇 英文
1 篇 西班牙文
1 篇 其他
1 篇 中文

检索条件"机构=Pattern Recognition and Human Language Technology Center"

共 420 条记录，以下是311-320 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Sequence Labeling-based Reordering Model for Phrase-based SMT 9

Sequence Labeling-based Reordering Model for Phrase-based SM...

引用

9th International Workshop on Spoken language Translation, IWSLT 2012

作者： Feng, Minwei Peter, Jan-Thorsten Ney, Hermann Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University Aachen Germany

For current statistical machine translation system, reordering is still a major problem for language pairs like Chinese-English, where the source and target language have significant word order differences. In this paper, we propose a novel reordering model based on sequence labeling techniques. Our model converts the reordering problem into a sequence labeling problem, i.e. a tagging task. For the given source sentence, we assign each source token a label which contains the reordering information for that token. We also design an unaligned word tag so that the unaligned word phenomenon is automatically implanted in the proposed model. Our reordering model is conditioned on the whole source sentence. Hence it is able to catch the long dependency in the source sentence. Although the learning on large scale task requests notably amounts of computational resources, the decoder makes use of the tagging information as soft constraints. Therefore, the training procedure of our model is computationally expensive for large task while in the test phase (during translation) our model is very efficient. We carried out experiments on five Chinese-English NIST tasks trained with BOLT data. Results show that our model improves the baseline system by 1.32 BLEU 1.53 TER on average. © IWSLT 2012. All rights reserved.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Non-Stationary Signal Processing and its Application in Speech recognition

Non-Stationary Signal Processing and its Application in Spee...

引用

2012 SAPA-SCALE Conference

作者： Tüske, Zoltán Drepper, Friedhelm R. Schlüter, Ralf Human Language Technology and Pattern Recognition Computer Science Department RWTH Aachen University Aachen52056 Germany

The most widely used acoustic feature extraction methods of current automatic speech recognition (ASR) systems are based on the assumption of stationarity. In this paper we extensively evaluate a recently introduced filter stable, non-stationary signal processing method, which relies on an adaptive part-tone decomposition of voiced speech to obtain alternative feature vectors for ASR. The non-stationary filterbank allows for more noise robust amplitude based features by suppressing the between-harmonics regions. Furthermore, by adapting the center filter frequencies to the underlying acoustic modes, it is possible to obtain useful phase features which can be interpreted in terms of the non-stationary dynamics within the vocal tract. The features are evaluated on different tasks ranging from vowel classification up to large vocabulary continuous speech recognition. © SAPA-SCALE 2012. All rights reserved.

关键词： Adaptive filters

来源：评论

学校读者我要写书评

暂无评论

The RWTH Aachen Machine Translation System for WMT 2012 7

The RWTH Aachen Machine Translation System for WMT 2012

引用

7th Workshop on Statistical Machine Translation, WMT 2012, immediately following the Conference of the North-American Chapter of the Association for Computational Linguistics - human language Technologies, NAACL HLT 2012

作者： Huck, Matthias Peitz, Stephan Freitag, Markus Nuhn, Malte Ney, Hermann Computer Science Department Human Language Technology And Pattern Recognition Group Rwth Aachen University AachenD-52056 Germany

ISBN: (纸本)9781937284206

This paper describes the statistical machine translation (SMT) systems developed at RWTH Aachen University for the translation task of the NAACL 2012 Seventh Workshop on Statistical Machine Translation (WMT 2012). We participated in the evaluation campaign for the French-English and German-English language pairs in both translation directions. Both hierarchical and phrase-based SMT systems are applied. A number of different techniques are evaluated, including an insertion model, different lexical smoothing methods, a discriminative reordering extension for the hierarchical system, reverse translation, and system combination. By application of these methods we achieve considerable improvements over the respective baseline systems. ©2012 Association for Computational Linguistics.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Insertion and deletion models for statistical machine translation

Insertion and deletion models for statistical machine transl...

引用

2012 Conference of the North American Chapter of the Association for Computational Linguistics: human language Technologies, NAACL HLT 2012

作者： Huck, Matthias Ney, Hermann Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University AachenD-52056 Germany

ISBN: (纸本)1937284204

We investigate insertion and deletion models for hierarchical phrase-based statistical machine translation. Insertion and deletion models are designed as a means to avoid the omission of content words in the hypotheses. In our case, they are implemented as phrase-level feature functions which count the number of inserted or deleted words. An English word is considered inserted or deleted based on lexical probabilities with the words on the foreign language side of the phrase. Related techniques have been employed before by Och et al. (2003) in an n-best reranking framework and by Mauser et al. (2006) and Zens (2008) in a standard phrase-based translation system. We propose novel thresholding methods in this work and study insertion and deletion features which are based on two different types of lexicon models. We give an extensive experimental evaluation of all these variants on the NIST Chinese → English translation task. © 2012 Association for Computational Linguistics.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Pivot lightly-supervised training for statistical machine translation 10

Pivot lightly-supervised training for statistical machine tr...

引用

10th Conference of the Association for Machine Translation in the Americas, AMTA 2012

作者： Huck, Matthias Ney, Hermann Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University AachenD-52056 Germany

In this paper, we investigate large-scale lightly-supervised training with a pivot language: We augment a baseline statistical machine translation (SMT) system that has been trained on human-generated parallel training corpora with large amounts of additional unsupervised parallel data;but instead of creating this synthetic data from monolingual source language data with the baseline system itself, or from target language data with a reverse system, we employ a parallel corpus of target language data and data in a pivot language. The pivot language data is automatically translated into the source language, resulting in a trilingual corpus with unsupervised source language side. We augment our baseline system with the unsupervised sourcetarget parallel data. Experiments are conducted for the German- French language pair using the standard WMT newstest sets for development and testing. We obtain the unsupervised data by translating the English side of the English-French 109 corpus to German. With careful system design, we are able to achieve improvements of up to +0.4 points BLEU / -0.7 points TER over the baseline.

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Leave-One-Out Phrase Model Training for Large-Scale Deployment 7

Leave-One-Out Phrase Model Training for Large-Scale Deployme...

引用

作者： Wuebker, Joern Hwang, Mei-Yuh Quirk, Chris Human Language Technology And Pattern Recognition Group Rwth Aachen University Germany Microsoft Corporation RedmondWA United States

ISBN: (纸本)9781937284206

Training the phrase table by force-aligning (FA) the training data with the reference translation has been shown to improve the phrasal translation quality while significantly reducing the phrase table size on medium sized tasks. We apply this procedure to several large-scale tasks, with the primary goal of reducing model sizes without sacrificing translation quality. To deal with the noise in the automatically crawled parallel training data, we introduce on-demand word deletions, insertions, and backoffs to achieve over 99% successful alignment rate. We also add heuristics to avoid any increase in OOV rates. We are able to reduce already heavily pruned baseline phrase tables by more than 50% with little to no degradation in quality and occasionally slight improvement, without any increase in OOVs. We further introduce two global scaling factors for re-estimation of the phrase table via posterior phrase alignment probabilities and a modified absolute discounting method that can be applied to fractional counts. ©2012 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Discriminative reordering extensions for hierarchical phrase-based machine translation 16

Discriminative reordering extensions for hierarchical phrase...

引用

16th Annual Conference of the European Association for Machine Translation, EAMT 2012

作者： Huck, Matthias Peitz, Stephan Freitag, Markus Ney, Hermann Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University AachenD-52056 Germany

In this paper, we propose novel extensions of hierarchical phrase-based systems with a discriminative lexicalized reordering model. We compare different feature sets for the discriminative reordering model and investigate combinations with three types of non-lexicalized reordering rules which are added to the hierarchical grammar in order to allow for more reordering flexibility during decoding. All extensions are evaluated in standard hierarchical setups as well as in setups where the hierarchical recursion depth is restricted. We achieve improvements of up to +1.2 %BLEU on a large-scale Chinese→English translation task. © 2012 European Association for Machine Translation.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Conditional leaving-one-out and cross-validation for discount estimation in Kneser-Ney-like extensions

Conditional leaving-one-out and cross-validation for discoun...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： J. Andrés-Ferrer M. Sundermeyer H. Ney Pattern Recognition and Human Language Technology Universidad Politécnica de Valencia Spain Human Language Technology and Pattern Recognition RWTH Aachen University Germany

The smoothing of n-gram models is a core technique in language modelling (LM). Modified Kneser-Ney (mKN) ranges among one of the best smoothing techniques. This technique discounts a fixed quantity from the observed counts in order to approximate the Turing-Good (TG) counts. Despite the TG counts optimise the leaving-one-out (L1O) criterion, the discounting parameters introduced in mKN do not. Moreover, the approximation to the TG counts for large counts is heavily simplified. In this work, both ideas are addressed: the estimation of the discounting parameters by L1O and better functional forms to approximate larger TG counts. The L1O performance is compared with cross-validation (CV) and mKN baseline in two large vocabulary tasks.

关键词： Smoothing methods Approximation methods Standards Optimization Estimation Computational modeling Training

来源：评论

学校读者我要写书评

暂无评论

Semantic cohesion model for phrase-based SMT

Semantic cohesion model for phrase-based SMT

引用

24th International Conference on Computational Linguistics, COLING 2012

作者： Feng, Minwei Sun, Weiwei Ney, Hermann Computer Science Department Human Language Technology and Pattern Recognition Group RWTH Aachen University Aachen Germany MOE Key Laboratory of Computational Linguistics Institute of Computer Science and Technology Peking University Beijing China

In this paper, we propose a novel semantic cohesion model. Our model utilizes the predicateargument structures as soft constraints and plays the role as a reordering model in the phrasebased statistical machine translation system. We build a translation system with GALE data. Experimental results on the NIST02, NIST03, NIST04, NIST05 and NIST08 Chinese-English tasks show that our model improves the baseline system by 0.93 BLEU 0.98 TER on average. We also compare our method with a syntax-augmented model (Cherry, 2008), and demonstrate the importance of predicate-argument semantics in machine translation. © 2012 The COLING.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共42页 << < 28 29 30 31 32 33 34 35 36 37 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：