TW200521725A - 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

200521725 V. Description of the invention (1) [Technical field to which the invention belongs] The present invention is a system and method related to data processing, which is applied to an electronic dictionary, especially a case of judging the case of a word / word, System and method for word / word matching and query. [Previous technology] Generally, there are many unknown foreign language characters in the day and time displayed on the computer. Some of these characters are single words and some are phrases. For these words, you can query electronic dictionaries (translation software) to understand their meaning and make up for the obstacles caused by insufficient language skills. In addition to providing query translation of words / words, the electronic dictionary also provides many additional functions, such as full-text translation, web page translation or instant translation, etc. These additional functions make translation faster and more convenient. Taking full text translation as an example, its feature is that it can translate a large number of words at a time, and organize them into meaningful sentences, eliminating the disadvantage of slowly querying word by word. Taking real-time translation as an example, its feature is convenient in operation. As long as the cursor is in contact with the word / word to be searched on the day, a window will be displayed to show the translation of the word / word to be searched. The user does not need to Word-by-word input can get the transliteration of words / words. For example, when a user opens an electronic document in a foreign language and reads it, in the past, when he encountered a new word in a foreign language that he did n’t recognize, he had to read the dictionary of the foreign language word to get The meaning of this word in a foreign language, however, it is quite inconvenient to look through the dictionary (word dictionary) and the time it takes to look up the word is relatively fast, so the faster way of searching is to use the electronic dictionary in the computer as an aid. Use the electronic dictionary to look up new words in foreign languages, just enter the word / word to be queried to get the relevant word / word

Page 5 200521725 V. Explanation of invention description (2) is quite convenient and fast. Although the processing speed of e-dictionary query words / words is quite fast, it still takes some time to input the words / words, which is the disadvantage of the United States. Therefore, the faster and more convenient query method is to use the additional functions of the e-dictionary , Such as full-text translation, web page translation or instant translation ... etc. Below we take instant translation as an example to explain how it works and its problems. As shown in "Figure 1", it is a flowchart of real-time translation operation. When the real-time translation function of the electronic dictionary is activated, a word / word to be queried is retrieved according to the cursor position (step 1 0 0); and the retrieved word / word is matched with the database to query the query Whether the word / word has an exact match in the database (step 1 1 0); if an exact match is found in the database, the explanation of the word / word to be queried is displayed (Step 1 3 0); if no words / words that can be exactly matched are found in the database, perform spell correction and fuzzy query (step 1 2 0), find a word in the database that is to be queried / Word The most similar word / word, and then the explanation of this closest word / word is displayed (step 1 3 0). Although the use of the instant translation function does not require keyboard input operation, and the mouse can be used to complete the query of new words, in some cases, the correct interpretation of the word / word to be queried may not be displayed correctly. For example, when the word / word to be queried appears at the beginning of a sentence or the title line, it may appear as the first letter or the whole sentence, and some words / words may have uppercase and lowercase forms. Explanations of different meanings. In this case, querying such words / words will cause the words / words to be queried to match the database with incorrect translation results, so the displayed query results are not what the user actually wants.

Page 6 200521725 V. Description of the invention (3) The following uses specific examples as illustrations. We take the frequently used single word as an example. There are two interpretations of the capital AS, which are n Anglo-Saxon11, that is, "Panglu "Saxons" and "n antisubmarine", that is, "anti-submarine"; its lowercase as has a variety of interpretations, such as, like, act, as, etc., the interpretation of uppercase and lowercase is completely different. Therefore, when the entire sentence is capitalized or the first letter is capitalized, for example, in the case of AS IT IS… or As it is…, the translation result should be “as” in lower case. However, it will use the uppercase AS as the matching word / word, so the translation will be incorrect. Take AS I T I S as an example, because you can find a word / word that exactly matches AS in the database, that is, the capital AS. Taking As i ΐ i s as an example, although it cannot completely match a word / word of A s, after the result of spell correction and fuzzy query, the matched word / word is A S, not a s. The above two situations will cause incorrect translation results to be output, which is obviously not the query result that the user wants to see. Similarly, this type of situation may also occur in other additional functions of electronic dictionaries, such as full-text translation, web page translation, etc. [Summary of the Invention] In view of the foregoing problems with the additional functions of the electronic dictionary, the present invention proposes a computer-executable system of word / word matching and query and a method thereof, the main purpose of which is to determine the word / query to be queried by Whether the word belongs to the entire sentence and the capitalization of the entire sentence, and then adopt appropriate correspondence rules to resolve the situation where the word / word to be queried in the past does not match the database correctly, and to achieve a correct match display

