KR19990017913U - Kanji database that allows you to find Chinese characters using multiple copies - Google Patents

Kanji database that allows you to find Chinese characters using multiple copies Download PDF

Info

Publication number
KR19990017913U
KR19990017913U KR2019970031050U KR19970031050U KR19990017913U KR 19990017913 U KR19990017913 U KR 19990017913U KR 2019970031050 U KR2019970031050 U KR 2019970031050U KR 19970031050 U KR19970031050 U KR 19970031050U KR 19990017913 U KR19990017913 U KR 19990017913U
Authority
KR
South Korea
Prior art keywords
kanji
find
copies
chinese characters
soil
Prior art date
Application number
KR2019970031050U
Other languages
Korean (ko)
Inventor
이병배
Original Assignee
이병배
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 이병배 filed Critical 이병배
Priority to KR2019970031050U priority Critical patent/KR19990017913U/en
Publication of KR19990017913U publication Critical patent/KR19990017913U/en

Links

Landscapes

  • Document Processing Apparatus (AREA)

Abstract

본 고안은 한자를 찾고자 할 때, 그 한자에 포함되어 있는 여러 개의 부수를 사용하여 복합적으로 한자를 찾을 수 있도록 한 한자사전용 한자데이터베이스에 관한 것이다.The present invention relates to a kanji database for kanji dictionary that enables the user to search kanji by using multiple copies included in the kanji.

종래 한자사전(옥편, 자전)은 오직 하나의 부수만으로 한자를 찾을 수 있도록 되어 있어, 만약 그 한자의 부수를 제대로 알지 못하면 한자를 찾는데 많은 시간이 소요된다.Conventional Chinese dictionary (okpyeon, rotation) is to be able to find the kanji with only one copy, it takes a lot of time to find the kanji if you do not know the copy of the kanji.

본 고안은 종래 이러한 결점을 해소하기 위하여 연출한 것으로, 우선 각각의 한자에 포함되어 있는 모든 부수를 분석하고 정리하여 한자데이터베이스를 만들었다. 이로 인하여 한자를 찾을 때, 여러 개의 부수를 복합적으로 사용하여 한자를 신속하게 찾을 수 있다.The present invention has been directed to solve such drawbacks in the prior art, and firstly, a Chinese character database was made by analyzing and arranging all copies contained in each Chinese character. This makes it possible to find Chinese characters quickly by using a combination of multiple copies when searching for Chinese characters.

예를 들면 培는 {흙토}, {설립}, {입구}, {흙토+설립}, {흙토+입구}, {설립+입구}, {흙토+설립+입구} 등의 7가지로 찾을 수 있는데, 여기서는 한가지 부수보다는 두 가지 부수의 조합으로 찾는 것이 쉬우며, 또한 두 가지 부수보다는 세 가지 부수의 조합으로 찾는 것이 쉽다. 그리고 여기에 총획이나, 음을 함께 추가시키면 한자 찾기가 더욱더 쉬워진다.For example, 培 can be found in seven ways: {soil}, {establishment}, {entry}, {soil + found}, {soil + entrance}, {establishment + entrance}, {soil + establishment + entrance}. Here, it is easier to find a combination of two copies rather than one copy, and it is easier to find a combination of three copies rather than two copies. If you add a stroke or a note to it, it will be easier to find Chinese characters.

Description

여러 개의 부수를 사용하여 한자를 찾을 수 있도록 한 한자데이터베이스Hanja database for finding Chinese characters using multiple copies

제 1 도는 본 고안의 데이터베이스 구성도1 is a block diagram of the database of the present invention

* 도면의 주요부분에 대한 부호의 설명* Explanation of symbols for main parts of the drawings

1 : 한자2 : 음과 뜻1: Chinese character 2: Yin and meaning

3 : 총획4 : 여러 개의 부수3: total stroke 4: multiple copies

