知识卡片
有限状态模型按状态和输入推进
有限状态机用有限状态及输入触发的转移描述行为;有限状态转导器还可产生输出。规则匹配和受控交互可用这种思路组织,但任意if树不等于足够描述所有文本程序,程序返回字符串也不自动证明它是有限状态转导。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- · 查看原书依据
When you type something like, “Good morning Rosa,” a computer sees only, “01000111 01101111 01101111 … .” How can you program a chatbot to respond to this binary stream intelligently? Could a nested tree of conditionals (if-else statements) check each of those bits and act on them individually? This would be equivalent to writing a special kind of program called a finite state machine (FSM).
参考来源
- 位置:《Natural Language Processing in Action, Second Edition》第01章《会读写的机器与自然语言处理》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Natural Language Processing in Action, Second Edition/_epub-src/OEBPS/Text/chapter-1.html)
- 结论依据:摘录中关于有限状态模型按状态和输入推进的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:When you type something like, “Good morning Rosa,” a computer sees only, “01000111 01101111 01101111 … .” How can you program a chatbot to respond to this binary stream intelligently? Could a nested tree of conditionals (if-else statements) check each of those bits and act on them individually? This would be equivalent to writing a special kind of program called a finite state machine (FSM).