失败的它回到自动语言识别码的技术。
Failing that, it falls back to automatic language identification technology.
一个统计语言识别系统一般采用移自动语言识别三角洲系数(议会)功能。
A statistical language recognition system generally USES shifted delta coefficient (SDC) feature for automatic language recognition.
如果未指定语言，系统会在编校过程中自动识别它。
If the language is not specified, the system identifies it automatically during the redaction process.
若能有一种方式可以自动识别用户在网上冲浪时偏好使用的语言和国家，岂不很棒。
Wouldn't it be nice if there was a way to automatically tell what languages and countries a user preferred as they surfed the web.
另外一个潜在的功能是通过对文档做一些状态分析，自动识别文档的语言……针对这些功能，我们会提供一些补丁。
Another potential feature is automatically determining what language a document is by doing some statistical analysis on.
尽管自动文本语言翻译目前相当有效，语音识别还是十分具有挑战性的。
Although automatic text translators are now reasonably effective, voice recognition has proved more challenging.
本文基于形式语言与自动机理论，主要对钢筋标识串的自动识别进行了研究。
Based on the formal language and automaton theory, this paper mainly studies the automatic recognition of steel character symbol.
该文根据自动机的定义，对超级自动机作了特定的定义，并给出了自动机对语言的识别功能的具体步骤。
Finally, its function of identifying language and solving logic problems is discussed by a special example based on the definition of super automata.
本文提出了时间树自动机识别语言的一个条件，并证明了结论的正确性。
This paper proposes a condition of timed tree automata recognizing language, proves the correctness of its.
正规集是对许多语言理论起核心作用的一类语言，研究正规集的性质有助于有限态文法的文法推断和句法分析的研究以及正规集的自动识别。
The study of properties ofregular sets is useful to grammar inference and syntax analyses for finite-state grammars such that regular languages can be recognized automatically.
在本文中，我们提出了一种统一的统计语言模型方法用来汉语自动分词和中文命名实体识别，这种方法对基于词的三元语言模型进行了很好的扩展。
In this paper, we extend a word-based trigram modeling to Chinese word segmentation and Chinese named entity recognition, by proposing a unified approach to SLM.
由于唇动序列和语言序列是一对多的映射，计算机自动唇读识别仅使用HMM是远远不够的。
Since lip movement sequence and language sequence are one-to-many mapping, it is far from sufficiency to use only HMM for lip-reading recognition.
从正则语言识别的角度证明了正则语言的识别系统确定有限自动机所识别的语言集是一个递归可枚举集，同时讨论了正则语言的可递归性。
The theorem that the language set distinguished deterministic finite automaton is a recursively enumerable set was proved, and then, the recursiveness of regular language was analyzed.
它可以通过手机相机识别某一标识、书籍或者其他物体上的文本，并自动将其翻译成选择的语言。
It lets you point your mobile device's camera at a sign, book or other object with text on it and watch as that text is automatically translated into the language of your choice.
通过系统的多语种化模块，能够自动识别客户端的默认语言并反馈给客户端相应语言的网页。
According to the MultilingualModel, it can automatically identify the language at the end of client and reflect related language webpage to client.
通过系统的多语种化模块，能够自动识别客户端的默认语言并反馈给客户端相应语言的网页。
According to the MultilingualModel, it can automatically identify the language at the end of client and reflect related language webpage to client.
应用推荐