Page 7 200521725 V. Description of the invention (4) The purpose of the translation result. For example, when the word / word to be queried belongs to the entire sentence, the corresponding rules adopted for the word / word to be queried should be queried in its lower case first, and then taken when the lower case cannot completely match the database. Other corresponding rules. Similarly, when the word / word to be queried is capitalized, the corresponding rules adopted for the word / word to be queried should also be queried in its lower case first. In order to achieve the above object, the computer-executable word / word matching and query system and method provided by the present invention must first determine whether the word / word to be queried belongs to the state of the entire sentence full-capitalization and capitalization, and then According to a predetermined query rule, a suitable word / word is matched in the database, and the corresponding interpretation is used as the output translation result. Regarding specific and feasible implementation modes of the present invention, the following is described with reference to the drawings: [Embodiment Mode] As shown in "Figure 2", it is a computer-executable word / word matching and query system and method hardware Architecture diagram. It is a computer system with an input device 21, a central processing unit 22, and a video output device 23. The input device 21 can be a keyboard, a mouse, a tablet, a light pen, etc., and can operate cursors generated on the day. The video output device 2 3 can also be a display such as a screen, a liquid crystal display, a touch screen, etc. An interface for providing a device for users to receive visually. As shown in Figure 3, it is a system architecture diagram of a computer-executable word / word matching and query system and method. It contains the database needed to maintain the system's operation 3 Character recognition module 3 2, Judgment module 3 3, Query module

Page 8 200521725 V. Description of the invention (5) 3 4. Spell correction and fuzzy query module 35 and output module 36. Each module mentioned above is described separately as follows: Database 31 is a word (dictionary) dictionary database, which contains: word / word fields, providing a wealth of words and words for querying; explaining stops , Providing explanations of words and words. The character recognition module 3 2 is used to extract the words / words on the day to generate a single word or word for query, that is, to generate a word / word to be queried after recognition. The judging module 33 judges whether the word / word to be queried belongs to the entire sentence and all capitals, and then determines the corresponding corresponding rule. If the word / word to be queried belongs to the entire sentence, all words are capitalized, then the word / word in lower case is searched first; otherwise, the word / word in the original form is searched first. When the original form of the word / word to be queried does not exactly match the database, determine whether the word / word to be queried is capitalized, and then adopt the corresponding rules. If the word / word to be queried is capitalized , Query in the lowercase form of the word / word to be queried, otherwise perform spell correction and fuzzy query functions. The query module 34 is matched with the database 31 according to the corresponding rules of the judgment module 33, and a corresponding processing strategy is generated according to the matching result. When the corresponding rule of the word / word to be queried exactly matches the database, the processing strategy is to output an explanation of the word / word to be queried; when the corresponding rule of the word / word to be queried does not match the database, it processes it There are two strategies. One is to determine whether the word / word to be queried is capitalized and then query according to its corresponding rule; the other is to determine whether the word / word to be queried is capitalized.

