JP5087326B2 - Pretend Kana Collection and Use Device and Pretend Kana Collection and Use Method - Google Patents

Description

  The present invention relates to a pretend kana collection and utilization device and a pretend kana collection and use method.

2. Description of the Related Art Conventionally, a technique for applying kana to kanji using a dictionary has been proposed (for example, Patent Document 1). In addition, for example, in Patent Document 2, a kanji dictionary with a plurality of kanji acquisition levels is prepared, and Japanese translations of other languages are converted into Japanese sentences according to the kanji acquisition level. A technique for enabling reading is disclosed. However, in any case, a dictionary must be prepared in advance, and a technique for automatically collecting dictionary registration data is not disclosed.
Japanese Patent Laid-Open No. 10-91627 JP 2004-54784 A

  It takes a lot of time and effort to prepare a dictionary that covers pretend kana corresponding to many kanji and idioms. Also, new ways of reading phrases may begin to be used, and it has been difficult to gather them quickly. On the other hand, many readings of words are actually used through the Internet and the like, and there is a demand for a technique for collecting reading (fake kana) information with high accuracy from these.

  SUMMARY OF THE INVENTION An object of the present invention is to provide a method for automatically collecting pseudonyms actually used on an existing Web page and reusing them according to the purpose of use.

The inventor accumulates pretend kana collected from existing Web pages in a database, determines a high-precision pretend kana, incorrect pretend kana, etc. according to its appearance frequency, and reuses it according to the purpose of use. The headline and the present invention were completed.
Specifically, the present invention provides the following.

(1) Fake kana data acquisition means for acquiring a combination of a phrase composed of kanji and a fake kana from the contents of a web page;
Pretend kana data recording means for recording the combination acquired by the pretend kana data acquiring means together with the number of appearances;
Fake kana data extracting means for extracting the combination recorded by the fake kana data recording means based on the number of appearances;
Pretend Kana collection and use device equipped with.

  According to this invention, the pretend kana collection and utilization device automatically collects combinations of words and phrases composed of kanji and pretend kana from the web page and reuses them according to the number of appearances. Can be reused, and the commonly used pretend pseudonym can be reused.

  (2) The pretending pseudonym collection / use device according to (1), further comprising Web page acquisition means for acquiring the contents of a plurality of Web pages through the Internet.

  According to this invention, the pretend kana collection and utilization apparatus acquires the contents of a plurality of Web pages, and therefore automatically collects combinations of words and phrases composed of kanji and pretend kana from many Web pages, and according to the number of appearances. Therefore, it is not necessary to manually create a dictionary or the like, and it is possible to reuse pretending pseudonyms that are widely used in general.

  (3) The Web page acquisition unit does not acquire the content of the Web page when the last update date and time of the Web page from which the content is to be acquired matches the last update date and time of the Web page that has already been acquired. The pretend pseudonym collection and utilization device described in (2).

  According to the present invention, the pretend pseudonym collection and utilization apparatus does not acquire the same Web page contents redundantly, so that the Web page contents can be efficiently acquired.

  (4) The pretensional kana data acquisition unit according to any one of (1) to (3), wherein the pretend kana data acquisition unit acquires the combination from ruby displayed on the Web page.

  According to this invention, since the pretend kana collection and acquisition device automatically acquires a combination of a phrase and a pretend kana from ruby, it is easy to see the phrase easily by looking at a ruby tag of a page description language such as HTML (hypertext markup language). A combination with pretend kana can be acquired.

  (5) The pretend kana data acquisition means, when all the characters in parentheses in the character string displayed on the Web page are hiragana characters and the characters immediately before the parentheses are kanji, the characters in the parentheses are immediately before the parentheses. (1) to (4), wherein the combination is acquired by regarding the kana as one of two or more consecutive kanji phrases.

  According to the present invention, when the pretend kana collection / use apparatus is such that all the characters in the parentheses in the character string displayed on the Web page are hiragana characters and the character immediately before the parentheses is a kanji character, the characters in the parentheses are parentheses. Since a combination of a phrase and a pseudonym is acquired by assuming that it is a pseudonym of the immediately preceding kanji phrase, it is possible to automatically acquire a pseudonym attached with parentheses.

  (6) The pretend kana data acquisition means, when all the characters in parentheses in the character string displayed on the Web page are katakana, and the characters immediately before the parentheses are kanji, the characters in the parentheses are immediately before the parentheses. (1) to (5), wherein the combination is acquired by regarding the kana as one of two or more consecutive kanji phrases.

  According to the present invention, when the pretend kana collection and utilization device detects that all the characters in the parentheses in the character string displayed on the Web page are katakana and the character immediately before the parentheses is a kanji, the character in the parentheses is the parenthesis. Since a combination of a phrase and a pseudonym is acquired as if it were a pretend kana phrase of the immediately preceding kanji, the same effect as in (5) can be expected.

  (7) The pretending pseudonym collection / use device according to any one of (1) to (6), wherein the number of appearances is the number of Web pages from which the combination is acquired.

  According to the present invention, since the pretend kana collection and utilization device does not collect the combination of the phrase and the pretend kana from the contents of the same web page, the wrong pretend kana is used multiple times for the same web page. However, the effect can be reduced.

  (8) The fake pseudonym according to any one of (1) to (6), wherein the number of appearances is the number of times the combination has actually appeared on the Web page acquired by the Web page acquisition unit Collection and utilization device.

  According to the present invention, the pretend kana collection and utilization device counts the number of actual appearances on a web page and acquires a combination of a phrase and pretend kana, so that, for example, a plurality of people can write sentences on the same web page like a blog. Can be collected to reflect the number of users.

  (9) The fake kana data extracting means extracts, from the combination recorded by the fake kana data recording means, the one having the largest number of appearances among the fake kana for the same word / phrase. (8) The pretending pseudonym collection and utilization device according to any one of (8).

  According to the present invention, the pretend kana collection / use apparatus can acquire the pretend pseudonym most widely used in the world for the same phrase.

  (10) The fake kana data extracting means extracts, from the combinations recorded by the fake kana data recording means, those having the largest number of appearances among words for the same fake kana. (8) The pretending pseudonym collection and utilization device according to any one of (8).

  According to the present invention, the pretend kana collection / use apparatus can acquire the most widely used words / phrases in the world for the same pretend kana.

  (11) The fake kana data extracting unit extracts, as error data, the combination recorded by the fake kana data recording unit and having the number of appearances smaller than a predetermined number. ) The pretending pseudonym collection and utilization device described in any of the above.

  According to the present invention, the pretend kana collection / use apparatus can acquire a combination of a phrase and a pretend pseudonym whose number of appearances is less than a predetermined number.

