首页> 外国专利> Automatic analysis of written and spoken texts of a source language (shown here using the example of the German language) in terms of their linguistic-grammatical consistency, which is an improved starting point for translations into other languages

Automatic analysis of written and spoken texts of a source language (shown here using the example of the German language) in terms of their linguistic-grammatical consistency, which is an improved starting point for translations into other languages

机译:根据语言-语法的一致性自动分析源语言的书面和口头文本(此处以德语为示例),这是将其翻译成其他语言的一个改进的起点

摘要

For more than half a century, so-called computer linguists have been trying to make natural language (including their grammar, logic, etc.) mathematically calculable. H. To formalize natural language. The goal is necessary, but it is tackled as if apparatuses and computers could solving all the associated problems on their own. The experience since 1957 (Chomsky), if not even since 1887 (Frege), teaches the opposite. The natural languages must first of all be formalized with their own possibilities to their limits. Only then are they mathematics a little bit more equal and may take advantage of mathematics a few advantages. The most obvious way was that of us newly developed: 1) The vocabulary of a language aufzugleisen enough that only one sense per word (including new artificial word) exists and 2) from the beginning, almost as rigorously and rigorously as it is in analogue form K In his second "Incompleteness Theorem" with mathematical statements and statements, Goedel did all his own numbers to number all terms and words and new and old meanings! On this basis, it is shown in this patent invention that even natural language grammars can be analyzed so comprehensively and comprehensively (ie, including all words) that they can be easily edited with numbers and automatically do things through numerical algorithms that the computational linguists do have not even begun to get started with their alien and fragmentary machines. Among the useful applications are: 1) An automatic grammatical analysis of self-language texts that can be used as the basis for translation engines, 2) Contextual recognition using a specific word field, in which, among other things, meaningful words are closely interlinked and 3) a direct one Translational possibility in foreign languages, where it is less important to the grace and beauty of the language, but rather to a literal, reliable and individual one-to-one translation, as is highly necessary in technical professions. 4) Other side effects are context recognition and thus correct word choice in texts, automatic summaries of large amounts of text and a new kind of speech recognition.
机译:半个多世纪以来,所谓的计算机语言学家一直在努力使自然语言(包括其语法,逻辑等)在数学上可计算。 H.规范自然语言。这个目标是必要的,但可以解决,就好像设备和计算机可以自己解决所有相关问题一样。自1957年(乔姆斯基)以来的经验,甚至甚至没有自1887年(弗雷格)以来的经验,都相反。首先,自然语言必须以其自身的可能性加以形式化。只有这样,他们的数学才更加平等,并可以利用数学的一些优势。最明显的方式是我们新近开发的方式:1)aufzugleisen语言的词汇量足以使每个单词(包括新的人造单词)仅存在一种含义,并且2)从一开始就几乎与模拟中的一样严格和严格形式K在第二个带有数学陈述和陈述的“不完全性定理”中,Goedel用自己的数字对所有术语和单词以及新旧含义进行了编号!在此基础上,本专利发明表明,甚至可以对自然语言语法进行如此全面和全面的分析(即包括所有单词),以使它们可以轻松地用数字进行编辑,并通过计算语言学家所做的数值算法自动完成甚至还没有开始使用外星人和零碎的机器。有用的应用程序包括:1)可以用作翻译引擎基础的自动语言文本自动语法分析,2)使用特定单词字段的上下文识别,其中有意义的单词紧密地相互关联3)外语直接翻译的可能性,这对于语言的优美和优美不太重要,而对于字面,可靠和个性化的一对一翻译而言,这在技术专业中非常必要。 4)其他副作用包括上下文识别,因此可以正确选择文本中的单词,自动汇总大量文本以及提供新型的语音识别。

著录项

  • 公开/公告号DE102015017039A1

    专利类型

  • 公开/公告日2016-08-11

    原文格式PDF

  • 申请/专利权人 NIKOLAUS CASTELL;

    申请/专利号DE20151017039

  • 发明设计人 ERFINDER WIRD SPÄTER GENANNT WERDEN;

    申请日2015-12-29

  • 分类号G06F17/28;

  • 国家 DE

  • 入库时间 2022-08-21 14:09:34

相似文献

  • 专利
  • 外文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号