Page 9 200521725 V. Description of the invention (6) Write, then perform spell correction and fuzzy query functions. Spell correction and fuzzy query module 35. The function of this module is to find a word / word most similar to the word / word to be queried in database 3 1 and output the corresponding interpretation as the query result. . There are two timings for performing spell correction and fuzzy query module 35. One is when the corresponding rule of the word / word to be searched cannot match with the database 31, and the other is the judgment module 3 3 When the word / word is not capitalized. The output module 36 is used to output the translation result, which is to generate a window and use this window to display the translation result. The output information includes the corresponding words and their corresponding interpretations, that is, the displayed interpretations can be the result of an exact match or the result of a fuzzy query. As shown in "Figure 4", it is a detailed flowchart of the computer-executable word / word matching and query system and method of the present invention, as well as the 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 the entire sentence in all capitals (step 4 1 0), and if the word / word to be queried belongs to the entire sentence If the text is all uppercase, query in the lower case of the word / word to be queried (step 4 2 0); then determine whether there is an exact match word / word in the database (step 4 3 0), and if there is an exact match word / Words, then output the translation result (step 4 4 0); if there is no exact match, execute spell correction and fuzzy query functions to match a word / word that is closest to the word / word to be queried (step 4 5 0), and then output its translation result (step 4 4 0); if the word / word to be queried is not the entire sentence text in all capitals, the original word / word of the word / word to be queried is searched (step 4 6 0) To determine whether there are any exact words / words in the database (step 4 7 0)

Page 10 200521725 V. Description of the invention (7) Word / word, then output the translation result (step 4 50); if there is no exact match word, determine whether the word / word to be queried is capitalized (step 4 8 0)? If the word / word to be queried is capitalized, query in the lower case of the word / word to be queried (step 4 2 0); otherwise, perform spell correction and modal query functions (step 4 5 0 ). The above are only the preferred embodiments of the present invention, and are not intended to limit the scope of implementation of the present invention; that is, all equivalent changes and modifications made in accordance with the scope of the patent application for the present invention are covered by the scope of the patent for the present invention .

Page 11 200521725 Brief description of the diagram. The first diagram is a flowchart of the real-time translation operation. The second diagram is the hardware architecture diagram of the computer-executable word / word matching and query system and method mentioned in the present invention. FIG. 3 is a system architecture diagram of a computer-executable word / word matching and query system and method according to the present invention; and FIG. 4 is a computer-executable word / word matching and query system and method according to the present invention. Detailed flowchart of system and method. Graphic symbol 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 spell correction and fuzzy query module output module retrieves the words / words to be queried to query whether the words / words to be queried exactly match the database. Performs spell correction and fuzzy query functions to output translation results. The word / word to be queried to determine whether the entire sentence is in all capitals

Page 12 200521725 Brief description of the diagram Step 420 Query in lower case Step 430 Determine whether the lower case matches the database completely Step 440 Output result Step 450 Perform spell correction and fuzzy query function Step 460 Query in original word / word form Step 470 Judgment Does the original word / word form exactly match the database? Exactly match Step 480: Determine whether the letters are capitalized

Page 13

Claims (1)

