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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

281 篇 会议
101 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

259 篇 工学
- 191 篇 计算机科学与技术...
- 176 篇 软件工程
- 66 篇 信息与通信工程
- 20 篇 机械工程
- 19 篇 生物工程
- 17 篇 控制科学与工程
- 14 篇 电气工程
- 14 篇 电子科学与技术（可...
- 10 篇 光学工程
- 9 篇 化学工程与技术
- 7 篇 生物医学工程（可授...
- 3 篇 仪器科学与技术
- 3 篇 动力工程及工程热...
- 2 篇 材料科学与工程（可...
- 2 篇 土木工程
163 篇 理学
- 109 篇 物理学
- 66 篇 数学
- 36 篇 统计学（可授理学、...
- 23 篇 生物学
- 20 篇 系统科学
- 10 篇 化学
- 1 篇 地球物理学
36 篇 管理学
- 26 篇 图书情报与档案管...
- 9 篇 管理科学与工程(可...
- 4 篇 工商管理
6 篇 法学
- 5 篇 社会学
- 1 篇 法学
2 篇 文学
- 2 篇 外国语言文学
- 1 篇 中国语言文学
1 篇 经济学
- 1 篇 应用经济学
1 篇 农学
1 篇 医学
1 篇 艺术学

主题

66 篇 speech recogniti...
40 篇 training
38 篇 hidden markov mo...
29 篇 neural machine t...
23 篇 machine translat...
20 篇 decoding
19 篇 handwriting reco...
18 篇 computer aided l...
16 篇 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...
38 篇 apptek gmbh aach...
32 篇 human language t...
31 篇 human language t...
23 篇 apptek gmbh aach...
21 篇 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...
6 篇 pattern recognit...
6 篇 human language t...
6 篇 human language t...
6 篇 human language t...
5 篇 a2ia sa

作者

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

语言

380 篇 英文
1 篇 西班牙文
1 篇 中文

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

共 382 条记录，以下是301-310 订阅

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

详细简洁

排序：

Using morpheme and syllable based sub-words for polish LVCSR

Using morpheme and syllable based sub-words for polish LVCSR

引用

36th IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2011

作者： Shaik, M. Ali Basha El-Desoky Mousa, Amr Schlüter, Ralf Ney, Hermann Human Language Technology and Pattern Recognition - Computer Science Department RWTH Aachen University 52056 Aachen Germany

ISBN: (纸本)9781457705397

Polish is a synthetic language with a high morpheme-per-word ratio. It makes use of a high degree of inflection leading to high out-of-vocabulary (OOV) rates, and high language Model (LM) perplexities. This poses a challenge for Large Vocabulary and Continuous Speech recognition (LVCSR) systems. Here, the use of morpheme and syllable based units is investigated for building sub-lexical LMs. A different type of sub-lexical units is proposed based on combining morphemic or syllabic units with corresponding pronunciations. Thereby, a set of grapheme-phoneme pairs called graphones are used for building LMs. A relative reduction of 3.5% in Word Error Rate (WER) is obtained with respect to a traditional system based on full-words. © 2011 IEEE.

关键词： Continuous speech recognition

来源：评论

学校读者我要写书评

暂无评论

Hybrid language models using mixed types of sub-lexical units for open vocabulary German LVCSR

Hybrid language models using mixed types of sub-lexical unit...

引用

12th Annual Conference of the International Speech Communication Association, INTERSPEECH 2011

作者： Ali Basha Shaik, M. El-Desoky Mousa, Amr Schlüter, Ralf Ney, Hermann Human Language Technology and Pattern Recognition Computer Science Department RWTH Aachen University 52056 Aachen Germany

German is a highly inflected language with a large number of words derived from the same root. It makes use of a high degree of word compounding leading to high Out-of-vocabulary (OOV) rates, and language Model (LM) perplexities. For such languages the use of sub-lexical units for Large Vocabulary Continuous Speech recognition (LVCSR) becomes a natural choice. In this paper, we investigate the use of mixed types of sub-lexical units in the same recognition lexicon. Namely, morphemic or syllabic units combined with pronunciations called graphones, normal graphemic morphemes or syllables along with full-words. This mixture of units is used for building hybrid LMs suitable for open vocabulary LVCSR where the system operates over an open, constantly changing vocabulary like in broadcast news, political debates, etc. A relative reduction of around 5.0% in Word Error Rate (WER) is obtained compared to a traditional full-words system. Moreover, around 40% of the OOVs are recognized. Copyright © 2011 ISCA.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Morpheme based Factored language Models for German LVCSR

Morpheme based Factored Language Models for German LVCSR

引用

12th Annual Conference of the International Speech Communication Association, INTERSPEECH 2011

作者： El-Desoky Mousa, Amr Ali Basha Shaik, M. Schlüter, Ralf Ney, Hermann Human Language Technology and Pattern Recognition Computer Science Department RWTH Aachen University 52056 Aachen Germany

German is a highly inflectional language, where a large number of words can be generated from the same root. It makes a liberal use of compounding leading to high Out-of-vocabulary (OOV) rates, and poor language Model (LM) probability estimates. Therefore, the use of morphemes for language modeling is considered a better choice for Large Vocabulary Continuous Speech recognition (LVCSR) than the full-words. Thereby, better lexical coverage and less LM perplexities are achieved. On the other side, the use of Factored language Models (FLMs) is considered a successful approach that allows the integration of many information sources to get better LM probability estimates. In this paper, we try a combined methodology for language modeling where both morphological decomposition and factored language modeling are used in one model called morpheme based FLM. Finally, we obtain around 2.5% relative reduction in Word Error Rate (WER) with respect to a traditional full-words system. Copyright © 2011 ISCA.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

The RWTH Aachen Machine Translation System for IWSLT 2011 8

The RWTH Aachen Machine Translation System for IWSLT 2011

引用

8th International Workshop on Spoken language Translation, IWSLT 2011

作者： Wuebker, Joern Huck, Matthias Mansour, Saab Freitag, Markus Feng, Minwei Peitz, Stephan Schmidt, Christoph Ney, Hermann Human Language Technology and Pattern Recognition Group Computer Science Department RWTH Aachen University Aachen Germany

In this paper the statistical machine translation (SMT) systems of RWTH Aachen University developed for the evaluation campaign of the International Workshop on Spoken language Translation (IWSLT) 2011 is presented. We participated in the MT (English-French, Arabic-English, Chinese-English) and SLT (English-French) tracks. Both hierarchical and phrase-based SMT decoders are applied. A number of different techniques are evaluated, including domain adaptation via monolingual and bilingual data selection, phrase training, different lexical smoothing methods, additional reordering models for the hierarchical system, various Arabic and Chinese segmentation methods, punctuation prediction for speech recognition output, and system combination. By application of these methods we can show considerable improvements over the respective baseline systems. © IWSLT 2011. All rights reserved.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Lightly-Supervised Training for Hierarchical Phrase-Based Machine Translation 1

Lightly-Supervised Training for Hierarchical Phrase-Based Ma...

引用

1st Workshop on Unsupervised Learning in NLP at the 2011 Conference on Empirical Methods in Natural language Processing, EMNLP 2011

作者： Huck, Matthias Vilar, David Stein, Daniel Ney, Hermann Human Language Technology and Pattern Recognition Group RWTH Aachen University Germany DFKI GmbH Berlin Germany

ISBN: (纸本)1937284131

In this paper we apply lightly-supervised training to a hierarchical phrase-based statistical machine translation system. We employ bitexts that have been built by automatically translating large amounts of monolingual data as additional parallel training corpora. We explore different ways of using this additional data to improve our system. Our results show that integrating a second translation model with only non-hierarchical phrases extracted from the automatically generated bitexts is a reasonable approach. The translation performance matches the result we achieve with a joint extraction on all training bitexts while the system is kept smaller due to a considerably lower overall number of phrases. © 2011 Association for Computational Linguistics

关键词： Computer aided language translation

来源：评论

学校读者我要写书评

暂无评论

Advancements in Arabic-to-English hierarchical machine translation

Advancements in Arabic-to-English hierarchical machine trans...

引用

15th International Conference of the European Association for Machine Translation, EAMT 2011

作者： Huck, Matthias Vilar, David Stein, Daniel Ney, Hermann Human Language Technology and Pattern Recognition Group RWTH Aachen University Germany DFKI GmbH Berlin Germany

ISBN: (纸本)9789081486118

In this paper we study several advanced techniques and models for Arabic-to-English statistical machine translation. We examine how the challenges imposed by this particular language pair and translation direction can be successfully tackled within the framework of hierarchical phrase-based translation. We extend the state-of-the-art with a novel cross-system and cross-paradigm lightlysupervised training approach. In addition, for following recently developed techniques we provide a concise review, an empirical evaluation, and an in-depth analysis: soft syntactic labels, a discriminative word lexicon model, additional reorderings, and shallow rules. We thus bring together complementary methods that previously have only been investigated in isolation and mostly on different language pairs. Combinations of the methods yield significant improvements over a baseline using a usual set of models. The resulting hierarchical systems perform competitive on the large-scale NIST Arabic-to-English translation task. © 2011 European Association for Machine Translation.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Soft String-to-Dependency Hierarchical Machine Translation 8

Soft String-to-Dependency Hierarchical Machine Translation

引用

8th International Workshop on Spoken language Translation, IWSLT 2011

作者： Peter, Jan-Thorsten Huck, Matthias Ney, Hermann Stein, Daniel Human Language Technology and Pattern Recognition Group RWTH Aachen University Aachen Germany Fraunhofer IAIS St. Augustin Germany

In this paper, we dissect the influence of several target-side dependency-based extensions to hierarchical machine translation, including a dependency language model (LM). We pursue a non-restrictive approach that does not prohibit the production of hypotheses with malformed dependency structures. Since many questions remained open from previous and related work, we offer in-depth analysis of the influence of the language model order, the impact of dependency-based restrictions on the search space, and the information to be gained from dependency tree building during decoding. The application of a non-restrictive approach together with an integrated dependency LM scoring is a novel contribution which yields significant improvements for two large-scale translation tasks for the language pairs Chinese-English and German-French. © IWSLT 2011. All rights reserved.

关键词： Machine translation

来源：评论

学校读者我要写书评

暂无评论

Warp that smile on your face: Optimal and smooth deformations for face recognition

Warp that smile on your face: Optimal and smooth deformation...

引用

作者： Gass, Tobias Pishchulin, Leonid Dreuw, Philippe Ney, Hermann Computer Vision Laboratory ETH Zurich Switzerland Computer Vision and Multimodal Computing MPI Informatics Saarbruecken Germany Human Language Technology and Pattern Recognition Group RWTH Aachen University Germany

ISBN: (纸本)9781424491407

In this work, we present novel warping algorithms for full 2D pixel-grid deformations for face recognition. Due to high variation in face appearance, face recognition is considered a very difficult task, especially if only a single reference image, for example a mug-shot, per face is available. Usually model-based approaches with additional training data are used to cope with several types of variation occurring in facial imaging. Image warping contrarily yields a distance measure which is invariant with regard to several types of variation. This allows for precise recognition even using only very few reference observations. Due to the computationally complex problem of optimal 2D warping, pseudo-2D warping-based approaches in the past represented strong approximations of the original problem, and were mainly successful on data with low variability or rectified images. We propose a novel 2D warping method which is globally optimal and makes no prior assumtions on the data variability besides two-dimensional smootheness constraints which both avoid local mirroring and gaps and significantly speed up the optimization. Furthermore, we show that occlusion handling is imperative to obtain smooth warpings in a variety of domains. We evaluate our novel algorithm on various well known databases, such as the AR-Face and CMU-PIE database, and provide a detailed comparison to existing warping approaches. We show that by using simple relative 2D constraints, strong local features and a kernel, which is robust w.r.t. occlusions, our computationally complex approaches outperform state-of-the-art results for recognizing faces under varying expressions, occlusions and poses. Most interestingly, we achieve higher accuracy using fewer training instances per class compared to methods learning a model of the 3D shape. © 2011 IEEE.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Using morpheme and syllable based sub-words for polish LVCSR

Using morpheme and syllable based sub-words for polish LVCSR

引用

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

作者： M. Ali Basha Shaik Amr El-Desoky Mousa Ralf Schlüter Hermann Ney Human Language Technology and Pattern Recognition RWTH Aachen University Aachen Germany

关键词： Vocabulary Speech recognition Speech Adaptation models Computational modeling Error analysis Joints

来源：评论

学校读者我要写书评

暂无评论

A convergence analysis of log-linear training and its application to speech recognition

A convergence analysis of log-linear training and its applic...

引用

IEEE Workshop on Automatic Speech recognition and Understanding

作者： S. Wiesler R. Schlüter H. Ney Human Language Technology and Pattern Recognition RWTH Aachen University of Technology Aachen Germany

Log-linear models are a promising approach for speech recognition. Typically, log-linear models are trained according to a strictly convex criterion. Optimization algorithms are guaranteed to converge to the unique global optimum of the objective function from any initialization. For large-scale applications, considerations in the limit of infinite iterations are not sufficient. We show that log-linear training can be a highly ill-conditioned optimization problem, resulting in extremely slow convergence. Conversely, the optimization problem can be preconditioned by feature transformations. Making use of our convergence analysis, we improve our log-linear speech recognition system and achieve a strong reduction of its training time. In addition, we validate our analysis on a continuous handwriting recognition task.

关键词： Hidden Markov models Training Optimization Convergence Speech recognition Eigenvalues and eigenfunctions Polynomials

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共39页 << < 27 28 29 30 31 32 33 34 35 36 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：