TWI259379B - Computer executable word/phrase matching and inquiring system and method thereof - Google Patents

Abstract

The present invention relates to a computer executable word/phrase matching and inquiring system and method thereof. The system includes a database, a text recognition module, a determination module, an inquiring module, a spelling correction and fuzzy inquiring module, and an output module. The method determines whether the word/phrase to be searched pertains to a fully capitalized sentence or a sentence with a starting capitalized letter, and matches a suitable word/phrase in the database in accordance with a corresponding predetermined rule.

Description

1259379 Case No. 92136323 Λ_η Amendment 5, Invention Description (i) Technical Field of the Invention The present invention relates to a system and method for data processing, which can be applied to an electronic dictionary, in particular, by a judgment word/ The case of word capitalization for systems and methods for word/word matching and querying. [Prior Art] In general, there are many foreign words that are not recognized in the pictures displayed by the computer. These words are either single words or some words. For these words, the electronic dictionary (translation software) can be queried in order to understand its meaning and make up for the obstacles caused by insufficient language ability. In addition to providing word/word translation queries, the electronic dictionary provides a number of additional features, such as full-text translation, web page translation or instant translation... these additional features make translation faster and more convenient. Taking full-text translation as an example, it is characterized by being able to translate a large number of word capsules at a time, and organize them into meaningful sentences, eliminating the shortcomings of slowly searching one word and one word. Taking instant translation as an example, it is characterized by the convenience of operation. As long as the cursor is touched with the word/word to be queried on the face, a window is displayed and the translation of the word/word to be queried is displayed. Word-by-word input can be obtained by word-by-word input. For example, when a user opens an electronic file for reading a foreign language, in the past, when he encounters a foreign language that he does not know, he must read the foreign language word (word: the code to obtain the meaning of this foreign language, but read the word ( The dictionary is quite inconvenient and it takes a long time to query the new words. Therefore, the faster way to query is to use the electronic dictionary in the computer as an aid. Using the electronic dictionary to search for foreign words, you can get the words/words to be queried. The explanation of the word/word is quite convenient and fast. Although the electronic dictionary queries the word/word

1259379 / _ Case number 92136323_年月日日__ V. Invention description (2) The speed is quite fast, but it takes some time to input the word/word, which is a shortcoming place, so it is faster and more Convenient query methods are functions that are attached using an electronic dictionary, such as full-text translation, web page translation, or instant translation. Below we use instant translation as an example to illustrate how it works and what problems exist. As shown in "Figure 1," it is a flow chart for the operation of instant translation. When the instant translation function of the electronic dictionary is started, a word/word to be queried is retrieved according to the position of the cursor (step 1 0 0 ); and the selected word/word is matched with the database to query the query to be queried. Whether the word/word has an exact matchable word/word in the database (step 11 0 ); if an exact match word/word can be found in the database, the interpretation of the word/word to be queried is displayed ( Step 1 3 0); If no words/words that can be matched exactly are found in the database, perform spelling correction and fuzzy query (step 1 2 0), find a word to be queried in the database. The most approximate word/word of the word, then the interpretation of the most approximate word/word is displayed (step 1 3 0 ). Although the use of the instant translation function does not require keyboard input operations, the mouse can be used to search for a new word, but in some cases, the correct interpretation of the word/word to be queried may not be correctly displayed. For example, when the word/word to be queried appears at the beginning or the head of the sentence, it may appear in the first letter uppercase or the whole sentence uppercase, and some words/words are in uppercase and lowercase. Interpretation of different meanings. Inquiring such words/words in this situation will result in the words/words to be queried matching the database with incorrect translation results, and thus the results of the query that the user actually wants are not displayed. The following is a specific example. Let us take the frequently used word a s as an example. The uppercase A S has two explanations, namely M A n g 1 〇 -

Page 6 1259379 / _ Case No. 92136323_年月日日__ V. Description of invention (3)

Saxon" 9 is the "Anglo-Saxon" and "n an ti submar i ne", that is, "anti-submarine", and its lowercase as has a variety of explanations, such as, like, as, as, etc., its case translation The explanation is quite different. Therefore, when the entire sentence is capitalized or capitalized, for example, AS IT IS ... or A sitis..., etc., it should be translated in lowercase as the result of the translation, but the result of the word/word match, but The uppercase AS is used as the matching word/word, so the translation is not correct. Take A S I T I S as an example, because in the database you can find a word/word that exactly matches the AS, that is, an uppercase AS. Taking As i t i s as an example, although the word/word of an As cannot be exactly matched, the result of spelling correction and fuzzy query is that the matching word/word is AS instead of as. The above two situations will result in incorrect translation results, which is obviously not the result of the query that the user wishes to see. Similarly, this type of situation can also occur in other additional functions of the electronic dictionary, such as full-text translation, web page translation, and so on. SUMMARY OF THE INVENTION In view of the foregoing problems related to the additional functions of the electronic dictionary, the present invention provides a computer executable word/word matching and query system and method thereof, the main purpose of which is to determine the word to be queried by Whether the word belongs to the state in which the entire sentence is capitalized and whether it is capitalized, and then adopts appropriate correspondence rules to solve the problem that the words/words to be queried in the past are not correctly matched with the database, and the correct matching words/words and correctness are achieved. Show the purpose of its translation results. For example, when the word/word to be queried belongs to all uppercase characters, the corresponding rule for the word/word to be queried should first be queried in lowercase, and the lowercase form cannot be completely matched with the database.

1259379 / _ Case No. 92136323 牟 Month Day Amendment _ 5. Inventive Note (4), take other corresponding rules. Similarly, when the word/word to be queried is capitalized, the corresponding rule for the word/word to be queried should also be queried in lowercase. In order to achieve the above object, the computer executable word/word matching and query system and method thereof according to the present invention must first determine whether the word/word to be queried belongs to the state in which the entire sentence character is capitalized and capitalized, and then According to a predetermined query rule, an appropriate word/word is matched in the database, and the corresponding interpretation is the output translation result. The embodiments of the present invention are described as follows: [Embodiment] As shown in the "Fig. 2", it is a hardware and a hardware for a computer-executable word/word matching and query system. Architecture diagram. It is a computer system composed of an input device 2 1 , a central processing unit 22 and a video output device 23. The input device 2 1 can be a keyboard, a mouse, a digital tablet, a light pen, etc., and can operate a cursor generated on the screen, and the video output device 23 can also be a display interface such as a screen, a liquid crystal display screen, or a touch screen. A device for providing visual reception by a user. As shown in Figure 3, it is a system architecture diagram of a computer-executable word/word matching and query system and its method. It includes a database 3 required for maintaining the operation of the system, a recognition module 3 2, a determination module 3 3, a query module 34, a spell correction and fuzzy query module 35, and an output module 36. The modules described above are respectively described as follows: Database 3 1, which is a dictionary of words (words), which contains: word/word fields, providing rich words and words for inquiries; , providing a single

1259379 j more _ case number 92136323L - 曰I day correction _ five, invention description (5) the corresponding interpretation of words and words. The character recognition module 3 2 generates a word or word that can be queried by the word/word on the face, that is, after recognition, a word/word to be queried is generated. The determining module 3 3 determines whether the word/word to be queried belongs to the entire sentence, and then determines the corresponding corresponding rule. If the word/word to be queried belongs to the uppercase of the entire sentence, first query the word/word in the lowercase form, otherwise the original word/word should be queried first. When the original form of the word/word to be queried cannot be completely matched with the database, it is determined whether the word/word to be queried is capitalized, and then the corresponding corresponding rule is adopted, if the word/word to be queried is capitalized. , the query is in the lowercase form of the word/word to be queried, otherwise the spell correction and fuzzy query function are performed. The query module 3 4 matches the database 3 1 according to the corresponding rule of the determining module 3 3 , and generates a corresponding processing strategy according to the matching result. When the corresponding rule of the word/word to be queried completely matches the database, the processing strategy is to output the interpretation of the word/word to be queried; when the corresponding rule of the word/word to be queried cannot match the database, the processing There are two strategies, one is to judge whether the word/word to be queried is capitalized by the first letter, and then according to the corresponding rule; the other is to perform spelling correction and blurring when it is determined whether the word/word to be queried is capitalized. Query function. The spelling correction and fuzzy query module 35, the function of the module is to find a word/word closest to the word/word to be queried in the database 31, and output the corresponding interpretation as the query result. . There are two opportunities to perform spelling correction and fuzzy query module 35, one of which is the correspondence of words/words to be queried.

1259379 _ Case No. 92136323_年月日日__ V. Invention Description (6) When the rule and database 3 1 cannot match, the other is that the judgment module 3 3 judges that the word/word to be queried is not capitalized. The output module 3 6 is for outputting a translation result, which is to generate a view window and use the window to display the translation result. The information it outputs contains the corresponding words and their corresponding interpretations, that is, the interpretations shown can be the result of a complete match or the result of a fuzzy query.

A detailed flow chart of a system and method for computer-executable word/word matching and querying of the present invention, as shown in Fig. 4, is also a preferred embodiment of the present invention. The process is to retrieve a word/word to be queried (step 4 0 0 ); determine whether the word/word to be queried is all uppercase text (step 4 1 0 ), if the word/word to be queried belongs to the whole sentence If the text is all uppercase, it is queried in the lowercase form of the word/word to be queried (step 4 2 0); then it is judged whether there is an exact matching word/word in the database (step 4 3 0 ), if there is an exact match word / Word, then output its translation result (step 4 4 0 ); if there is no exact matching word / word, perform spelling correction and fuzzy query function, match a word/word closest to the word/word to be queried (step 4 5 0 ), and then output the translation result (step 4 4 0 ); if the word/word to be queried is not all uppercase text, the original word/word query of the word/word to be queried (step 4 6 0 ) Judging whether there is an exact matching word/word in the database (step 4 70), if there is an exact matching word/word, outputting the translation result (step 4 5 0 ); if there is no exact matching word/word, Then, it is determined whether the word/word to be queried is capitalized (step 4 80 0), if the query is to be queried Lowercase / uppercase headed word, the places to be queried word / word query (Step 420), otherwise the fuzzy query spelling correction function (step 450). The above is only the preferred embodiment of the present invention, and

Page 10 1259379 Case No. 92136323

1259379 Case No. 92136323 Yearly Correction Diagram Simple Explanation FIG. 1 is a flow chart of the instant translation operation; FIG. 2 is a hardware diagram of the system and method for computer executable word/word matching and query proposed by the present invention. FIG. 3 is a system architecture diagram of a system and method for computer-executable word/word matching and query according to the present invention; and FIG. 4 is a computer executable word/word matching proposed by the present invention. Detailed flow chart of the system with the query and its method. Schematic description 21 22 23 31 32 33 34 35 36 Step 1 0 0 Step 1 1 0 Step 1 2 0 Step 1 3 0 Step 4 0 0 Step 4 1 0 Input device central processing unit Video output device database text recognition mode Group judgment module query module spelling correction and fuzzy query module output module to retrieve the word/word to be queried. The word/word to be queried is completely matched with the database. Perform spelling correction and fuzzy query function to output translation results. The word/word to be queried determines whether the entire sentence is all uppercase

1259379

Case No. 92136323 ¥.............. Month Correction Schematic Brief Description Step 420 Query in lowercase form Step 430 Determine if the lowercase form is completely matched with the database Step 440 fm Out result Step 450 Perform spelling Correction and Fuzzy Query Function Step 460 Query in the original word/word form Step 47 0 Determine whether the original word/word form is completely matched with the database. Complete match Step 480 Determine whether the first letter is capitalized. Page 13

Claims (1)

1259379 _ Case No. 92136323 匕―21 .~..——琴一.,—日__ VI. Patent application scope 1. A computer executable word/word matching and query system, the system includes: a library that provides words/words and their corresponding explanations for query purposes; a text recognition module that, based on the text on the screen, is identified to generate a word/word to be queried; a judgment module, based on the query word / word letter case, determine a corresponding rule; f a query module to query whether there is a pair in the database A word/word that should be exactly matched by the rule; a spelling correction and fuzzy query module, when there is no word/word in the database that exactly matches the corresponding rule, to generate a word with the to-be-checked/ The most approximate word/word; and an output module for outputting the translation of the perfectly matched word/word and the translation of the most similar word/word. ::2. A computer-executable word/word matching and ~-query system as described in claim 1, wherein the determining module is a full-text uppercase writing module for determining the Whether the word/word to be queried belongs to the uppercase of the entire sentence to determine the corresponding rule. 3. A system for computer-implemented word/word matching and querying as described in claim 2, wherein the corresponding rule is a lowercase query, and the lowercase of the word/word to be queried is queried. 4. A system for computer-implemented word/word matching and querying as claimed in claim 2, wherein the corresponding rule is a original word/word query, Page 14 1259379 _ Case No. 92136323_Yearly 曰 Amendment _ VI. Patent Application Scope The original form of the word/word to be inquired. 5. The system of computer-executable word/word matching and query according to claim 1, wherein the determining module is an initial capitalization determining module for determining the word to be queried/ Whether the word is capitalized to determine the corresponding rule. 6. The system for computer-implemented word/word matching and query according to claim 5, wherein the corresponding rule is a lowercase query, and the lowercase form of the word/word to be queried is queried. 7. The system for computer-implemented word/word matching and query according to claim 5, wherein the corresponding rule is a spelling correction and a fuzzy query, and the spelling correction and fuzzy query module is executed at this time. 8. A computer executable word/word matching and query method, the method comprising the following steps: capturing a word/word to be queried; determining a word according to the judgment of the word/word letter of the to-be-queried Corresponding rules; according to whether the corresponding rule of the word/word to be queried completely matches a database, generating a corresponding processing strategy; When the corresponding rule cannot be completely matched with the database, performing a spelling correction and fuzzy query function, finding a word/word closest to the corresponding rule in the database; and outputting the exact match according to the result of the query The translation of the word/word with the translation of the most similar word/word. 9. Computer-executable word/word matching as described in item 8 of the patent application scope Page 15 1259379 _ Case No. 92136323_Yearly revision _ Sixth, the method of applying for patent scope and inquiry, wherein the letter case is judged to determine whether the word/word to be queried belongs to all uppercase characters to determine the corresponding rule. 1 . The method of computer-executable word/word matching and query according to claim 9, wherein the corresponding rule is a lowercase query, and the word/word is to be queried in a lowercase form. 1 1. The method for computer-implemented word/word matching and query according to claim 9, wherein the corresponding rule is a original word/word query, and the original form of the word/word to be queried Inquire. 1 2 . The method of computer-implemented word/word matching and query according to claim 8 , wherein the letter case is judged whether the word/word to be queried is capitalized, Decide on the corresponding rule. 1 . The method of computer-implemented word/word matching and query according to claim 12, wherein the corresponding rule is a lowercase query, and the lowercase form of the word/word to be queried is queried. 1 4. The method for computer-implemented word/word matching and query according to claim 12, wherein the corresponding rule is a spelling correction and a fuzzy query, and the spelling correction and fuzzy query function are performed. 1 5 . The method of computer-executable word/word matching and query according to claim 8 , wherein the processing strategy is to output the perfectly matched word/word and its interpretation. The corresponding rule of the word/word of the query exactly matches the database. 1 6. Computer-executable word/word matching as described in item 8 of the patent application scope Page 16 1259379 / _ Case No. 92136323_ Year Month 曰 Amendment _ 6. The method of applying for patent scope and inquiry, wherein the processing strategy is to determine whether the word/word to be queried is capitalized, which is to be The corresponding rule of the word/word of the query cannot be exactly matched with the database. 1 7 . The method of computer-implemented word/word matching and query according to claim 8 , wherein the processing strategy is to perform a spell correction and a fuzzy query function, and the word to be queried is/ The corresponding rule of the word cannot be completely matched with the database, and it has been determined whether the word/word to be queried is capitalized. Page 17 1259379 Page 3