200521725 6. Scope of patent application 1. A computer-executable word / word matching and querying system, the system includes: a database that provides explanations of words / words and their corresponding for querying; a text recognition module According to the text on the screen, a word / word to be queried is generated after identification; a judgment module determines a corresponding rule according to the case of the word / word to be queried; a query module is used to query the data Whether there is a word / word in the database that exactly matches the corresponding rule; a spelling correction and fuzzy query module is used to generate a word and word that exactly matches the corresponding rule in the database The most similar word / word; and an output module for outputting the translation of the fully matched word / word and the translation of the most similar word / word. 2. The computer-executable word / word matching and querying system described in item 1 of the scope of patent application, wherein the judgment module is a whole sentence uppercase judgment module for judging the query Whether the word / word belongs to the entire sentence in all capitals to determine the corresponding rule. 3. The computer-executable word / word matching and query system as described in item 2 of the scope of patent application, wherein the corresponding rule is a lowercase query, and the query is performed in the lowercase form of the word / word to be queried. 4. The computer-executable word / word matching and query system described in item 2 of the scope of patent application, wherein the corresponding rule is an original word / word query, Page 14 200521725 6. Scope of Patent Application Search in the original form of the word / word to be searched. 5. The computer-executable word / word matching and querying system described in item 1 of the scope of patent application, wherein the upper and lower case judgment module is an uppercase letter judgment module for judging the pending query. Whether the word / word is capitalized to determine the correspondence rule. 6. The computer-executable word / word matching and query system as described in item 5 of the scope of patent application, wherein the corresponding rule is a lowercase query, and the query is performed in the lowercase form of the word / word to be queried. 7. The computer-executable word / word matching and query system described in item 5 of the scope of patent application, wherein the corresponding rule is a spell correction and fuzzy query, and the spell correction and fuzzy query module is executed at this time. 8. The computer-executable word / word matching and querying system as described in item 1 of the scope of patent application, wherein the processing strategy is to execute the output module, which is used as the word / word to be queried. Correspondence rules can exactly match the database. 9. The computer-executable word / word matching and querying system described in item 1 of the scope of the patent application, wherein the processing strategy is to execute the first-capitalization judgment module when the word / query to be searched / This correspondence rule for words cannot exactly match the database. 10. The computer-executable word / word matching and query system described in item 1 of the scope of patent application, wherein the processing strategy is to execute the spelling correction and fuzzy query module, which is the The corresponding rule of the word / word cannot completely match the database, and the capitalization judgment module has been executed. Page 15 200521725 6. Scope of Patent Application 11. A computer-executable method for word / word matching and query, the method includes the following steps: Retrieving a word / word to be queried; According to the word / word to be queried The judgment of the case of the letter determines a corresponding rule; according to whether the corresponding rule of the word / word to be queried exactly matches a database, a corresponding processing strategy is generated; when the corresponding rule cannot completely match the database When performing a spell correction and fuzzy query function, find a word / word most similar to the corresponding rule in the database; and output a translation of the fully matched word / word similar to the Yuan according to the result of the query Word / to the zapping. 12. The computer-executable word / word matching and query method described in item 11 of the scope of patent application, wherein the case determination of the letter is to determine whether the word / word to be queried belongs to the entire sentence. Capitalize to determine the correspondence rule. 13. The computer-executable word / word matching and query method described in item 12 of the scope of patent application, wherein the corresponding rule is a lowercase query, and the query is performed in the lowercase form of the word / word to be queried. 14. The method for computer-executable word / word matching and query as described in Item 12 of the scope of patent application, wherein the corresponding rule is an original word / word query, based on the original word / word query Form query. 1 5. The computer-executable word / word matching and query method described in item 11 of the scope of patent application, wherein the case of the letter is judged to judge the Page 16 200521725 VI. Whether the word / word to be queried in the scope of patent application belongs to the first letter of the capital letter to determine the corresponding rule 16. Computer-executable word / word matching and query as described in the scope of patent application 15 Method, wherein the corresponding rule is a lowercase query, and the query is performed in the lowercase form of the word / word to be queried. 17. The computer-executable word / word matching and query method as described in item 15 of the scope of patent application, wherein the corresponding rule is a spell correction and ambiguous query, and then perform the spell correction and fuzzy query functions. 18. The method for computer-executable word / word matching and query as described in item 11 of the scope of patent application, wherein the processing strategy is to output the exact matched word / word and its interpretation. The corresponding rule of the word / word to be queried exactly matches the database. 19. The method of computer-executable word / word matching and query as described in item 11 of the scope of patent application, wherein the processing strategy is to determine whether the word / word to be queried is capitalized, and it should be The corresponding rule of the word / word to be queried cannot completely match the database. 2 0. The computer-executable word / word matching and query method described in item 11 of the scope of patent application, wherein the processing strategy is to perform spell correction and fuzzy query functions when the word to be queried is used. The corresponding rule of / word cannot completely match the database, and it has been determined whether the word / word to be queried is capitalized. Page 17