Encoder takes an input sequence and create a contextualized representation of it, then passed to a decoder which generates a task-specific output sequence.
The Rust Programming Language Brief Note (Vol1-Basic)
- 1 Getting Started
- 3 Common Concepts
- 4 Understanding Ownership
- 5 Using Structs to Structure Related Data
- 6 Enums and Pattern Matching
- 8 Common Collections
- 8-1 Storing Lists of Values with Vectors
- 8-2 Storing UTF-8 Encoded Text with Strings
- 8-3 Storing Keys with Associated Values in Hash Maps
- 9 Error Handling
- 10 Generic Types, Traits, and Lifetimes
- 10-1 Generic Data Types
- 10-2 Traits Defining Shared Behavior
- 10-3 Validating References with Lifetimes
- 10-3-1 Preventing Dangling References with Lifetimes
- 10-3-2 The Borrow Checker
- 10-3-3 Generic Lifetimes in Functions
- 10-3-4 Lifetime Annotation Syntax
- 10-3-5 Lifetime Annotations in Function Signatures
- 10-3-6 Thinking in Terms of Lifetimes
- 10-3-7 Lifetime Annotations in Struct Definitions
- 10-3-8 Lifetime Elision
- 10-3-9 Lifetime Annotations in Method Definitions
- 10-3-10 The Static Lifetime
- 10-4 Generic Type Parameters Trait Bounds and Lifetimes Together
- 11 Writing Automated Tests
- 18 Patterns and Matching
- 18-1 All the Places Patterns Can Be Used
- 18-2 Refutability Whether a Pattern Might Fail to Match
- 18-3 Pattern Syntax
1 | $ cargo new proj |
The Rust Programming Language Brief Note (Vol2-Manage)
- 7 Managing Growing Projects with Packages Crates and Modules
- 14 More About Cargo and Crates io
- 14-1 Customizing Builds with Release Profiles
- 14-2 Publishing a Crate to Crates io
- 14-2-1 Making Useful Documentation Comments
- 14-2-2 Exporting a Convenient Public API with
pub use - 14-2-3 Setting Up a Crates io Account
- 14-2-4 Adding Metadata to a New Crate
- 14-2-5 Publishing to Crates io
- 14-2-6 Publishing a New Version of an Existing Crate
- 14-2-7 Removing Versions from Crates.io with
cargo yank
- 14-3 Cargo Workspaces
- 14-4 Installing Binaries from Crates io with
cargo install - 14-5 Extending Cargo with Custom Commands
In addition to grouping functionality, encapsulating implementation details lets you reuse code at a higher level: once you’ve implemented an operation, other code can call that code via the code’s public interface without knowing how the implementation works. The way you write code defines which parts are public for other code to use and which parts are private implementation details that you reserve the right to change. This is another way to limit the amount of detail you have to keep in your head.
- Packages: A Cargo feature that lets you build, test, and share crates
- Crates: A tree of modules that produces a library or executable
- Modules and use: Let you control the organization, scope, and privacy of paths
- Paths: A way of naming an item, such as a struct, function, or module
Neural Architectures for Named Entity Recognition 论文笔记
Paper: 1603.01360.pdf
code:
核心思想:pretrained + character-based 词表示分别学习形态和拼写,Bi-LSTM + CRF 和基于转移的模型均可以对输出标签的依赖关系建模。
看了 Related Work 后发现很多想法其实早就冒出来了,不同的论文在不同点上使用了不同的方法,本篇恰好用这样的方法取得了最好的效果。其实,我觉得更加有意思的是基于转移的模型,它构建了一个 action 的时间序列,感觉更加抽象,想法更加精妙。
Rust Tutorial
The Rust Programming Language
Recently, I have read The Rust Programming Language book which is really a comprehensive combination. I prefer to write some brief note when I am reading a book, just for times of reviews in the future. Here is the same.
剑指 Offer2(Python 版)解析(Ch3)
具体实现和测试代码:
系列解析(TBD):
- Python 单例模式
- 好玩儿的 DP
- 递归还是递归
- 双指针的威力
- 双列表的威力
- 有趣的排列组合
特别说明:下文中的实例代码一般仅包括核心算法(不一定能直接运行),完整代码可以参考对应的链接。
剑指 Offer2(Python 版)解析(Ch2)
具体实现和测试代码:
系列解析(TBD):
- Python 单例模式
- 好玩儿的 DP
- 递归还是递归
- 双指针的威力
- 双列表的威力
- 有趣的排列组合
特别说明:下文中的实例代码一般仅包括核心算法(不一定能直接运行),完整代码可以参考对应的链接。
剑指 Offer2(Python 版)解析(Ch4)
具体实现和测试代码:
系列解析(TBD):
- Python 单例模式
- 好玩儿的 DP
- 递归还是递归
- 双指针的威力
- 双列表的威力
- 有趣的排列组合
特别说明:下文中的实例代码一般仅包括核心算法(不一定能直接运行),完整代码可以参考对应的链接。
剑指 Offer2(Python 版)解析(Ch6)
- 第六章:面试中的各项能力
- 面试题 53(一):数字在排序数组中出现的次数
- 面试题 53(二):0 到 n-1 中缺失的数字
- 面试题 53(三):数组中数值和下标相等的元素
- 面试题 53(四):数组中数值只出现一次的数
- 面试题 54:二叉搜索树的第 k 大节点
- 面试题 55(一):二叉树的深度
- 面试题 55(二):平衡二叉树
- 面试题 56(一):数组中只出现一次的两个数字
- 面试题 56(二):数组中唯一只出现一次的数字
- 面试题 57(一):和为 s 的两个数字
- 面试题 57(二):和为 s 的连续正数序列
- 面试题 58(一):翻转单词顺序
- 面试题 58(二):左旋转字符串
- 面试题 59(一):滑动窗口的最大值
- 面试题 59(二):队列的最大值
- 面试题 60:n 个骰子的点数
- 面试题 61:扑克牌的顺子
- 面试题 62:圆圈中最后剩下的数字
- 面试题 63:股票的最大利润
- 面试题 64:求 1 到 n 之和
- 面试题 65:不用加减乘除做加法
- 面试题 66:构建乘积数组
- 面试案例
具体实现和测试代码:
系列解析(TBD):
- Python 单例模式
- 好玩儿的 DP
- 递归还是递归
- 双指针的威力
- 双列表的威力
- 有趣的排列组合
特别说明:下文中的实例代码一般仅包括核心算法(不一定能直接运行),完整代码可以参考对应的链接。
剑指 Offer2(Python 版)解析(Ch5)
具体实现和测试代码:
系列解析(TBD):
- Python 单例模式
- 好玩儿的 DP
- 递归还是递归
- 双指针的威力
- 双列表的威力
- 有趣的排列组合
特别说明:下文中的实例代码一般仅包括核心算法(不一定能直接运行),完整代码可以参考对应的链接。