(12) A fake pseudonym collection and usage method for collecting information related to fake kana using a computer,
Acquiring the contents of a plurality of Web pages via the Internet;
Obtaining a combination of words and phrases composed of kanji and pretend kana from the content of the web page;
Recording the acquired combination together with the number of appearances;
Extracting the recorded combination according to the number of appearances;
A pretend kana collection and use method characterized by including:

  According to the present invention, the same effect as in (2) can be expected by executing the method using a computer.

According to this invention, the pretend kana collection and utilization device automatically collects combinations of words and phrases composed of kanji and pretend kana from the web page and reuses them according to the number of appearances. Can be reused, and the commonly used pretend pseudonym can be reused.
Further, according to the present invention, the pretend kana collection and utilization device can reuse the combination of the phrase and the pretend kana in accordance with the number of appearances, so that the pretend kana is adapted to the purpose of use in consideration of the difficulty and correctness of kanji. Can be reused.

Hereinafter, the best mode for carrying out the present invention will be described with reference to the drawings. This is merely an example, and the technical scope of the present invention is not limited to this.
(First embodiment)

[Overall view]
FIG. 1 is an overall view showing the relationship between the pretend pseudonym collection and use device 1 and the Web pages 20 to 24 on which the pretend pseudonym collection and use device 1 collects pretend pseudonym data through the Internet 10. The pretend kana collection and utilization device 1 includes a Web page acquisition unit 3 that acquires a Web page to collect pretend pseudonym data, a pretend pseudonym data acquisition unit 4 that acquires pretend pseudonym data from the Web page acquired by the Web page acquisition unit 3, The fake kana data recording means 5 for recording the fake kana data acquired by the fake kana data acquisition means 4, the fake kana data extracting means 6 for extracting the fake kana data recorded in the fake kana data recording means 5 according to the purpose of use, and each of these And a control unit 2 that controls communication and controls communication for accessing the Web pages 20 to 24 through the Internet 10.
Fake kana data means a combination of a phrase and a fake kana, and the same words with different kana, or different words with the same kana data are different kana data. It is.

