JP4004060B1 - Character search method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a character search method capable of searching accurately and quickly by a simple method without searching for character knowledge or a special device for character search with Kanji and Korean characters.
A gap between constituent elements of a search character is divided in a vertical direction and a horizontal direction, the character is encoded and classified by replacing the possibility of division with a code, and the character is input by inputting the classification code. The character search method that enables the user to understand the character by displaying the meaning of the search character obtained thereafter in multiple languages, videos, or the like.
[Selection] Figure 3

Description

  The present invention relates to a search method for accurately and quickly searching for characters such as Chinese characters and Korean characters using a simple method.

Conventionally, several patents have been proposed as a method of searching for characters, particularly kanji. Japanese Patent Application Laid-Open No. H10-228867 searches for a character by one or more constituent elements constituting the character.
According to the present invention, a character part included in the character logical expression input from the character logical expression input means 10 is specified by the character part specifying means 11, and this is substituted into the character logical expression to create a part logical expression. . The part logical expression is calculated by the part logical expression calculation means 12, and the corresponding character specifying means 13 refers to the character part database 15 using the set of parts obtained as the calculation result as a search condition to specify the corresponding character. It is.
JP 2003-30183 A

  The invention described in Patent Document 1 is based on knowledge of kanji characters, and is configured to divide a character into several parts and add, subtract, multiply, etc. the divided characters in parts. Therefore, an arithmetic character search device is used for this purpose.

  The operation of the arithmetic character search device is based on knowledge of kanji characters, and each means such as the character logical expression input 10 and the character part specifying means 11 is required, so that the structure of the search device becomes complicated and the search method is also It was complicated.

  The present invention has been made in view of the above points, and provides a character search method that can be performed in a simple manner and can be accurately and quickly performed without assuming kanji or Korean character knowledge or special devices. is there.

The gist of the present invention is that an input means 10 for receiving an input of a character quadrant code and the like, and a character database and a character search program corresponding to a character quadrant code in which a gap between search character components is encoded. A character search method in a search device comprising storage means 30 for storing, calculation means 20 for collating input information with a character database, and display means 40 for displaying search results,
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Whether or not the dividing line can be drawn in an approximately cross shape in the horizontal direction is judged in order for each of the upper, lower, left, and right parts of the character. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and these numbers are assigned to the corresponding digits in the first, second, third, and fourth digits of the four-digit number in the order of the top, bottom, left, and right. The character is encoded into a character four-divided code, the character four-divided code and the corresponding character or character image, multilingual, video file are classified and stored as a database,
The input means 10 accepting input of the character quadrant code;
When the arithmetic means 20 collates the character four-division code that has received the input with the character four-division code stored in the storage means 30, and the character four-division code matches, the character four-division code Displaying on the display means 40 a character or character image, multi-language, and moving image file corresponding to
It is possible to search and display the corresponding character or character image from the character quadrant code entered by a person who does not have knowledge about the characters and character components, and understand the meaning of the obtained character or character image in multiple languages and movies It is in the character search method that can be done.

The gist of the present invention is that the input means 10 for receiving the input of the character quadrant code and the character pronunciation information, the character quadrant code that encodes the gap between the constituent elements of the search character, and the character pronunciation information A storage unit 30 for storing a character database and a character search program corresponding to the combination, a calculation unit 20 for comparing input information with the character database, and a display unit 40 for displaying a search result are provided. A character search method in a search device,
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Judgment is made in order of the four parts of the top, bottom, left, and right of the character to determine whether or not the dividing line can be drawn in the horizontal direction. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and these numbers are assigned to the corresponding digits in the first, second, third, and fourth digits of the four-digit number in the order of the top, bottom, left, and right. A character or character image corresponding to a combination of the character four-division code and the character pronunciation information by coding the character pronunciation information in alphabets immediately after the character four-division code; Multilingual video files Classified as a database and is stored,
The input means 10 receiving an input of a combination of the character quadrant code and the character pronunciation information;
The computing means 20 collates the combination of the character quadrant code and the character pronunciation information received with the input with the combination of the character quadrant code and the character pronunciation information stored in the storage means 30, and these characters. A step of displaying, on the display means 40, a character or a character image, a multilingual, and a moving image file corresponding to the combination of the character quad-code and the character pronunciation information when the combination of the quad-code and the character pronunciation information matches. And
It is possible to search and display the corresponding character or character image from the combination of the character quadrant code inputted by a person having knowledge of character and character pronunciation and the character pronunciation information, and to obtain the meaning of the obtained character or character image. There is a character search method that can be understood by language and video.
Further, the gist of the present invention is that the input means 10 for receiving the input of the character quadrant code and the character grammar semantic information, the character quadrant code encoding the gap between the constituent elements of the search character, and the character grammar A storage unit 30 for storing a character database or a character search program corresponding to the semantic information, a calculation unit 20 for collating the input information with the character database, and a display unit 40 for displaying the search result are provided. A character search method in a search device,
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Judgment is made in order of the four parts of the top, bottom, left, and right of the character to determine whether or not the dividing line can be drawn in the horizontal direction. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and this number is assigned to the corresponding digits in the order of the first digit, the second digit, the third digit, and the fourth digit of the 8-digit number in the order of the upper, lower, left, and right. The character is coded to form a character four-division code, and whether or not there is a gap between components that can be further divided at a location different from the division line of the character is represented by a number in the fifth digit. Is encoded by expressing the number of characters in the 6th digit, followed by this code. It is coded by expressing the grammatical information whether it is a noun or otherwise in the 7th digit and the semantic information indicating whether it is human or otherwise in the 8th digit. Combining grammatical information and semantic information codes into an 8-digit code, the corresponding character or character image, multilingual, video file is classified and stored as a database,
The input means 10 accepting the 8-digit code;
When the arithmetic means 20 collates the 8-digit code that has received the input with the 8-digit code stored in the storage means 30, and the 8-digit code matches, Displaying a character or character image corresponding to a digit code, a multilingual, video file on the display means 40, and
It is possible to search and display the corresponding character or character image from the 8-digit code entered by a person with knowledge of the grammar and meaning of the character, and understand the meaning of the obtained character or character image in multiple languages and videos It is in the character search method that can be done.

