JPH0589181A - Trademark retrieving device - Google Patents

Abstract

PURPOSE:To very easily retrieve the registered or pending trademark having the characters or pronunciation coincide with the characters constituting a trademark or pronunciation for it respectively when examining and screening the one having little possibility to be registered out of several tens of trademarks. CONSTITUTION:The plural retrieving character strings inputted at the same time from an input device 2 are read out one by one, and a trademark having the trademark or pronunciation coincide with the retrieving character string is retrieved out of registered or pending trademarks stored in a data base 7 and then stored in a retrieving result storing area 5c, and each time a retrieval process is completed, a retrieving result is outputted as a list from an output device 3, and then each time the list is outputted the stored content of the retrieving result storing area 5C 15 erased. An arithmetic processor 6 repeatedly addresses the above stated series of processes according to the data numbers of a retrieving character string.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a trademark search apparatus for searching a trademark containing a registered character and a pending application for a trademark including a predetermined character or a name.

[0002]

2. Description of the Related Art Generally, the quality of a trademark attached to a product or the like affects the sales of the product using it and the degree of use of the service. Therefore, each company develops a new product, etc.
A great deal of effort is also spent in determining the trademark. When deciding a trademark, for example, the trademark is solicited through in-house public offering,
From among these, after repeated examinations, those that match the product concept are picked up and dozens of trademark candidates are selected, and then one trademark is decided at a board of directors meeting.

However, even if the trademark is determined in this way, the same or similar trademark may already be registered or applied for. In such a case, the selection of the trademark must be redone. .. And usually, it is selected again from other trademarks selected as trademark candidates,
It is quite possible that the same and similar trademarks have already been registered or applied for these trademarks.

In order to avoid this, it is confirmed in advance whether or not there are dozens of trademark candidates remaining as trademark candidates, the same or similar registered trademark and the pending trademark, and the corresponding trademark exists. If only the items that are not registered are left as trademark candidates, the possibility of registering these trademark candidates also increases.

[0005]

However, in order to conduct a registered trademark and trademark application pending for such dozens of trademark candidates in advance, enormous effort, time and cost must be spent, and Little research has been done on trademarks. Then, in order to reduce the labor, time, and cost required for determining a trademark, each company applies in advance for a trademark that is not planned to be used, registers it, and manages it as a so-called stock trademark. When making a decision, we try to select from the stock trademarks. The number of such stock trademarks becomes enormous, which causes an adverse effect that a person who truly wants to use the trademark cannot use the trademark.

[0006] Conventionally, in order to reliably investigate the possibility of registering a trademark, the presence or absence of the same or similar registered trademark or trademark in application has been searched by a computer based on its name. However, since this system focuses on finding similar trademarks, there is a problem that internal processing for defining the similar range is very troublesome and the search time becomes very long. In addition, it is not necessary to investigate the similar range for a trademark that has the same registered trademark or a trademark that is currently applied and has no possibility of registration, so even if you try to search for the same trademark first, The processing is very slow because it is searched by the same procedure as when searching for a range.

Moreover, it is not possible to input the respective names for a large number of trademarks at one time, and the names must be input one by one each time the search result is output. Therefore, the operator has to sequentially input the calls to be searched one by one each time the search result is output for one call, which makes the input operation very troublesome.

However, at the stage of filtering out a trademark that is unlikely to be registered from dozens of trademark candidates, it suffices to discontinue the search when the same trademark is discovered, and it is not necessary to perform a search to a strict similar range. No, but it requires fast processing of a large number of trademarks to be searched. Therefore, the present invention is a registered trademark or a pending trademark having a character or a name matching with a character constituting each trademark or a name derived from the trademark when passing out a dozen of trademark candidates with extremely low possibility of registration. The search for the trademark can be performed extremely easily, and the great effort required for the conventional manual operation is reduced, and at the same time, inputting a large number of search condition setting data at one time reduces the effort of input operation, The challenge is to be able to search in a short time.

[0009]