[Hardware configuration of pretend kana collection and use device 1]
FIG. 2 is a diagram illustrating a hardware configuration of the pretending pseudonym collection and utilization apparatus 1 according to the present embodiment.
The fake pseudonym collection and utilization device 1 includes a CPU (Central Processing Unit) 41 (a plurality of CPUs such as the CPU 42 may be added in a multiprocessor configuration), a bus line 30, a communication I / F (I / F). Interface) 43, main memory 44, BIOS (Basic Input Output System) 45, display device 46, I / O controller 47, and input devices 48 such as a keyboard and a mouse.

The communication I / F 43 is a network adapter for the pretend pseudonym collection and use device 1 to access a server or the like (not shown) in which the Web pages 20 to 24 are held via the Internet 10. The communication I / F 43 may include a modem, a cable modem, and an Ethernet (registered trademark) adapter.
The BIOS 45 records a boot program executed by the CPU 41 when the pretend pseudonym collection / use device 1 is started, a program depending on the hardware of the pretend pseudonym collection / use device 1, and the like.

The display device 46 displays a screen of calculation processing results and the like by the pretend kana collection and utilization device 1, and includes display devices such as a cathode ray tube display device (CRT) and a liquid crystal display device (LCD).
A storage device 51 such as a hard disk 49 and a semiconductor memory 50 can be connected to the I / O controller 47.
The input device 48 accepts input by the administrator of the pretend kana collection / use device 1.
The hard disk 49 stores various programs for functioning as the pretend kana collection and utilization device 1, programs for executing the functions of the present invention, and a table to be described later.

  Although the above example mainly explained the hardware configuration of the pretend kana collection and utilization device 1, the above-described functions are realized by installing a program on a computer and operating the computer as the pretend kana collection and utilization device 1. You can also Therefore, the function realized by the pretending pseudonym collecting and using apparatus 1 described as an embodiment in the present invention is executed by executing the above-described method by the computer or by introducing the above-described program into the computer. This is also possible.

  Note that the computer in the present invention refers to an information processing device including a storage device, a control device, and the like, and the pretend kana collection and utilization device 1 includes an information processing device including a storage device 51, a control device 40, and the like. This information processing apparatus is included in the concept of the computer of the present invention. Here, the control unit 2, the web page acquisition unit 3, the pretend kana data acquisition unit 4 and the pretend kana data extraction unit 6 shown in FIG. Each corresponds.

[table]
FIG. 3 is a diagram showing a URL update date / time table according to the present embodiment. It holds the URL address 100 of the acquired Web page and the last update date and time 101 of the Web page. The URL update date / time table acquires the last update date / time of a file of the Web page from a server or the like that holds the Web page when the Web page is acquired, and records it together with the URL address 100. In this way, when a Web page with the same URL is accessed again, the last update date and time recorded on the server that holds the Web page matches the last update date and time 101 recorded in the URL update date and time table. Since it can be seen that the content of the Web page has not changed since the previous acquisition, acquisition of new pretend kana data can be omitted.

  FIG. 4 is a diagram showing an update reserve table according to the present embodiment. The update preliminary table is a work table used to avoid counting the number of appearances redundantly when a combination of the same phrase and pretend kana appears multiple times in the same Web page. The usage method will be described in the description of the processing flow. It consists of a phrase 110 and a pretend kana 111.

  FIG. 5 is a diagram showing a phrase pretending pseudonym table according to the present embodiment. The phrase pretend kana table is a table for recording a combination of the phrase 120 and the pretend kana 121 acquired from the Web page, and the appearance count 122 is also recorded. By looking at the number of appearances 122, it is possible to determine commonly used pretend kana or wrong pretend kana.

  6 and 7 show examples extracted from the phrase pretend kana table (FIG. 5) based on the number of appearances 122 in accordance with the purpose of use. A specific usage method will be described later.

  FIG. 8 is a view showing the most common pretend kana table according to the present embodiment. The most frequent pretend kana table is obtained by extracting, from the combination of the word 120 and the pretend kana 121 registered in the word pretend kana table (FIG. 5), those having the highest number of appearances among the pretend kana for the same word. The most common pretend kana table is composed of a phrase 130, pretend kana 131, and number of appearances 132.

  FIG. 9 is a diagram showing a most frequent phrase table according to the present embodiment. The most frequent word / phrase table is obtained by extracting the most frequently occurring words / phrases for the same fake kana from the combinations of the word / phrase 120 and the fake kana 121 registered in the word / phrase kana table (FIG. 5). The most frequent phrase table is composed of a phrase 140, a pseudonym 141, and an appearance count 142.

  FIG. 10 is a diagram showing an incorrect word / phrase pretend kana table according to the present embodiment. The incorrect phrase pretending pseudonym table is obtained by extracting the combinations of the phrase 120 and the pretend pseudonym 121 registered in the phrase pretending pseudonym table (FIG. 5) and having the number of appearances not more than a predetermined number. The incorrect phrase pretend kana table is composed of a phrase 150, pretend kana 151, and number of appearances 152.