For example, the present invention can be applied to Westerners who do not have character knowledge of search characters such as Kanji or Hangul on a homepage using the Internet, learners who have insufficient character knowledge, or front-end processors that have acquired character knowledge. It is effective in situations where a wide range of users such as those who are familiar with character conversion processing.
In particular, when Westerners who do not have knowledge of kanji characters or character processing systems search kanji, etc., enter codes that divide the characters of the present invention with numbers etc. even with 1-byte character processing devices such as ASCII codes. And can search for characters. In addition, the meaning of the retrieved characters can be easily understood in multiple languages and videos.

  Also, Japanese and Chinese who have character knowledge and character processing system of search characters such as kanji and hangul do character conversion processing which is a kind of character search with front end processor etc. 2 bytes such as shift JIS code and GB code The conversion efficiency can be improved by inputting the code of the present invention together with the conventional phonetic information in the system character processing device.

In the best mode of the present invention, the gap between the constituent elements of the search character is divided in the vertical direction and the horizontal direction, and the character is encoded by substituting a code for whether or not the division is possible. By storing the code in the storage means, inputting the code from the input means, and searching for characters from the storage means using the calculation means, it does not have character knowledge such as kanji radicals or writing order. Humans can also search for characters, and then display the meaning of the obtained search characters in multiple languages, videos, etc. to enable character understanding.
Also, by inputting and classifying the pronunciation information of the search characters together with the code, the character search efficiency is improved for those who have knowledge of characters such as kanji pronunciation compared to the conventional search method using only pronunciation information. be able to.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.
In the present invention, the character database and processing program corresponding to the code can be stored in the storage means in FIG. 1, and the program shown in FIG. Character registration efficiency can be improved by simply registering it in the user dictionary of the conversion software (front-end processor).

FIG. 1 is a functional block diagram showing an embodiment of the present invention.
For example, assume that a Japanese kanji dictionary homepage published on the Internet is downloaded and a dictionary search is performed on an information device such as a personal computer or a mobile phone. A kanji dictionary homepage that can be divided into four-character code and kanji as shown in FIG. 4 and can be viewed in a table format is downloaded and decompressed as a file compressed by the ZIP method or the like, and stored in the storage means 30 of the personal computer in advance. deep.

  The storage means 30 in FIG. 1 stores a character quadrant code as shown in FIG. 4 and the corresponding kanji in a database format of an array classified as a record for each code. The display viewed by the user is also in the format shown in FIG. 4, but the home page is often created in Shift JIS, so the actual code format shown in FIG. 1 is expressed in hexadecimal JIS as shown in FIG. It is stored in the storage means 30.

  The character quadrant code input by the character code input means 10 of FIG. 1 using, for example, a numeric key of a personal computer or a cellular phone is sequentially displayed with the character quadrant codes of the character database stored in the storage means 30 in advance. Verification is performed in one arithmetic means 20 (CPU or the like). The actual verification is performed in the shift JIS notation format of the four-division code shown in FIG.

  A program necessary for the collation processing is used by calling a search function of homepage browsing software (browser) or word processor software installed in the storage means 30 in advance.

When the input 4-division code matches the 4-division code of the database, as a result, the 4-division code that coincides most recently with the cursor key in the table of browsing pages is displayed on the display means such as the liquid crystal screen of FIG. In 40, the corresponding character string is highlighted (highlighted) in a color different from the background.
For example, as a result of inputting a four-part character code 1111 from the input means 10 of FIG. 1 and collating the character database of FIG. 4 previously stored in the storage means 30 with the calculation means 20 of FIG. When the cursor key is placed on the line, “1111” on the left side of “Word” is highlighted. If you want to continue searching, select “Next” in the search function of homepage browsing software or word processor software. When the “Search” button is pressed, “1111” on the left side of “Competition” in the next row is highlighted. In this way, the target character can be searched sequentially.

  In addition, by using the option function button of the same software, it is also possible to display a list of only the lines that match the inputted 1111 four-division code.

  The numbers 1 and 0 used in Fig. 4 are represented by 31 and 30 in Fig. 5 in Shift JIS, but if a personal computer does not have Kanji processing functions such as Shift JIS, it is common in Europe and America. Because the ASCII code is the same 31 and 30, the search result will be an image if only the character part such as “word” or “competition” is saved in the GIF or JPG image file format when creating the website. It is possible to highlight with “1111” displayed on the left side of “word” or “1111” displayed on the left side of “competition” that is an image, and the user does not garble Can be displayed.

The method of downloading and decompressing and searching the compressed homepage described above has the advantage that you can browse without connecting to the Internet, but online search using the search function of the homepage browsing software while connected to the Internet It is possible to do as well.
In the case of online search, the HTML format file being temporarily browsed is stored in the storage means 30 of FIG. 1 and so on. However, there is an advantage that it is not necessary to download, and it is not necessary to always secure the capacity of the storage means 30 or the like.

  Also, if you want to search a huge dictionary online, you can use a CGI search program on the homepage server side created in advance in the Perl language, etc., and enter the character quadrant code in the input field to display only the corresponding characters in a list. You can also. Such a database search CGI program is generally easy to obtain as free software, and has the advantage of being able to search online at high speed without using the search function of homepage browsing software installed on a user's personal computer or the like.