본 고안은 한자를 찾고자 할 때, 그 한자에 포함되어 있는 여러 개의 부수를 사용하여 복합적으로 한자를 찾을 수 있도록 한 한자사전용 한자데이터베이스에 관한 것이다.The present invention relates to a kanji database for kanji dictionary that enables the user to search kanji by using multiple copies included in the kanji.

종래 한자사전(옥펀, 자전)은 오직 하나의 부수만으로 한자를 찾을 수 있도록 되어 있어, 만약 그 한자의 부수를 제대로 알지 못하면 한자를 찾는데 많은 시간이 소요된다.Traditional Chinese kanji dictionary (oxen, gyokja) is to be able to find the kanji with only one copy, if you do not know the copy of the kanji properly, it takes a lot of time to find the kanji.

본 고안은 종래 이러한 결점을 해소하기 위하여 안출된 것으로, 우선 각각의 한자에 포함되어 있는 모든 부수를 분석하고 정리하여 한자데이터베이스를 만들었다. 이로 인하여 한자를 찾을 때, 여러 개의 부수를 복합적으로 사용하여 한자를 신속하게 찾을 수 있다.The present invention was devised in order to solve such a deficiency in the prior art, and firstly, a Chinese character database was made by analyzing and arranging all copies contained in each Chinese character. This makes it possible to find Chinese characters quickly by using a combination of multiple copies when searching for Chinese characters.

이를 첨부도면에 의거하여 상세히 설명하면 다음과 같다.When described in detail based on the accompanying drawings as follows.

데이터베이스의 필드(field)는 한자(1), 뜻과 음(2), 총획(3), 여러 개의 부수(4)로 구성되어 있고, 그 여러 개의 부수(4)에는 그 한자에 포함되어 있는 모든 부수를 포함하여서 된 한자데이터베이스이다.The field of the database consists of Chinese characters (1), meaning and sound (2), total strokes (3), and multiple copies (4), and each of these copies (4) contains all Kanji database containing copies.

이와 같이 구성된 한자데이터베이스(제1도)에서 培를 찾고자 한다면, 이 한자의 부수인 흙토(土), 설립(立), 입구(口)가 포함된 모든 레코드를 찾으면 된다. 하지만 사용자가 부수를 일부분만 알고 있다면 예를 들면 흙토(土)만 알고 있다면 흙토(土)가 포함된 한자가 매우 많아 찾기가 어려울 것이다. 따라서 부스를 많이 알면 알수록 한자 찾기가 쉬워진다. 이로 인하여 사용자가 본 고안인 한자데이터베이스를 사용할 경우 한자 부수를 자연적으로 외울 수 있으며, 한자를 신속하게 찾을 수 있다.If you want to find 培 in the Chinese character database (figure 1), you can find all records that contain the swelling, establishment, and entrance of the kanji. However, if the user only knows a part of the copy, for example, if only the soil soil (토) will be difficult to find so many Chinese characters containing soil soil (흙). Therefore, the more you know the booth, the easier it is to find Chinese characters. Therefore, when the user uses the Chinese character database of the present invention, the number of Chinese characters can be memorized naturally, and the Chinese characters can be found quickly.

참고로 培는 {흙토}, {설립}, {입구}, {흙토+설립}, {흙토+입구}, {설립+입구}, {흙토+설립+입구} 등의 7가지로 찾을 수 있다. 여기서 한가지 부수보다는 두 가지 부수의 조합으로 찾는 것이 쉬우며, 또한 두 가지 부수보다는 세 가지 부수의 조합으로 찾는 것이 쉽다. 그리고 여기에 총획이나, 음을 함께 추가시키면 한자 찾기가 더욱더 쉬워진다.For reference, 培 can be found in seven types: {soil}, {establishment}, {entry}, {soil + establishment}, {soil + entrance}, {establishment + entrance}, and {soil + establishment + entrance}. Here it is easier to find a combination of two copies rather than one copy, and it is easier to find a combination of three copies rather than two copies. If you add a stroke or a note to it, it will be easier to find Chinese characters.

Claims (1)