[Processing flow]
The processing flow of the pretend kana collection and utilization device 1 will be described with reference to FIG. Unless otherwise specified, the following processing is performed by the control device 40 of the pretend pseudonym collection and utilization device 1.
In the present embodiment, the control device 40 of the pretending pseudonym collection and utilization device 1 accesses the plurality of predetermined URL addresses through the Internet 10 according to a predetermined rule and collects the contents of the corresponding Web pages 20 to 24. It is assumed that the process called is performed.
The control device 40 of the pretending pseudonym collection and utilization device 1 accesses the Web pages 20 to 24 based on the URL address through the Internet 10 and acquires the last update date and time of the file of the Web page (S1000).

  Next, it is checked whether or not the URL address of the acquired Web page is registered in the URL update date / time table (FIG. 3) (S1010). If not registered (S1010: No), the URL address 100 and the last update date / time 101 are registered in the URL update date / time table (FIG. 3) (S1020), the contents of the Web page are acquired (S1050), and the pseudonym is acquired. The process proceeds to (S1060 and later). If registered (S1010: Yes), the last update date and time of the obtained Web page file is compared with the last update date and time 101 registered in the URL update date and time table (FIG. 3), and the two match. It is checked whether or not (S1030). If the two match (S1030: Yes), the content of the Web page has not changed from the previous acquisition, so no processing is performed and the processing of the Web page ends. If they do not match (S1030: No), the content of the Web page is different from that obtained last time, so the last update date / time 101 in the URL update date / time table (FIG. 3) is updated (S1040). The contents are acquired (S1050), and the process proceeds to pretend pseudonym acquisition processing (S1060 and later).

  Next, pretend kana data is acquired from the contents of the Web page (S1060). The following two methods are used to acquire pretend kana data. One is a method of obtaining using an HTML ruby tag describing the contents of a Web page. According to the language specification of HTML, a phrase after <rb> in <ruby> and </ ruby> and a pseudonym after <rt> are acquired in pairs.

  For example, from “<ruby> <rb> Naru Nanao <rt> Nananar </ ryby>”, “Phrase: Naru Nanao, Pretend Kana: Nananaru” is acquired. From “<ruby> <rb> beast </ rb> <rp>” (</ rp> <rt> kadamono </ rt> <rp>) </ rp> </ ryby> Beast, pretend pseudonym: Kadamono "is acquired. Note that even languages other than HTML that have a ruby function can be processed in the same manner by extracting the ruby.

  The other method is that if all the characters in the parentheses in the displayed text are hiragana characters and the characters immediately before the parentheses are kanji, the kanji and the hiragana characters in the parentheses are acquired as phrases and pretend kana characters. To do. In this case, when a plurality of kanji characters are consecutive, they are collectively acquired as a phrase. For example, from “Yuwa”, “Phrase: Yuwa, Pretend Kana: Yuwa” is acquired. However, for example, from “Toshizo Hijikata”, “Phrase: Toshizo Hijikata, Pseudonym: Toshizo” is acquired instead of “Phrase: Toshizo, Pseudonym: Toshizo”. In addition, “phrase: natural diary, pretend pseudonym: like” is acquired from the “natural diary”. In this way, there is a possibility that an improper pseudonym is acquired, but this will be dealt with in the process described later. Whether or not it is a Chinese character can be determined by looking at the character code. The same applies when the characters in parentheses are all katakana instead of hiragana.

  It is checked whether or not the pretend pseudonym data acquired in this way is registered in the update reserve table (FIG. 4) (S1070). If not registered (S1070: No), the update reserve table (FIG. 4). (S1080). If it is registered (S1070: Yes), it is not registered in the update preliminary table (FIG. 4). Then, it is checked whether there is still pseudonym data in the Web page with the same URL (S1090). If there is still pretend kana data (S1090: Yes), pretend kana data is acquired in the same manner (S1060). In this way, the processing from step 1060 to step 1090 is repeated. If there is no pretend kana data in the Web page with the same URL (S1090: No), it is registered in the pretend kana table (FIG. 5) based on the update preliminary table (FIG. 4) (S1100 to S1140).

  Next, registration to the phrase pretending pseudonym table (FIG. 5) will be described with reference to FIG. First, a combination of words and pretend kana registered in the update reserve table (FIG. 4) is read (S1100). Then, it is checked whether or not the combination of the read phrase and pretend kana has already been registered in the pretend kana table (FIG. 5) (S1110). If registered (S1110: Yes), “1” is added to the appearance count 122 (S1120). If there is no registration (S1110: No), the combination of the phrase and pretend kana is registered in the pretend kana table (FIG. 5), and “1” is set in the appearance count 122 (S1130). This process is repeated for all pretend pseudonym data registered in the update reserve table (FIG. 4) (S1140).