FIG. 2 is a flowchart of search processing according to the present invention.
S100 represents the start of work for searching, for example, a homepage-style kanji dictionary. S200 represents inputting a character quadrant code from the input means 10 of FIG. S300 represents determining whether or not to convert the format of the character quadrant code described later for collation. If conversion is necessary, after performing format conversion processing using a script such as JAVA (registered trademark) script described in advance on the homepage in S400, the calculation means 20 of FIG. This indicates that the character four-division code input by using and the character four-division code in the database are collated. If it is determined in S300 that format conversion is not necessary, the collation process in S500 is performed with the format of the input character quadrant code as it is.
The format conversion is, for example, the format in which the four-digit character code in FIG. 4 is a format in which all four digits are represented by 1 or 0, but if this is entered in a format in which all digits are different from 1234, a number other than 1 is entered. Means that a simple script that replaces all with 1 is processed on the homepage.

  However, S300 and S400 are necessary steps only when the input format and the database format are different, and may be omitted for other usage methods.

  S600 represents that the display unit 40 of FIG. 1 highlights, for example, a character quadrant code portion collated and matched on the homepage.

  In S700, when it is desired to further investigate the meaning of the searched character, a link is set in advance to the character or the character image, and the character is jumped to another place on the homepage by clicking on the character or the like. It is determined whether or not a screen explaining the meaning is displayed.

  If the user clicks a character to display the meaning of the character, multilingual (parallel translation) language information may be displayed in S800, or non-language information such as a moving image may be displayed. Represents that. Multilingual (parallel translation) information means, for example, displaying “Ci” in Chinese or “Word” in English together with a Japanese kanji “word”. If the user can understand these languages, there is an advantage that the meaning of the word “word” in Japanese can be understood by linguistic analogy.

  For users who cannot understand with linguistic information, for example, if you click on the word “competition”, the semantic information based on non-linguistic information is displayed, such as displaying a screen in which a person is competing with a video (such as animation). It is called display.

  If it is determined that it is not necessary to display the semantic information of the character searched by the user, the process proceeds to the re-input step in S900. If the user continues to input a different character four-division code, the process continues again from S200, and if the search is to end, the end step is S1000. For example, the process ends when the user performs an operation such as closing the window of the personal computer.

  FIG. 3 is an explanatory diagram showing a character dividing method.

  For example, the character search method according to the present embodiment is such that the cake on which the character is placed is divided into four from above with a knife, and the knife can be cut into the gap between the lines constituting the character. Shall not be touched. Here, the “line” refers to a general term for graphics such as a straight line, a curve, and a point which are constituent elements of a character.

  The cake is compared to a watch, and the direction of cutting the knife from the center of the watch is 12 o'clock direction is “upper half in the vertical direction (abbreviation“ upper ”) and 6 o'clock direction is“ lower half in the vertical direction (abbreviation “ "Down"), the 9 o'clock direction is referred to as the "horizontal left half (abbreviated as" left "), and the 3 o'clock direction is referred to as" lateral right half (abbreviated as "right") ".

The order in which the characters are divided into four can be arbitrarily set, but in this embodiment, the order is top, then bottom, third left, and finally right.
Then, the place where the character can be divided is represented by 1 and the place where the character cannot be divided is represented by a number 0, and the character to be searched is classified by a 4-digit number consisting of a combination of 1 or 0 in the order of top → bottom → left → right. This is referred to as “character four-division code” or abbreviated as “code”. In addition, by using a name such as “cake cut method” as a nickname, the application rules of the code can be easily understood by metaphor.

  In addition to the method of calling the four dividing lines with the general names of up, down, left and right, it may be illustrated with colored dividing lines by contrasting color names such as red, green, blue and yellow.

There are 16 possible four-divided codes from 0000 to 1111. When there are a plurality of division methods for one character among these 16 codes, a priority rule corresponding to the degree of conformity of the condition “priority is given to codes that can be divided as much as possible and as evenly as possible” is used. . The metaphor of sharing cakes equally makes it easier to understand.
In addition, a process such as search or display can be applied before a code with a higher priority than a code with a lower priority as necessary.

  The “word” in FIG. 3 represents 1111 which is the first priority code having the highest priority. This code means that the character is divided into four parts in the order of upper → lower → left → right, and the parts that can be divided are indicated by solid lines.

In FIG. 3, “Kei”, “Jin”, “Six”, and “Part” represent the second priority codes. The second code is a code in which characters are classified so as to divide the cake into three parts, and these codes have the same priority.
As shown in FIG. 3, 1011 of the codes means that the codes are divided in the order of upper → left → right. For example, 1101 of the codes corresponding to the letters “Kai” is shown in FIG. , Means that the character is divided in the order of upper → lower → right, for example, the character “Jin” corresponds to 0111 of the code means that it is divided in the order of lower → left → right as shown in FIG. For example, 1110 of the codes corresponding to the characters “six” means that the codes are divided in the order of upper → lower → left, as shown in FIG. 3, for example, the characters “part”.

“North” and “bean” in FIG. 3 represent the third priority code.
The third priority code is a code in which characters are classified so as to divide the cake into two. These codes have the same priority.
As shown in FIG. 3, 1100 of the codes means that the codes are divided in the order of upper → lower, and for example, the character “north” corresponds.
Among the codes, 0011 means that the code is divided in order of left → right, and for example, a letter “bean” corresponds to it.

“Dog”, “Office”, “Dimension”, and “Fire” in FIG. 3 represent the fourth priority code.
The fourth priority code is a code in which characters are classified so that the cake is divided into two. These codes have the same priority.
In this case, the condition of the two-division code is the same as that of the third priority code, but since the condition “divide as evenly as possible” cannot be applied, the third rule takes precedence over the fourth rule. is there.
1001 in the code means that the code is divided in the order of upper → right, and for example, the character “dog” corresponds.
Of the codes, 0101 means that the codes are divided in the order of lower → right, and for example, the character “Agency” corresponds.
Of the codes, 0110 means that the codes are divided in the order of lower → left, and for example, the character “dimension” corresponds.
Of the codes, 1010 means that the codes are divided in the order of upper → left, and for example, the letter “fire” corresponds to the code.
Although "fire" can be divided into 1001, in the present invention, redundancy may be allowed so that a target character can be searched regardless of which code is entered by creating a duplicate database.

The fifth priority code theoretically corresponds to four codes 1000, 0001, 0100, and 0010, but is excluded from the division rule because it cannot be divided even if a knife is cut into a part of the cake.
Accordingly, only a code of 0000 that cannot be divided is adopted as a code having the lowest priority. The character corresponding to this code is “mouth” in FIG. 3, for example.

  In this way, there are 16 combinations of codes in theory, but in accordance with the fifth code process, 12 combinations are finally adopted.

  The fifth priority code mainly corresponds to the character shape of kanji, such as “There are almost no characters that can be cut only at one place, and there are not a few characters that can be cut even at one place”. Since it corresponds, characters other than Kanji, for example, Hangul, 16 codes may be used without excluding 4 codes.

  In addition, when a plurality of codes exist for one character, a database with redundancy may be created so that processing can be performed regardless of which code is specified by the rule user. For example, the letter “fire” may be 1010 or 1001.

