<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>BERT on Answer</title>
    <link>https://answer.freetools.me/tags/bert/</link>
    <description>Recent content in BERT on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Thu, 12 Mar 2026 10:59:23 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/bert/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Hidden State：Transformer如何在层层传递中「理解」语言</title>
      <link>https://answer.freetools.me/hidden-statetransformer%E5%A6%82%E4%BD%95%E5%9C%A8%E5%B1%82%E5%B1%82%E4%BC%A0%E9%80%92%E4%B8%AD%E7%90%86%E8%A7%A3%E8%AF%AD%E8%A8%80/</link>
      <pubDate>Thu, 12 Mar 2026 10:59:23 +0800</pubDate>
      <guid>https://answer.freetools.me/hidden-statetransformer%E5%A6%82%E4%BD%95%E5%9C%A8%E5%B1%82%E5%B1%82%E4%BC%A0%E9%80%92%E4%B8%AD%E7%90%86%E8%A7%A3%E8%AF%AD%E8%A8%80/</guid>
      <description>从Hidden State的数学定义出发，深入解析Transformer不同层如何编码词身份、句法结构和语义信息。涵盖BERT层级分析、Probing研究、Fine-tuning对表示的影响，以及如何有效利用中间层表示的完整技术全景。</description>
    </item>
    <item>
      <title>Transformer的权重共享：为什么一行代码能省下两亿参数</title>
      <link>https://answer.freetools.me/transformer%E7%9A%84%E6%9D%83%E9%87%8D%E5%85%B1%E4%BA%AB%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E8%83%BD%E7%9C%81%E4%B8%8B%E4%B8%A4%E4%BA%BF%E5%8F%82%E6%95%B0/</link>
      <pubDate>Thu, 12 Mar 2026 06:33:31 +0800</pubDate>
      <guid>https://answer.freetools.me/transformer%E7%9A%84%E6%9D%83%E9%87%8D%E5%85%B1%E4%BA%AB%E4%B8%BA%E4%BB%80%E4%B9%88%E4%B8%80%E8%A1%8C%E4%BB%A3%E7%A0%81%E8%83%BD%E7%9C%81%E4%B8%8B%E4%B8%A4%E4%BA%BF%E5%8F%82%E6%95%B0/</guid>
      <description>深入解析Transformer模型中输入嵌入层与输出层共享权重的技术原理，从直觉理解到数学推导，揭示这个看似简单的设计决策背后的深层逻辑。</description>
    </item>
    <item>
      <title>自注意力与交叉注意力：Transformer如何用两种机制处理「同一序列」与「两个世界」</title>
      <link>https://answer.freetools.me/%E8%87%AA%E6%B3%A8%E6%84%8F%E5%8A%9B%E4%B8%8E%E4%BA%A4%E5%8F%89%E6%B3%A8%E6%84%8F%E5%8A%9Btransformer%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%A4%E7%A7%8D%E6%9C%BA%E5%88%B6%E5%A4%84%E7%90%86%E5%90%8C%E4%B8%80%E5%BA%8F%E5%88%97%E4%B8%8E%E4%B8%A4%E4%B8%AA%E4%B8%96%E7%95%8C/</link>
      <pubDate>Thu, 12 Mar 2026 03:15:16 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%87%AA%E6%B3%A8%E6%84%8F%E5%8A%9B%E4%B8%8E%E4%BA%A4%E5%8F%89%E6%B3%A8%E6%84%8F%E5%8A%9Btransformer%E5%A6%82%E4%BD%95%E7%94%A8%E4%B8%A4%E7%A7%8D%E6%9C%BA%E5%88%B6%E5%A4%84%E7%90%86%E5%90%8C%E4%B8%80%E5%BA%8F%E5%88%97%E4%B8%8E%E4%B8%A4%E4%B8%AA%E4%B8%96%E7%95%8C/</guid>
      <description>深入解析Transformer中Self-Attention和Cross-Attention的技术原理、数学公式、历史演进与实际应用。从GPT的自回归生成到机器翻译的编码器-解码器架构，揭示这两种注意力机制如何塑造现代大模型的设计哲学。</description>
    </item>
    <item>
      <title>因果语言模型与掩码语言模型：两种预训练范式的本质差异</title>
      <link>https://answer.freetools.me/%E5%9B%A0%E6%9E%9C%E8%AF%AD%E8%A8%80%E6%A8%A1%E5%9E%8B%E4%B8%8E%E6%8E%A9%E7%A0%81%E8%AF%AD%E8%A8%80%E6%A8%A1%E5%9E%8B%E4%B8%A4%E7%A7%8D%E9%A2%84%E8%AE%AD%E7%BB%83%E8%8C%83%E5%BC%8F%E7%9A%84%E6%9C%AC%E8%B4%A8%E5%B7%AE%E5%BC%82/</link>
      <pubDate>Wed, 11 Mar 2026 21:12:01 +0800</pubDate>
      <guid>https://answer.freetools.me/%E5%9B%A0%E6%9E%9C%E8%AF%AD%E8%A8%80%E6%A8%A1%E5%9E%8B%E4%B8%8E%E6%8E%A9%E7%A0%81%E8%AF%AD%E8%A8%80%E6%A8%A1%E5%9E%8B%E4%B8%A4%E7%A7%8D%E9%A2%84%E8%AE%AD%E7%BB%83%E8%8C%83%E5%BC%8F%E7%9A%84%E6%9C%AC%E8%B4%A8%E5%B7%AE%E5%BC%82/</guid>
      <description>深度解析Transformer两大预训练范式：因果语言模型(CLM)与掩码语言模型(MLM)的工作原理、注意力机制差异、训练目标、应用场景对比，以及现代大模型为何普遍选择decoder-only架构</description>
    </item>
    <item>
      <title>一个字符的救赎：拼写检查如何在毫秒间从编辑距离走到深度学习</title>
      <link>https://answer.freetools.me/%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E7%9A%84%E6%95%91%E8%B5%8E%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%A6%82%E4%BD%95%E5%9C%A8%E6%AF%AB%E7%A7%92%E9%97%B4%E4%BB%8E%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB%E8%B5%B0%E5%88%B0%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/</link>
      <pubDate>Sat, 07 Mar 2026 11:02:09 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%80%E4%B8%AA%E5%AD%97%E7%AC%A6%E7%9A%84%E6%95%91%E8%B5%8E%E6%8B%BC%E5%86%99%E6%A3%80%E6%9F%A5%E5%A6%82%E4%BD%95%E5%9C%A8%E6%AF%AB%E7%A7%92%E9%97%B4%E4%BB%8E%E7%BC%96%E8%BE%91%E8%B7%9D%E7%A6%BB%E8%B5%B0%E5%88%B0%E6%B7%B1%E5%BA%A6%E5%AD%A6%E4%B9%A0/</guid>
      <description>深入解析拼写检查与自动更正的技术原理：从1961年第一个拼写检查器到现代AI驱动的上下文感知纠错。涵盖Levenshtein编辑距离、BK树、SymSpell算法、N-gram语言模型、BERT深度学习等核心技术，以及触摸屏空间模型、键盘邻近键误触等移动端特殊挑战。</description>
    </item>
  </channel>
</rss>