In this way, combinations of words and pretend kana that are actually used on many Web pages are automatically collected along with the number of appearances, so even if a pretend pseudonym is attached to a Web page. By checking the number of appearances, it is possible to collect pretending pseudonyms used by many people with high accuracy.
In addition, since the number of appearances is counted as one for the same pretend kana data that appears multiple times on the same Web page, for example, even if a certain person repeatedly uses pretend pseudonym data in the same Web page, The number of appearances finally recorded in the phrase pretend kana table (FIG. 5) is handled as one, and the possibility that an incorrect pretend kana is recognized as a correct pretend kana is suppressed.

[Reuse of pretend kana data]
By narrowing down the phrase pseudonym table (FIG. 5) using the pretend kana 121 or the phrase 120 as a key and displaying them in the order of the number of appearances 122, the phrase 120 or the phrase 120 for the pretend kana 121 in the order of frequency used on the Web page. A pretend pseudonym 121 is displayed. FIG. 6 shows an example of narrowing down the phrase pseudonym table (FIG. 5) with the pretend pseudonym 121 “Asuka”, and FIG. 7 shows an example of narrowing down the pretend pseudonym table (FIG. 5) with the phrase 120 “Meisei”. . In this way, pretend kana data corresponding to the purpose of use can be acquired.

  For example, when a normal sentence is displayed on a Web page, for example, the phrase “Myosei” can be given the pseudonym “Myojo” with the highest number of appearances.

  In addition, since the number of appearances is larger, it indicates that many web pages are used with pretend kana, so it is generally estimated that the phrase is difficult to read without pretend kana. . For example, if the number of appearances is 1000 times or more, it may be determined that the word is generally difficult to read. Moreover, although not so many, it is thought that a person with the appearance frequency more than a certain number of times may or may not be pretend to be a pseudonym.

  For example, according to the example of the most common pretend kana table (FIG. 8), “Kin-Kingei” and “Lunyi” are pretend to be pretend to be used on web pages more than 1000 times. Can be considered. In addition, “Etsubushi” and “Melancholy” are 800 times and 300 times, respectively, so they are generally considered to be difficult to read words, even though they are not as good as “Kang Koei” and “Lunyi”. Can be considered. Therefore, when creating a Web page, if the assumed user of the Web page is an adult, pretend kana data with an appearance count of 1000 or more is used, and if the assumed user is a junior high school student or a high school student, for example, A usage method such as using pretend kana data of 300 times or more is conceivable.

