[16.06.14] Auto Correction for Mobile TypingHyeonmin Park
This document summarizes research on algorithms for mobile typing auto-correction. It discusses Nota Keyboard, which aims to prevent typing errors by widening key recognition areas. It also discusses SwiftKey, which uses natural language processing and a noisy channel model to detect and correct typing errors on a contextual basis after text has been entered. The document reviews machine learning techniques like supervised and semi-supervised learning used for auto-correction and the clustering algorithm and language models applied by SwiftKey.
[16.06.14] Auto Correction for Mobile TypingHyeonmin Park
This document summarizes research on algorithms for mobile typing auto-correction. It discusses Nota Keyboard, which aims to prevent typing errors by widening key recognition areas. It also discusses SwiftKey, which uses natural language processing and a noisy channel model to detect and correct typing errors on a contextual basis after text has been entered. The document reviews machine learning techniques like supervised and semi-supervised learning used for auto-correction and the clustering algorithm and language models applied by SwiftKey.
This document introduces the characters in a story about a teleporting machine error. The main characters are:
1) Lassy, a heroic officer who patrols the teleporting machine and tries to manage issues, but has no real power.
2) Professor Venus, a villainous scientist who creates a virus and plays games where the goal is to spread a plague. She finds risks with the teleporting machine.
3) Terry, the villainous supporter who is the authoritative boss focused on company benefits. He ignores Lassy's reports.
The document discusses solving a tiling puzzle problem using dynamic programming and the inclusion-exclusion principle. It describes tracking the state as the last full column and its mask. It also explains that trying to attach dominoes in four directions counts some solutions multiple times, so inclusion-exclusion is needed for the four directions. Finally, it mentions the maximum number of movable tiles is 1, so simple inclusion-exclusion can be used.
This document introduces the characters in a story about a teleporting machine error. The main characters are:
1) Lassy, a heroic officer who patrols the teleporting machine and tries to manage issues, but has no real power.
2) Professor Venus, a villainous scientist who creates a virus and plays games where the goal is to spread a plague. She finds risks with the teleporting machine.
3) Terry, the villainous supporter who is the authoritative boss focused on company benefits. He ignores Lassy's reports.
The document discusses solving a tiling puzzle problem using dynamic programming and the inclusion-exclusion principle. It describes tracking the state as the last full column and its mask. It also explains that trying to attach dominoes in four directions counts some solutions multiple times, so inclusion-exclusion is needed for the four directions. Finally, it mentions the maximum number of movable tiles is 1, so simple inclusion-exclusion can be used.
18. 결합의 종류 (Cont.)
단일 결합 : σ-결합 1개
이중 결합 : σ-결합 1개, 𝜋-결합 1개
삼중 결합 : σ-결합 1개, 𝜋-결합 2개
사중 결합 : σ-결합 1개, 𝜋-결합 2개, δ-결합 1개
오중 결합 : σ-결합 1개, 𝜋-결합 2개, δ-결합 2개
육중 결합 : σ-결합 1개, 𝜋-결합 2개, δ-결합 3개
18
19. 19
정리
원자가결합 이론에서는 원자가껍질의 원자
오비탈에 있는 홀전자가 짝을 이루어 결합을
형성한다. 원자 오비탈이 머리까지 겹치면
σ-결합을, 옆으로 겹치면 𝜋-결합을 형성한다.