데이터베이스의 필드(field)는 한자(1), 뜻과 음(2), 총획(3), 여러 개의 부수(4)로 구성되어 있고, 그 여러 개의 부수(4)에는 그 한자에 포함되어 있는 모든 부수를 포함하여서된 한자데이터베이스.The field of the database consists of Chinese characters (1), meaning and sound (2), total strokes (3), and multiple copies (4), and each of these copies (4) contains all Kanji database including copies.
KR2019970031050U 1997-11-05 1997-11-05 Kanji database that allows you to find Chinese characters using multiple copies KR19990017913U (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR2019970031050U KR19990017913U (en) 1997-11-05 1997-11-05 Kanji database that allows you to find Chinese characters using multiple copies

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR2019970031050U KR19990017913U (en) 1997-11-05 1997-11-05 Kanji database that allows you to find Chinese characters using multiple copies

Publications (1)

Publication Number Publication Date
KR19990017913U true KR19990017913U (en) 1999-06-05

Family

ID=69676518

Family Applications (1)

Application Number Title Priority Date Filing Date
KR2019970031050U KR19990017913U (en) 1997-11-05 1997-11-05 Kanji database that allows you to find Chinese characters using multiple copies

Country Status (1)

Country Link
KR (1) KR19990017913U (en)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR19990084008A (en) * 1999-09-06 1999-12-06 이관동 Chinese Character Classification and Arrangement System by Algebra Number 18
WO2008038993A1 (en) * 2006-09-29 2008-04-03 In Ki Park Database system and its handling method for ideogram
KR100899449B1 (en) * 2007-09-04 2009-05-27 고려대학교 산학협력단 Kanji search method and Kanji search system

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR19990084008A (en) * 1999-09-06 1999-12-06 이관동 Chinese Character Classification and Arrangement System by Algebra Number 18
WO2008038993A1 (en) * 2006-09-29 2008-04-03 In Ki Park Database system and its handling method for ideogram
KR100899449B1 (en) * 2007-09-04 2009-05-27 고려대학교 산학협력단 Kanji search method and Kanji search system

Similar Documents

Publication Publication Date Title
BR9405791A (en) Combined process based on dictionary and similar character set for handwriting recognition
EA199900237A1 (en) DEVICE AND METHOD FOR QUICK PRINTING
KR19990017913U (en) Kanji database that allows you to find Chinese characters using multiple copies
Brinkmann et al. From codicology to technology: Islamic manuscripts and their place in scholarship
KR980007055U (en) Chinese dictionary to find Chinese characters using similar Chinese characters
Shapiro American Higher Education: A Special Tradition Faces a Special Challenge. Occasional Paper Number 16.
Venner et al. Okapi: a prototype online catalogue
JPS6466790A (en) Character recognizing device
KR850700022A (en) How to regenerate compound character symbols by combining subsymbols
KR20000036600A (en) A internet service to offer the private information
Belk Avoidance Strategies in Intimate Relationships.
Song et al. SIM: a Korean signature extraction method
JPS648441A (en) Character string retrieving system
Lunsford Rhetoric: A Key to Survival.
JPH035877A (en) Data operating system
Ainsworth Roger Heim, Les Champignons Toxiques et Hallucinogènes, Éditions N. Boubée et Cie, Paris (1963), p. 327, 40 text-figures, 3 maps, 3 graphs. Price: NF 42
SULLIVAN Mariano Fortuny y Marsal and orientalism in nineteenth-century Spain
Muller-Gotama Explorations in Korean syntax and semantics By Seok Choong Song
Morewedge Franz Rosenthal," The Classical Heritage in Islam"(Book Review)
KR880006053A (en) Chinese printing method for convenient search
Guasti A Description of Political Training Carried Out in the Youth Movement of the" Democrazia Cristiana" between 1977 and 1978.
Penning Don't Look to Congress for Systemic Reform Plans.
KANGAS Paul Heald, selected works; 1960-1981
Kulkarni et al. READFAST—an online information retrieval system
Smith Education and the Industrial Revolution by EG West

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
E601 Decision to refuse application