Further, according to the most frequent word / phrase table (FIG. 9), it is possible to know the word / phrase having the highest number of appearances for the same fake kana.
On the other hand, “sub-nest” (Asuka) has only one appearance, so it is presumed that an impersonated pseudonym is attached, so it is not generally used. However, a table in which the number of appearances is equal to or less than a certain number of times (for example, 10 times or less), such as an erroneous word pretending kana table (FIG. 10), is created. It can also be displayed and used on a Web page in such a form.

(Second Embodiment)
In the first embodiment, when the same pretend pseudonym data appears multiple times on the same Web page, it is counted as one time. However, the present invention is not particularly limited to this. The number of appearances may be counted as it is and reflected in the number of appearances 122 in the phrase pretend kana table (FIG. 5).

  In the present embodiment, FIGS. 1 to 3 and FIG. 5 are the same as those in the first embodiment. However, the update spare table (FIG. 4) is not used in this embodiment.

[Processing flow]
The processing flow of the pretend kana collection and utilization device 1 will be described with reference to FIG. Unless otherwise specified, the following processing is performed by the control device 40 of the computer that processes the pretend pseudonym collection and utilization device 1. Parts that perform the same processing as in FIGS. 11 and 12 are given the same numbers.

Steps 1000 to 1060 are the same as those in FIG. In this embodiment, since all pretend kana data appearing on the same Web page is counted, registration is not performed in the update reserve table, and all pretend kana data (S1060) acquired from the Web page is reflected in the phrase pretend kana table (FIG. 5). To do. The registration process (S1110 to S1130) to the phrase pretending kana table (FIG. 5) is the same as FIG. However, after the registration process (S1110 to S1130) in the phrase pretending pseudonym table (FIG. 5) is completed, it is checked whether or not pretend pseudonym data still exists in the Web page with the same URL (S1150). If there is still pretend kana data (S1150: Yes), pretend kana data is acquired in the same manner (S1060). If there is no more pretend kana data (S1150: No), the process is terminated.
In this way, since the same pretend pseudonym data is counted by the number of times it actually appears, for example, when multiple people write sentences on the same Web page like a blog, the frequency that is actually used in the world Can be collected.

  As mentioned above, although embodiment of this invention was described, this invention is not restricted to embodiment mentioned above. The effects described in the embodiments of the present invention are only the most preferable effects resulting from the present invention, and the effects of the present invention are limited to those described in the embodiments of the present invention. is not.

It is the whole figure which showed the relationship between the pretend pseudonym collection and utilization apparatus 1 which concerns on an example of embodiment of this invention, and the Web pages 20-24 which pretend pseudonym collection and utilization apparatus 1 collects pretend pseudonym data via the internet 10. FIG. It is a figure which shows the hardware constitutions of the pretend pseudonym collection utilization apparatus 1 which concerns on an example of embodiment of this invention. It is a figure which shows the URL update date table which concerns on an example of embodiment of this invention. It is a figure which shows the update reserve table which concerns on an example of embodiment of this invention. It is a figure which shows the phrase pretending pseudonym table which concerns on an example of embodiment of this invention. It is a figure which shows the example extracted from the phrase pretend kana table (FIG. 5) using the pretend kana as a key. It is a figure which shows the example extracted from the phrase pretend kana table (FIG. 5) using a phrase as a key. It is a figure which shows the most frequent pretend kana table which concerns on an example of embodiment of this invention. It is a figure which shows the most frequent word phrase table which concerns on an example of embodiment of this invention. It is a figure which shows the kana phrase pretending pseudonym table which concerns on an example of embodiment of this invention. It is a flowchart (the 1) of a process of the pretending pseudonym collection utilization apparatus 1 which concerns on the 1st Embodiment of this invention. It is a flowchart (the 2) of a process of the pretending pseudonym collection utilization apparatus 1 which concerns on the 1st Embodiment of this invention. It is a flowchart of a process of the pretend pseudonym collection utilization apparatus 1 which concerns on the 2nd Embodiment of this invention.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1 Prediction Kana collection utilization apparatus 2 Control means 3 Web page acquisition means 4 Prediction Kana data acquisition means 5 Prediction Kana data recording means
6 Pretend Kana data extraction means 10 Internet 20-24 Web page 30 Bus line 40 Control device 41, 42 CPU (Central Processing Unit)
43 Communication I / F (I / F: Interface)
44 Main memory 45 BIOS (Basic Input Output System)
46 Display Device 47 I / O Controller 48 Input Device 49 Hard Disk 50 Semiconductor Memory 51 Storage Device