A format example of the character four-division code will be described.
There are five types of character code formats for one character.

   “Binary (bit) format” (commonly called “binary four-digit format”) is a binary number (0 (non-divided) or 1 (divided)) for a quadrant of each upper, lower, left, and right quarters. FIG. 3 shows an example of this format in a 4-digit (4-bit) format represented by (bit). The position information is fixed in the order of top, bottom, left, and right and is not abbreviated to less than 4 digits.

The “decimal number format” is divided into a “decimal number non-omitted format” and a “decimal number omitted format”.

"Decimal number non-omitted format" (commonly called "decimal 4-digit format") is 0 (non-divided), 1 (vertical upper half divided), 2 (vertical lower half divided), 3 (horizontal left half divided) ) And 4 (horizontal half right division). The order of the location information is not fixed, but the abbreviation of less than 4 digits is not displayed.
Examples of ascending order are 1234, 1204, etc., examples of descending order are 4321, 4021, etc., examples of arbitrary order are 2341, 2401, etc., and examples of non-division are 0000.

The “decimal number omission format” is the same rule as the “decimal number omission format”, but only 0 is shown when all of the upper, lower, left and right dividing lines cannot be divided, and two or less zeros can be omitted.
When an example of “decimal number omission format” is represented by “decimal omission format”, examples of ascending order are 1234, 124, etc., examples of descending order are 4321, 421, etc., examples of arbitrary order are 2341, 241 The example of non-division is 0.

  “Everyday Word Format” is divided into “Everyday Word Non-Omitted Format” and “Everyday Word Omitted Format”.

  “Daily word non-abbreviated format” uses “up / down / left / right” or “UDLR (acronym for Up Down Left Right)” instead of “1234” in “decimal number non-abbreviated format”. Color names such as “red green blue yellow” may be used. The format rule is the same as “decimal non-abbreviated format”.

  Ascending example “1234” is “up / down / left / right” or “UDLR”, “1204” is “up / down 0 right” or “UD0R”, and descending example “4321” is “upper right / lower left” or “RLDU”, “ “4021” is “Right 0 Bottom Up” or “R0DU”, etc. Arbitrary example “2341” is “Bottom Left Right Top” or “DLRU”, “2401” is “Bottom Right 0 Top” or “DR0U”, etc. The non-divided example “0000” is “0000” or the like.

  The “everyday abbreviation format” uses “up / down / left / right” or “UDLR (acronym for Up Down Left Right)” instead of “decimal abbreviation format” “1234”. The format rules are the same as the “decimal number abbreviation format”. When the code is continued, there is no regularity of 4 digits for each character, so it is mandatory to insert a delimiter such as a hyphen at the position corresponding to the character unit. To do.

  Ascending example “1234” is “up / down / left / right” or “UDLR”, “124” is “up / down / right / right” or “UDR”, and descending order example “4321” is “upper right / lower left” or “RLDU”, “421”. ”Is“ lower right upper ”or“ RDU ”, etc. Arbitrary order example“ 2341 ”is“ lower left upper left ”or“ DLRU ”,“ 241 ”is“ lower right upper ”or“ DRU ”, etc. The example “0” is represented by “0”.

The “hexadecimal compression format” (commonly referred to as “hexadecimal one-digit format”) is expressed as one character by converting the “binary number (bit) format” into a hexadecimal number.
For example, the following one-digit display is possible. The binary number 0000 is represented as 0 in the hexadecimal number, the binary number 0101 (decimal number 5) is represented as 5 in the hexadecimal number, and the binary number 1010 (decimal number 10) is represented as A in the hexadecimal number. 1111 (decimal number 15) is represented by F in hexadecimal number, so input can greatly improve the efficiency of learning.

  “Associative character compression format” (commonly referred to as “associative one-digit format”) is represented by one character by replacing “binary number (bit) format” with an easily associated alphabet or the like as shown in FIG. FIG. 6 contrasts the decimal abbreviation format and the associative character compression format. Even with the same single digit, the hexadecimal compression format is logical but difficult to memorize, so there is an advantage for beginners that the associative character compression format is easier to memorize and more efficient.

Next, a 4-part code format for a character string of two or more characters will be described.
For example, when the last name “Kitayama” consisting of two characters “North” and “Mountain” in FIG. 4 is represented by a four-part character code, the four-part code “1100” and “0000” in FIG. "11000000" can be represented by an 8-digit number, so if you want to create a name list, add "11000000" to the 4-part code in Fig. 4 and write "Kitayama" on the right side. Good.
However, for various reasons such as it is difficult to distinguish the enumeration of numbers, and it takes time to input a lot of numbers 0, it is necessary to specify the format of the character string.

  The character string format of “binary number (bit) format” may or may not insert a hyphen (−) or the like as a separator between adjacent characters. The reason is that it is easy to identify because the code string is continuously fixed every 4 digits.

  The format that does not insert a delimiter is a binary format without delimiters because the internal data is stored in a format that lists codes corresponding to character strings in 4 digits (4 bits) without inserting hyphens (-). Has the advantage that the input format and the stored data format are the same and there are few erroneous processes.

  The format for inserting delimiters increases the number of characters input by the user by the hyphen (-) symbol in addition to 0 and 1, but the advantage is that it is easy for the input user to visually identify the character code delimiters. is there.

  In the “decimal number non-abbreviated format”, insertion of a delimiter is optional for the same reason as the character string format of “binary number (bit) format”.

