This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| { | |
| "A": "非謂形容詞", | |
| "Caa": "對等連接詞,如:和、跟", | |
| "Cab": "連接詞,如:等等", | |
| "Cba": "連接詞,如:的話", | |
| "Cbb": "關聯連接詞", | |
| "D": "副詞", | |
| "DE": "的,之,得,地", | |
| "Da": "數量副詞", | |
| "Dfa": "動詞前程度副詞", |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [('A', '非謂形容詞'), | |
| ('Caa', '對等連接詞,如:和、跟'), | |
| ('Cab', '連接詞,如:等等'), | |
| ('Cba', '連接詞,如:的話'), | |
| ('Cbaa', '關聯連接詞'), | |
| ('Cbba', '關聯連接詞'), | |
| ('Cbbb', '關聯連接詞'), | |
| ('Cbca', '關聯連接詞'), | |
| ('Cbcb', '關聯連接詞'), | |
| ('Daa', '數量副詞'), |
This file has been truncated, but you can view the full file.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| [{"place": [], "tokens": [{"label": "TIME", "index": 0, "pos": "Nd", "token": "今天"}, {"label": "O", "index": 1, "pos": "SHI", "token": "是"}, {"label": "PERSON", "index": 2, "pos": "Nb", "token": "俞"}, {"label": "PERSON", "index": 3, "pos": "Na", "token": "董事"}, {"label": "O", "index": 4, "pos": "Na", "token": "葬禮"}], "content": "今天是俞董事葬禮", "time": " 1944年(民33年,34歲) 10月7日 土 ", "participant": [{"index": 2, "token": "俞"}, {"index": 3, "token": "董事"}], "relative_time": [{"index": 0, "token": "今天"}]}, {"place": [{"index": 3, "token": "總理家"}, {"index": 46, "token": "公司"}], "tokens": [{"label": "TIME", "index": 0, "pos": "Nd", "token": "夜裡"}, {"label": "O", "index": 1, "pos": "P", "token": "在"}, {"label": "PERSON", "index": 2, "pos": "Nb", "token": "袁"}, {"label": "PLACE", "index": 3, "pos": "Nc", "token": "總理家"}, {"label": "O", "index": 4, "pos": "COMMACATEGORY", "token": ","}, {"label": "O", "index": 5, "pos": "VF", "token": "邀"}, {"label": "PERSON", "index": 6, "pos": "Nb", "token": "白川"}, {"label": "O", "index |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| 今天 雖是 中秋節 , 又 碰上 星期天 , 公司 仍 如常 上班 | |
| 過 了 下午 四點 , 帶 母親 、 肇嘉嫂 、 淑英 等 孩子們 到 天壇 遊覽 | |
| 晚上 七點 回到 辦公處 與 同僚 設宴 共祝 中秋 佳節 , 與 張 小姐 一同 賞月 , 閒談 四 年前 的 往事 | |
| 晚上 九點 用車 送 她 回去 , 並 帶 淑英 到京 屋家 拜訪 | |
| 晚上 把 橋本 君 叫來 辦公處 , 同沙 處長 、 王 課長 討論 水泥 定價 等 種種 事宜 |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| {'content': '過了下午四點,帶母親、肇嘉嫂、淑英等孩子們到天壇遊覽', | |
| 'participant': [], | |
| 'place': [], | |
| 'time': ' 1944年(民33年,34歲) 10月1日\u3000日 ', | |
| 'tokens': [{'index': 0, 'label': 'O', 'pos': 'VC1', 'token': '過'}, | |
| {'index': 1, 'label': 'O', 'pos': 'Di', 'token': '了'}, | |
| {'index': 2, 'label': 'O', 'pos': 'Ndabe', 'token': '下午'}, | |
| {'index': 3, 'label': 'O', 'pos': 'Ndabe', 'token': '四點'}, | |
| {'index': 4, 'label': 'O', 'pos': 'NN', 'token': ','}, | |
| {'index': 5, 'label': 'O', 'pos': 'VC32', 'token': '帶'}, |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # coding: utf-8 | |
| try: | |
| from .access_django import * | |
| except: | |
| from access_django import * | |
| import random | |
| from django.template import Context, Template | |
| from utils.nlg import * | |
| from utils.tagger import * | |
| from utils.query import * |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| function x = subset_sum(M,Sum) | |
| [~, n] = size(M); | |
| S = {0}; | |
| C = [0]; | |
| for i=1:n | |
| [~, sz] = size(S); | |
| ai = 1; | |
| for j = 1:sz | |
| arr = S{j}; | |
| if arr(1) + M(i) <= Sum && ~any(ismember(C, arr(1) + M(i))) |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Genoil's ethminer 0.9.41-genoil-1.1.6 | |
| ===================================================================== | |
| Forked from github.com/ethereum/cpp-ethereum | |
| CUDA kernel ported from Tim Hughes' OpenCL kernel | |
| With contributions from nicehash, nerdralph, RoBiK and sp_ | |
| Please consider a donation to: | |
| ETH: 0xeb9310b185455f863f526dab3d245809f6854b4d | |
| Usage ethminer [OPTIONS] |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <cstdio> | |
| #include <cstdlib> | |
| #include <cmath> | |
| #define MAX_N 100 | |
| #define MAX_M 32 | |
| void fuck(int gp[MAX_N][MAX_M], int fit_camel[MAX_N][2]){ | |
| int x1[MAX_N], x2[MAX_N]; | |
| for(int i = 0; i < MAX_N; i++){ | |
| x1[i] = 0; | |
| x2[i] = 0; |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| #include <stdio.h> | |
| #define MAX_N 10 | |
| #define MAX_M 10 | |
| void add_one(int s[MAX_N][MAX_M], int n, int m) { | |
| /* All elements in s will add one. */ | |
| int i, j; | |
| for(i = 0; i < n; i++) | |
| for(j = 0; j < m; j++) | |
| s[i][j] += 1; | |
| } |