200937228 九、發明說明： 【發明所屬之技術領域】 本發明係關於一種快速關鍵字取得之方法，尤指一種 適用於電子裝置之快速關鍵字取得之方法。 5 【先前技術】200937228 IX. Description of the Invention: [Technical Field] The present invention relates to a method for obtaining a fast keyword, and more particularly to a method for fast keyword acquisition for an electronic device. 5 [Prior technology]
10 15 ❹ 一般而言，在使用導航系統、手持式電腦、個人數位 助理等電子裝置時，常需要輸入例如關鍵字之資料以進行 搜尋或編輯等作業，且為顧及一般使用者使用之方便性， 因此均會使用到廣為人知之注音輸入法以取得使用者需要 的關鍵字，然而以注音輸入法輸入關鍵字之缺失在於需要 按下極多之按鍵才能得到一個字的輸入，因此，當以注音 輸入法取得關鍵字時，若其關鍵字的長度較短，則尚可^ 使用者所接受，但是如果關鍵字的長度長達6〜1〇個字，則 對使用者將造成大之負擔，例如，如果要取得關鍵字「中 正二路」，由於「中正二路」的注音符號組合為「”虫乂厶,，，， 虫人、””几、””力乂、’’」，以—般的注音輸人法，則要輸 入11個符號做字的選取4次，才能得到「中正二路」，因此 傳統的注音輸入要耗費的時間甚多，實不符合實際之需求。 市面上智慧型注音輸入法雖然也是藉由開頭注音符號 來取字詞，但是取得的字詞卻是設計者主觀認定的常用字 而非使用者想要的關鍵字，因此使用者輸入了注音符號後 將會取得一大堆字詞，其中交雜的關鍵字與常用字，對使 用者要選取關鍵字反而多添困擾，加上關鍵字的長度越 20 200937228 長’使用者也輸入相同長度的數量的開頭注音符號才能夠 取得關鍵字，明顯的比較麻煩，而有予以改進之必要。 【發明内容】 5 ❹ 10 15 ❹ 本發明之目的在於提供一快速關鍵字取得系統及方 法，其能簡化注音輸入法之步驟，以增加系統搜尋之速度， 以及能減少使用者之選取關鍵字之困擾，以減少選取^麻 須。 依據本發明之一特色，本發明提出一種快速關鍵字取 得之系統’其包括：—關鍵字資料庫，包括有多數個關鍵 字及該等關鍵字之關鍵字編號，該等關鍵字係為道路、設 施以及景點名稱；一有限狀態機，其具有多數個狀態，每 一狀態具有一狀態編號，該等狀態相對應有至少一為道 路、設施以及景點名稱之關鍵字；以及一鏈結檔，用以鏈 結該等狀態編號及所有對應該等狀態編號之關鍵字的關鍵 子編號，其中，該有限狀態機之狀態編號相對應於該鍵結 標中之狀態編號，該鍵結播之每一個狀態編號包括有至少 一關鍵字編號’該等關鍵字編號對應該關鍵字資料庫之關 鍵字。 依據本發明之另一特色，本發明提出一種用於電子裝 置之快速關鍵字取得之方法，該電子裝置包括有一包含有 多數個關鍵字及該等關鍵字之關鍵字編號的關鍵字資料 庫、一具有多數個狀態之有限狀態機、及一鏈結檔，該有 限狀態機之每一狀態具有一狀態編號，該等狀態係對應有 20 200937228 5 Ο 10 15 Θ 20 至少一為道路、設施以及景點名稱之關鍵字，該鏈結檔係 鍵結該等狀態編號及所有對應該等狀態編號之關鍵字的關 鍵字編號’該方法包括步驟：（Α)輸入至少一個開頭注音 符號給該有限狀態機；（Β)藉由有限狀態機得到該等開頭 注音符號對應的狀態，並藉由此狀態之狀態編號從該鏈結 檔取得對應之關鍵字編號；以及（C)藉由該鏈結檔之關鍵 字編號以從關鍵字資料庫取出對應的關鍵字，以供選取之。 以本發明之快速關鍵字取得系統及方法可有效簡化注 音輸入法之步驟，例如，只需輸入「虫虫儿灼」給系統後， 即可取出「中正二路、中洲二路、珍珠二路、中正二路車 行地下道」等四筆資料，再做一次的選取動作（即從四種 路名選取一樣），比較起傳統的注音輸入而言，只需要輸 入4個符號再做一次的動作選取即可，如果要取得的關鍵字 网為「中正二路車行地下道」，那麼便可在此時直接選取 出來’同樣也只需要輸入4個符號再做選取動作1次即可。 【實施方式】 有關本發明之快速關鍵字取得之系統及方法，係用於一 導航裒置、手持式電腦、個人數位助理等電子裝置中，以 供使用者藉由輸入注音符號而快速找到所需要之關鍵字， 請先參照圖1所示為建構本發明之快速關鍵字取得之系統 的不意圖’其先建造一儲存關鍵字詞的關鍵字資料庫U， 其關鍵字資料庫11包括有例如全台灣的道路名稱、設施名 稱、以及景點名稱等等關鍵字，如圖所示，該等關鍵字名 7 200937228 稱包括有”勹女门猴園” 、”丁 一丫補日式涮涮鍋，，、” 九號橋”、 五號橋”…等等，係依注音符號次 序及筆畫次序而依編號（1，2,3…）排列記錄於關鍵字資料 庫11中》 5 ❿ 10 15 Ο 接著，將上述全台灣的道路、設施、以及景點名稱之關鍵 干利用 Windows API(Application Programming Interface)或 其他等效方式轉換成注音符號之關鍵字，並且將關鍵字之 每個字的注音符號的開頭注音選取出來，以形成一開頭注 音符號組合資料庫12。例如’ ”勹女门狼園”轉換成，，勹 女门厂U” ，” 丁一 丫補日式涮涮鍋”轉換成，，丁 一丫勹g 尸尸尸《，’…等等，依此類推。 接著，將開頭注音符號組合資料庫12中的關鍵字重新 排列’其依照注音符號的順序及字串長度遞增方式而排 列，例如，開頭為，，勹”之關鍵字為起始，接著為，，勺 勺”勺勹勹勹勺一虫”，一直到”勹，，開頭 的關鍵字排序完後，緊接著再由，，女，，開頭的關鍵字依序 排列，以致於完成整個開頭注音符號順序排列的資料庫。 再來，將開頭注音符號組合資料庫12中關鍵字具有重 複出現的開頭注音符號刪除，使具有相同注音符號之道 號、^施及景點名稱之關鍵字對應單一的開頭注音符號， 且將開頭注音符號組合資料庫12中不連續段補足，以形成 連續遞增之排序排列之NFA(Non-deterministic finite automata)開頭注音符號組合資料庫丨3，例如，”勹勺勺” 和勹勹勹Μ —虫”之間為不連續段，在，，勹勹勹”和，， 20 200937228 勹勹勹Μ —史”之間補上”勹勺勹q，，和”勹勹勹Μ -’，’使得”勺”，，和，，” Κ，之間能夠形成 一連續段》 接著，該NFA開頭注音符號組合資料庫13使用非決定 5 性的有限自動機（Non_deterministiC finite aut〇mata, NFA)取 得關鍵字群的演算法，以形成一有限狀態機14，此nfa技 術讓取得關鍵字的演算法所需的時間能夠大為減少，而其 有限狀態機14包括有多數個狀態141，該多數個狀態141各 有其狀態編號（0，1，2,3，...），在有限狀態機14中，以〇為起始 10狀態編號，狀態編號之間藉由開頭注音符號相互連接，^ 如’狀態編號0和狀態編號1之間以開頭注音符號，，勺，，連 接’狀態編號1和狀態編號2之間以開頭注音符號，，勺，，連 接，以此類推，狀態編號5和狀態編號6之間即為由開頭注 音符號”生”連接。 15 另外，本發明之系統更包括有一鍵結檔15，此鍵結檔 15用以鏈結狀態編號及所有對應狀態編號之關鍵字的^鍵 ® 干編號，因此，結合有限狀態機14和鍵結槽15而言，當使 用者輸入”勺勺”時，有限狀態機14會由狀態編號〇到^態 編號1，再由狀態編號1到狀態編號2,若使用者僅輸入兩個 開頭注音符號，此時，系統將連接到鍵結播15的狀態編號2 中，而鏈結權15中的狀態编號2包括有所有開頭注音符號前 兩碼符合”勹勹”的所有關鍵字的關鍵字編號，再將這些 關鍵字供使用者選取之用，若繼續再輸入其他的開頭注音 符號’系統將會再依據使用者輸入的結果至相對應的狀態 9 200937228 編號，以連接到相符合關鍵字的關鍵字編號，以供使用 者選取之用’若狀態編號輸入之開頭注音符號無連結關 係，狀態將維持在原來的狀態編號，例如，使用^輸入” 勹” Η :後’再輸入，，勹”，因為，，”〜，後之後 並沒有和）有連結關係，因此，狀態將維持在狀 號4。10 15 ❹ In general, when using electronic devices such as navigation systems, handheld computers, and personal digital assistants, it is often necessary to input information such as keywords for searching or editing, and to facilitate the convenience of general users. Therefore, the well-known phonetic input method is used to obtain the keywords that the user needs. However, the lack of inputting keywords by the phonetic input method requires that a large number of buttons need to be pressed to obtain a word input. Therefore, when the phonetic transcription is used, When the input method obtains a keyword, if the length of the keyword is short, it is acceptable to the user, but if the length of the keyword is as long as 6 to 1 〇, the user will be burdened. For example, if you want to get the keyword "Zhongzheng Erlu", because the phonetic symbol combination of "Zhongzheng Erlu" is ""worm,,,,,,,,,,,,,,,,, For the general phonetic input method, you need to input 11 symbols to select the word 4 times in order to get the "Zhongzheng 2nd Road". Therefore, the traditional phonetic input takes a lot of time, which does not match. The actual demand. Although the smart phonetic input method on the market also uses the initial phonetic symbols to take words, the words obtained are the common words that the designer subjectively identifies, rather than the keywords that the user wants, so the user inputs the phonetic symbols. After that, a lot of words will be obtained, in which the mixed keywords and common words will be more troublesome for the user to select the keywords, and the length of the keywords is 20 200937228 long 'users also input the same length It is obviously more troublesome to get the keywords in the beginning of the number of phonetic symbols, and there is a need to improve them. SUMMARY OF THE INVENTION 5 ❹ 10 15 ❹ The object of the present invention is to provide a fast keyword acquisition system and method, which can simplify the steps of the phonetic input method, thereby increasing the speed of system search and reducing the user's selected keywords. Troubled to reduce the selection of ^ whiskers. According to a feature of the present invention, the present invention provides a system for rapid keyword acquisition, which includes: a keyword database including a plurality of keywords and keyword numbers of the keywords, the keywords being roads , facility and attraction name; a finite state machine having a plurality of states, each state having a state number corresponding to at least one of a keyword for a road, facility, and attraction name; and a link file, a key sub-number for linking the status numbers and all the keywords corresponding to the status numbers, wherein the state number of the finite state machine corresponds to the status number in the key binding, and the key is broadcasted A status number includes at least one keyword number 'the keywords corresponding to the keyword database. According to another feature of the present invention, the present invention provides a method for fast keyword acquisition of an electronic device, the electronic device including a keyword database including a plurality of keywords and keyword numbers of the keywords, a finite state machine having a plurality of states, and a link file, each state of the finite state machine having a state number corresponding to 20 200937228 5 Ο 10 15 Θ 20 at least one for roads, facilities, and The keyword of the name of the attraction, the link file is a key number that links the status number and all keywords corresponding to the status number. The method includes the steps of: (Α) inputting at least one initial phonetic symbol to the limited state (Β) obtaining a state corresponding to the first phonetic symbols by a finite state machine, and obtaining a corresponding keyword number from the link file by the state number of the state; and (C) by the link file The keyword number is used to retrieve the corresponding keyword from the keyword database for selection. The fast keyword acquisition system and method of the present invention can effectively simplify the steps of the phonetic input method. For example, after inputting the "bugs and insects" to the system, the "Zhongzheng Erlu, Zhongzhou 2nd Road, and Pearl 2 Road can be taken out. "Zhongzheng Er Road Car Road Underground Road" and other four pieces of information, and then do a selection action (that is, the same from the four road names), compared to the traditional phonetic input, only need to input 4 symbols and do another action Select it. If the keyword network to be acquired is "Zhongzheng Erlu Road Underground Road", you can directly select it at this time. 'You only need to input 4 symbols and do the selection action once. [Embodiment] The system and method for obtaining a quick keyword according to the present invention are used in an electronic device such as a navigation device, a handheld computer, a personal digital assistant, etc., for the user to quickly find a place by inputting a phonetic symbol. For the keywords that need, please refer to FIG. 1 for the purpose of constructing the system of the quick keyword acquisition of the present invention. First, a keyword database U for storing keyword words is constructed. The keyword database 11 includes For example, the names of road names, facility names, and scenic spots in Taiwan are as shown in the figure. These keyword names 7 200937228 are said to include "勹女门猴园" and "丁一丫补日式涮涮" Pot,,, "No. 9 Bridge", No. 5 Bridge, etc., are recorded in the Keyword Library 11 according to the number (1, 2, 3...) according to the sequence of phonetic symbols and the order of strokes. 5 ❿ 10 15 Ο Next, use the Windows API (Application Programming Interface) or other equivalent method to convert the key words of the above-mentioned roads, facilities, and attractions in Taiwan into the phonetic symbols. At the beginning of each word phonetic alphabet phonetic select the keyword out to form a beginning note sound symbol combination database 12. For example, ' 勹 门 门 狼 园 ” ” 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换 转换Next, the keywords in the first phonetic symbol combination database 12 are rearranged 'in accordance with the order of the phonetic symbols and the string length incrementing manner, for example, the beginning of the key, the key of the 勹" is the start. , and then, the spoon spoon "spoon spoon", until "勹,, after the beginning of the keyword sorting, followed by,, female,, the beginning of the keywords are arranged in order, so that Complete the database in which the entire phonetic symbol is arranged in order. Next, delete the initial phonetic symbol with the repeated occurrence of the keyword in the initial phonetic symbol combination database 12, so that the key number of the same phonetic symbol, the key to the name of the attraction and the name of the attraction are The word corresponds to a single initial phonetic symbol, and the discontinuous segments in the initial phonetic symbol combination database 12 are complemented to form a NFA (Non-deterministic finite automata) initial phonetic symbol group. The database 丨3, for example, between the "scissor spoon" and the cockroach-worm" is a discontinuous segment, between, 勹勹勹",,, 20 200937228 勹勹勹Μ - history" "勹 勹 , q,, and "勹勹勹Μ - ', '使" spoon",, and, " Κ, can form a continuous segment between" Then, the NFA beginning phonetic symbol combination database 13 uses non-determination The 5 finite automaton (Non_deterministiC finite aut〇mata, NFA) obtains the algorithm of the keyword group to form a finite state machine 14, and the nfa technology can greatly reduce the time required to obtain the keyword algorithm. The finite state machine 14 includes a plurality of states 141 each having its state number (0, 1, 2, 3, ...), and in the finite state machine 14, starting with 〇 10 The status number, the status number is connected to each other by the first phonetic symbol, ^ such as the beginning of the phonetic symbol between the status number 0 and the status number 1, the spoon, the connection between the status number 1 and the status number 2 to start with the phonetic Symbol, spoon, connection, and so on, state 5 and the state number 6 is connected by the first phonetic symbol "sheng". 15 In addition, the system of the present invention further includes a key binding file 15 for the link state number and all corresponding state numbers. The ^ key ® of the keyword is dry numbered. Therefore, in combination with the finite state machine 14 and the keying slot 15, when the user inputs the "spoon", the finite state machine 14 will be numbered from the state number to the state number 1, and then From state number 1 to state number 2, if the user inputs only two initial phonetic symbols, the system will be connected to the status number 2 of the key connection 15 at this time, and the status number 2 in the link weight 15 includes All the first two phonetic symbols with the first two codes match the keyword number of "勹勹", and then these keywords are used by the user for selection. If you continue to input other initial phonetic symbols, the system will be based on the user. The result is input to the corresponding state 9 200937228 number to connect to the keyword number of the matching keyword, for the user to select, if the state phone number is entered, the phonetic symbol is not connected, and the state will be dimensioned. Hold the original status number, for example, use ^ input "勹" Η: after 're-enter, 勹', because, "~, after and after and there is a connection relationship, therefore, the status will remain in the status code 4.
10 1510 15
圖2進一步顯示本發明之快速關鍵字取得之方法，其首 先輸入至少一個開頭注音符號給有限狀態機14(步驟 sioi);其次，藉由有限狀態機14得到開頭注音符號對應的 狀態141 ,並藉由此狀態141之狀態編號從鏈結檔15取得對 應之關鍵字編號（步驟S102);最後，藉由鏈結檔15之關鍵字 編號以從關鍵字資料庫11取出對應的關鍵字，以供選取之 (步驟S103)。例如，如圖3A所示，為導航系統2用之快速關 鍵子取得之系統畫面，畫面最上端依序而下為使用者選取 的關鍵字21、系統取出的全部符合條件之關鍵字22、使用 者輸入的注音符號23、以及提供給使用者輸入的鍵盤24, 首先使用者在輸入的鍵盤24輸入，，史虫儿，，後，系統取出 的全部符合條件之關鍵字，即在系統取出的全部符合條件 之關鍵字22處顯示了「中正二分局」（如圖3B所示）以及其 他符合之關鍵字，再來，使用者再輸入，，力”後，即把不 符合之關鍵字移除，僅留下相符合之關鍵字，如圖3C所示， 在系統取出的全部符合條件之關鍵字22處僅只剩下「中正 二路」、「中正二路車.·」、「中洲二路」、以及「珍珠 二路」4筆資料，使用者再選取所要的關鍵字，而使用者在 20 200937228 輸入每一個注音符號後系統即可馬上取出相關之關鍵字， 既使在未做速度最佳化的情況下’選取關鍵字所耗費的時 在0.5秒左右，大幅提升了選取的速度。 5 ❹ 10 上述實施例僅係為了方便說明而舉例而已，本發明所 主張之權利範圍自應以申請專利範圍所述為準，而非僅限 於上述實施例。 【圖式簡單說明】 圖1係本發明之系統架構圖。 圖2係本發明之流程圖。 圖3 A、3B及3C係本發明一實施例之系統裝置畫面圖。 【主要元件符號說明】 關鍵字資料庫11 開頭注音符號組合資料庫i 2 NFA開頭注音符號組合資料庫13 〇 有限狀態機14 鏈結檔15 導航系統2 選取的關鍵字21 系統取出的全部符合條件之關鍵字22 輸入的注音符號23 輸入的鍵盤24 步驟S101〜S103 狀態141 112 further illustrates the method of fast keyword acquisition of the present invention, which first inputs at least one initial phonetic symbol to the finite state machine 14 (step sioi); secondly, the finite state machine 14 obtains the state 141 corresponding to the first phonetic symbol, and The corresponding keyword number is obtained from the link file 15 by the state number of the state 141 (step S102); finally, the corresponding keyword is retrieved from the keyword database 11 by the keyword number of the link file 15 to It is selected (step S103). For example, as shown in FIG. 3A, for the system screen obtained by the quick key of the navigation system 2, the topmost end of the screen is the keyword 21 selected by the user, and all the keywords that are extracted by the system are used. 22 The phonetic symbol 23 input by the user, and the keyboard 24 provided to the user input, first input by the user on the input keyboard 24, the history of the insect, and then all the keywords that are taken out by the system are taken out in the system. All the eligible keywords 22 show "Zhongzheng Second Branch" (as shown in Figure 3B) and other matching keywords, and then the user re-enters, after the force, the non-conforming keywords are moved In addition, only the matching keywords are left. As shown in Figure 3C, only the "Zhongzheng Erlu", "Zhongzheng Erlu..", and "Zhongzhou II" are left in all the keywords 22 that are taken out of the system. 4" and "Pearl 2" data, the user selects the desired keyword, and the user can immediately retrieve the relevant keyword after entering each phonetic symbol in 20 200937228, even if not In the case of speed optimization, the time taken to select a keyword is about 0.5 seconds, which greatly increases the speed of selection. 5 ❹ 10 The above embodiments are merely examples for convenience of description, and the scope of the claims is intended to be limited to the above embodiments. BRIEF DESCRIPTION OF THE DRAWINGS Fig. 1 is a system architecture diagram of the present invention. Figure 2 is a flow chart of the present invention. 3, 3B and 3C are screen views of a system apparatus according to an embodiment of the present invention. [Key component symbol description] Keyword database 11 Beginning phonetic symbol combination database i 2 NFA beginning phonetic symbol combination database 13 〇Limited state machine 14 Link file 15 Navigation system 2 Selected keyword 21 All the conditions that the system takes out are eligible Keyword 22 Input phonetic symbol 23 Input keyboard 24 Steps S101 to S103 Status 141 11