In the “decimal number abbreviation format”, a hyphen (−) or the like is inserted as a delimiter between adjacent characters. The reason is that the code string does not have a certain length from 1 digit to 4 digits and changes, so that the code for one character cannot be identified.
For example, 1234 can be identified as 1234 (one-character code) or 12-34 (two-character code string) by inserting a delimiter.

  The “daily life non-abbreviated format” may or may not insert a hyphen (−) or the like between adjacent characters and character separators. The reason is that it is easy to identify because the code string is continuously fixed every 4 digits.

  The “daily life abbreviation format” inserts a hyphen (−) or the like as a delimiter between adjacent characters. The reason is that the code string does not have a certain length from 1 digit to 4 digits and changes, so that the code for one character cannot be identified.

  For example, up / down / left / right (UDLR) can be identified by inserting a delimiter (one character code), up / down / left / right (UDLR) or up / down / left / right (UD-LR) (two character string code sequence).

  The “hexadecimal compression format” does not require a separator, but inserts symbols such as # at the beginning and end of the character code. The reason is that the hexadecimal code format uses numbers 0 to 9 and alphabets A to F (corresponding to number 15), and numbers and some alphabets are mixed. A # symbol or the like is inserted at the beginning and end of the character code so as not to be confused with a sequence of numbers and alphabetic character strings. When explicitly inputting or displaying, it may be full-width or half-width.

  For example, the hexadecimal compression format of “large” is “0” (zero), but when the decimal compression format is identified as “0”, the hexadecimal compression format is explicitly displayed as “# 0 #”.

  In the embodiment of the present invention, “D” in “daily life format” and “hexadecimal compression format” overlap, but the latter can be explicitly identified by “#”, and the “#” symbol is omitted. The former “D” can be distinguished from the fact that it is not used alone. Other than “D”, there is no overlap between formats using alphabets. By utilizing these features, a checking routine for preventing erroneous processing may be added to the software processing system.

  The main purpose of the hexadecimal compression format is to input quickly and efficiently with as few characters as possible, so by inserting # symbols at the beginning and end of the character code, the code string that follows becomes one character in hexadecimal. Since correspondence can be identified, a hyphen (-) or the like of a delimiter is unnecessary.

Since the “associative character compression format” is displayed in alphabet or the like without using numbers (0 is Z), no delimiter is required. Even if it is displayed in the same alphabet as the hexadecimal compression format, it can be identified by the # symbol.
For example, the hexadecimal compression format of “Large” is “# 0 #”, and the associative character compression format is “Z”.

  By using the format, even a person who does not have knowledge of kanji can search for kanji by using only a four-character divided code. However, the character four-divided code is also useful for people who have kanji knowledge and kanji learners.

  For example, when inputting kanji using Japanese or Chinese kanji conversion software (front-end processor) on a personal computer or mobile phone, it is easier to handle and can improve efficiency.

  FIG. 7 shows a dedicated keyboard used for a Chinese character input method called “five-stroke type” adopted in China. FIG. 8 shows a general ASCII keyboard. In the five-stroke keyboard shown in FIG. 7, components having simplified kanji radicals are assigned to each alphabet key except Z.

  This kanji input method does not use kanji pronunciation, but uses a combination of character knowledge such as components and stroke order. FIG. 9 shows a method of inputting a kanji character called “do” in a five-stroke type.

“Procedure” replaces traditional kanji knowledge, which is made by combining components in the order of “禾” → “mouth” → “king”, with the numbers 31 → 23 → 11 representing the position of the keyboard.
Alternatively, the keys to which the three components are assigned are replaced with alphabets “T” → “K” → “G”.

  However, in order to learn a five-stroke type input method, in addition to knowledge of over 100 components and kanji, such as stroke order, knowledge and training of dedicated devices such as the arrangement of which component is assigned to which key Therefore, it is not suitable for the operation of personal computers and mobile phones.

  On the other hand, front-end processors that input kanji pronunciation information (reading) in alphabetical characters called romaji or pinyin and convert kanji are widely used for operations of personal computers and mobile phones.

  However, there are many kanji characters with the same pronunciation called “symphony” in the pronunciation of Chinese and Japanese kanji characters. To select the desired kanji, it was necessary to perform a complicated operation of hitting the space bar many times and searching for it.

For example, the number of Chinese homophones shown in FIG. 10 has become enormous, and it has been necessary to hit the space bar one after another to find the target character from among the conversion candidates.
1 in FIG. 10 is a single kanji list of pronunciation “YI” published in the word dictionary “modern Chinese dictionary”, which has 109 characters in total.
2 in FIG. 10 is a single kanji list of pronunciation “SHI” published in a kanji dictionary called “Xinhua dictionary”, which has 67 characters in total.
3 in FIG. 10 is a single kanji list of pronunciation “LI” included in the Chinese national standard (GB) code corresponding to Japanese JIS, which has a total of 75 characters.
If the number of candidates for conversion of the same-sound kanji displayed by the front-end processor at one time is 10, for example, it is inconvenient because it is necessary to hit the space bar nearly 11 times for the conversion operation of “YI” at the maximum.

  In order to solve such a problem, the present invention has realized that the kanji conversion efficiency is improved by combining character form information which does not require kanji knowledge called character quadrant code and conventional pronunciation information.

  FIG. 11 is a table and a graph showing the number of characters and the ratio of the three same-tone Kanji groups “YI”, “SHI”, and “LI” in FIG.

For example, “I” in the pronunciation group “YI” can be represented by “1100” and a four-division code, “usage” in the pronunciation group “SHI” is “1100”, and “rei” in the pronunciation group “LI” is “ 1100 "and 4 division codes.

  As a result, the “1100” group of “YI”, “SHI”, and “LI” has 27 characters, 21 characters, and 26 characters, respectively, and is divided into 25%, 31%, and 35% of the entire homophone group, respectively. I was able to reduce it from one to a quarter.

  Therefore, since there are 12 types of 4-division codes, it is theoretically possible to disperse the homophones by an average of about 8 percent on average for each 4-division code. I will call it.

  And if you look at the graph in Fig. 11, the 4-part code other than "1100" has a homophone variance rate of almost 10% or less, and you need to hit the space bar only once to three times when converting to Kanji. I understand.

In this way, when combining the four-division code and pronunciation, kanji conversion provides great convenience.

  However, the “1100” group in FIG. 11 has a relatively larger number of homophones than the other chord groups. Therefore, in FIG. 12, the number of characters and the distribution ratio of the “1100” group when the 4-digit division code is expanded to 5 digits are extracted.

  The rule for extending the division code to 5 digits is simple. For example, there is a place where the Chinese character “example” can be divided into two places in the vertical direction. Consider it as a possible kanji. Based on this idea, “1” is added to the fifth digit of the division code for re-dividable Chinese characters, and “0” is added to the fifth digit of the division code for non-re-dividable Chinese characters.

  As a result, in FIG. 12, the dispersion ratio could be improved to the 10% level by extending the 4-digit division code of 1100 to 5 digits.

  Comparing this result with the distribution ratio of FIG. 11, it is also shown that it is not always necessary to classify all Chinese characters by a 5-digit divided code, and only a part of codes such as 1100 may be used.