Claims (12)

Pretend kana data acquisition means for acquiring, from a text in a web page, a combination of words that satisfy a predetermined condition as a combination of a word composed of kanji and its pretend kana,
Fake kana data recording means for recording the combination acquired by the fake kana data acquisition means in a table together with the number of appearances of the combination;
Fake kana data extraction means for extracting a combination for use as a dictionary from the combinations recorded in the table by the fake kana data recording means, based on the magnitude of the number of appearances ,
The pretend kana data extraction means presumes that a combination whose number of appearances is equal to or greater than a predetermined threshold among the combinations recorded in the table is generally difficult to read and used apparatus. The pretend kana data extracting means uses the threshold value set according to the age group of the user assumed by the Web page to be created, and the dictionary satisfying the number of appearances specified by the age group of the user 2. The pretend kana collection and utilization device according to claim 1, wherein When acquiring the contents of a plurality of Web pages via the Internet, if the last update date / time of the Web page from which the contents are to be acquired matches the last update date / time of the already acquired Web page, the contents of the Web page are acquired. phonetic collection using apparatus according to claim 1 or 2, further comprising a Web page acquiring unit not.   4. The pretensional kana data collection and utilization apparatus according to claim 1, wherein the pretend pseudonym data acquisition unit acquires the combination from ruby displayed on the Web page.   The pretend kana data acquisition means, when all the characters in parentheses in the character string displayed on the Web page are hiragana characters and the characters immediately before the parentheses are kanji, the characters in the parentheses are 1 or 5. The pretend kana collection and use apparatus according to claim 1, wherein the combination is acquired by regarding the pretend kana as two or more consecutive kanji phrases.   The pretend kana data acquisition means, when all the characters in parentheses in the character string displayed on the Web page are katakana, and the characters immediately before the parentheses are kanji, the characters in the parentheses are 1 or 6. The pretend kana collection and use apparatus according to claim 1, wherein the combination is acquired by regarding the pretend kana as two or more consecutive kanji phrases.   The fake pseudonym collection / use device according to claim 1, wherein the appearance count is the number of Web pages from which the combination is acquired. 7. The pretending pseudonym collection and utilization apparatus according to claim 3 , wherein the number of appearances is the number of times the combination has actually appeared on a Web page acquired by the Web page acquisition unit.   The phonetic kana data extracting means extracts, from the combinations recorded in the table by the phonetic kana data recording means, those having the highest appearance frequency among the kana for the same word / phrase as combinations for use as the dictionary. 9. The pretend pseudonym collection and use device according to claim 1, wherein   The phonetic kana data extracting means extracts, from the combinations recorded in the table by the phonetic kana data recording means, the phrase having the highest number of appearances among the phrases for the same phonetic kana as a combination for use as the dictionary. 9. The pretend pseudonym collection and use device according to claim 1, wherein   The fake kana data extraction means is a combination for using as a dictionary that extracting, from the combination recorded in the table by the fake kana data recording means, data having an appearance frequency less than a predetermined number as error data 9. The pretend pseudonym collection and use device according to claim 1, characterized in that: A fake pseudonym collection and use method for collecting information on pretend kana executed by a computer,
The computer acquiring the contents of a plurality of Web pages from a server on which the Web pages are held via the Internet;
Acquiring from the text in the web page acquired by the computer a combination of words that satisfy a predetermined condition as a combination of a word composed of kanji and its pretend kana;
Recording the combination acquired by the computer in a table together with the number of occurrences of the combination;
Extracting the combination to be used as a dictionary from the combinations recorded in the table by the computer according to the number of appearances , and
The extracting step estimates a combination whose number of appearances is equal to or greater than a predetermined threshold among the combinations recorded in the table as a word that is generally difficult to read. .

Images