In order to solve this problem, the present invention relates to at least a registered trademark in the same product category as the trademark to be searched and a trademark in application, which is a trademark showing characters constituting the trademark. A database in which data, name data representing one or more names that can be generated from a trademark, number data such as an application number, a publication number, and a registration number attached according to the examination process are written, and an input format displayed on a display device. According to the above, an input device capable of inputting a plurality of characters constituting a trademark to be searched or a name of a trademark at one time as a search character string, a storage area for storing the database, and storing the plurality of search character strings individually. A storage device having a search character string storage area and a search result storage area for storing a searched trademark, and the search character string storage area For each search character string stored in,
A reading process for reading the character strings one by one, and searching for a trademark having a character or a name matching the search character string among the registered trademarks and the applied patents stored in the database, and storing the retrieved result in the search result storage area. A search process for storing, an output process for outputting a list of the search results stored in the search result storage area each time the output device outputs the list, and a search process for storing the search result each time the list is output. The arithmetic processing device is characterized by comprising a series of processes including an erasing process for erasing the stored contents of the area, which are sequentially repeated according to the number of data of the search character string.

[0010]

According to the present invention, a plurality of search character strings can be input at a time in accordance with the input format displayed on the display device, so that it is troublesome to input each search result one by one. Absent. Then, at least the registered trademark of the same product category as the trademark to be searched and the database in which the trademark under application is recorded are searched for a trademark having a character or a name matching the search character string,
It is possible to obtain materials for filtering out items that are extremely unlikely to be registered.

Therefore, by using the trademark search apparatus according to the present invention, this kind of research work which has been conventionally carried out by manual research can be carried out very easily, and labor, time and cost can be remarkably reduced. In addition, this search process only determines whether or not a part or all of the characters or names forming the trademark stored in the database match the search character string, and thus it is troublesome when defining the similar range. No processing is required, and the search time is extremely short.

Further, every time the searched trademarks are output as a list, the recorded contents of the search result recording area are erased, and the search result for the next search condition setting data is stored. A large-capacity memory that can store all the search results of the search condition setting data for several minutes is not necessary, and a memory capacity necessary for performing a search for one search condition setting data is sufficient.

[0013]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS The present invention will be specifically described below based on the embodiments shown in the drawings. FIG. 1 is a flow chart showing a trademark search device according to the present invention, FIG. 2 is an explanatory diagram showing recorded contents of a database, FIG. 3 is a flowchart showing a trademark search processing procedure, and FIG. 4 is an explanatory diagram showing a list of search results. Is. The character trademark search device is a display device 1 such as a CRT display.
An input device 2 such as a keyboard and a mouse, an output device 3 such as a printer for printing and outputting a list of search results,
These include a computer C connected to the input / output port 4, and the computer C has at least the storage device 5.
And an arithmetic processing unit 6.

On the display device 1, when the computer C is started up, a first search for searching for a trademark that matches a search character string representing a trademark or a name and a second search for searching for a trademark similar to a specific trademark. A menu for selecting a search and a third search for performing a trade name search for a trademark and a trademark specified by the applicant is displayed.

In this case, when the first search is selected, a plurality of search character strings that represent the product category of the trademark to be searched and the characters that make up the trademark or a name that can be derived from the trademark are displayed at once. The available input formats are displayed. In addition, when the second search is selected, the product category of the specific trademark to be searched up to the similar range and the input format for inputting the characters composing the trademark or the name that can be generated from the trademark as the search target data are displayed. To be done. Furthermore, when the third search is selected, the product category of the trademark to be searched, its name, and the input format for inputting the name or name of the applicant or the trademark right holder are displayed.

An input device 2 such as a keyboard or a mouse
Is the input format displayed when the first search, the second search, or the third search is selected according to the menu displayed on the display device 1 when the computer C is started up, or when each search is selected. Enter the required data according to.

Reference numeral 7 indicates at least the registered trademark in the same product category as the trademark to be searched and the trademark under application, as shown in FIG. 2, for each trademark, from the trademark data and the trademark representing the characters constituting the trademark. Name data representing one or more names that may occur, number data such as application number, publication number and registration number attached with examination progress, name data representing name / name of applicant or trademark owner, filing date, It is a database in which date data such as registration date and update registration date are written, and is supplied by a flexible disk or the like. The name data includes not only names that can be generated from the characters that form the trademark but also names that are generated from the symbols and figures that form the trademark.