FIG. 13 shows the distribution ratio when the 4-digit division code 1100 is expanded to 6 digits.
Traditional glyph information, which is the number of strokes, was predicated on strict application, so it was difficult for foreigners and beginners to learn. Therefore, the present invention introduces stroke information that can be classified with an intuitive impression of “Does it look complicated?” Or “Is it simple?” At the 6th digit following the 5-digit division code. .

  Specifically, the leftmost column in the table of FIG. 13 is based on a quantitative standard of 9 or more strokes and 7 or less strokes, which is complicated or simple, and the 9th stroke or more is classified as 110011, the 7th stroke or less is 110010, and so on. Eight strokes have redundant Kanji characters in both groups and have redundancy.

  The second column from the left of the table in FIG. 13 shows that the number of characters in the 8 strokes is duplicated and the duplicates are divided into 2 such as 8 strokes and 8 strokes. The results are shown in the right column. For example, 110011 (8 strokes or more) of “YI” is the result of totaling 6 + 2 = 8 characters.

  By using this 6-digit extended division code, it can be seen from the lower graph in FIG. 13 that most groups achieved a dispersion ratio of 8% or less.

  In this way, the problem of conventional kanji conversion could be solved by using the four-divided code in combination with kanji pronunciation information.

  The character quadrant code search method of the present embodiment can effectively narrow down single kanji characters, but it is also practical when applied to narrowing down words (a combination of two or more kanji characters).

Furthermore, with the combination of the 5-digit code, 24 classifications × 24 classifications = 576 combinations, that is, word classifications are possible.
For example, if 6892 words in the regular vocabulary included in the Chinese certification test for foreigners called HSK are divided by 576 classifications, it is about 12 words, so about 12 words are the average number of inclusions in one classification. If this number is used, for example, when searching for words that cannot be read in regular Chinese, simply entering the five-digit code twice (for two characters) will result in approximately 12 words, and the word processor As a result, the number of candidates for kanji conversion is almost the same as the number of candidates, and it is practical.

Next, a description will be given of an input format when using a kind of input kanji search software called kanji conversion. For example, when a front-end processor or the like is used to input only a character quadrant code and convert it to kanji, etc., a symbol such as a full-width @ (at) is used to distinguish it from a simple numeric string that does not need to be converted to kanji. Insert at the beginning and end of.
Similarly, the combination format of pronunciation and character quadrant code, for example, inserts a full-width equal (=) symbol into the pronunciation and quadrant code to clearly indicate that it is combination information, and also includes full-width @ (at) Insert symbols at the beginning and end of the combination information.

  For example, in order to convert and search for the character string “Showa”, a format such as @ showa = 1204-1200 @, which combines a pronunciation and a character code at the beginning of a record corresponding to the 4-part code in FIG. Is registered in advance in the user registration dictionary of the front-end processor together with the character string Showa, and at the time of conversion, after entering @ Showa = 1204-1200 @ from the keyboard, hit the space bar etc. "Can be called and converted.

  Usually, the @ symbol used for an e-mail address is half-width, so symbols such as full-width @ are rarely used. By explicitly adding these symbols to the range specification related to the character code, erroneous conversion of the front-end processor is prevented.

The user dictionary registration method of the front-end processor may be registered for each word by using an operation tool called a language bar. For example, the following "reading" (tab insertion) "phrase" It is also possible to create a registration list in the order of “(tab insertion),“ part of speech ”(tab insertion), and“ user comment ”and register them together.
@ Shouwa = 1204-1200 @ Showa Noun Link

  Depending on the front-end processor, not only can you enter and display commentary strings in the user comment field, but you can also display non-linguistic information such as multilingual information and videos on another homepage by setting a link. , Also helps to understand the meaning of the displayed words.

  @ May be used for the purpose of clearly indicating that it is a notation for a quadrant character code in addition to Kanji conversion, and may be used in half-width.

  In the hexadecimal compression format, by using a symbol such as # different from @ etc., it is possible to distinguish, for example, that the alphabet “D” is a hexadecimal compression format instead of an everyday language format.

In the conventional kanji conversion using only pronunciation input, for example, when a large number of homophone candidates with the input “Kisha” are displayed, it is necessary to correct the erroneous conversion depending on the context.
For example, if you enter "Let's be happy," there are several possible conversions. The following four examples are all conversion candidates with no grammatical errors, but most front-end processors can only do one conversion.
I think your reporter is good.
I think the train reporter is good.
I think the journalists are happy.
I think your train is good.

However, if the homophone “Kissha” is registered in the user dictionary in the format of the present invention in advance, the desired kanji can be converted once by inputting as follows.
@ 0034-1200 = Kissha @ 's @ 1230-0000 = Kissha @
@ 1234-0000 = @ 1230-0000 of Kisha @
@ 1230-0000 = Kisha @ 's @ 0034-1204 = Kisha @ is good.
@ 0034-1200 = Kissha @ 's @ 1234-0000 = Kissha @ is good.

The reason why the conversion can be made at one time is that even though the pronunciation is the same, the character quadrant codes are different.
Note that the division code and the order of pronunciation may be reversed.

Explain the detailed format of character codes.
Using field-specific formats enables more precise kanji search.
For example, when performing a search limited to a small terminology dictionary, enter the terminology dictionary name with, for example, “Kana” after the leading @, and then enter a colon (:) etc. Limit.

For example, if you enter “Katata” from the last name technical term dictionary (abbreviated as “myoji”)
@Moji: Katadada = 1034-0000 @ Pre-registered in the 4-part code column of Fig. 4, registered in the same column as Katata in the character column, and registered in the user dictionary, the surname technical term dictionary ("Myo Therefore, the following homophones that are not registered in the specialized dictionary are not displayed as conversion candidates, improving accuracy.
@It is just = 1034-1204 @ type

 The citation format may improve conversion efficiency. For example, when a kana is represented by a divided code, a plurality of kana are classified into one type of code, so it may take time to search for a specific kana character. The same applies to alphabets and numbers.

  In this case, if you enter not only the character code but also common and simple characters such as kana, alphabets, numbers, and symbols directly mixed with the character code, double quotation marks (" ")) Etc. are added to distinguish them from character codes.

For example, “38” of “Showa 38” is expressed in the following form.
@Shouwa "38" Nen = 1204-1200- "38" -0000 @
Note that the quotation marks in the pronunciation part may be omitted.

  In this case, since the quoted part may be a variable, it is preferable that the program can perform partial matching excluding the quoted part.

In some cases, the part format is useful for those who are learning.
If you do not know the pronunciation of the kanji you want to search for, but know the pronunciation (sound or practice) of the component elements that make up the kanji, list the pronunciation of the component elements by inserting a semicolon (;), etc. Can be combined. However, a semicolon (;) etc. is also added to the beginning and end of the part reading.

For example, the part format of “魏 (pronounced“ Gi ”)” is expressed as follows.
@;

  “魏” is composed of two parts, “commitment” and “demon”, so the pronunciation of “commitment” is “I” (spoken reading), and the pronunciation of “demon” is “oni” (note reading), “ki” ( (Speech reading) is listed, but it may be a part of the part, so if it is registered in the dictionary in advance, it helps the learner to search difficult kanji.

Explain the simple format of character codes.
When a 4-part character code is used for a folder name or file name in an information device or the like having only a 1-byte processing function, a simple character code format is used. Based on the ISO-9660 standard for saving data files on a CD-R, the file name can be up to 8 characters, the extension can be up to 3 characters, and the underscore (_) can be used for the symbol. Append the following abbreviations after the underscore (_) at the end of. The underscore and alphabet abbreviation are collectively referred to as “identifier”.

The following is an example of a simple format.
Binary number format_B (abbreviation of Binary Number)
Decimal format_D (abbreviation for Decimal Number)
Daily Word Format_C (abbreviation for a Commonly used Word)
Hexadecimal format_H (abbreviation for Hexadecimal Number)
Association Form_A (Abbreviation of Association of Idea)

For example, a simple format example in which the pronunciation of “word” is entered as “GO” in the Roman alphabet notation, followed by the character code “1234”, and finally the identifier in decimal format is entered as follows: Become.
(All half-width) → GO1234_D.HTM

  The simple format is also useful for making it easy to search for file and folder names uniformly with a portable music player.

  The types and characteristics of characters used for the input display of the character quadrant code will be described in relation to general devices.

Number formats are the most practical.
Since “binary number (bit) format” uses only 0 and 1, for example, most existing mobile phone number buttons, PC numeric keys, mouse left and right buttons, game machine controller left and right buttons, TV remote control with input function, etc. Input and display are possible with the minimum necessary input means of the devices.

  The “decimal number format” uses five types of numbers from 0 to 4, so it can be input using general existing information devices such as mobile phone numeric buttons, PC numeric keys, and TV remote controls with input functions. Display is possible.

  Alphabets, numbers, hyphens (-), @, #, double quotes ("), colons (:), semicolons (;) underscores (_), etc. are used as character input means for ordinary personal computers and mobile phones. .

  As described above, the characters required for all character code formats are limited to the above-mentioned several types. For example, it is common to use numeric buttons on a mobile phone (excluding telephones for calls), PC numeric keys, and TV remote controls with input functions. Input and display are possible with existing information devices.

In the case of “Daily Word Format”, input is time-consuming, like “Up / Down / Left / Right”, and there are restrictions depending on the device. But easy to understand. If the button switch is displayed in an everyday language format with icons, etc., it is easy to operate even for those who are not familiar with the operation of equipment such as the elderly.

  If the display can be substituted with an icon (graphic), it can be used widely. It is common to display icons from 4 to 16 types of 4-part character codes on the screen of input devices such as personal computers and ticket vending machines, and select them with a mouse pointer or touch panel pen or finger. Input and display are possible with existing devices. The advantage of this means is that the user can input and display intuitively on the spot without learning the character code format.

  The format conversion method shown in S400 of FIG. 2 will be described. This processing may be performed by a simple script such as JAVA (registered trademark) SCRIPT in the HTML format of the home page, or the user may perform simple format conversion using the replacement function of the word processing software.

  When there is no “binary number (bit) format” hyphen (−), the input format is the same format as the data in the storage means of FIG.

  In the case of “binary (bit) format” hyphen (−) insertion, the hyphen is deleted before collation and then collated with internal data.

When there is no “decimal number abbreviation format” without a hyphen (−), a reference 4-digit number string template in the order of “1234” is stored in the memory in advance, and this and the input character code are prefixed by 4 digits. The matching numbers are rearranged in ascending order, but if the input character code contains 0, the matching does not match, so the mismatched numbers are replaced with 0. This process is repeated every four digits.
For example, it is processed as @ 41201043 @ → 12041034.

  In the case of “decimal number non-abbreviated format” hyphen (−) insertion, the hyphen is deleted before collation, and then the above processing is performed.

In the case of “decimal abbreviation format” hyphen (−) insertion, a reference 4-digit number string template in the order of “1234” is stored in the memory in advance, and this is an input character code string delimited by a hyphen. The matching numbers are rearranged in ascending order, but if there is a number that is omitted in the input character code string and does not match the 4-digit character string template, 0 is inserted to compensate. Then remove the hyphen. This process is repeated for each input character code string delimited by a hyphen.
For example, processing is performed as follows: @ 412-143 @ → 124-134 → 12041034.

In the case of “hexadecimal number compression format”, the input character code string is converted by collating it with a correspondence table of hexadecimal numbers and binary numbers, or by a function built in the processing device.
For example, processing is performed as (hexadecimal number) DB → (binary number) 11011011.

  In the case of “associative character compression format”, the input character code string is collated with a correspondence table of associative character codes and binary numbers and converted. For example, processing is performed as (associative character code) KW → (binary number) 11011011.

  By combining grammatical information such as parts of speech and semantic information such as meaning classification in the code column of FIG. 4 representing the character database, the characters stored in the same record with the same code can be combined with the grammar and meaning. You can also search from information.

  For example, a grammatical information code is added to the seventh digit and a semantic information code is added to the eighth digit following the 6-digit divided code.

Grammar information refers to part-of-speech information such as nouns, verbs, and adjectives.
In the embodiment described below, grammatical information is information of nouns and other parts of speech. However, the present invention is not limited to this, and for example, syntactic information of subjects and predicates may be used as grammatical information.

  When classified as a noun and other than the above, the 7th digit grammatical information is expressed in decimal format, the noun is 7, the part of speech other than the noun such as a verb or adjective is 8 and the part of speech is not specified. It shall be expressed as

  Character database The character database information up to the sixth digit of “north” in FIG. Since the part of speech of “north” is a noun, the code with the 7th digit grammar information added can be expressed as 1100007.

  Character database For example, the character shape information up to the sixth digit of “hit” in FIG. Since the part-of-speech of “hit” is a verb, it is a part-of-speech other than a noun, so the code with the seventh digit grammar information added can be expressed as 1100008.

Semantic information refers to classification information of meaning such as words related to humans and words related to nature.
In the embodiment to be described next, the information about whether it is related to humans or non-humans is used as semantic information. In addition, for example, classification methods such as animals, plants, and others are arbitrary.

  For example, if the search character is related to humans, 9 is added to the eighth digit, and if it is related to non-humans, 0 is added to the eighth digit in decimal format. 11000070 and “hit” are words related to humans and can be expressed as 11000089, so that more detailed identification is possible at the time of search.

  As described above, if a search is performed by inputting a code using only the character information up to the sixth digit, the two kanji characters “north” and “stroke” cannot be identified at the time of the search because they are the same code. If the 8th digit semantic information is added, the code is different and can be identified at the time of retrieval.

It is a functional block diagram of the present invention. It is a search processing flowchart of the present invention. It is explanatory drawing which shows the division | segmentation method of the character of this invention. It is a character database table | surface of this invention. It is Shift JIS notation of the character database of this invention. It is a comparison table of the decimal number omission format and the associative character compression format of the present invention. This is a five-stroke key layout. It is a key layout of ASCII layout. This is an example of five-stroke input. This is an example of Chinese homophones. This is the distribution of Chinese homophones. This is the variance of the 4-digit code and 5-digit code of Chinese homophones. This is the variance of the 6-digit code for Chinese homophones.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Input means 20 Calculation means 30 Storage means 40 Display means

Claims (3)

An input means 10 for receiving an input of a character quadrant code and the like; a storage means 30 for storing a character database and a character search program corresponding to a character quadrant code in which a gap between search character components is encoded; A character search method in a search device comprising a calculation means 20 for collating input information with a character database and a display means 40 for displaying a search result,
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Judgment is made in order of the four parts of the top, bottom, left, and right of the character to determine whether or not the dividing line can be drawn in the horizontal direction. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and these numbers are assigned to the corresponding digits in the first, second, third, and fourth digits of the four-digit number in the order of the top, bottom, left, and right. The character is encoded into a character four-divided code, the character four-divided code and the corresponding character or character image, multilingual, video file are classified and stored as a database,
The input means 10 accepting input of the character quadrant code;
When the arithmetic means 20 collates the character four-division code that has received the input with the character four-division code stored in the storage means 30, and the character four-division code matches, the character four-division code Displaying on the display means 40 a character or character image, multi-language, and moving image file corresponding to
It is possible to search and display the corresponding character or character image from the character quadrant code entered by a person who does not have knowledge about the characters and character components, and understand the meaning of the obtained character or character image in multiple languages and movies Character search method that can be used. Character database and character search program corresponding to the combination of the input means 10 for receiving the input of the character quadrant code and the character pronunciation information, the character quadrant code that encodes the gap between the constituent elements of the search character, and the character pronunciation information A character search method in a search device comprising: storage means 30 for storing the input information; arithmetic means 20 for collating input information with the character database; and display means 40 for displaying the search results.
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Judgment is made in order of the four parts of the top, bottom, left, and right of the character to determine whether or not the dividing line can be drawn in the horizontal direction. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and these numbers are assigned to the corresponding digits in the first, second, third, and fourth digits of the four-digit number in the order of the top, bottom, left, and right. A character or character image corresponding to a combination of the character four-division code and the character pronunciation information by coding the character pronunciation information in alphabets immediately after the character four-division code; Multilingual video files Classified as a database and is stored,
The input means 10 receiving an input of a combination of the character quadrant code and the character pronunciation information;
The computing means 20 collates the combination of the character quadrant code and the character pronunciation information received with the input with the combination of the character quadrant code and the character pronunciation information stored in the storage means 30, and these characters. A step of displaying, on the display means 40, a character or a character image, a multilingual, and a moving image file corresponding to the combination of the character quad-code and the character pronunciation information when the combination of the quad-code and the character pronunciation information matches. And
It is possible to search and display the corresponding character or character image from the combination of the character quadrant code inputted by a person having knowledge of character and character pronunciation and the character pronunciation information, and to obtain the meaning of the obtained character or character image. Character search method that can be understood by language and video. Character input database 10 and character search program corresponding to character quartet code and character grammar semantic information encoded with input means 10 for receiving input of character quartet code and character grammar semantic information; A character search method in a search device comprising: storage means 30 for storing the input information; arithmetic means 20 for collating input information with the character database; and display means 40 for displaying the search results.
When the character database is stored in the storage means 30, when the character has a gap between the constituent elements, the dividing line is drawn, and when there is no gap, the dividing line cannot be drawn. Judgment is made in order of the four parts of the top, bottom, left, and right of the character to determine whether or not the dividing line can be drawn in the horizontal direction. If the dividing line can be drawn, the number 1 is not drawn. Is represented by the number 0, and this number is assigned to the corresponding digits in the order of the first digit, the second digit, the third digit, and the fourth digit of the 8-digit number in the order of the upper, lower, left, and right. The character is coded to form a character four-division code, and whether or not there is a gap between components that can be further divided at a location different from the division line of the character is represented by a number in the fifth digit. Is encoded by expressing the number of characters in the 6th digit, followed by this code. It is coded by expressing the grammatical information whether it is a noun or otherwise in the 7th digit and the semantic information indicating whether it is human or otherwise in the 8th digit. Combining grammatical information and semantic information codes into an 8-digit code, the corresponding character or character image, multilingual, video file is classified and stored as a database,
The input means 10 accepting the 8-digit code;
When the arithmetic means 20 collates the 8-digit code that has received the input with the 8-digit code stored in the storage means 30, and the 8-digit code matches, Displaying a character or character image corresponding to a digit code, a multilingual, video file on the display means 40, and
It is possible to search and display the corresponding character or character image from the 8-digit code entered by a person with knowledge of the grammar and meaning of the character, and understand the meaning of the obtained character or character image in multiple languages and videos Character search method that can be used.

Images