When the trademark inputted in this way has a plurality of pieces of call data, it is processed into a data file in which data other than the call data such as number data and trademark data overlaps each call data. Managed as a single data file that has been recorded and recorded, or a main data file that stores trademark data and number data and other data for the first call data, and common number data for the second and subsequent call data (for example, application It is managed as a plurality of data files consisting of sub-data files containing only (number data).

In the database 7, each data is written for each predetermined period in accordance with a trademark registration application and its disposal within the period, for example, publication of application, registration of trademark right registration, renewal registration, etc. In addition, when the refusal, invalidation of the application, the decision to invalidate, and the decision to cancel were finalized, unnecessary data was deleted and new data was written in order to save the memory capacity for the database. A new database will be provided. It should be noted that the database 7 examines registered trademarks and pending trademarks by classifying them by product category, unpublished pending trademarks, unregistered trademarks after publication and registered trademarks. The data may be classified and recorded over time according to the progress.

A storage area 5a for storing the database 7 is stored in the storage device 5, and when the first search is selected,
A search character string storage area 5b capable of individually storing the plurality of search character strings, and a search target for characters or trademark names constituting a specific trademark to be searched up to a similar range when the second search is selected. The search target storage area 5d to be stored as data, and the portion of the characters or names stored as the search target data in the search target storage area 5d, which is to be changed in character or sound, are converted into a character representing an arbitrary character string. A trademark having a plurality of similar search character string storage areas 5e for individually storing a plurality of replaced similar search character strings and a character or a name matching the similar search condition setting data stored in the similar search character string storage area 5e. Is stored when a similar trademark search file 5f, a similar range setting file 5g in which a similar range is set, and a third search are selected. A search character string representing the name of the trademark to be sought and a search condition storage area 5h storing the search data representing the name / name of the applicant or the trademark right holder, the first search, the second search, and the third search. It is composed of a search result storage area 5c for storing the trademark searched for when it is executed.

Next, the processing procedure of the arithmetic processing unit 6 will be described with reference to FIG.
It will be described with reference to the flowchart shown in FIG. When the computer C is started up, the program shown in FIG. 3 is started to be executed. First, in step (1), the display device 1 is first searched,
A menu for selecting the second search and the third search is displayed,
Then, the process proceeds to step (2), and the first search, the second search and the third search are selected by performing a predetermined key operation or mouse operation on the input device 2 in accordance with this menu display.

When the first search is selected, the process proceeds to step (3), in which the item classification data for specifying the search range and the input format for sequentially inputting a plurality of search character strings are displayed on the display device 2. .. Then, in step (4), in accordance with the input format, the commodity classification data and n pieces of search condition setting data consisting of the main part of the trademark to be searched or its name are sequentially input.

At this time, for example, when trying to search for a trademark using the characters "Spring", the character string "Spring" that constitutes the trademark and the nicknames "Hull" and "Shun" derived from the characters are searched for in the search character string. Entering as means that a trademark having the characters "spring" and the names "Hull" and "Shun" will be searched.

As a search character string, some characters are
It is also possible to set the character replaced with a character representing an arbitrary character or character string. For example, when searching for the trademark "~~ office", if there is a possibility that a registered trademark "~~ office" exists, the characters "?" If it is replaced with, any trademark can be searched by setting the search character string to "...

When the input of the search character string is completed, the step
Moving to (5), each search character string Di (i = 1 to n) is individually stored in the plurality of search condition storage areas 5b. Then, when the input device 2 is operated to give a search execution instruction in step (6), the process proceeds to step (7), and i = 1 is set to specify the search character string. Then step
Going to (8), referring to the database 7 of the corresponding product category, regarding the first search condition setting data D ₁ stored in the search condition storage area 5b, the registered trademark and pending application recorded in the database 7 Among the trademarks, a trademark in which a part or all of the trademark data or the nominal data matches the search character string D ₁ is searched.

When the search for the search character string D ₁ is completed, the process proceeds to step (9), in which the searched trademarks are sorted and stored in the order of Japanese syllabary based on the calling data and stored in the search result storage area 5c. Then, the process proceeds to step (10) and the search results are listed and output from the output device 3. As shown in FIG. 4, in the list, the product category and the search character string D ₁ are written at the beginning, and the searched trademarks are arranged in the order of the Japanese syllabary of the name data. The publication number, the registration number, and the applicant are displayed, and the pronouncing of the nominal data is also written and output before the trademark. For a trademark having a plurality of name data, the database 7 is managed for each corresponding name, so that the same trademark is output in duplicate for each name.

When the list is output, the process goes to step (11) to erase the stored contents of the search result storage area 5c, and to step (12) to determine whether i = n. When i ≠ n, the process moves to step (13) and i = i +
After replacing with 1, the procedure returns to step (8), and when i = n, the search is completed for all the search character strings Di (i = 1 to n). Therefore, the contents of the search character string storage area 5b Erase and return to step (2).

When the second search is selected in step (2), the process proceeds to step (14), the input format is displayed on the display device 2, and the step is the same as when the first search is selected. In (15), according to the input format,
Merchandise classification data and search target data representing a name or a name that can be generated from a trademark constituting a specific trademark to be searched up to the similar range are input and stored in the search target storage area 5d. This search target data does not have to replace some characters with characters that represent arbitrary character strings,
A character string that represents a character that constitutes a trademark or its name is input.

Next, in step (16), as shown in Table 1, a part of the search target data is replaced with an arbitrary character or a character representing a character string to set the search condition n.
The similar search character strings Ri (i = 1 to n) are set.
This is based on the set theory for setting the number of characters to be changed, deleted, or inserted depending on the length of the character string of the search target data, from one character to a predetermined number of characters, and which character of the search target data is changed. It is designed to set a character string and eliminate duplicate character strings.

[0030]

[Table 1]

For example, the change, deletion, and insertion of one character will be described by taking a search character string "ABCD (A to D is Kana characters)" representing a trademark as an example, and as shown in Table 1, any one character can be changed. Various similar search character strings Ri (i = 1 to n) are automatically set by using the character “?” That represents and the character “*” that represents an arbitrary character string regardless of the number of characters.

In determining the similar search character string Ri (i = 1 to n), first, for each character of the search character string, all conditions for changing one character, deleting one character, and inserting one character are listed. If duplicated ones are omitted from among these, four similar search character strings Ri are set. When a search condition for changing, deleting, or inserting two or more characters is set, the condition is determined by the combination of the characters to be changed. In addition, for example, for a trademark having five letters or a trademark that produces a five-sound notation, the search character string is
Instead of "* B ?? E *""* A ?? D *""*A?"
? E * ”and“ * AB ?? DE * ”may be used. As described above, by using an arbitrary character and a character representing a character string, it is possible to set various kinds of conditions that may be determined to be similar with very few search condition setting data. Further, the similarity search character string may be input by the operator by operating the keyboard or the like.

Although Table 1 describes an example of similar search condition setting data in the case of one-character change, one-character deletion, and one-character insertion, this condition is two-character change, two-character deletion, two-character deletion. It can be set arbitrarily including insertion. In addition, the case where "*" is added to the beginning and end of a word is explained, but if you attach only the beginning of a word, you can search only for trademarks whose ending matches the similar search condition setting data. For example, it is possible to search only a trademark whose word head part matches the similar search character string. Furthermore, it goes without saying that "?" And "*" are replaced with the same type of mark depending on the type of computer.

Next, in step (17), each similar search character string Ri (i = 1 to n) is sequentially stored in each similar search character string storage area 5e of the storage device 5. And
When a search execution instruction is given by operating the input device 2 in step (18), the process proceeds to step (19) and all the similar search character strings Ri stored in the similar search character string storage area 5e.
For (i = 1 to n), referring to the database 7 of the corresponding product category, the first similar search character string Ri (i = 1 to n) stored in the similar search character string storage area 5e.
With respect to, the registered trademark and the pending application recorded in the database 7 are searched for a trademark that matches the condition of the similar search character string Ri and are stored in the similar trademark search file 5f.

When the similar trademark search file 5f is created, the process proceeds to step (20), where the trademark stored in the similar trademark search file 5f is stored in the search target storage area 5d. In the search target data, the part in which the similar search character string Ri is replaced with "?" Or "*" matches the character or sound changed within the similar range set in the similar range setting file 5g. To search.

In the similarity range setting file 5g, for example, when the retrieval character string is a nominal, at least the same consonant and vowel in the syllabary, a long consonant "-", a consonant "t", a dull sound, a semi-voiced sound, , Alphabets with similar shapes and pronunciations are set as similar ranges. Therefore, for example, when the "ru" part of the trademark name is replaced with "?" Etc. as the search target data, the same consonant "Larrilello", the same vowel "Ukutsunufumuyuru" or "n""-"" The trademark that matches the one replaced with "" is searched. In addition,
If the search string is the alphabet that makes up the trademark,
Vowels and consonants with similar pronunciations are set as similar ranges.

When the search is completed, the process proceeds to step (21), where the searched trademarks are sorted in the order of Japanese syllabary based on the name data and stored in the search result recording area 5c.
In step (22), the search results are listed and output from the output device 3. In this list, the product category and the similar search character string are recorded at the beginning, and the searched trademarks are arranged in the order of the Japanese syllabary in the same way as in the first search. The publication number, registration number, and applicant are displayed, and the pronouncing data of the nominal data is written before each trademark.

When the output of the list is completed, the process proceeds to step (23) to erase the storage contents of the search result storage area 5c, the search target storage area 5d, the similar character string storage area 5e and the similar search file 5f. Then return to step (2).

As described above, when the similarity judgment is made, a plurality of similar search character strings Ri are searched by the set theory for the matching ones and the similar search file is created. It is possible to cover all the similar areas. In addition, from the database 7 in which a large number of trademarks are recorded, only the trademarks that match the conditions set by the similar search character string are extracted to create a similar trademark search file, and the similar trademark search file is created. I try to find a trademark similar to a specific trademark stored as search target data from
The number of trademarks to be searched is limited, and the processing time is very short when making a similarity judgment.

Further, when the third search is selected in step (2), the process proceeds to step (27) and the display device 1 displays
Displayed is an input format in which the product category data of the trademark to be searched, the search character string representing the name of the trademark, and the search data representing the name or name of the applicant or trademark owner can be entered. Next, in step (28), the product category data, the search character string, and the search data are input from the input device 2 according to the input format. In this case, a plurality of search character strings can be simultaneously input to the same applicant and the same trademark right holder. It is also possible to set a search character string in which some characters are replaced with arbitrary characters or a character (for example, "?") Representing a character string.

When the input of each data is completed, the step (2
After shifting to 9), each search condition setting data is stored in the search condition storage area 5h of the storage device 5. Then, when the input device 2 is operated to give a search execution instruction in step (30), the process proceeds to step (31), in which the registered trademark and the trademark applied for in the database 5a corresponding to the product category data are registered. Of which, the name of the applicant or the trademark owner has a name that matches the search character string in the search condition setting data, and
A trademark whose name data representing a name matches the search data is searched for.

When the search is completed, the process moves to step (32), the searched trademark is stored and stored in the search result storage area 5c, and the process goes to step (33) to output the search result and the corresponding trademark. If there is more than one, this is output as a list. Next, the process proceeds to step (34), the contents of the data stored in the search condition storage area 5h and the search result storage area 5c are erased, and the process returns to step (2).

The steps (6) to (9), (18) to (21) and
(30) to (32) are search processes in the first search, the second search, and the third search, respectively, and steps (10), (22), and (33) output the search results stored in the search result storage area 5c. The output processing to be output from the device 3, steps (11), (23) and (34) are the deletion processing for deleting the stored contents of the search result storage area 5c.

As described above, according to this example, the first search for searching only for a match with the search character string and the second search for searching for similar strings are separately performed. Regarding the investigation conducted to filter out the trademark candidates with extremely low registration possibility out of the dozen possible trademark candidates, the first search that does not search the similar range may be performed. In this first search, since a large number of search character strings are input at one time and a search is performed for each character string, it is not necessary to wait for the output of detection results one by one when inputting search condition setting data,
The input operation becomes very easy. Further, the first search only requires a judgment as to whether or not a part or all of the trademark data / name data of the trademark stored in the database matches the search character string, and therefore the search time is short.

Then, a second search is performed to search the similar range only for those which are not applicable in the first search. As a result, powerful materials for determining the registration possibility can be obtained. That is, for a trademark that has no possibility of registration, such as the same registered trademark or a trademark being applied for,
Since it is not necessary to investigate the similar range, it can be filtered out by the first search, and the second search can be performed only for the trademarks that need to be searched up to the truly similar range, so the search time can be shortened as a whole. It

The list output as the search result is arranged in the order of the Japanese syllabary of the nominal data, and the initials of the nominal data are also written, so that it is very easy to see when used as a reference material. Also, each time the list is output, the recorded contents of the search result recording area 5c are erased and the search results for the next search condition setting data are stored, so that the search condition setting data for the input number of A large-capacity memory that can store all the search results is not necessary, and a memory capacity necessary for searching one search condition setting data is sufficient.

Further, according to the third search, it is possible to search for a trademark having the same name and applicant, so it is possible to easily search whether or not the trademark used by a competitor is applied for and registered. You can do so by searching the trademark or registered trademark for which the name matches and checking the application number, publication number, and registration number, and browsing the application documents, gazettes, and registration ledgers. There is no need to worry about identifying people or trademark owners.

[0048]

As described above, according to the present invention, when narrowing down a large number of trademark candidates to several trademark candidates, a plurality of trademarks including a predetermined character or a designation are searched and registered. It is possible to filter out items with extremely low possibility in advance. In this case, multiple search condition setting data can be input at one time, which saves time and effort for input operation and makes it possible to save the trademark stored in the database. However, since it is merely determined whether or not it has a character or a name matching the search condition setting data, there is an effect that a lot of trademark candidates can be searched in a short time.

Further, the labor, time and cost of the trademark search are remarkably reduced, and the useless trademark registration application which was carried out to eliminate such labor can be reduced, and the harmful effect of the stock trademark can be prevented. In addition to being useful, it also has the effect of reducing the examination effort for trademarks.
Furthermore, since the stored contents of the search result storage area are erased each time one search process is completed and a search result is output, a large capacity memory is not required and a trademark is searched with one search character string. In this case, there is also an effect that it is possible to continuously search a large number of search character strings with a sufficiently small capacity memory.

[Brief description of drawings]

FIG. 1 is a flow sheet showing a trademark search device according to the present invention.

FIG. 2 is an explanatory diagram showing recorded contents of a database.

FIG. 3 is a flowchart showing a processing procedure for trademark search.

FIG. 4 is an explanatory diagram showing a list of search results.

[Explanation of symbols]

C ... Computer 1 ... Display device 2 ... Input device 3 ... Output device 5 ... Storage device 5a ... Database storage area 5b ... Search character string storage area 5c ... Search result storage area 5d ... Search target storage area 5e ... Similar search character string storage area 5f ... Similar trademark search file 5h ... Search condition storage area 6 ... Arithmetic processing device 7 ... Database

Claims (4)

[Claims] 1. A) At least for a registered trademark in the same product category as the trademark to be searched or a trademark under application, trademark data representing the characters constituting the trademark, and call data representing one or more calls that can occur from the trademark. , The database (7) in which the number data such as the application number, publication number, registration number, etc. attached with the progress of the examination is written, and B) Attempt to search according to the input format displayed on the display device (1). An input device (2) capable of inputting a plurality of characters constituting a trademark or a name of a trademark as a search character string at one time; and C) a storage area (5) for storing the database (7).
a storage device (5) which comprises a) and has a search character string storage area (5b) capable of individually storing the plurality of search character strings and a search result storage area (5c) storing the searched trademark; ) For each search character string stored in the search character string storage area (5b), a reading process for reading out the character string one by one, and the registered trademark and the applied trademark registered in the database (7) , Searching for a trademark having a character or a name matching the search character string, and searching the storage area for the search result (5
c) a search process to be stored, an output process to output a search result stored in the search result storage area (5c) as a list from the output device (3) each time the search process is completed, and a list. From the arithmetic processing unit (6), which performs a series of processes consisting of an erasing process for erasing the stored contents of the search result storage area (5c) each time it is output, in accordance with the number of data of the search character string. A trademark search device characterized by: 2. A) At least for a registered trademark in the same product category as the trademark to be searched and a trademark under application, trademark data representing characters constituting the trademark, and nominal data representing one or more nominal names that can be generated from the trademark. , A database (7) in which number data such as application number, publication number, registration number, etc., attached along with the examination process is written, and B) a predetermined search character string according to the menu displayed on the display device (1) The display device (1) is selected when a first search for searching for a trademark having a character or a name matching with and a second search for searching for a trademark similar to a specific trademark are selected. According to the input format displayed in, a plurality of characters constituting the trademark to be searched or the name of the trademark can be input as a search character string at a time, and when the second search is selected, the display device (1 ), An input device (2) for inputting characters constituting a specific trademark or a name of the trademark for which similarity judgment is to be performed, and C) a storage area (5) for storing the database (7).
a) and a search character string storage area (5) in which the plurality of search character strings can be individually stored when the first search is selected.
b), a search target storage area (5d) for storing, as search target data, a name of a character or a trademark that constitutes the specific trademark when the second search is selected, and the search target storage area (5d) Among the characters or names stored as data to be searched in, the part that is to be changed in character or sound is replaced with a character that represents an arbitrary character string. A search character string storage area (5e) and a search result recording area (5 that stores the trademarks searched by the first search and the second search
c) and a storage device (5) including: (d) When the first search is selected, one set of data is stored for each search character string stored in the search character string storage area (5b). Of the registered trademark and pending trademark recorded in the database (7), which are read out one by one,
A search process of searching for a trademark having a character or a name matching the search character string and storing it in the search result storage area (5c), and a store process in the search result storage area (5c) each time the search process is completed. A series of processes including an output process for outputting the retrieved search results as a list from the output device (3) and an erasing process for erasing the stored contents of the search result storage area (5c) every time the list is output. Is sequentially repeated according to the number of data of the search character string, and when the second search is selected, the registered trademark and the trademark under application recorded in the database (7) of the same product category are A file creating process for creating a similar trademark search file (5f) by searching a trademark having a character or a name matching each similar search character string stored in the similar search character string storage area (5e). When, the trademark was recorded in the similar trademark search file (5f), the search target storage area (5
With respect to the search target data stored in d), characters or sounds are changed within the similarity range by referring to the similarity range setting file (5g) in which a portion representing an arbitrary character string of the similarity search character string is set in advance. A search process for searching for a trademark that matches the search result and storing it in the search result storage area (5c), and each time the search processing ends, the search result storage area (5c
An output process for outputting the search results stored in (c) as a list from the output device (3), and an arithmetic processing device (E) for deleting the stored contents of the search result storage area (5c) each time the list is output ( 6) A trademark search device comprising: 3. A) At least for a registered trademark in the same merchandise category as the trademark to be searched and a trademark under application, trademark data representing characters constituting the trademark, and nominal data indicating one or more nominal names that can be generated from the trademark. , A database (7) in which number data such as an application number, a publication number, and a registration number attached according to the progress of examination is written, and B) a storage area (5) for storing the database (7).
A storage device (5) that includes a) and a search result storage area (5c) that stores a trademark searched under arbitrary conditions among the trademarks recorded in the database (7), and C) each of the above. The trademarks stored in the storage areas (5a, 5b) are sorted in the order of Japanese syllabary based on the calling data,
A trademark search device comprising an output device (3) for outputting as a list in which the characters representing the onset of the nominal data are listed. 4. A) At least for a registered trademark in the same product category as the trademark to be searched and a trademark being applied for, trademark data representing characters constituting the trademark, and nominal data representing one or more nominal names that can occur from the trademark. , Database (7) in which number data such as application number, publication number, registration number, etc. attached along with the progress of examination, name data representing the name / name of the applicant or trademark owner, and B) display device In accordance with the input format displayed in (1), enter the name generated from the trademark to be searched as a search character string, and enter the name of the applicant or trademark owner.
An input device (2) for inputting a name as search data, and C) a storage area (5) for storing the database (7).
a), a storage device (5) including a search condition storage area (5h) for storing the search character string and search data, and a search result recording area (5c) for storing the searched trademark, D) The search character string stored in the search condition storage area (5h) is read, and the registered character and the applied trademark which are recorded in the database (7) have a name matching the search character string, and A search process in which the applicant or trademark owner searches for a trademark that matches the search data and stores it in the search result storage area (5c); and when the search processing ends, stores in the search result storage area (5c). A trademark search device comprising an output device (3) for outputting the searched result output from the output device (3) and an arithmetic device (6) for performing the output process.