JP3732785B2 - Kanji search device, kanji search method, program thereof, and recording medium recording the program - Google Patents

Description

」が選択されたとしている。
【０１２２】
また、このような異体字関連図を作成するために、本実施例による漢字検索装置１００は、図２に示すような漢字関連付ファイル１１５を有する。この漢字関連付ファイル１１５は、漢字の常用漢字や簡体字や繁体字や異体字（略字，旧字，俗字を含む）や通行字等の関係を管理するものであり、ある漢字に対して何れの漢字が常用漢字や簡体字や繁体字や異体字（略字，旧字，俗字を含む）や通行字等の関係を有するかを管理するものである。
【０１２３】
図８（ｂ）に漢字関連付ファイル１１５のデータ構成を示す。図８（ｂ）を参照すると、漢字関連付ファイル１１５は、漢字（漢字のコード番号）の組み合わせの表となっており、互いに交わる欄に相互の関係を示す情報が格納されている構成となっている。
【０１２４】
従って、関連字図作成手段１０７は、入力手段１２１より異体字関連図の表示要求が入力されると、漢字関係付ファイル１１５から対象の漢字を含む関係を読み出し、これに基づいて漢字情報ファイル１１４を参照して図８に示す異体字関連図を作成し、作成した異体字関連図を表示手段１２２を介してユーザに提供する。
【０１２５】
また、この他、漢字情報ファイル１１４に格納されている各国の字形等を表示手段１２２に表示するよう構成してもよい。これは、上記各表示画面と同様に入力手段１２１から表示要求がなされた場合に、例えば漢字検索手段１０５が漢字情報ファイル１１４から各字形を読み出し、これを表示するよう構成することで実現可能である。
【０１２６】
・構成のまとめ
以上、本実施例による漢字検索装置１００の詳細な構成を説明したが、漢字検索装置１００は、専用のハードウェアとして構成しても、ソフトウェアで構成し、これをパーソナルコンピュータや携帯電話機（次世代携帯電話機等を含む）やその他、演算処理装置等のコンピュータを有する電子機器等に組み込むことで実現してもよい。図９に漢字検索装置１００をソフトウェアで実現する場合の、該ソフトウェアが組み込まれる機器のブロック構成例を示す。
【０１２７】
図９を参照すると、該機器はＣＰＵ（中央演算処理装置）１１とＲＡＭ（ランダムアクセスメモリ）１２とＲＯＭ（リードオンリメモリ）１３と表示装置１４と入力装置１５と記憶装置１６とを有して構成される。
【０１２８】
ここで、表示装置１４は図２における表示手段１２２と対応するものであり、入力装置１５は入力手段１２１と対応するものである。また、記憶装置１６はハードディスクやＥＰ−ＲＯＭ等の不揮発性記録媒体から成るものである。
【０１２９】
この構成において本実施例による漢字検索装置１００を実現するためのソフトウェアは記憶装置１６に記憶され、必要に応じて読み出され、ＣＰＵ１１において実行される。また、この際、ＲＡＭ１２において作業領域が確保される。
【０１３０】
また、上記ソフトウェアは、ＣＤ−ＲＯＭやＤＶＤ−ＲＯＭやその他のリムーバブルな記録媒体に記録し持ち運ぶことで、任意の電子機器において実行できるよう構成するとよい。
【０１３１】
・第１の実施例における入力動作
次に、漢字検索装置１００を使用して漢字を入力する際の動作を図１０のフローチャートを用いて説明する。
【０１３２】
図１０を参照すると、本実施例ではまず、ユーザが入力手段１２１を用いて要素の読み及び算術記号（＋，＊，−）を入力する（ステップＳ１０１）。このように入力された要素の読みは、算術記号が入力されたことをトリガとして、漢字検索装置１００における検索式組立手段１０１から部品１検索手段１０２へ入力され、対応する部首が部品１ファイル１１１から検索される（ステップＳ１０２）。
【０１３３】
この検索の結果、対応する部首が存在する場合（ステップＳ１０３のＹｅｓ）、検索式組立手段１０１は、これを表示手段１２２よりユーザへ一覧表示する（ステップＳ１０９）。これに対し、ステップＳ１０２の検索の結果、対応する部首が存在しない場合（ステップＳ１０３のＮｏ）、検索式組立手段１０１は、ステップＳ１０１で入力された要素の読みを部品２検索手段１０３へ入力し、対応する部品を部品２ファイル１１２から検索する（ステップＳ１０４）。
【０１３４】
この検索の結果、対応する部品が存在する場合（ステップＳ１０５のＹｅｓ）、検索式組立手段１０１は、これを表示手段１２２よりユーザへ一覧表示する（ステップＳ１０９）。これに対し、ステップＳ１０４の検索の結果、対応する部品が存在しない場合（ステップＳ１０５のＮｏ）、検索式組立手段１０１は、ステップＳ１０１で入力された要素の読みを部品３検索手段１０４へ入力し、対応する常用漢字を部品３ファイル１１３から検索する（ステップＳ１０６）。
【０１３５】
この検索の結果、対応する常用漢字が存在する場合（ステップＳ１０７のＹｅｓ）、検索式組立手段１０１は、これを表示手段１２２よりユーザへ一覧表示する（ステップＳ１０９）。これに対し、ステップＳ１０６の検索の結果、対応する常用漢字等が存在しない場合（ステップＳ１０７のＮｏ）、検索式組立手段１０１は、対応する要素が存在しないことを表示手段１２２を介してユーザへ通知し（ステップＳ１０８）、ステップＳ１０１へ帰還する。
【０１３６】
また、上記フローにおいて、部首，部品，常用漢字の何れかの要素が存在し、これが表示手段１２２において一覧表示されると（ステップＳ１０９）、ユーザは、入力手段１２１を用いて所望する要素を選択する（ステップＳ１１０）。
【０１３７】
このように所望する要素が選択されると、検索式組立手段１０１は、最後にステップＳ１０１において入力された算術記号が「＊」であるか否かを判定する（ステップＳ１１１）。
【０１３８】
この判定の結果、「＊」でない場合（ステップＳ１１１のＮｏ）、検索式組立手段１０１はステップＳ１０１に帰還して、次の要素の読み及び算術記号を入力させる。これに対し、ステップＳ１１１の判定の結果、「＊」である場合（ステップＳ１１１のＹｅｓ）、検索式組立手段１０１は、上記フローにおいて決定された検索式を漢字検索手段１０５に入力し、漢字検索手段１０５において漢字情報ファイル１１４より対応する漢字が検索される（ステップＳ１１２）。
【０１３９】
この検索の結果、対応する漢字が存在しない場合（ステップＳ１１３のＮｏ）、漢字検索手段１０５は、対応する漢字が存在しないことを表示手段１２２を介してユーザへ通知し（ステップＳ１１４）、ステップＳ１０１に帰還する。これに対し、ステップＳ１１２の検索の結果、対応する漢字が存在する場合（ステップＳ１１３のＹｅｓ）、漢字検索手段１０５は、表示手段１２２を介して検索された漢字を一覧表示し（ステップＳ１１５）、ユーザに入力手段１２１を用いて所望する漢字を選択させる（ステップＳ１１６）。
【０１４０】
その後、漢字検索装置１００は、選択された漢字に関する詳細情報が要求されたか（ステップＳ１１７）、又、選択された漢字に関する異体字関連図が要求されたか（ステップＳ１２０）、又、選択された漢字を所定のアプリケーションに入力することが要求されたか（ステップＳ１２３）を判定する。
【０１４１】
ここで、選択された漢字に関する詳細情報が要求された場合（ステップＳ１１７のＹｅｓ）、漢字検索装置１００は、詳細情報検索手段１０６を用いて漢字情報ファイル１１４から選択された漢字に関する詳細情報を特定し（ステップＳ１１８）、これを表示手段１２２を介してユーザに呈示する（ステップＳ１１９）。
【０１４２】
また、選択された漢字に関する異体字関連図が要求された場合（ステップＳ１２０のＹｅｓ）、漢字検索装置１００は、関連字図作成手段１０７を用いて漢字関連付ファイル１１５より選択された漢字に対して関連する漢字のコード番号及びどのような関連であるかの情報を読み出し、これに基づいて漢字情報ファイル１１４より各漢字の字形やフォントデータ等をそれぞれ特定し（ステップＳ１２１）、特定した情報を用いて異体字関連図を作成して、これを表示手段１２２を介してユーザに呈示する（ステップＳ１２２）。
【０１４３】
以上のように動作することで、ユーザはキーボード等の入力手段１２１を用いて所望する漢字を検索するだけでなく、検索された漢字に関する詳細な情報や関連する漢字の系統図も閲覧することが可能となる。
【０１４４】
・具体的入力例
また、図１０に示すフローチャートに従った入力手順を、以下に具体例を挙げて説明する。
【０１４５】
本説明では、以下に示す４つの入力式を例に挙げて説明する。

・・「堊」を検索する場合
本実施例において（式１）に示す「堊」を検索する場合、ユーザはまず部首を検索するために入力手段１２１を用いて「つち＋」と入力する。この「つち＋」は入力手段１２１より漢字検索装置１００に入力される。
【０１４６】
漢字検索装置１００は、入力された「つち＋」を検索式組立手段１０１に入力する。検索式組立手段１０１はまず「つち」を部品１検索手段１０２に入力する。ここで、「つち」に対応する部首「土」が部品１ファイル１１１において存在するため、部品１検索手段１０２では「土」が検索される。従って、検索式組立手段１０１は、部品１検索手段１０２で検索された「土」を表示手段１２２に表示する。これに対しユーザは、表示された「土」を入力手段１２１を用いて選択する。この選択は検索式組立手段１０１に入力される。これにより検索式組立手段１０１では、「土＋」までが決定される。
【０１４７】
次に、ユーザは入力手段１２１よりその他の要素として「あ＊」を入力する。この「あ」も上記と同様に、まず部品１検索手段１０２に入力され、該当する部首が検索される。ここで、「あ」に対応する部首が部品１ファイル１１１に存在しないため、このことが部品１検索手段１０２から検索式組立手段１０１に入力される。
【０１４８】
このように該当する部首が存在しないことが入力されると、検索式組立手段１０１は次に「あ」を部品２検索手段１０３に入力する。これに対し部品２検索手段１０３は「あ」に該当する部品を部品２ファイル１１２から検索する。しかし、部品２ファイル１１２には存在しない。
【０１４９】
次に部品３ファイル１１３を検索する。ここで、「あ」に該当する常用漢字「亜」，許容漢字「亞」が部品３ファイル１１３に存在するため、部品３検索手段１０４では「亜」，「亞」が検索される。従って、検索式組立手段１０１は、部品３検索手段１０４で検索された「亜，亞」を表示手段１２２に表示する。これに対しユーザは、表示された「亜，亞」より「亞」を入力手段１２１を用いて選択する。この選択は検索式組立手段１０１に入力される。これにより検索式組立手段１０１では、「土＋亞＊」までが決定される。
【０１５０】
ここで、「＊」は検索を実行させるための算術式であるため、検索式組立手段１０１は、決定された検索式「土＋亞＊」を漢字検索手段１０５に入力する。
【０１５１】
漢字検索手段１０５では、入力された「土＋亞＊」における各要素「土」，「亞」に基づいて漢字情報ファイル１１４を検索し、対応する漢字を特定する。ここで、漢字情報ファイル１１４には「堊」が存在するため、漢字検索手段１０５では、「堊」が検索される。従って、漢字検索手段１０５は表示手段１２２を介して「堊」をユーザに呈示する。これに対しユーザは、表示された「堊」を入力手段１２１を用いて選択する。また、この選択された「堊」は対象のアプリケーションに入力される。
【０１５２】
ここで、表示手段１２２に表示された「堊」に関する詳細情報を表示する場合、ユーザは入力手段１２１又はマウス等の他の入力手段を用いて「堊」に関する詳細情報表示画面（図７）を表示させる命令を入力する。この命令は詳細情報検索手段１０６に入力され、部品３ファイル１１４から詳細情報が特定される。詳細情報検索手段１０６は、特定された詳細情報に基づいて「堊」に関する詳細情報表示画面を作成し、これを表示手段１２２を介してユーザに呈示する。
【０１５３】
また、「堊」に関する異体字関連図を表示する場合、ユーザは入力手段１２１又はマウス等の他の入力手段を用いて「堊」に関する異体字関連図表示画面（図８）を表示させる命令を入力する。この命令は関連字図作成手段１０７に入力され、部品３ファイル１１４から各関連字（簡体字，繁体字，通行字，異体字（略字，旧字，俗字等を含む）等；但し、日本字形を基本とする）が特定される。関連字図作成手段１０７は、特定された各関連字に基づいて「堊」に関する異体字関連図表示画面を作成し、これを表示手段１２２を介してユーザに呈示する。
【０１５４】
・・「滬」を検索する場合
また、本実施例において（式２）に示す「滬」を検索する場合、ユーザはまず部首を検索するために入力手段１２１を用いて「さんずい＋」と入力する。この「さんずい＋」は入力手段１２１より漢字検索装置１００に入力される。
【０１５５】
漢字検索装置１００は、入力された「さんずい＋」を検索式組立手段１０１に入力する。検索式組立手段１０１はまず「さんずい」を部品１検索手段１０２に入力する。ここで、「さんずい」に対応する部首「水（
【０１５６】
【外２】

）」が部首ファイル１１１において存在するため、部品１検索手段１０２では「水（
【０１５７】
【外３】

）」が検索される。従って、検索式組立手段１０１は、部品１検索手段１０２で検索された「水（
【０１５８】
【外４】

）」を表示手段１２２に表示する。これに対しユーザは、表示された「水（
【０１５９】
【外５】

）」を入力手段１２１を用いて選択する。この選択は検索式組立手段１０１に入力される。これにより検索式組立手段１０１では、「水＋」までが決定される。
【０１６０】
次に、ユーザは入力手段１２１よりその他の要素として「と＋」を入力する。この「と」も上記と同様に、まず部品１検索手段１０２に入力され、該当する部首が検索される。ここで「と」に対応する部首「戸」，「斗」，「十」，「土」，…が部品１ファイル１１１において存在するため、部品１検索手段１０２ではこれらが検索される。従って、検索式組立手段１０１は、部品１検索手段１０２で検索された「戸」，「斗」，「十」，「土」，…を表示手段１２２に表示する。これに対しユーザは、表示された部首一覧より所望の「戸」を入力手段１２１を用いて選択する。この選択は、検索式組立手段１０１に入力される。これにより検索式組立手段１０１では、「水＋戸＋」までが決定される。
【０１６１】
更に、ユーザは入力手段１２１よりその他の要素として「むら＊」を入力する。この「むら」も上記と同様に、まず部品１検索手段１０２に入力され、該当する部首が検索される。ここで、「むら」に対応する部首が部品１ファイル１１１に存在しなかった場合には、次のステップに移る。
【０１６２】
このように該当する部首が存在しないことが入力されると、検索式組立手段１０１は次に「むら」を部品２検索手段１０３に入力する。ここで、「むら」に対応する部品が部品２ファイル１１２にも存在しないため、このことが部品２検索手段１０３から検索式組立手段１０１に入力される。
【０１６３】
従って、検索式組立手段１０１は次に「むら」を部品３検索手段１０４に入力する。ここで、「むら」に該当する常用漢字「村」，「邑（人名漢字）」，「群」，「屯」，…が部品３ファイル１１３に存在するため、部品３検索手段１１３では「村」，「邑」，「群」，「屯」，…が検索される。従って、検索式組立手段１０１は、部品３検索手段１０４で検索された「村，邑，群，屯，…」を表示手段１２２に表示する。これに対しユーザは、表示された「村，邑，群，屯，…」より「邑」を入力手段１２１を用いて選択する（実際には、邑は部首であるので、部首ファイル１１１に存在する）。この選択は検索式組立手段１０１に入力される。これにより検索式組立手段１０１では、「水（
【０１６４】
【外６】

）＋戸＋邑＊」までが決定される。
【０１６５】
その後、検索式組立手段１０１は、「＊」を認識して、決定された検索式「水（
【０１６６】
【外７】

）＋戸＋邑＊」を漢字検索手段１０５に入力する。また、これに対して漢字検索手段１０５は、対応する漢字「滬」を検索して対応する漢字を特定し、これを表示手段１２２を介してユーザに呈示する。これに対しユーザは、表示された「滬」を入力手段１２１を用いて選択し、「滬」を対象のアプリケーションに入力させる。
【０１６７】
また、同様に「滬」に関する詳細情報や異体字関連図を表示することも可能である。
【０１６８】
・・「鐚」を検索する場合
また、本実施例において（式３）に示す「鐚」を検索する場合、ユーザはまず部首を検索するために入力手段１２１を用いて「きん＋」と入力する。この「きん＋」に対しては、部品１ファイル１１１において対応する部首「金」が格納されているため上記と同様に「金」が選択され、検索式組立手段１０１において「金＋」までが決定される。
【０１６９】
つぎに、ユーザは検索式において「惡」を入力するために、入力手段１２１を用いて「あく＋」を入力する。ここで、「惡」は部品１ファイル１１１，部品２ファイル１１２，部品３ファイル１１３の何れにおいても格納されていないが、類似する要素として部品３ファイル１１３において「悪」（実際には、許容字体であるため部品３ファイル１１３に存在する）が格納されている。従って、ユーザは、表示手段１２２に表示された一覧から「悪」を選択する。これにより、検索式組立手段１０１では、「金＋悪＊」が決定され、これが漢字検索手段１０５に入力される。
【０１７０】
漢字検索手段１０５では、「金＋悪＊」に対応する漢字が漢字情報ファイル１１４より検索されるが、「金＋悪＊」と完全に一致する漢字は存在しない。そこで、本実施例では「悪」と「惡」とのような類似（関連）する要素を共に漢字情報ファイル１１４における要素として格納しておく。従って、漢字検索手段１０５において類似する要素より成る漢字までも特定することが可能となる。これにより、ユーザは「惡」の代わりに「悪」を入力することが可能となり、より容易に検索式を入力することが可能となる。
【０１７１】
また、同様に「鐚」に関する詳細情報や異体字関連図を表示することも可能である。
【０１７２】
・・「谺」を検索する場合
また、本実施例において（式４）に示す「谺」を検索する際、上記と同様の手順で入力する場合では、ユーザはまず部首を検索するために入力手段１２１を用いて「たに＋」と入力し、「谷＋」が決定された後に「きば＊」を入力して、検索式「谷＋牙＊」を決定する。
【０１７３】
しかしながら、本実施例では、部首を先頭に入力しなくても検索が可能なように構成しているため、本例においてユーザはまず「きば＋」と入力してもよい。この場合、検索式組立手段１０１において決定される検索式は「牙＋谷＊」となる。
【０１７４】
検索式組立手段１０１は、この検索式「牙＋谷＊」をそのまま漢字検索手段１０５に入力する。これに対して漢字検索手段１０５は、「牙＋谷」に基づいて対応する漢字を検索する。ここで本実施例では、漢字情報ファイル１１４において部首とその他の要素（部品又は常用漢字）とを区別して管理するよう構成していない。このため、漢字検索手段１０５は、部首とその他の要素とが順番に従って入力されていない場合でも対象の漢字を検索することが可能となる。
【０１７５】
また、同様に「谺」に関する詳細情報や異体字関連図を表示することも可能である。
【０１７６】
このように、本実施例では、漢字を例えば最大で４つの読める要素（部首，部品，常用漢字等）に分割しているため、ユーザは容易に検索式を入力することが可能となる。更に、この際、対象の漢字を検索するための検索キーをキーボード等の入力手段のみを用いて入力することを可能としているため、ユーザは容易に作業を実行することが可能となる。
【０１７７】
また、ユーザが入力する要素の順序を、部首を最初とし、その後、画数順に部品又は常用漢字を入力することを推奨しているため、漢字検索装置１００における処理量を減少させることが可能となり、迅速に目的の漢字を特定することが可能となる。但し、本実施例において、漢字情報ファイル１１４の要素の項目では、部首がデータ系列において先に位置され、そのあとに筆順に従って各要素が並ぶよう構成する。また、漢字検索手段１０５は、漢字情報ファイル１１４をデータ系列の順に従って検索する。
【０１７８】
更に、各要素を特定する際に、部首ファイル１１１，部品ファイル１１２，常用漢字ファイル１１３の順に検索を実行することで、必要最小限の要素検索のみで検索式が決定できるよう構成することが可能となる。
【０１７９】
更に、本実施例では、検索された漢字に関する詳細情報や関連字情報をユーザに容易に提供することが可能である。
【０１８０】
・第１の実施例のまとめ
また、以上のように構成された本実施例は、例えば以下に示すような用途として用いることで、より本実施例による効果が発揮される。
（１）漢字入力の現場での論文記述における難字の記入
（２）キーパンチャーによる原稿入力の際の難字や読めない漢字の入力
（３）漢字文献資料のデータベース作製における手書き文字や難字の入力
（４）ＯＣＲ（自動読取装置）での読み取り不可能な文字の補正入力
このように、本実施例による漢字検索装置１００は、入力における難字や読みの無い又は読めない漢字を入力する際に特に有効に活用されるものであり、更に、ＯＣＲ等と組み合わせることでも、迅速な入力を実現できるものである。
〔第２の実施例〕
上記第１の実施例では、主に音訓読みが存在しない又は解らない漢字の入力の際に高い効果を発揮するものである。この構成において、難字ではあるが音訓読みが存在する漢字の入力をより容易且つ迅速に実行させるよう構成した場合について、以下に第２の実施例として図面を用いて詳細に説明する。
【０１８１】
これを実現するために、本実施例では、ユニコードで登録されている漢字を幾つかに分類し、各分類毎に順を追って検索するよう構成する。これにより、ユーザから所望された漢字をより迅速に特定することが可能となる。
【０１８２】
即ち、本実施例では、漢字を例えばＪＩＳ漢字における第１水準，第２水準，補助漢字，及びその他の漢字と分類し、ユーザから入力された漢字の読みに基づいて、第１水準，第２水準，補助漢字，その他の漢字と順を追って検索する。これにより、より一般的な漢字から特定することが可能となり、不必要な漢字に対する検索処理を省くことが可能となる。
【０１８３】
更に、本実施例は、第１の実施例による漢字検索装置１００の機能も有しているため、全ての漢字に対して検索が実行できる。
【０１８４】
図１１に本実施例による漢字検索装置２００のブロック図を示す。図１１を参照すると、漢字検索装置２００は、図２に示す漢字検索装置１００と比較して、漢字検索手段１０５が漢字検索手段２０５に置き換えられている。この漢字検索手段２０５は、入力手段１２１から入力された読みに対応する漢字を文字コードファイル２１０から直接検索する。但し、文字コードファイル２１０は、通常の文字コードファイルであり、各文字に対するコード番号と読みとフォントデータとを対応付けて管理するものである。ここで、文字コードとしてはユニコードとするが、これをＪＩＳコートやＳ−ＪＩＳコードやＥＵＣや区点コード等としてもよい。さらに、フォントデータはアウトラインフォントでもビットマップフォントでもよい。
【０１８５】
次に、上記した漢字検索装置２００を用いた本実施例の動作について、以下に図面を用いて詳細に説明する。図１２は、本実施例における漢字検索装置２００の動作を説明するためのフローチャートである。
【０１８６】
図１２を参照すると、本実施例ではまず、ユーザが入力手段１２１を用いて所望する漢字の読みを入力する（ステップＳ２０１）。このように入力された漢字の読みは、漢字検索装置２００における漢字検索手段２０５に入力され、文字コードファイル２１０より対応する漢字が特定される。この際、漢字検索手段２０５は、まずＪＩＳ漢字の第１水準として登録された漢字群を対象として文字コードファイル２１０を検索し、対応する漢字を特定する（ステップＳ２０２）。但し、各漢字がどの分類（ＪＩＳ漢字における第１水準，第２水準，補助漢字，その他の漢字群）に属するかは、図示しないファイル、又は漢字情報ファイル１１４、又は文字コードファイル２１０において管理されているものとする。
【０１８７】
この検索の結果、対応する漢字が特定された場合（ステップＳ２０３のＹｅｓ）、漢字検索装置２００は、図１０におけるステップＳ１１５に移行し、特定された漢字を表示手段１２２に一覧表示する。これに対し、ステップＳ２０２の検索の結果、対応する漢字が特定されなかった場合（ステップＳ２０３のＮｏ）、漢字検索手段２０５は、次にＪＩＳ漢字の第２水準として登録された漢字群を対象として文字コードファイル２１０を検索し、対応する漢字を特定する（ステップＳ２０４）。
【０１８８】
この検索の結果、対応する漢字が特定された場合（ステップＳ２０５のＹｅｓ）、漢字検索装置２００は、上記と同様に図１０におけるステップＳ１１５に移行する。これに対し、ステップＳ２０４の検索の結果、対応する漢字が存在しなかった場合（ステップＳ２０５のＮｏ）、漢字検索手段２０５は、次にＪＩＳ補助漢字として登録された漢字群を対象として文字コードファイル２１０を検索し、対応する漢字を特定する（ステップＳ２０６）。
【０１８９】
この検索の結果、対応する漢字が特定された場合（ステップＳ２０７のＹｅｓ）、漢字検索装置２００は、上記と同様に図１０におけるステップＳ１１５に移行する。これに対し、ステップＳ２０６の検索の結果、対応する漢字が存在しなかった場合（ステップＳ２０７のＮｏ）、漢字検索手段２０５は、文字コードファイル２１０に登録されている残りの漢字群を対象として検索を実行する（ステップＳ２０８）。
【０１９０】
この検索の結果、対応する漢字が特定された場合（ステップＳ２０９のＹｅｓ）、漢字検索装置２００は、上記と同様に図１０におけるステップＳ１１５に移行する。これに対し、ステップＳ２０８の検索の結果、対応する漢字が存在しなかった場合（ステップＳ２０９のＮｏ）、漢字検索手段２０５は、このことを表示手段１２２を介してユーザに呈示し（ステップＳ２１０）、図１０におけるステップＳ１０１へ移行する。その後、第１の実施例で説明した方法により検索を実行する。
【０１９１】
以上のように構成することで、本実施例では、音訓読みのできる難字を迅速且つ容易に検索する環境と共に、読みの無い漢字を含む全ての漢字を容易に検索する環境を提供することが可能となる。
〔第３の実施例〕
また、上記した第１の実施例において、より漢字検索に要する処理量を減少させる構成を第３の実施例として以下に図面を用いて詳細に説明する。
【０１９２】
本実施例では、部首を入力する際に、該部首の対象の文字における位置を指定する。これにより、本実施例では検索対象の漢字を大幅に絞り込むことが可能となる。
【０１９３】
図１３は、本実施例で定義する部首の位置の種類であり、図中、斜線部分に部首が位置される。但し、（分類７）及び（分類９）では、各々分割された領域の何れかに部首が位置されるとする。
【０１９４】
図１３を参照すると、本実施例では、部首の付き位置（以下、部首位置という）を、（分類０）全体，（分類１）偏，（分類２）旁，（分類３）冠・頭・蓋，（分類４）足，（分類５）垂れ・にょう・かまえ，（分類６）かまえ，（分類７）４分の１，（分類８）縦割れ・横割れ，（分類９）９分の１、また、この他にも、（分類Ａ）分類５の反対部分，（分類Ｂ）分類６の反対部分，（分類Ｃ）分類８の反対部分，（分類Ｄ）部首を天地又は左右に複数個並べたもの，（分類Ｅ）部首と部品とを重ねたもの，（分類Ｆ）部首と部品とが左右対称に配列されるもの、の計１６種類に分割している。但し、図中、栗塗りの部分には部首が配置される。
【０１９５】
この分割の種類において、分類５〜６の「構え」には５種類存在し、分類５には「しきがまえ」等が属し、分類６には「えんがまえ」や「うけばこ」や「はこがまえ」や「くにがまえ」等が属する。また、分類７の「４分の１」は、漢字を縦横２×２に分割した何れかの位置に部首が属することを示すものであり、分類９の「９分の１」は、漢字を縦横３×３に分割した何れかの位置に部首が属することを示すものである。また、分類８の「縦割れ」には「われぎょう」等が属し、同じく分類８の「横割れ」には「われごろも」等が属する。更に、分類０の「全体」には部首１つで１字を成す漢字が属する。
【０１９６】
また、本実施例では図１３に示すような部首の位置をキーボードより成る入力手段１２１で指定するために、図１４に例示するように、キーボードにおける所定のキーに部首位置を割り当てる。即ち、本実施例では、例えばキーボードより「１」が入力された場合、漢字検索装置３００は部首が『偏』であると認識する。
【０１９７】
但し、図１４に示す例では、１つのキーに対して複数の部首位置が対応付けられている。この場合、同一のキーに割り当てられている部首位置は区別せずに検索を実行するよう構成してもよいが、例えば分類５の「にょう」を指定する場合には５を２回入力するよう構成してもよい。
【０１９８】
以下、本実施例による漢字検索装置３００の構成を図１５のブロック図を用いて説明する。図１５を参照すると、漢字検索装置３００は、図２に示す漢字検索装置１００と比較して、漢字検索手段１０５が漢字検索手段３０５に、又、漢字情報ファイル１１４が漢字情報ファイル３１４に、それぞれ置き換えられている。
【０１９９】
ここで、漢字情報ファイル３１４のデータ構成を図１６に示す。図１６を参照すると、漢字情報ファイル３１４では、第１の実施例と同様なデータ構成の他に、部首の位置を示す情報（部首位置）が格納されている。
【０２００】
以下に、上記のように構成された漢字検索装置３００の動作について、図面を用いて詳細に説明する。
【０２０１】
図１７を参照すると、本実施例ではまず、ユーザが入力手段１２１を用いて部首の位置を指定する（ステップＳ３０１）。これは、図１４に示すキーボードより成る入力手段１２１から数字を入力することで実現される。
【０２０２】
このように部首の位置の指定が入力されると、漢字検索装置３００は図１０におけるステップＳ１０１に移行し、以降の動作を実行する。
【０２０３】
また、図１０のステップＳ１１１において、ステップＳ１０１で最後に入力された算術記号が「＊」であると判定した場合（ステップＳ１１１のＹｅｓ）、漢字検索手段３０５は、まずステップＳ３０１で入力された部首位置に対応する漢字群を漢字情報ファイル３１４から特定する（ステップＳ３０２）。
【０２０４】
その後、図１０のステップＳ１１１までの動作において決定した算術式に基づいて、ステップＳ３０２で特定した漢字群を検索して対応する漢字を特定し（ステップＳ３０３）、図１０におけるステップＳ１１３へ移行する。
【０２０５】
以上のように動作することで、本実施例では、漢字検索装置３００が検索対象とする漢字の数を検索処理の初期の段階で大幅に削減することができ、迅速に所望された漢字を検索することが可能となる。
〔第４の実施例〕
また、上記した第２の実施例において、目的に応じた専門用語や熟語等が格納された電子辞書を設けることで、使い勝手のよい文書作成装置３００を提供することが可能となる。
【０２０６】
これは、例えば仏教書や古典等の特殊な書物に含まれる難字等より成る専門用語や熟語等が登録された電子辞書（以下、用語入力辞書という）を、図１１における漢字検索装置２００に設ける。これにより、上記のような専門的な文書を容易且つ迅速に入力することが可能となる。
【０２０７】
以下、このように構成した文書作成装置４００について図面を用いて詳細に説明する。
【０２０８】
図１８は、文書作成装置４００の構成を示すブロック図である。図１８を参照すると、文書作成装置４００は、図１１に示す漢字検索装置２００と比較して、漢字検索手段２０５が用語検索手段４０５に置き換えられている。更に、文書作成装置４００は、用語入力辞書ファイル４２０が新たに設けられている。
【０２０９】
この用語入力辞書ファイル４２０は、上記のような専門用語や熟語等（以下、単に用語という）と、読みと、品詞等の情報と、語義と、が格納されるものである。但し、用語はこれを構成する漢字のコード番号（例えばユニコード）の列挙として格納される。
【０２１０】
以下に、上記のように構成された文書作成装置４００の動作について、図面を用いて詳細に説明する。
【０２１１】
図１９は、文書作成装置４００を用いて文書を作成する際の流れを示すフローチャートである。
【０２１２】
図１９を参照すると、本実施例ではまず、ユーザが入力手段１２１を用いて用語の読みを入力する（ステップＳ４０１）。このように所望された用語の読みが入力されると、文書作成装置４００は、用語検索手段４０５において用語入力辞書ファイル４２０から対応する用語を検索する（ステップＳ４０２）。
【０２１３】
この検索の結果、対応する部首が存在しない場合（ステップＳ４０３のＮｏ）、用語検索手段４０５は、このことを表示手段１２２を介してユーザに通知し（ステップＳ４０４）、図１２におけるステップＳ２０１へ移行して、第２の実施例による動作を実行する。
【０２１４】
これに対し、ステップＳ１０２の検索の結果、対応する用語が検索された場合（ステップＳ４０３のＹｅｓ）、用語検索手段４０５は、これを表示手段１２２よりユーザへ一覧表示し（ステップＳ４０５）、ユーザに入力手段１２１を用いて所望する漢字を選択させる。但し、この際、一覧を表示する画面は、図６に示す漢字検索結果一覧表示画面と同様の構成としてよい。
【０２１５】
その後、用語検索手段４０５は、選択された用語に関する詳細情報が要求されたか（ステップＳ４０７）、又、選択された用語を所定のアプリケーションに入力することが要求されたか（ステップＳ４１０）を判定する。但し、上記詳細情報は、用語の品詞や語義等の情報である。
【０２１６】
ここで、選択された用語に関する詳細情報が要求された場合（ステップＳ４０７のＹｅｓ）、用語検索手段４０５は、用語入力辞書ファイル４２０から選択された用語に関する詳細情報を特定し（ステップＳ４０８）、これを表示手段１２２を介してユーザに呈示する（ステップＳ４０９）。
【０２１７】
以上のように動作することで、ユーザはキーボード等の入力手段１２１を用いて所望する用語を検索・入力するだけでなく、検索された用語に関する詳細な情報を閲覧することも可能となる。
〔第５の実施例〕
また、上記各実施例では、要素（部首，部品等）の読みを入力することで所望する漢字を検索する構成について説明したが、本実施例では、漢字の部首をはじめとする部品等の読みが解らない場合でも、より正確且つ迅速に所望する漢字を検索するよう構成した場合について、以下に図面を用いて詳細に説明する。
【０２１８】
以上でも述べていたように、漢字全体に亘る共通性は、全ての漢字が部首（部品）を持つこと、更に、画数を持つことと、の２点に集約される。
【０２１９】
上記各実施例では、まず、その共通性の１つである、部首（部品）の、特に読みに着目して構成していた。これに対し、本実施例は、この部首（部品）が読めない場合にも同様に漢字を検索することを可能にするものである。従って、本実施例による効果は、上記各実施例のように、所望する漢字を確実且つ迅速に検索できることの他に、読めない漢字（要素も大別すれば漢字に属する）の学習に役立つことである。
【０２２０】
これを実現するために、本実施例では、読みの他に画数を併用することで、読めない要素を含む漢字も、キーボード上から素早く検索することができ、目的の漢字に迅速に逢着する。但し、本実施例における画数を用いた検索は、この構成だけを単独で動作させてもよく、また、上記各実施例による検索方法に混在させて動作させてもよい。
【０２２１】
また、本実施例による漢字検索装置５００の構成例を図２０に示す。但し、漢字検索装置５００は、本実施例による構成を第１の実施例に当てはめた場合の構成例である。
【０２２２】
この構成において、部品１検索手段５０２，部品２検索手段５０３，部品３検索手段５０４は、各要素（部首，部品，常用漢字）の読みでなく、各要素の画数による検索も実行する。即ち、本実施例では、以下の動作の説明において触れるように、読みでなく画数が入力された要素に関して部品１検索手段５０２，部品２検索手段５０３，部品３検索手段５０４は、画数に基づいて部品１ファイル５１１，部品２ファイル５１２，部品３ファイル５１３をそれぞれ検索する。
【０２２３】
また、本実施例による部品１ファイル５１１，部品２ファイル５１２，部品３ファイル５１３は、上記各実施例における項目の他に、各要素（部首，部品，常用漢字）の画数も格納している。
【０２２４】
また、本実施例でも同様に、特定された要素は、表示手段１２２へ出力され、ユーザに一覧表示される。これに対して、ユーザは、列挙された要素の中から所望する要素を入力手段１２１を用いて選択入力し、検索式を完成させる。
【０２２５】
次に、本実施例による動作をより詳細に説明する。
【０２２６】
本実施例では、読むことができない要素（部首又は部品又は常用漢字）を「？」と入力し、続いて画数を入力するよう構成する。即ち、例えば要素「隹」を入力する場合、ユーザは「？８＋」と入力する。
【０２２７】
このように、「？」が入力されると、検索式組立手段１０１は、「？」の次に入力された算用数字（上記例では「８」）を、まず部品１検索手段５０１へ入力する。これに応じ、部品１検索手段５０１は、部品１ファイル５１１より該当する画数の要素（部首）を検索し、これを表示手段１２２へ出力して一覧表示させる。ユーザは、表示された検索結果の一覧から所望する要素を入力手段１２１を用いて選択入力する。
【０２２８】
また、該当する部首が部品１ファイル５１１に存在しない場合、検索式組立て手段１０１は、上記と同様に、入力された画数を順に部品２検索手段５０３，部品３検索手段５０４に入力し、部品又は常用漢字より該当する要素を特定する。但し、この動作は、ユーザより所望する要素が選択入力された時点で完了し、次の動作へ移行する。
【０２２９】
更に、このように画数に基づいて検索され、選択入力された要素は、第１の実施例と同様に、漢字検索手段１０５へ入力される。また、漢字検索手段１０５は、第１の実施例と同様に、入力された要素に基づいて検索式を立て、漢字情報ファイル１１４より該当する漢字を検索する。
【０２３０】
従って、上記の様に構成された本実施例では、例えば「雖」を検索する場合、ユーザは「くち＋むし＋？８＊」と入力してもよい。また、これに対して漢字検索装置５００は、「？８」に対して「金，長，門，阜，隶，隹，雨，青，非，隹…」を部品１ファイル５１１の検索結果として表示する。従って、ユーザは、表示された検索結果の中から「隹」を入力手段１２１を用いて選択する。これにより、「？」による画数の検索が完了し、最終的な検索式「口＋虫＋隹＊」が立式される。
【０２３１】
但し、本発明では、本実施例のように読めない部品を「？」として入力せずとも、所望する漢字を検索することは可能である。即ち、「雖」を「くち＋むし＊」の２つの要素で検索することも可能である。このように本発明では、読めない部首・部品を無視して、読める所だけで検索式を作成しても、迅速に所望する漢字を得ることができる。
【０２３２】
例えば、部首「木＋口」を含む漢字の中から何れかを検索する場合、部首が「木」の漢字がユニコード内に９９３字存在する。従って、「木」だけで検索を実行すれば、９９３字が検索される。
【０２３３】
そこで、「木＋口」では９３字存在する。この内、口が２つは２０字、口が３つは７字、口が４つは１字で、口が１つは６５字である。しかも、口が１つである字を含む部品の内、見慣れた字は、「占、古、台、只、号、加、句、司、召、可、兄、如、否、呈、君、告、含、吾、豆、局、京、居、命、保、胡、亭、患、容、唐、党、善、登、聖、敬、濤」などで、合計３４字である。
【０２３４】
更に、口が２つのような字が２８字ある。つまり、９３字の内、６２字を占めるのである。残りは３１字である。この３１字の内、例えば「＋（草冠）」の字はたったの３つである。
【０２３５】
これに対し、本実施例は、上記例のように、読める要素のみでは有効な数まで限定しきれない場合に特に有効となる項性である。
【０２３６】
このように、本実施例は、読みのみによる検索でも、画数を併用した検索でも、所望する漢字へ逢着するのに有効なものである。
〔第６の実施例〕
また、上記各実施例では、入力手段１２１をキーボードとしていたが、これに例えば音声入力手段を含ませるよう構成してもよい。これにより、よりユーザの使い勝手のよい漢字検索装置を提供することができる。
【０２３７】
即ち、本実施例による漢字検索装置では、入力手段において音声認識された要素の読みや算術記号やクエスチョンマークや画数等が検索式組立手段１０１（図２参照）に入力され、これに基づいて検索式組立手段１０１が検索式を組み立てる。この際の動作は、上記における各実施例と同様である。
【０２３８】
また、本実施例による音声入力式の漢字検索装置を実現するために、本実施例による漢字入力装置が実現されるコンピュータには、マイクと音声認識用のアプリケーションとが設けられているものとする。
【０２３９】
〔他の実施例〕
また、上記した各実施例は、本発明を好適に実施した形態の一例に過ぎず、本発明は、その主旨を逸脱しない限り、種々変形して実施することが可能なものである。
【０２４０】
【発明の効果】
以上、説明したように、請求項１記載の発明によれば、迅速且つ容易に所望する漢字を特定することができる環境を提供することが可能となる。
【０２４１】
即ち、本発明によれば、ユーザはキーボード等の入力手段を用いて所望する漢字を検索するための検索キーを入力することが可能となり、ユーザに要する手間を削減することが可能となる。更に、本発明によれば、漢字を分割して得られる要素を一般的に読み書きされている文字とすることで、専門的な知識を必要とせずに、読みの無い又は解らない漢字や難字を容易且つ迅速に入力することが可能となる。
【０２４２】
更に、請求項２記載の発明によれば、検索キーにおいて部首位置及び画数を指定する構成を設けることで、部首等の要素の読みが不明なものにも対応し、且つ又、漢字検索に要するデータの処理量を大幅に削減することが可能となり、より迅速且つ的確に所望された漢字を特定することが可能となる。
【０２４３】
また、請求項３記載の発明によれば、入力された漢字の読みに基づいて、必要に応じて部分的に漢字検索を実行するため、迅速且つ容易に所望された漢字を特定することができる環境を提供することが可能となる。
【０２４４】
更に、本発明において、集合を例えばＪＩＳ漢字における第１水準，第２水準，補助漢字，その他の漢字とし、この順序で検索を実行することで、一般的な漢字から特定することができ、より迅速に所望された漢字を特定することが可能となる。
【０２４５】
更に、請求項４記載の発明によれば、検索された漢字に関する詳細な情報をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字に関する詳細な情報を学習する環境も提供することが可能となる。
【０２４６】
更に、請求項５記載の発明によれば、検索された漢字の異体字等の関連字をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字の関連字を学習する環境も提供することが可能となる。
【０２４７】
更に、請求項６記載の発明によれば、入力がより簡易な漢字検索装置を提供することができる。
【０２４８】
また、請求項７記載の発明によれば、迅速且つ容易に所望する漢字を特定することができる環境を提供することが可能となる。
【０２４９】
即ち、本発明によれば、ユーザはキーボード等の入力手段を用いて所望する漢字を検索するための検索キーを入力することが可能となり、ユーザに要する手間を削減することが可能となる。更に、本発明によれば、漢字を分割して得られる要素を一般的に読み書きされている文字とすることで、専門的な知識を必要とせずに、読みの無い又は解らない漢字や難字を容易且つ迅速に入力することが可能となる。
【０２５０】
更に、請求項８記載の発明によれば、検索キーにおいて部首位置及び画数を指定する構成を設けることで、部首の読みの分からないものに対応することが可能となる。
【０２５１】
また、請求項９記載の発明によれば、入力された漢字の読みに基づいて、必要に応じて部分的に漢字検索を実行するため、迅速且つ容易に所望された漢字を特定することができる環境を提供することが可能となる。
【０２５２】
更に、本発明において、集合を例えばＪＩＳ漢字における第１水準，第２水準，補助漢字，その他の漢字とし、この順序で検索を実行することで、一般的な漢字から特定することができ、より迅速に所望された漢字を特定することが可能となる。
【０２５３】
更に、請求項１０記載の発明によれば、検索された漢字に関する詳細な情報をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字に関する詳細な情報を学習する環境も提供することが可能となる。
【０２５４】
更に、請求項１１記載の発明によれば、検索された漢字の異体字等の関連字をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字の関連字を学習する環境も提供することが可能となる。
【０２５５】
更に、請求項１２記載の発明によれば、入力がより簡易な漢字検索方法を提供することができる。
【０２５６】
また、請求項１３記載の発明によれば、迅速且つ容易に所望する漢字を特定することができる環境を提供することが可能となる。
【０２５７】
即ち、本発明によれば、ユーザはキーボード等の入力手段を用いて所望する漢字を検索するための検索キーを入力することが可能となり、ユーザに要する手間を削減することが可能となる。更に、本発明によれば、漢字を分割して得られる要素を一般的に読み書きされている文字とすることで、専門的な知識を必要とせずに、読みの無い又は解らない漢字や難字を容易且つ迅速に入力することが可能となる。
【０２５８】
また、請求項１４記載の発明によれば、検索キーにおいて部首位置及び画数を指定する構成を設けることで、より迅速且つ的確に所望された漢字を特定することが可能となる。
【０２５９】
また、請求項１５記載の発明によれば、入力された漢字の読みに基づいて、必要に応じて部分的に漢字検索を実行するため、迅速且つ容易に所望された漢字を特定することができる環境を提供することが可能となる。
【０２６０】
更に、本発明において、集合を例えばＪＩＳ漢字における第１水準，第２水準，補助漢字，その他の漢字とし、この順序で検索を実行することで、一般的な漢字から特定することができ、より迅速に所望された漢字を特定することが可能となる。
【０２６１】
更に、請求項１６記載の発明によれば、検索された漢字に関する詳細な情報をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字に関する詳細な情報を学習する環境も提供することが可能となる。
【０２６２】
更に、請求項１７記載の発明によれば、検索された漢字の異体字等の関連字をユーザは容易に知得することが可能となるため、漢字を容易且つ迅速に検索する環境を提供するだけでなく、検索された漢字の確認する環境や、漢字の関連字を学習する環境も提供することが可能となる。
【０２６３】
更に、請求項１８記載の発明によれば、入力がより簡易となる漢字検索装置を実現するプログラムを提供することができる。
【０２６４】
また、請求項１９記載の発明によれば、上記各プログラムが記録された記録媒体を用いて、任意の端末でこれを実行することが可能となる。
【図面の簡単な説明】
【図１】本発明において漢字を分類する４つのカテゴリを説明するための図である。
【図２】本発明の第１の実施例による漢字検索装置１００の構成を示すブロック図である。
【図３】図２における部品１ファイル１１１のデータ構成を示すテーブルである。
【図４】図２における部品３ファイル１１３のデータ構成を示すテーブルである。
【図５】図２における漢字情報ファイル１１４のデータ構成を示すテーブルである。
【図６】本発明の第１の実施例による漢字検索結果一覧表示画面の例を示す図である。
【図７】本発明の第１の実施例による詳細情報表示画面の例を示す図である。
【図８】（ａ）は本発明の第１の実施例による異体字関連図表示画面の例を示す図であり、（ｂ）は図２における漢字関連付ファイル１１５のデータ構成を示すテーブルである。
【図９】本発明の第１の実施例による漢字検索装置１００が実現される機器の構成を示すブロック図である。
【図１０】本発明の第１の実施例による漢字検索動作の流れを示すフローチャートである。
【図１１】本発明の第２の実施例による漢字検索装置２００の構成を示すブロック図である。
【図１２】本発明の第２の実施例による漢字検索動作の流れを示すフローチャートである。
【図１３】本発明の第３の実施例において定義された部首位置を説明するための図である。
【図１４】本発明の第３の実施例において定義された部首位置とキーボードにおけるキーとの割当てを説明するための図である。
【図１５】本発明の第３の実施例による漢字検索装置３００の構成を示すブロック図である。
【図１６】図１５における漢字情報ファイル３１４のデータ構成を示すテーブルである。
【図１７】本発明の第３の実施例による漢字検索動作の流れを示すフローチャートである。
【図１８】本発明の第４の実施例による文書作成装置４００の構成を示すブロック図である。
【図１９】本発明の第４の実施例による漢字入力動作の流れを示すフローチャートである。
【図２０】本発明の第５の実施例による漢字検索装置５００の構成を示すブロック図である。
【符号の説明】
１１ ＣＰＵ
１２ ＲＡＭ
１３ ＲＯＭ
１４ 表示装置
１５ 入力装置
１６ 記憶装置
１７ ネットワークインタフェース
１８ バス
１００、２００、３００、５００ 漢字検索装置
１０１ 検索式組立手段
１０２、５０２ 部品１検索手段
１０３、５０３ 部品２検索手段
１０４、５０４ 部品３検索手段
１０５、２０５、３０５ 漢字検索手段
１０６ 詳細情報検索手段
１０７ 異体字関連図作成手段
１１１、５１１ 部品１ファイル
１１２、５１２ 部品２ファイル
１１３、５１３ 部品３ファイル
１１４、３１４ 漢字情報ファイル
１１５ 漢字関連付ファイル
１２１ 入力手段
１２２ 表示手段
２１０ 文字コードファイル
４００ 文書作成装置
４０５ 用語検索手段
４２０ 用語入力辞書ファイル[0001]
BACKGROUND OF THE INVENTION
The present invention relates to a kanji search device, a kanji search method, a program thereof, and a recording medium on which the program is recorded, and in particular, a kanji search device using a multi-character code ISO 10646 (unicode), a kanji search method, a program thereof, and a The present invention relates to a recording medium on which a program is recorded.
[0002]
[Prior art]
At present, electronic devices equipped with word processor functions such as personal computers have various input methods as input means (hereinafter referred to as language input software) for characters and symbols with 2-byte codes such as kanji. Has been.
[0003]
This is because characters used mainly in Japanese, Chinese, and the like include a great deal of diversity in character, such as reading, shape, configuration, and meaning.
[0004]
For example, in a language that can be assigned to a 1-byte code, such as Western languages, almost all documents can be created as long as 26 letters, numbers, symbols, and spaces can be input. Therefore, the interest of the language input software provider has been directed to providing an input means for inputting these characters quickly and easily. As a result, what has been reached is the keyboard input means.
[0005]
On the other hand, the languages assigned to 2-byte codes such as Japanese and Chinese are complex and diverse, such as kanji, hiragana, katakana, alphabet, numbers, kanji, symbols, spaces, etc. It consists of letters. Moreover, focusing on kanji, among them, for example, the number of characters specified in the first and second levels of JIS kanji is 6,355 characters, and the number of characters specified as auxiliary kanji is 5,801. There are a total of 12,156 characters in total.
[0006]
Among them, most of the kanji used as everyday words are substantially stored in a 2,965-character kanji group associated with the first level in JIS kanji. For other characters with relatively low use frequency, 3,390 characters are defined as the second level in JIS kanji.
[0007]
Therefore, because these 6,355 Kanji characters are sufficient in daily life, language input software for Japanese input (hereinafter referred to as Japanese input software) was created mainly to be suitable for inputting these 6,355 characters. Has been.
[0008]
In other words, the Japanese input software is premised on being able to read Kanji at the first level, so that it can be entered using the keyboard, and it is rather premised that the Kanji at the second level cannot be read. Therefore, an input means other than the keyboard is used for input.
[0009]
This is because, in JIS kanji, the first level kanji is given a code in the order of reading, and the second level kanji is given a code in the order of radicals / strokes. It is easy to use.
[0010]
However, there are more characters in kanji. For example, 48,899 characters are registered in the Daikan Japanese dictionary and 47,035 characters are registered in the Kangxi dictionary. In addition, there are about 50,000 variants of these kanji characters, and there are a huge number of about 100,000 characters when combined with the kanji supported by the Daikan Japanese dictionary and Kangxi dictionary. To do.
[0011]
The reason for such a large number of kanji is that the use of kanji is not unique to modern Japanese terms. In other words, the character of kanji has been built over a long history, changing with the times. For this reason, the materials of the kanji literature were created in each era, and the types were inexhaustible and complicated.
[0012]
[Problems to be solved by the invention]
However, among these kanji characters, kanji with both readings of phonetics is recognized as 12,156 characters corresponding to JIS kanji, and at least kanji readings do not exist in the other kanji. Furthermore, the current Japanese input software provides only a minimum input means for inputting Japanese terms due to the difficulty of the technology and the cost performance. For this reason, there is a problem that the procedure for inputting characters other than JIS kanji as described above is very complicated and difficult.
[0013]
In recent years, there has been a social demand for digitizing kanji document materials that have been built up in history and providing them to users and the like via a network such as the Internet. However, since the problems as described above exist, a technique for quickly and accurately inputting kanji document materials has not been provided, and there is a problem that it takes a lot of time and money for digitization. Due to this problem, the digitization of Japanese kanji documents, especially in Japan, lags behind other countries.
[0014]
Accordingly, the present invention has been made in view of the above problems, and a kanji search device, a kanji search method, a program thereof, and a recording medium on which the program is recorded can specify a desired kanji quickly and easily. The purpose is to provide.
[0015]
[Means for Solving the Problems]
In order to achieve such an object, the invention described in claim 1 is a Chinese character management for managing a Chinese character registered in a predetermined character code and an element and / or number of strokes obtained by dividing the Chinese character into a character having a reading. An element management unit that manages the element and the reading and / or number of strokes of the element, an element search unit that retrieves an element corresponding to the reading and / or the number of strokes from the element management unit, and the element search unit. It has a kanji search means for searching for kanji including the searched element from the kanji management means, and a search result display means for displaying kanji searched by the kanji search means.
[0016]
Thus, the invention according to claim 1 can provide an environment in which a desired Chinese character can be specified quickly and easily.
[0017]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0018]
Further, in the invention described in claim 2, the element includes a radical, and the Chinese character management means manages the position of the radical in the Chinese character and designates the position of the radical and the radical. And a designated radical position kanji identifying means for identifying a kanji corresponding to the designated radical position from the kanji management means, wherein the kanji search means is identified by the designated radical position kanji identifying means It is characterized in that a search is performed on the designated kanji.
[0019]
Accordingly, in the invention described in claim 2, by providing a configuration for specifying the radical position and the number of strokes in the search key, it is possible to cope with the unknown reading of the element such as the radical, and also for the kanji search. It is possible to greatly reduce the amount of data processing required, and it is possible to specify a desired Chinese character more quickly and accurately.
[0020]
According to a third aspect of the present invention, there is provided a kanji classification means for classifying kanji registered in a predetermined character code into one or more sets, and a kanji search means for searching a set classified by the kanji classification means. And a search result display means for displaying the kanji searched by the kanji search means, wherein the kanji search means does not perform a search for a set after the set in which the kanji is first searched. Yes.
[0021]
Thus, in the invention described in claim 3, since the kanji search is partially executed as necessary based on the input kanji reading, it is possible to quickly and easily specify the desired kanji. Can be provided.
[0022]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0023]
Furthermore, the invention described in claim 4 is detailed information management means for managing detailed information including at least one of reading, total number of strokes, one or more types of character shapes, and related characters for each kanji, and the kanji search means. And a detailed information specifying means for specifying the detailed information of the kanji searched in step (b), and a detailed information display means for displaying the detailed information specified by the detailed information specifying means.
[0024]
Thus, in the invention described in claim 4, since the user can easily know detailed information about the searched kanji, not only provides an environment for easily and quickly searching for kanji, but also searches It is also possible to provide an environment for confirming the kanji that has been made and an environment for learning detailed information about the kanji.
[0025]
Further, the invention according to claim 5 is related character management means for managing related characters, related character specifying means for specifying related characters of the kanji retrieved by the kanji search means from the related character management means, and the kanji System diagram creating means for creating a system diagram showing the relationship between the kanji and the related characters based on the kanji searched by the search means and the related characters specified by the related character specifying means, and the system diagram creating means And a system diagram display means for displaying the system diagram created in (1).
[0026]
Thus, in the invention described in claim 5, since the user can easily know related characters such as variants of the searched kanji, it is only necessary to provide an environment for easily and quickly searching for kanji. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0027]
Furthermore, the invention described in claim 6 has voice recognition means for recognizing voice, and the reading of the element and / or the number of strokes are inputted from the voice recognition means.
[0028]
Accordingly, in the invention described in claim 6, it is possible to provide a kanji search device that is easier to input.
[0029]
The invention according to claim 7 is a kanji search method for searching kanji based on an element obtained by reading and / or dividing kanji registered in a predetermined character code into characters having a number of strokes. Element search step for searching for an element corresponding to the read and / or number of strokes from an element management means for managing the element and the reading and / or number of strokes of the element, and means for displaying the element searched in the element search step An element selection step that causes the user to select, and a kanji search step for searching for a kanji that includes the element selected in the element selection step from a kanji management means that manages kanji and elements that constitute the kanji; A kanji search result display step for displaying the kanji searched in the kanji search step.
[0030]
Thus, in the invention described in claim 7, it is possible to provide an environment in which a desired Chinese character can be specified quickly and easily.
[0031]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0032]
Further, in the invention according to claim 8, the element includes a radical, and the kanji managing means manages the position of the radical in the kanji and designates the position of the radical and the radical. And a designated radical position kanji identifying step for identifying the kanji corresponding to the designated radical position from the kanji management means, and the kanji search step is identified in the designated radical position kanji identifying step It is characterized in that a search is performed on the designated kanji.
[0033]
Thus, in the invention described in claim 8, it is possible to deal with a situation in which the radical reading and the number of strokes are not specified by providing a configuration for specifying the radical position and the number of strokes.
[0034]
The invention according to claim 9 is a kanji search method for searching for kanji classified into one or more sets, wherein the one or more sets are based on input kanji and / or stroke number readings. And a kanji search result display step for displaying the kanji searched in the kanji search step, wherein the kanji search step searches for sets after the set in which kanji is first searched. It is characterized by not performing.
[0035]
Thus, in the invention described in claim 9, since the kanji search is partially executed as necessary based on the input kanji reading, it is possible to quickly and easily specify the desired kanji. Can be provided.
[0036]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0037]
Furthermore, the invention according to claim 10 relates to the kanji and the details related to the kanji searched in the kanji search step, including at least one of reading, the total number of strokes, at least one type of character shape and related characters. A detailed information specifying step that is specified by a detailed information managing means that manages information, and a detailed information display step that displays the detailed information specified in the detailed information specifying step.
[0038]
Thus, in the invention described in claim 10, since the user can easily know detailed information about the searched kanji, not only provides an environment for easily and quickly searching for kanji, but also searches. It is also possible to provide an environment for confirming the kanji that has been made and an environment for learning detailed information about the kanji.
[0039]
Furthermore, the invention described in claim 11 is a related character specifying step of specifying related characters of the kanji searched in the kanji search step from related character management means for managing related characters of a predetermined kanji, and the kanji search step. A system diagram creating step for creating a system diagram showing the relationship between the kanji and the related characters based on the kanji retrieved in step 1 and the related characters identified in the related character identifying step, and creating in the system diagram creating step And a system diagram display step for displaying the system diagram.
[0040]
Thus, in the invention described in claim 11, since the user can easily know related characters such as variants of the searched kanji characters, it is only necessary to provide an environment for easily and quickly searching for kanji characters. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0041]
Furthermore, the invention described in claim 12 has a voice recognition step for recognizing voice, and the reading and / or number of strokes of the element is the reading and / or number of strokes recognized in the voice recognition step. Yes.
[0042]
Thus, the invention according to claim 12 can provide a kanji search method that is easier to input.
[0043]
The invention according to claim 13 is a Chinese character management means for managing a Chinese character registered in a predetermined character code and an element obtained by reading the Chinese character and / or dividing it into a character having a stroke number; An element search process for operating a computer having element management means for managing reading and / or the number of strokes of the element, wherein the element management means searches for an element corresponding to the reading and / or the number of strokes from the element management means. And a kanji search process for searching for kanji including the element searched by the element search process from the kanji management means and a search result display process for displaying the kanji searched by the kanji search process. Let
[0044]
Thus, in the invention described in claim 13, it is possible to provide an environment in which a desired Chinese character can be specified quickly and easily.
[0045]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0046]
The invention according to claim 14 is the above-described program for causing the computer to function the computer for managing the position of the radical in the kanji, wherein the element includes a radical, and the kanji management means manages the position of the radical in the kanji. Causing the computer to execute a radical position designation process for designating a radical position and a designated radical position kanji identification process for identifying a Chinese character corresponding to the designated radical position from the kanji management means, The kanji search process is characterized by searching for the kanji specified by the designated radical position kanji specifying process.
[0047]
Thus, in the invention described in claim 14, it is possible to specify a desired kanji character more quickly and accurately by providing a configuration for specifying the radical position and the number of strokes in the search key.
[0048]
The invention according to claim 15 is a program for causing a computer having a kanji classification means for classifying kanji registered in a predetermined character code into one or more sets, wherein the kanji classification means The computer executes a kanji search process for searching the classified set and a search result display process for displaying the kanji searched in the kanji search process. In the kanji search process, a kanji is first searched. It is characterized by not searching sets after the set.
[0049]
Thus, in the invention described in claim 15, since a partial Chinese character search is executed as necessary based on the input Chinese character reading, it is possible to quickly and easily specify the desired Chinese character. Can be provided.
[0050]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0051]
Furthermore, the invention described in claim 16 functions as the computer having detailed information management means for managing detailed information including at least one of reading, the total number of strokes, one or more types of character shapes, and related characters for each Chinese character. A detailed information specifying process for specifying the detailed information of the kanji searched in the kanji search process, and a detailed information display for displaying the detailed information specified in the detailed information specifying process And causing the computer to execute processing.
[0052]
Thus, in the invention described in claim 16, since the user can easily know detailed information on the searched kanji, not only provides an environment for easily and quickly searching for kanji, but also searches. It is also possible to provide an environment for confirming the kanji that has been made and an environment for learning detailed information about the kanji.
[0053]
Furthermore, the invention described in claim 17 is the above-mentioned program for causing the computer to have related character management means for managing related characters, wherein the related characters of the kanji searched in the kanji search process are related to the related characters. System diagram showing relation between kanji and related characters based on related character specifying process specified from character management means, kanji searched in kanji search process and related characters specified in related character specifying process A system diagram creation document process for creating the system diagram and a system diagram display process for displaying the system diagram created by the system diagram creation process are executed by the computer.
[0054]
Thus, in the invention described in claim 17, since the user can easily know the related characters such as variants of the searched kanji, it is only necessary to provide an environment for easily and quickly searching for kanji. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0055]
Furthermore, the invention according to claim 18 is the above-described program, wherein the computer executes speech recognition processing for recognizing speech, and the reading of the elements and / or the number of strokes are recognized by the speech recognition processing. It is characterized by reading and / or number of strokes.
[0056]
Thus, in the invention described in claim 18, it is possible to provide a program that realizes a kanji search device that makes input easier.
[0057]
According to a nineteenth aspect of the present invention, the above program is recorded on a recording medium.
[0058]
Thus, according to the nineteenth aspect of the present invention, it is possible to execute this on an arbitrary terminal using the recording medium on which each program is recorded.
[0059]
DETAILED DESCRIPTION OF THE INVENTION
〔principle〕
In explaining the present invention, the principle of the present invention will be described first.
[0060]
The present invention relates to character codes that can be processed by computers installed in various personal computers, mobile phones (including next-generation mobile phones), other electronic devices, and the like, and in particular, JIS X 0221, which is relatively large-scale among them. This is for inputting characters of ISO 10646-1 Unicode (hereinafter referred to as Unicode) using a keyboard (or numeric keypad).
[0061]
In principle, Unicode includes characters from all over the world in its coat system, and the number of registered characters is the largest at present, and the number of Chinese characters is 20,902. In addition, it is a character code that has the possibility of being compatible with all characters such as kanji in the future, and is the character code that is most likely to be the global standard in the future.
[0062]
Therefore, in each example illustrated below, the specific configuration is illustrated on the assumption that a kanji corresponding to Unicode is input. However, the essence of the present invention is not limited to Unicode, and other character codes such as JIS code, S-JIS code, EUC, and division code, and new character codes can also be applied.
[0063]
In addition, even if a kanji character does not have or can not be read, its elements are divided into one or more radicals and parts that can be read. Kana 'can be expressed.
[0064]
For example, taking the Chinese character “雖 (sound: Sui, Kun: Yedo)” as an example, even if this Chinese character cannot be read, the composition is divided into radicals and parts such as “mouth + insect + spider”. Then, it can be expressed as “Kuchi + Mushi + Futari”. In the present invention, a logic for specifying a desired character is set using such a principle, and it is possible to make a computer easily specify a target character.
[0065]
For example, the present invention consolidates characters, particularly Chinese characters, into the following four categories as in the following embodiments. These are shown in FIG. However, the pie chart in FIG. 1 schematically shows a conceptual ratio of radicals and other parts (including common Chinese characters) in Chinese characters.
(A) Kanji category consisting of one radical
(B) Kanji category consisting of multiple radicals
(C) Kanji category consisting of radical and one or more parts
(D) Kanji category consisting of radical and one or more kanji
In general, all Chinese characters can be divided into at least one of "radical", "other Chinese characters" and "several parts", and always have "radical" It is composed. However, radical is a concept of Chinese character classification that refers to 204 sub-classes (currently 214 classes) that classify 47,035 characters registered in the Kangxi dictionary.
[0066]
However, the gist of the present invention is not to categorize into four categories as described above, but to achieve a desired kanji more easily and quickly by consolidating into a plurality of categories.
[0067]
By the way, this invention is comprised so that the following three items may be implement | achieved in order to settle in the desired Chinese character more easily and quickly from many Chinese characters.
(1) Capable of speedy input processing
(2) Less prior learning about search and input
(3) Easily accept expansion of multi-kanji characters, and do not break down the expected increase in the number of characters
In the above, in order to cope with (1), the present invention employs a configuration in which a search key is input using a keyboard. That is, the present invention provides an environment in which a search key for specifying a desired character can be input without requiring another GUI (graphical user interface) such as a mouse or a pen-type input device. The input work is simplified. However, it does not preclude the use of other GUIs for speedy input processing according to necessity or situation.
[0068]
Further, in order to cope with (2), the present invention provides an environment in which a Chinese character search is executed by effectively utilizing a Chinese character that is used as a regular character. As a result, only a minimum amount of knowledge is required for the user, which can be widely used by general users. However, as the kanji used for regular use, not only the common kanji but also the kanji defined in the first level of personal name kanji and JIS kanji, etc., which are generally read, may be adopted.
[0069]
In order to deal with (3), the present invention employs a code system having a huge capacity, such as Unicode, as a character code. For example, in the present Japan, the immediate goal of kanji processing is to realize an environment where 48,899 characters registered in the “Daikan Japanese Dictionary” and 47,035 characters registered in the “Kangsu Dictionary” can be easily input. However, in order to practically satisfy the multi-kanji code system close to 50,000 characters, it is necessary to use a code system having an enormous capacity such as Unicode at present. This Unicode is a large code system that cannot be compared with the conventional JIS Kanji 6,355 characters and compared with the recently established JIS auxiliary Kanji 5,801 characters (which are hardly recognized). In the present invention, by adopting a character code having such an enormous capacity, even if a character is added later, it is possible to sufficiently cope with it.
[0070]
DESCRIPTION OF EXEMPLARY EMBODIMENTS Hereinafter, preferred embodiments of the invention will be described in detail with reference to the drawings.
[First embodiment]
First, a first embodiment of the present invention will be described in detail with reference to the drawings.
[0071]
This embodiment is composed of 214 radicals defined in the Kangxi Dictionary, 99 radicals composed of a plurality of radicals, and more than 100 characters such as parts, kana, kana, and numbers. Elements that can read 20,902, especially 18,000 unreadable Kanji characters that are supported by Unicode, for example, using the kanji readings of Unicode kanji characters that can be used as standard parts and common kanji characters Disassembled into However, in this embodiment, an example is given in which one kanji is divided into up to four elements. That is, in this embodiment, each Chinese character is composed of up to four readable elements. However, the present invention is not limited to four elements as described above, and can be modified in any way as long as it is two or more elements.
[0072]
In this way, for example, by dividing into four elements, in this embodiment, a search key for specifying a desired kanji can be easily input using only the keyboard, and it can be quickly set. It becomes possible.
[0073]
Further, in the present embodiment, regarding the searched characters, for example, kanji, information on the kanji is also provided to the user via display means such as a display. The kanji information includes the reading of the whole kanji, the number of strokes, the included radicals and parts, the common kanji, the type of kanji, the code number, and the related characters (related characters).
[0074]
Here, in general, kanji includes related characters such as common kanji, simplified characters, traditional characters, passage characters, variant characters (including abbreviations, old characters, and folk characters). For example, in “Body”, there is a “Body” registered as a common Chinese character (or Japanese character shape, hereinafter referred to as a Japanese character shape), and there is a variant character (former character) “體” for this common Chinese character. Exists. In addition, “body” is also a simplified Chinese character, and there is a traditional Chinese character “體”. In addition, “body” includes “躰”, “存在”, etc. as other related characters. Such a relationship exists in a mixed manner in Unicode. Furthermore, when referring to the differences in character shapes, there are distinctive differences in each country where Kanji is used, and there are many variants of written characters. A system that can also distinguish these variants is also desirable.
[0075]
Therefore, in the present embodiment, the information of these relations is also managed and provided to the user. That is, for the target kanji, information on the types of information such as common kanji (current kanji), personal kanji, simplified characters, traditional characters, passage characters, variant characters (including abbreviations, old characters, folk characters), allowable characters, national characters, etc. provide.
[0076]
Further, as a code number, not only Unicode but also a code number in JIS code, S-JIS code, EUC, division code, other character code, and the like may be provided.
[0077]
As a result, in this embodiment, it is possible not only to provide an environment in which a desired kanji can be specified easily and quickly, but also to provide an environment in which the association of characters is known.
[0078]
-Configuration of the first embodiment
Next, the block configuration of the Chinese character search apparatus 100 according to the present embodiment will be described in detail with reference to FIG.
[0079]
Referring to FIG. 2, the present embodiment includes an input unit 121 and a display unit 122 that are configured by a Chinese character search device 100 and a keyboard.
[0080]
The kanji retrieval apparatus 100 includes a retrieval formula assembly unit 101 that assembles an expression (hereinafter referred to as a retrieval expression) for retrieving a kanji based on the reading of elements and arithmetic symbols input from the input unit 121, and retrieval expression assembly. And kanji search means 105 for searching for kanji based on the search formula established by the means 101.
[0081]
Further, the retrieval formula assembling means 101 is connected to the part 1 retrieving means 102, the part 2 retrieving means 103, and the part 3 retrieving means 104, and is specified by the radical retrieving means 102, the parts retrieving means 103, and the common kanji retrieving means 104. On the basis of the radicals, parts, common Chinese characters, and arithmetic symbols input from the input means 121, a search formula for searching for a desired Chinese character is assembled.
[0082]
Here, in this embodiment, it is assumed that the component 1 is a radical, for example. Therefore, the part 1 file 111 that stores the search target range of the part 1 search unit 102 stores the radical, and the component 1 search unit searches the part 1 file 111 for the radical. In the present embodiment, the parts 2 and 3 are parts with readings that do not correspond to radicals, for example, and the part 3 is assumed to be a common Chinese character. Accordingly, the part 2 search means 103 searches for parts (other than radicals and common kanji) from the part 2 file 112, and the part 3 search means 104 searches for the common kanji from the part 3 file 113 (however, these are also parts). Search for. Further, the present invention is not limited to this configuration, and the parts constituting the kanji may be further classified and assigned to the parts 4. In this case, however, the configuration of the component 4 search means... And the component 4 file is provided according to the classification.
[0083]
More specifically, the retrieval formula assembly means 101 receives element readings and arithmetic symbols from the input means 121. Here, in this example, in order to search for “読 み”, the elements “Futari”, “+”, “Kuchi”, “+”, “Mushi”, “*” or “Space” or “Conversion” are read and Assume that arithmetic symbols are entered in order. However, in this embodiment, “+” means that the reading input immediately before is converted into an element, and “*”, “space”, or “conversion” converts the reading of the element input immediately before into an element. After that, it means that the search is executed based on the search formula assembled as a whole.
[0084]
In addition, the order of inputting the element readings may be configured to input the radical first, and then input the readings of each element according to the stroke order, without any particular limitation. In the following description, a case where the former is configured will be described.
[0085]
In this embodiment, when the element reading “Futari” is input first and then “+” is input, the retrieval formula assembling means 101 inputs “Futari” to the radical search means 102. The radical search unit 102 searches the radical file 111 for a radical corresponding to the input “Futari”, and outputs a list of radicals obtained as a search result to the search formula assembly unit 101. The retrieval formula assembling means 101 presents the input list of radicals to the user via the display means 122 and causes the input means 121 to select a desired radical from the list. However, if the search result can be limited to one character, only this one Chinese character is displayed.
[0086]
In addition, the retrieval formula assembling unit 101 will be described as a case where there is no corresponding radical as a result of retrieval by the radical retrieval unit 102. For example, since “Futaru” always exists in the part 1 file 111, assuming that “Futaru” is input, this “Futaru” is input to the part 1 search means 102. The part 1 search unit 101 searches the part 1 file 112 for a part (radical) corresponding to the input “Futaru”, and outputs a list of radicals obtained as a search result to the search type assembly unit 101. . On the other hand, the retrieval formula assembling unit 101 presents the input list of radicals to the user via the display unit 122 and causes the input unit 121 to select a desired radical from the list.
[0087]
Further, the retrieval formula assembling unit 101 inputs “Futaru” to the component 2 retrieval unit 103 when there is no corresponding part (group) as a result of the retrieval by the component 1 retrieval unit 102. The part 2 search unit 103 searches the part 2 file 112 for a part corresponding to the input “Futaru”, and outputs a list of parts obtained as a search result to the search type assembly unit 101. On the other hand, the retrieval formula assembling unit 101 presents a list of input parts to the user via the display unit 122 and causes the input unit 121 to select a desired common kanji from the list.
[0088]
Furthermore, the retrieval formula assembling unit 101 inputs “Futaru” to the component 3 retrieval unit 104 when the corresponding component and radical do not exist as a result of the retrieval by the component 2 retrieval unit 102. The part 3 search unit 103 searches the part 3 file 113 for a part (common kanji) corresponding to the input “Futaru”, and outputs a list of common kanji characters obtained as a search result to the search type assembly unit 101. . On the other hand, the retrieval formula assembling unit 101 presents a list of input parts to the user via the display unit 122 and causes the input unit 121 to select a desired common kanji from the list.
[0089]
However, if there is no corresponding radical, part, or common kanji as a result of the above search, the retrieval formula assembling means 101 presents this to the user via the display means 122, and again the element To input readings and arithmetic symbols.
[0090]
In this embodiment, an element may be specified using an arithmetic symbol “−”. However, in this embodiment, “-” means that an element is omitted from an element. That is, when “隹” is input as an element, for example, “特定” is specified by inputting “I (text: common kanji)”, “−”, and “I (thread: common kanji)”.
[0091]
In the case of such a configuration, the data structure of the part 2 file 112 also stores elements obtained by further subdividing each part, like the part 3 file 113 shown in FIG. In addition, when input is made using “-”, the retrieval type assembling means 101 lists the elements searched from the part 1 file 111, the part 2 file 112, and the part 3 file 113 based on the inputted “I”. Is presented to the user via the display means 122. Thereafter, a desired element is selected from these, and “maintenance” is determined.
[0092]
Next, similarly, a list of elements retrieved from the part 1 file 111, the part 2 file 112, and the part 3 file 113 based on “Ito” is presented to the user via the display unit 122, and desired elements are selected from the list. To select. Thereby, up to “fiber” is determined. However, this operation is executed by inputting “+” after “Ito”. Further, the retrieval formula assembling means 101 refers to the part 3 file 113 based on the “fiber” determined as described above, and the difference between the elements constituting “fiber” and the elements constituting “thread”. ("隹" in this example) is specified. Thereby, up to “ま で +” is specified.
[0093]
Further, when “Futari” is searched, “り (Futari)” exists in the part 1 file 111, and therefore the retrieval formula assembling means 101 displays “隹” on the display means 122. On the other hand, the user determines (selects) that the radical is “隹” using the input means 121. By this operation, the retrieval formula assembling means 101 determines up to “隹 +” in the retrieval formula.
[0094]
Next, when “Kuchi +” is input to the retrieval formula assembling means 101, the element reading “Kuchi” is similarly input to the part 1 searching means 102, and the corresponding radical is searched. If the corresponding radical does not exist due to an erroneous input or the like, similarly, “Kuchi” is sequentially input to the part 2 search means 103 and the part 3 search means 104 to search for the corresponding part or common kanji. . Further, the list obtained as a result is presented to the user via the display means 122, and a desired radical or component or common kanji is selected from the list. With this operation, the retrieval formula assembling means 101 determines up to “隹 + mouth +” in the retrieval formula.
[0095]
Further, when “Mushi *” is inputted from the input means 121, the retrieval formula assembling means 101 inputs the element reading “Mushi” to the part 1 retrieval means 102, executes the same operation, and applies accordingly. Determine radicals, parts, or common kanji. Further, the list obtained as a result is presented to the user via the display means 122, and a desired radical or component or common kanji is selected from the list. By this operation, the search expression “隹 + mouth + insect *” is determined.
[0096]
However, in the above-described series of steps, the final search formula is completed by sequentially executing a search each time a set of element readings and arithmetic symbols are input. However, the present invention is not limited to this, and after inputting all of the element readings and arithmetic symbols, a search related to the reading of each element may be executed to complete the final search expression.
[0097]
When the search formula is determined in this way, the search formula assembling means 101 inputs the determined search formula “隹 + mouth + insect” to the kanji search means 105. The kanji search means 105 searches for the corresponding kanji from the kanji information file 114 based on the inputted search expression “隹 + mouth + insect”, and presents the search results obtained thereby as a list on the display means 122. Therefore, the user uses the input unit 121 to select a desired kanji from the list presented in this way.
[0098]
In the search, a kanji character including each item included in the search expression as an element is specified. However, at this time, similar kanji characters may be specified. This similar kanji is a kanji that includes more elements than the elements in the search expression. In addition, the kanji obtained as a search result is displayed from the matching ones, and the next highest degree of similarity, that is, in the order including the elements higher than the elements in the search formula, in this case, “隹 + mouth + insect” + Configure to display Chinese characters that contain one element.
[0099]
・ Description of each file
Here, the data structure of each file in the present embodiment will be described with reference to FIGS. However, each file described below is assumed to be created in a normal file format. However, the present embodiment is not limited to this, and may be created as a relational type or network type database. Each file may be composed of one file or a plurality of files.
[0100]
Further, the radicals defined in the present embodiment are, for example, 214 radicals defined in the Kangxi Dictionary, and 99 radicals constituted by using a plurality of radicals.
[0101]
..Part 1 file 111
First, the data structure of the component 1 file 111 will be described with reference to FIG. Referring to FIG. 3, in the component 1 file 111, radical codes and readings are associated with each other. The radical code is associated with radical font data (for example, outline font data or bitmap font data). However, the font data may be stored in the component 1 file 111 or in another file (not shown).
[0102]
In this way, the component 1 search means 102 identifies the radical code corresponding to the input reading and inputs it to the display means 122 to display a list. However, the display screen at this time is the same as the character search result list display screen described below with reference to FIG.
[0103]
..Part 2 file 112
The part 2 file 112 can also be realized by the same data configuration as the part 1 file 111 shown in FIG. However, in the part 2 file 112, a part code is stored instead of the radical code (or common kanji code) (in this case, the part is a general-purpose part, which is a kanji in Unicode that is a component of many kanji characters). And newly registered external characters designated as parts). In addition, outline font data or bitmap font data is associated with the component code in the same manner as described above.
[0104]
..Part 3 file 113
The component 3 file 113 has the data configuration shown in FIG. Referring to FIG. 4, in the component 3 file 113, common kanji codes and readings are associated with each other. Further, in the component 3 file 113, elements constituting the common kanji are further associated with the common kanji code. However, the elements in the part 3 file 113 are radicals or parts stored in any of the part 1 file 111, the part 2 file 112, and the part 3 file 113, or common kanji. Further, outline font data or bitmap font data is also associated with the common kanji code.
[0105]
However, the common kanji registered in the part 3 file 113 in the present embodiment is not limited to the common kanji, as mentioned above, but is defined in the first level of personal kanji and other JIS kanji. It may be a general Chinese character like this.
[0106]
..Kanji information file 114
FIG. 5 shows the data structure of the kanji information file 114 in FIG. Referring to FIG. 5, in the kanji information file 114, for each kanji, the code number, character shape, number of strokes, and kanji of the character code applied in this embodiment (ISO 10646 = Unicode: Unicode in this embodiment) are configured. Are associated with the elements to be performed (radicals, parts, common kanji, etc.). Here, the character shape is the shape of each of the same kanji, such as Japan, China, Taiwan, Korea, Vietnam, etc., and variant characters that have changed over time. However, simplified Chinese characters are generally used in modern China, and traditional Chinese characters are used in Taiwan. Further, the number of elements to be stored may be a maximum of four as described above. As described above, when further subdividing each component, the configuration is not limited to the above configuration, and may be four or more.
[0107]
As the number of strokes, in addition to the total number of strokes of the entire kanji, the number of strokes related to the portion excluding the radical may be stored.
[0108]
The font data for each character code may be stored in the kanji information file 114 or in another file. In addition, the font data may be an outline font or a bitmap font, and when an outline font is applied, it may be a full outline font or a stroke font.
[0109]
Also, in the element item in the kanji information file 114, codes (radical code, component code, common kanji code) in the part 1 file 111, the part 2 file 112, and the part 3 file 113 are stored.
[0110]
Further, the kanji information file 114 may be configured to store a character code (other character code) other than Unicode, for example, a code number in a JIS code, S-JIS code, EUC, division code, or the like. In addition, for each kanji, the type of kanji that indicates whether it is a common kanji, personal kanji, traditional kanji, simplified kanji, passage kanji, variant kanji (including abbreviations, old letters, folk kanji), permissible or national kanji, etc. is also stored. It may be configured to do so.
[0111]
..Search result list display screen
Next, an example of a kanji search result list display screen displayed on the display unit 122 when the list of kanji searched by the kanji search unit 105 is presented to the user will be described with reference to FIG.
[0112]
Referring to FIG. 6, the kanji search result list display screen displays images of kanji obtained as search results and buttons provided for the kanji. In addition, the image of kanji corresponds to numbers.
[0113]
On this screen, when the user inputs a number from the input means 121 or selects a button corresponding to the kanji with another input means (for example, a mouse), the desired kanji is input to a predetermined application. Is called.
[0114]
Furthermore, when the area where the kanji image is displayed in the configuration is selected by the other input means, the character code of the selected kanji is input to the detailed information search means 106 in FIG. 2 and selected from the kanji information file 114. Detailed information about kanji is identified. The specified detailed information is presented to the user via the display unit 122 as a detailed information display screen.
[0115]
Further, the screen for displaying the list obtained as a result of the search by the part 1 search means 102, the part 2 search means 103, and the part 3 search means 104 on the display means 122 is also the kanji search result shown in FIG. A configuration similar to that of the list display screen may be used. However, in this case, a button for displaying detailed information is omitted.
[0116]
Further, as a display method other than the screen shown in FIG. 6, it is possible to display the retrieved result one character at a time, and switch the kanji to be displayed each time a space key is input, for example. However, in the description of the present embodiment, a case where a list is displayed on the screen shown in FIG. 6 will be described.
[0117]
Detailed information display screen
An example of the detailed information display screen is shown in FIG. Referring to FIG. 7, on the detailed information display screen according to the present embodiment, the reading and learning of the selected kanji, the parts (including radicals / common kanji) constituting the kanji, the number of strokes, the common kanji or the personal kanji are displayed. Displays the type of kanji that indicates whether it is a traditional, simplified, pass-by, or variant (including abbreviations, old, and folk), allowed or national characters, and the code number assigned to the kanji. . Further, the code numbers to be displayed are not limited to one type, and code numbers in a plurality of types of character codes may be listed.
[0118]
This detailed information display screen is created by the detailed information search means 106 by reading various detailed information from the kanji information file 114 when a detailed information display request is input from the input means 121.
[0119]
・ Related figure
Further, in this embodiment, the kanji selected from the kanji search result list display screen shown in FIG. 6 is configured to display a systematic diagram of related characters including variants of the kanji. This is configured to be displayed by selecting a button provided for displaying the variant related diagram on the kanji search result list display screen shown in FIG. 6 by the input means 121 or another input device such as a mouse. However, for example, in the above detailed information display screen, a “variant character related diagram display” button is provided as shown in FIG. 7, and this is displayed by selecting with the input means 121 or other input means such as a mouse. You may comprise.
[0120]
Moreover, an example of the variant related figure displayed on the display means 122 is shown using Fig.8 (a). In the variant-related diagram as illustrated in Fig. 8 (a), for the selected kanji, the common kanji, simplified characters, traditional characters, variant characters (including abbreviations, old characters, and folk characters), and passing characters are displayed in a systematic manner. Is done. Thereby, the user can easily understand what kind of Chinese characters are related and what kind of variant characters are included. However, in the following description, in order to give a preferable example, the kanji search result list display screen displays “
[0121]
[Outside 1]

"Is selected.
[0122]
In addition, in order to create such a variant-related diagram, the kanji search device 100 according to the present embodiment has a kanji-related file 115 as shown in FIG. This kanji-related file 115 is used to manage the relationship between kanji common kanji, simplified kanji, traditional kanji, variant kanji (including abbreviations, old letters, folk characters), and passing characters. It manages whether the kanji has a relationship with common kanji, simplified Chinese characters, traditional Chinese characters, variant Chinese characters (including abbreviations, old characters, and folk characters) and passing characters.
[0123]
FIG. 8B shows the data structure of the kanji-related file 115. Referring to FIG. 8 (b), the kanji-related file 115 is a table of combinations of kanji (kanji code numbers), and has a configuration in which information indicating the mutual relationship is stored in columns that intersect each other. ing.
[0124]
Therefore, when the display request for the variant related diagram is input from the input unit 121, the related character diagram creating unit 107 reads the relationship including the target kanji from the kanji related file 115, and based on this, the kanji information file 114 is read. 8 is created, and the created variant-related diagram is provided to the user via the display means 122. FIG.
[0125]
In addition, the character form of each country stored in the Chinese character information file 114 may be displayed on the display unit 122. This can be realized by a configuration in which, when a display request is made from the input unit 121 as in the case of each display screen, for example, the kanji search unit 105 reads each character form from the kanji information file 114 and displays it. is there.
[0126]
・ Summary of configuration
The detailed configuration of the kanji search device 100 according to the present embodiment has been described above. However, the kanji search device 100 may be configured as software even if it is configured as dedicated hardware, and this may be configured as a personal computer or mobile phone (next generation). It may also be realized by being incorporated into an electronic device having a computer such as an arithmetic processing unit. FIG. 9 shows a block configuration example of a device in which the Chinese character search apparatus 100 is implemented by software when the software is incorporated.
[0127]
Referring to FIG. 9, the device includes a CPU (Central Processing Unit) 11, a RAM (Random Access Memory) 12, a ROM (Read Only Memory) 13, a display device 14, an input device 15, and a storage device 16. Composed.
[0128]
Here, the display device 14 corresponds to the display means 122 in FIG. 2, and the input device 15 corresponds to the input means 121. The storage device 16 is composed of a nonvolatile recording medium such as a hard disk or an EP-ROM.
[0129]
In this configuration, software for realizing the Chinese character search device 100 according to the present embodiment is stored in the storage device 16, read out as necessary, and executed by the CPU 11. At this time, a work area is secured in the RAM 12.
[0130]
The software may be configured to be executed in any electronic device by being recorded and carried on a CD-ROM, DVD-ROM, or other removable recording medium.
[0131]
-Input operation in the first embodiment
Next, the operation when inputting a Chinese character using the Chinese character search device 100 will be described with reference to the flowchart of FIG.
[0132]
Referring to FIG. 10, in this embodiment, first, the user inputs an element reading and an arithmetic symbol (+, *, −) using the input means 121 (step S101). The reading of the element input in this way is input from the search expression assembly means 101 in the kanji search apparatus 100 to the part 1 search means 102, triggered by the input of an arithmetic symbol, and the corresponding radical is the part 1 file. A search is performed from 111 (step S102).
[0133]
As a result of this search, if there is a corresponding radical (Yes in step S103), the search formula assembling unit 101 displays the list as a list from the display unit 122 to the user (step S109). On the other hand, if the corresponding radical does not exist as a result of the search in step S102 (No in step S103), the search formula assembling unit 101 inputs the reading of the element input in step S101 to the component 2 search unit 103. Then, the corresponding part is searched from the part 2 file 112 (step S104).
[0134]
As a result of this search, if there is a corresponding part (Yes in step S105), the search formula assembling unit 101 displays the list from the display unit 122 to the user (step S109). On the other hand, if the corresponding part does not exist as a result of the search in step S104 (No in step S105), the search formula assembling unit 101 inputs the reading of the element input in step S101 to the part 3 search unit 104. The corresponding common kanji is searched from the part 3 file 113 (step S106).
[0135]
As a result of this search, if there is a corresponding common kanji character (Yes in step S107), the search formula assembling means 101 displays a list of these from the display means 122 to the user (step S109). On the other hand, as a result of the search in step S106, if the corresponding common kanji character does not exist (No in step S107), the search formula assembling means 101 notifies the user via the display means 122 that the corresponding element does not exist. Notification (step S108) and return to step S101.
[0136]
Further, in the above flow, if any element of radical, part, or common kanji exists and is displayed as a list on the display means 122 (step S109), the user uses the input means 121 to select a desired element. Select (step S110).
[0137]
When the desired element is selected in this way, the retrieval formula assembling means 101 determines whether or not the arithmetic symbol last input in step S101 is “*” (step S111).
[0138]
If the result of this determination is not "*" (No in step S111), the retrieval formula assembling means 101 returns to step S101 to input the next element reading and arithmetic symbol. On the other hand, if the result of determination in step S111 is “*” (Yes in step S111), the search formula assembling means 101 inputs the search formula determined in the above flow to the kanji search means 105 to search for kanji. The corresponding kanji is retrieved from the kanji information file 114 in the means 105 (step S112).
[0139]
As a result of this search, if there is no corresponding kanji (No in step S113), the kanji search means 105 notifies the user that there is no corresponding kanji via the display means 122 (step S114), and step S101. Return to On the other hand, as a result of the search in step S112, if the corresponding kanji exists (Yes in step S113), the kanji search means 105 displays a list of kanji searched via the display means 122 (step S115). The user is made to select a desired Chinese character using the input means 121 (step S116).
[0140]
Thereafter, the kanji search apparatus 100 has requested detailed information regarding the selected kanji (step S117), requested a variant-related diagram regarding the selected kanji (step S120), or selected kanji. Is determined to be input to a predetermined application (step S123).
[0141]
Here, when detailed information related to the selected kanji is requested (Yes in step S117), the kanji search apparatus 100 specifies detailed information related to the kanji selected from the kanji information file 114 using the detailed information search means 106. This is presented to the user via the display means 122 (step S119).
[0142]
If a variant-related diagram relating to the selected kanji is requested (Yes in step S120), the kanji search device 100 uses the related-character diagram creating means 107 to select the kanji selected from the kanji-related file 115. The related kanji code number and the information about the relationship are read out, and based on this, the character shape and font data of each kanji are specified from the kanji information file 114 (step S121), and the specified information is Using this, a variant-related diagram is created and presented to the user via the display means 122 (step S122).
[0143]
By operating as described above, the user can not only search for a desired kanji using the input means 121 such as a keyboard, but can also view detailed information about the searched kanji and related system diagrams of kanji. It becomes possible.
[0144]
・ Specific input examples
The input procedure according to the flowchart shown in FIG. 10 will be described below with a specific example.
[0145]
In this description, the following four input expressions will be described as examples.

..When searching for “堊”
In the present embodiment, when searching for “堊” shown in (Formula 1), the user first inputs “Tachi +” using the input means 121 to search for a radical. This “tsuchi +” is input to the kanji search device 100 from the input means 121.
[0146]
The kanji search device 100 inputs the input “Tachi +” to the search expression assembly means 101. The retrieval type assembling means 101 first inputs “Tachi” to the part 1 retrieval means 102. Here, since the radical “Sat” corresponding to “Tachi” exists in the part 1 file 111, the part 1 search unit 102 searches for “Sat”. Therefore, the retrieval formula assembling unit 101 displays “soil” retrieved by the component 1 retrieval unit 102 on the display unit 122. On the other hand, the user uses the input unit 121 to select the displayed “Soil”. This selection is input to the retrieval formula assembling means 101. As a result, the retrieval formula assembling means 101 determines up to “Sat +”.
[0147]
Next, the user inputs “A *” as another element from the input means 121. Similarly to the above, this “a” is first input to the part 1 search means 102 and the corresponding radical is searched. Here, since the radical corresponding to “A” does not exist in the part 1 file 111, this is input from the part 1 retrieval unit 102 to the retrieval type assembly unit 101.
[0148]
When it is input that the corresponding radical does not exist in this way, the retrieval formula assembling unit 101 next inputs “A” to the component 2 retrieval unit 103. On the other hand, the part 2 search means 103 searches the part 2 file 112 for a part corresponding to “A”. However, it does not exist in the part 2 file 112.
[0149]
Next, the part 3 file 113 is searched. Here, since the common kanji character “A” corresponding to “A” and the allowable Chinese character “亞” exist in the part 3 file 113, the part 3 search means 104 searches for “A” and “亞”. Therefore, the retrieval formula assembling unit 101 displays “A, 亞” retrieved by the part 3 retrieving unit 104 on the display unit 122. On the other hand, the user uses the input means 121 to select “亜” from the displayed “A, １２１”. This selection is input to the retrieval formula assembling means 101. As a result, the retrieval formula assembling means 101 determines up to “Sat + 亞 *”.
[0150]
Here, since “*” is an arithmetic expression for executing the search, the search expression assembling means 101 inputs the determined search expression “Sat + 亞 *” to the kanji search means 105.
[0151]
The kanji search means 105 searches the kanji information file 114 based on the elements “Sat” and “亞” in the inputted “Sat + 亞 *” and specifies the corresponding Kanji. Here, since “堊” exists in the Chinese character information file 114, the Chinese character search unit 105 searches for “堊”. Therefore, the kanji search means 105 presents “堊” to the user via the display means 122. On the other hand, the user selects the displayed “堊” using the input means 121. The selected “堊” is input to the target application.
[0152]
Here, when displaying the detailed information regarding “堊” displayed on the display unit 122, the user uses the input unit 121 or other input means such as a mouse to display the detailed information display screen (FIG. 7) regarding “堊”. Enter the command to be displayed. This command is input to the detailed information search means 106, and the detailed information is specified from the part 3 file 114. The detailed information search means 106 creates a detailed information display screen related to “堊” based on the specified detailed information, and presents this to the user via the display means 122.
[0153]
Further, when displaying the variant-related diagram related to “堊”, the user uses the input unit 121 or other input means such as a mouse to issue a command for displaying the variant-related diagram display screen (FIG. 8) related to “堊”. input. This command is input to the related character diagram creating means 107, and each related character (simplified characters, traditional characters, passing characters, variant characters (including abbreviations, old characters, folk characters, etc.) etc. from the part 3 file 114; Basic) is specified. The related character diagram creating unit 107 creates a variant character related diagram display screen related to “堊” based on each identified related character, and presents this to the user via the display unit 122.
[0154]
..When searching for “滬”
Further, in the present embodiment, when searching for “滬” shown in (Expression 2), the user first inputs “Sansui +” using the input means 121 to search for a radical. This “Sansui +” is input to the Chinese character search device 100 from the input means 121.
[0155]
The kanji search device 100 inputs the input “Sansui +” to the search expression assembly means 101. The retrieval formula assembling means 101 first inputs “Sansui” to the part 1 retrieval means 102. Here, the radical corresponding to “Sansui” “Water (
[0156]
[Outside 2]

) ”Exists in the radical file 111, the component 1 search means 102 selects“ water (
[0157]
[Outside 3]

) "Is searched. Therefore, the retrieval formula assembling means 101 uses the “water (
[0158]
[Outside 4]

) ”Is displayed on the display means 122. In response to this, the user displays the displayed “water (
[0159]
[Outside 5]

) ”Is selected using the input means 121. This selection is input to the retrieval formula assembling means 101. As a result, the retrieval formula assembling means 101 determines up to “water +”.
[0160]
Next, the user inputs “and +” as other elements from the input means 121. Similarly to the above, this “to” is first input to the part 1 search means 102 and the corresponding radical is searched. Here, since the radicals “door”, “to”, “ten”, “soil”,... Corresponding to “to” exist in the part 1 file 111, these are searched by the part 1 search means 102. Therefore, the retrieval formula assembling unit 101 displays “door”, “to”, “ten”, “soil”,... Retrieved by the component 1 retrieval unit 102 on the display unit 122. On the other hand, the user uses the input means 121 to select a desired “door” from the displayed radical list. This selection is input to the retrieval formula assembling means 101. As a result, the retrieval formula assembling means 101 determines up to “water + door +”.
[0161]
Further, the user inputs “unevenness *” as another element from the input means 121. Similarly to the above, this “unevenness” is first input to the part 1 search means 102 and the corresponding radical is searched. Here, if the radical corresponding to “unevenness” does not exist in the part 1 file 111, the process proceeds to the next step.
[0162]
When it is input that the corresponding radical does not exist in this way, the retrieval formula assembling unit 101 next inputs “unevenness” to the component 2 retrieval unit 103. Here, since the part corresponding to “unevenness” does not exist in the part 2 file 112, this is input from the part 2 search unit 103 to the search-type assembly unit 101.
[0163]
Therefore, the retrieval formula assembling means 101 next inputs “unevenness” to the part 3 retrieving means 104. Here, the common kanji characters “mura”, “邑 (personal kanji)”, “group”, “屯”,... Corresponding to “mura” exist in the part 3 file 113, so ”,“ 邑 ”,“ group ”,“ 屯 ”,... Therefore, the retrieval formula assembling unit 101 displays “village, 邑, group, 屯,...” Retrieved by the part 3 retrieval unit 104 on the display unit 122. On the other hand, the user selects “邑” from the displayed “village, 邑, group, 屯,...” Using the input means 121 (actually, since the 邑 is a radical, the radical file 111 Present). This selection is input to the retrieval formula assembling means 101. As a result, the retrieval formula assembling means 101 “water (
[0164]
[Outside 6]

) + Door + 邑 * ”is determined.
[0165]
Thereafter, the retrieval formula assembling means 101 recognizes “*” and determines the retrieved retrieval formula “water (
[0166]
[Outside 7]

) + Door + 邑 * "is input to the kanji search means 105. In response to this, the kanji search means 105 searches for the corresponding kanji “滬”, identifies the corresponding kanji, and presents it to the user via the display means 122. On the other hand, the user selects the displayed “滬” using the input unit 121 and inputs “滬” to the target application.
[0167]
Similarly, it is also possible to display detailed information related to “滬” and a variant-related diagram.
[0168]
..When searching for “鐚”
Further, in the present embodiment, when searching for “鐚” shown in (Equation 3), the user first inputs “kin +” using the input means 121 to search for a radical. For “kin +”, since the corresponding radical “gold” is stored in the part 1 file 111, “gold” is selected in the same manner as described above, and the retrieval type assembling means 101 up to “gold +”. Is determined.
[0169]
Next, in order to input “惡” in the search formula, the user inputs “Aku +” using the input unit 121. Here, “惡” is not stored in any of the part 1 file 111, the part 2 file 112, and the part 3 file 113, but “bad” (actually, acceptable character font in the part 3 file 113 as a similar element. Therefore, it is stored in the part 3 file 113). Therefore, the user selects “Evil” from the list displayed on the display unit 122. As a result, the retrieval formula assembling means 101 determines “gold + evil *” and inputs it to the kanji retrieval means 105.
[0170]
The kanji search means 105 searches the kanji information file 114 for the kanji corresponding to “gold + bad *”, but there is no kanji that completely matches “gold + bad *”. Therefore, in this embodiment, similar (related) elements such as “evil” and “惡” are both stored as elements in the kanji information file 114. Therefore, the kanji search means 105 can specify even kanji composed of similar elements. As a result, the user can input “bad” instead of “惡”, and can input a search expression more easily.
[0171]
Similarly, it is also possible to display detailed information related to “鐚” and a variant-related diagram.
[0172]
..When searching for “谺”
Further, in the present embodiment, when searching for “谺” shown in (Equation 4), when inputting in the same procedure as described above, the user first uses the input means 121 to search for a radical. "+" Is input, and after "valley +" is determined, "Kiba *" is input to determine the search expression "valley + fang *".
[0173]
However, in this embodiment, since the search is possible without inputting the radical at the head, the user may first input “Kiba +” in this example. In this case, the retrieval formula determined by the retrieval formula assembling means 101 is “tusk + valley *”.
[0174]
The search formula assembling means 101 inputs this search formula “tusk + valley *” to the kanji search means 105 as it is. On the other hand, the kanji search means 105 searches for the corresponding kanji based on “tusk + valley”. In this embodiment, the kanji information file 114 is not configured to distinguish and manage radicals and other elements (parts or common kanji). For this reason, the kanji search means 105 can search for the target kanji even when the radical and other elements are not input in order.
[0175]
Similarly, it is also possible to display detailed information related to “谺” and a variant-related diagram.
[0176]
In this way, in this embodiment, since the kanji is divided into, for example, a maximum of four readable elements (radicals, parts, common kanji, etc.), the user can easily input a search expression. Further, at this time, since the search key for searching for the target kanji can be input using only the input means such as a keyboard, the user can easily perform the work.
[0177]
In addition, since it is recommended that the order of elements input by the user be the radical first, and then input parts or common kanji in order of strokes, it is possible to reduce the processing amount in the kanji search device 100. It becomes possible to quickly identify the target kanji. However, in the present embodiment, in the element item of the Chinese character information file 114, the radical is positioned first in the data series, and thereafter, the elements are arranged according to the stroke order. The kanji search means 105 searches the kanji information file 114 in the order of the data series.
[0178]
Furthermore, when each element is specified, a search formula can be determined by performing only the minimum necessary element search by executing a search in the order of the radical file 111, the part file 112, and the regular kanji file 113. It becomes possible.
[0179]
Furthermore, in this embodiment, it is possible to easily provide the user with detailed information and related character information regarding the searched Chinese characters.
[0180]
・ Summary of the first embodiment
In addition, the present embodiment configured as described above can be used for the following applications, for example, so that the effects of the present embodiment are further exhibited.
(1) Entering difficult characters in the paper description in the field of Kanji input
(2) Entering difficult characters or unreadable kanji characters when entering a manuscript with the key puncher
(3) Input of handwritten characters and difficult characters when creating a database of kanji literature
(4) Correction input of characters that cannot be read by OCR (automatic reading device)
As described above, the kanji search device 100 according to the present embodiment is particularly effectively used when inputting difficult characters in reading or kanji characters that are not or cannot be read, and can be quickly combined with OCR or the like. It is possible to realize a simple input.
[Second Embodiment]
In the first embodiment, a high effect is exerted mainly when inputting kanji characters that do not have or are not understood. In this configuration, a case in which the input of kanji characters that are difficult characters but have phonetic readings is executed more easily and quickly will be described in detail as a second embodiment with reference to the drawings.
[0181]
In order to realize this, in the present embodiment, the kanji registered in Unicode is classified into several, and the search is performed in order for each classification. Thereby, it becomes possible to specify the kanji desired by the user more quickly.
[0182]
That is, in the present embodiment, the kanji is classified into, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and based on the reading of the kanji input from the user, the first level, the second Search in order of level, auxiliary kanji, and other kanji. As a result, it is possible to specify from more general Chinese characters, and it is possible to omit a search process for unnecessary Chinese characters.
[0183]
Furthermore, since this embodiment also has the function of the Chinese character search apparatus 100 according to the first embodiment, it is possible to execute a search for all Chinese characters.
[0184]
FIG. 11 shows a block diagram of a Chinese character search apparatus 200 according to this embodiment. Referring to FIG. 11, in the Chinese character search device 200, the Chinese character search unit 105 is replaced with the Chinese character search unit 205 as compared with the Chinese character search device 100 shown in FIG. 2. The kanji search unit 205 directly searches the character code file 210 for kanji corresponding to the reading input from the input unit 121. However, the character code file 210 is a normal character code file, and manages the code number, reading, and font data for each character in association with each other. Here, the character code is a unicode, but this may be a JIS coat, an S-JIS code, an EUC, a block code, or the like. Furthermore, the font data may be an outline font or a bitmap font.
[0185]
Next, the operation of this embodiment using the above-described kanji search device 200 will be described in detail with reference to the drawings. FIG. 12 is a flowchart for explaining the operation of the Chinese character search apparatus 200 in this embodiment.
[0186]
Referring to FIG. 12, in this embodiment, first, the user inputs a desired kanji reading using the input means 121 (step S201). The kanji reading input in this way is input to the kanji search means 205 in the kanji search device 200, and the corresponding kanji is specified from the character code file 210. At this time, the kanji search means 205 first searches the character code file 210 for the kanji group registered as the first level of JIS kanji, and specifies the corresponding kanji (step S202). However, it is managed in a file (not shown), the kanji information file 114, or the character code file 210 which class (first level, second level, auxiliary kanji, and other kanji groups in JIS kanji) belongs to each kanji. It shall be.
[0187]
As a result of this search, when the corresponding kanji is specified (Yes in step S203), the kanji search device 200 proceeds to step S115 in FIG. 10 and displays the specified kanji on the display unit 122 as a list. On the other hand, when the corresponding kanji is not specified as a result of the search in step S202 (No in step S203), the kanji search means 205 next targets the kanji group registered as the second level of JIS kanji. The character code file 210 is searched and the corresponding kanji is specified (step S204).
[0188]
As a result of this search, when the corresponding kanji is specified (Yes in step S205), the kanji search device 200 proceeds to step S115 in FIG. 10 as described above. On the other hand, if the corresponding kanji character does not exist as a result of the search in step S204 (No in step S205), the kanji search means 205 then selects the character code file for the kanji group registered as the JIS auxiliary kanji character. 210 is searched and the corresponding kanji is specified (step S206).
[0189]
As a result of this search, when the corresponding kanji is specified (Yes in step S207), the kanji search device 200 proceeds to step S115 in FIG. 10 as described above. On the other hand, if the corresponding kanji does not exist as a result of the search in step S206 (No in step S207), the kanji search means 205 searches for the remaining kanji groups registered in the character code file 210. Is executed (step S208).
[0190]
As a result of this search, when the corresponding kanji is specified (Yes in step S209), the kanji search device 200 proceeds to step S115 in FIG. 10 as described above. On the other hand, if the corresponding kanji does not exist as a result of the search in step S208 (No in step S209), the kanji search means 205 presents this to the user via the display means 122 (step S210). Then, the process proceeds to step S101 in FIG. Thereafter, the search is executed by the method described in the first embodiment.
[0191]
By configuring as described above, in this embodiment, it is possible to provide an environment for easily searching for all kanji characters including unread kanji characters as well as an environment for quickly and easily searching for difficult characters that can be read. It becomes.
[Third embodiment]
In the first embodiment described above, a configuration for further reducing the amount of processing required for Kanji search will be described in detail as a third embodiment with reference to the drawings.
[0192]
In this embodiment, when inputting a radical, the position of the radical in the target character is designated. As a result, in this embodiment, it becomes possible to greatly narrow down the search target kanji.
[0193]
FIG. 13 shows the types of radical positions defined in the present embodiment, and the radicals are located in the shaded area in the figure. However, in (Category 7) and (Category 9), it is assumed that the radical is located in any of the divided areas.
[0194]
Referring to FIG. 13, in this embodiment, the position of the radical (hereinafter referred to as the radical position) is (class 0) overall, (class 1) bias, (class 2) 旁, (class 3) crown / Head / lid, (Category 4) foot, (Category 5) Sagging / Now / Kamae, (Category 6), (Category 7) 1/4, (Category 8) Longitudinal crack / Transverse crack, (Category 9) 1/9, in addition, (Class A) Opposite part of Class 5, (Category B) Opposite part of Class 6, (Category C) Opposite part of Class 8, and (Category D) radical Or it is divided into a total of 16 types: a plurality of arrangements on the left and right, (Category E) superimposing radicals and parts, (Category F) arranging radicals and parts symmetrically . However, radicals are arranged in chestnut-painted portions in the figure.
[0195]
In this type of division, there are five types in the “positions” of the categories 5 to 6, the category 5 includes “Shikigae”, etc., and the category 6 includes “Engae”, “Ukebako”, “ "Hakogae", "Kunigae", etc. belong to this category. In addition, “1/4” of classification 7 indicates that the radical belongs to any position obtained by dividing the Chinese character into 2 × 2 in the vertical and horizontal directions. Indicates that the radical belongs to any position obtained by dividing the head into 3 × 3. In addition, “Vertical cracks” of category 8 belong to “Igego” and so on, and “Horizontal cracks” of category 8 also belong to “Kagoromo” and the like. In addition, a “kanji” that forms one character with one radical belongs to “all” of category 0.
[0196]
Further, in this embodiment, in order to designate the radical position as shown in FIG. 13 by the input means 121 composed of a keyboard, the radical position is assigned to a predetermined key on the keyboard as illustrated in FIG. That is, in this embodiment, for example, when “1” is input from the keyboard, the Chinese character search apparatus 300 recognizes that the radical is “bias”.
[0197]
However, in the example shown in FIG. 14, a plurality of radical positions are associated with one key. In this case, the search may be executed without distinguishing the radical positions assigned to the same key. For example, when “Nyo” of classification 5 is designated, 5 is input twice. You may comprise.
[0198]
Hereinafter, the configuration of the Chinese character search apparatus 300 according to the present embodiment will be described with reference to the block diagram of FIG. Referring to FIG. 15, compared to the Chinese character search device 100 shown in FIG. 2, the Chinese character search device 300 includes a Chinese character search unit 105 as a Chinese character search unit 305, and a Chinese character information file 114 as a Chinese character information file 314. Has been replaced.
[0199]
Here, the data structure of the kanji information file 314 is shown in FIG. Referring to FIG. 16, the kanji information file 314 stores information indicating the position of the radical (the radical position) in addition to the data structure similar to that of the first embodiment.
[0200]
Hereinafter, the operation of the Chinese character search apparatus 300 configured as described above will be described in detail with reference to the drawings.
[0201]
Referring to FIG. 17, in this embodiment, first, the user designates the position of the radical using the input means 121 (step S301). This is realized by inputting a number from the input unit 121 including a keyboard shown in FIG.
[0202]
When the designation of the radical position is input in this way, the kanji search device 300 proceeds to step S101 in FIG. 10 and executes the subsequent operations.
[0203]
If it is determined in step S111 in FIG. 10 that the arithmetic symbol last input in step S101 is “*” (Yes in step S111), the kanji search unit 305 first sets the part input in step S301. A kanji group corresponding to the neck position is specified from the kanji information file 314 (step S302).
[0204]
Thereafter, based on the arithmetic expression determined in the operations up to step S111 in FIG. 10, the kanji group specified in step S302 is searched to identify the corresponding kanji (step S303), and the process proceeds to step S113 in FIG.
[0205]
By operating as described above, in this embodiment, the number of kanji to be searched by the kanji search device 300 can be greatly reduced at the initial stage of search processing, and a desired kanji can be searched quickly. It becomes possible to do.
[Fourth embodiment]
Further, in the second embodiment described above, it is possible to provide an easy-to-use document creation apparatus 300 by providing an electronic dictionary storing technical terms, idioms, etc. according to the purpose.
[0206]
For example, an electronic dictionary (hereinafter referred to as a term input dictionary) in which technical terms and idioms made up of difficult characters included in special books such as Buddhist books and classics are registered is provided in the kanji search device 200 in FIG. . Thereby, it becomes possible to input the specialized document as described above easily and quickly.
[0207]
Hereinafter, the document creation apparatus 400 configured as described above will be described in detail with reference to the drawings.
[0208]
FIG. 18 is a block diagram illustrating a configuration of the document creation device 400. Referring to FIG. 18, in the document creation device 400, the Chinese character search unit 205 is replaced with a term search unit 405 compared to the Chinese character search device 200 shown in FIG. 11. Further, the document creation device 400 is newly provided with a term input dictionary file 420.
[0209]
The term input dictionary file 420 stores the above technical terms, idioms, etc. (hereinafter simply referred to as terms), information such as readings, parts of speech, and meanings. However, the term is stored as an enumeration of the code numbers (for example, Unicode) of the kanji that compose this term.
[0210]
Hereinafter, the operation of the document creation apparatus 400 configured as described above will be described in detail with reference to the drawings.
[0211]
FIG. 19 is a flowchart showing a flow when a document is created using the document creation device 400.
[0212]
Referring to FIG. 19, in this embodiment, first, the user inputs a term reading using the input means 121 (step S401). When the reading of the desired term is input in this way, the document creation device 400 searches the term input dictionary file 420 for the corresponding term in the term search unit 405 (step S402).
[0213]
If there is no corresponding radical as a result of the search (No in step S403), the term search unit 405 notifies the user of this via the display unit 122 (step S404), and the process returns to step S201 in FIG. The operation according to the second embodiment is executed.
[0214]
On the other hand, if the corresponding term is searched as a result of the search in step S102 (Yes in step S403), the term search unit 405 displays a list of the terms from the display unit 122 to the user (step S405). A desired kanji is selected using the input means 121. However, at this time, the screen for displaying the list may have the same configuration as the kanji search result list display screen shown in FIG.
[0215]
Thereafter, the term search unit 405 determines whether detailed information regarding the selected term is requested (step S407), or whether the selected term is requested to be input to a predetermined application (step S410). However, the detailed information is information such as the part of speech and meaning of terms.
[0216]
Here, when the detailed information on the selected term is requested (Yes in step S407), the term search unit 405 specifies the detailed information on the term selected from the term input dictionary file 420 (step S408). Is presented to the user via the display means 122 (step S409).
[0217]
By operating as described above, the user can not only search for and input a desired term using the input unit 121 such as a keyboard, but can also browse detailed information regarding the searched term.
[Fifth embodiment]
Further, in each of the above embodiments, a configuration has been described in which a desired kanji is retrieved by inputting readings of elements (radicals, parts, etc.), but in this embodiment, parts such as radicals of kanji are used. Even when the reading is not understood, a case in which a desired kanji is searched more accurately and quickly will be described in detail with reference to the drawings.
[0218]
As described above, the commonality over the entire kanji is summarized in two points: that all kanji have radicals (parts) and that they have the number of strokes.
[0219]
In each of the above-described embodiments, first, the configuration of the radical (part), which is one of the commonality, is focused on. On the other hand, this embodiment makes it possible to search for kanji in the same manner even when the radical (part) cannot be read. Therefore, the effect of the present embodiment is useful for learning kanji that cannot be read (elements belong to kanji if the elements are broadly classified) as well as being able to search for a desired kanji reliably and quickly as in the above embodiments. It is.
[0220]
In order to realize this, in this embodiment, by using the number of strokes in addition to reading, kanji including elements that cannot be read can be quickly searched from the keyboard, and the target kanji can be quickly settled. However, in the search using the number of strokes in the present embodiment, only this configuration may be operated alone, or the search method according to each of the above embodiments may be mixed and operated.
[0221]
FIG. 20 shows a configuration example of the Chinese character search apparatus 500 according to this embodiment. However, the kanji search device 500 is a configuration example when the configuration according to the present embodiment is applied to the first embodiment.
[0222]
In this configuration, the part 1 search unit 502, the part 2 search unit 503, and the part 3 search unit 504 execute not only reading of each element (radical, part, common kanji) but also search based on the number of strokes of each element. That is, in this embodiment, as will be described in the following description of the operation, the component 1 search means 502, the component 2 search means 503, and the component 3 search means 504 are based on the number of strokes for the elements for which the stroke number is input instead of reading. The component 1 file 511, the component 2 file 512, and the component 3 file 513 are searched.
[0223]
In addition, the part 1 file 511, the part 2 file 512, and the part 3 file 513 according to the present embodiment also store the number of strokes of each element (radical, part, common kanji) in addition to the items in the above embodiments. .
[0224]
Similarly, in the present embodiment, the identified elements are output to the display unit 122 and displayed as a list for the user. On the other hand, the user selects and inputs a desired element from the listed elements using the input means 121, and completes the search expression.
[0225]
Next, the operation according to the present embodiment will be described in more detail.
[0226]
In the present embodiment, an element that cannot be read (a radical or a part or a common Chinese character) is input as “?”, And then the number of strokes is input. That is, for example, when inputting the element “隹”, the user inputs “? 8+”.
[0227]
Thus, when “?” Is input, the retrieval formula assembling means 101 first inputs the arithmetic number (“8” in the above example) input next to “?” To the part 1 search means 501. To do. In response to this, the component 1 search unit 501 searches the component 1 file 511 for the corresponding stroke number element (radical) and outputs it to the display unit 122 for list display. The user selects and inputs a desired element from the displayed search result list using the input unit 121.
[0228]
If the corresponding radical does not exist in the part 1 file 511, the retrieval formula assembling unit 101 sequentially inputs the input stroke number to the part 2 retrieving unit 503 and the part 3 retrieving unit 504 in the same manner as described above. Or, specify the corresponding element from the common kanji. However, this operation is completed when a desired element is selected and input by the user, and the process proceeds to the next operation.
[0229]
Further, the elements searched and selected and input based on the number of strokes in this way are input to the kanji search means 105 as in the first embodiment. Similarly to the first embodiment, the kanji search unit 105 establishes a search formula based on the input elements and searches the kanji information file 114 for the corresponding kanji.
[0230]
Therefore, in this embodiment configured as described above, for example, when searching for “雖”, the user may input “Kuchi + Mushi +? 8 *”. On the other hand, the Kanji search apparatus 500 searches for “? 8” with “Kin, Cho, Mon, Fu, 隶, 隹, rain, blue, non, 隹. indicate. Therefore, the user uses the input unit 121 to select “結果” from the displayed search results. As a result, the search for the number of strokes by “?” Is completed, and the final search expression “mouth + insect + 隹 *” is formed.
[0231]
However, in the present invention, it is possible to search for a desired Chinese character without inputting a non-readable part as “?” As in this embodiment. In other words, it is possible to search for “雖” with two elements “Kuchi + Mushi *”. As described above, in the present invention, a desired kanji can be quickly obtained even if a search expression is created only by ignoring radicals / parts that cannot be read.
[0232]
For example, when searching for any Chinese character including radical “Thu + Mouth”, there are 993 Kanji characters with radical “Thu” in Unicode. Therefore, if a search is executed using only “Thu”, 993 characters are searched.
[0233]
Therefore, there are 93 characters in “Thu + Mouth”. Among them, two mouths are 20 letters, three mouths are 7 letters, four mouths are 1 letters, and one mouth is 65 letters. Moreover, among the parts that contain a single-mouthed character, the familiar character is “Oro, old, dai, samurai, issue, kan, phrase, boss, summon, acceptable, brother, nyo, no, present, you. , Advertise, inc., Candy, beans, bureau, kyo, i, life, ho, hu, bower, affliction, yong, party, good, nobo, holy, esteem, jealousy, etc., for a total of 34 characters.
[0234]
In addition, there are 28 characters with two mouths. That is, 62 characters out of 93 characters are occupied. The rest is 31 characters. Among these 31 characters, for example, there are only 3 characters such as “+ (crown)”.
[0235]
On the other hand, the present embodiment is particularly effective when the number of elements that can be read cannot be limited to an effective number as in the above example.
[0236]
As described above, the present embodiment is effective for setting a desired kanji regardless of a search only by reading or a search using both strokes.
[Sixth embodiment]
In each of the above embodiments, the input unit 121 is a keyboard. However, for example, a voice input unit may be included. Thereby, the user-friendly kanji search device can be provided.
[0237]
That is, in the Chinese character search device according to the present embodiment, the reading of the elements recognized by the input means, the arithmetic symbols, the question marks, the number of strokes, etc. are input to the search formula assembling means 101 (see FIG. 2), and the search is performed based on this. The expression assembly means 101 assembles the search expression. The operation at this time is the same as that in each of the embodiments described above.
[0238]
Further, in order to realize the speech input type kanji search device according to the present embodiment, the computer on which the kanji input device according to the present embodiment is implemented is provided with a microphone and an application for speech recognition. .
[0239]
[Other Examples]
Each of the above-described embodiments is merely an example of a preferred embodiment of the present invention, and the present invention can be implemented with various modifications without departing from the gist thereof.
[0240]
【The invention's effect】
As described above, according to the first aspect of the present invention, it is possible to provide an environment in which a desired Chinese character can be specified quickly and easily.
[0241]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0242]
Furthermore, according to the second aspect of the invention, by providing a configuration for designating the radical position and the number of strokes in the search key, it is possible to cope with an unknown reading of an element such as a radical. Therefore, it is possible to significantly reduce the amount of data processing required to identify the desired Chinese character more quickly and accurately.
[0243]
Further, according to the invention described in claim 3, since the Chinese character search is partially executed as required based on the input reading of the Chinese character, the desired Chinese character can be specified quickly and easily. An environment can be provided.
[0244]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0245]
Furthermore, according to the invention of claim 4, since the user can easily know detailed information about the searched kanji, not only provides an environment for easily and quickly searching for kanji, It is also possible to provide an environment for confirming searched kanji and an environment for learning detailed information about kanji.
[0246]
Further, according to the invention described in claim 5, since the user can easily know related characters such as variants of the searched Chinese characters, only an environment for easily and quickly searching for Chinese characters is provided. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0247]
Furthermore, according to the sixth aspect of the present invention, it is possible to provide a kanji search device that is easier to input.
[0248]
According to the seventh aspect of the present invention, it is possible to provide an environment in which a desired Chinese character can be specified quickly and easily.
[0249]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0250]
Furthermore, according to the eighth aspect of the present invention, it is possible to deal with a situation in which the radical reading and the number of strokes are not specified by providing a configuration for designating the radical position and the number of strokes in the search key.
[0251]
Further, according to the ninth aspect of the present invention, a desired Chinese character can be specified quickly and easily because a partial Chinese character search is executed as necessary based on the input Chinese character reading. An environment can be provided.
[0252]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0253]
Furthermore, according to the invention described in claim 10, since it becomes possible for the user to easily obtain detailed information about the searched kanji, not only provides an environment for easily and quickly searching for kanji, It is also possible to provide an environment for confirming searched kanji and an environment for learning detailed information about kanji.
[0254]
Furthermore, according to the eleventh aspect of the present invention, the user can easily know related characters such as variants of the searched kanji characters, so that only an environment for easily and quickly searching for kanji characters is provided. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0255]
Furthermore, according to the twelfth aspect of the invention, it is possible to provide a kanji search method that is easier to input.
[0256]
Further, according to the invention described in claim 13, it is possible to provide an environment in which a desired Chinese character can be specified quickly and easily.
[0257]
That is, according to the present invention, it is possible for the user to input a search key for searching for a desired kanji using an input means such as a keyboard, and the labor required for the user can be reduced. Furthermore, according to the present invention, the elements obtained by dividing the kanji are generally read and written characters, so that kanji and difficult characters that are not read or cannot be understood without requiring specialized knowledge. It becomes possible to input easily and quickly.
[0258]
According to the fourteenth aspect of the present invention, it is possible to specify a desired Chinese character more quickly and accurately by providing a configuration for specifying the radical position and the number of strokes in the search key.
[0259]
According to the fifteenth aspect of the present invention, a desired Chinese character can be specified quickly and easily because a partial Chinese character search is executed as necessary based on the input Chinese character reading. An environment can be provided.
[0260]
Furthermore, in the present invention, the set is, for example, the first level, the second level, the auxiliary kanji, and other kanji in JIS kanji, and by performing the search in this order, it can be specified from general kanji. It becomes possible to quickly specify the desired kanji.
[0261]
Furthermore, according to the invention described in claim 16, since the user can easily know detailed information about the searched kanji, not only provides an environment for easily and quickly searching for kanji, It is also possible to provide an environment for confirming searched kanji and an environment for learning detailed information about kanji.
[0262]
Furthermore, according to the invention described in claim 17, since the user can easily know the related characters such as variants of the searched Chinese characters, only an environment for easily and quickly searching for the Chinese characters is provided. In addition, it is possible to provide an environment for confirming searched kanji and an environment for learning kanji-related characters.
[0263]
Furthermore, according to the invention described in claim 18, it is possible to provide a program that realizes a kanji search device that makes input easier.
[0264]
According to the nineteenth aspect of the present invention, it is possible to execute this on any terminal using a recording medium on which the above programs are recorded.
[Brief description of the drawings]
FIG. 1 is a diagram for explaining four categories for classifying kanji in the present invention.
FIG. 2 is a block diagram showing a configuration of a Chinese character search apparatus 100 according to the first embodiment of the present invention.
3 is a table showing a data configuration of a part 1 file 111 in FIG. 2. FIG.
4 is a table showing a data configuration of a part 3 file 113 in FIG. 2. FIG.
5 is a table showing the data structure of the kanji information file 114 in FIG. 2. FIG.
FIG. 6 is a diagram showing an example of a kanji search result list display screen according to the first embodiment of the present invention.
FIG. 7 is a diagram showing an example of a detailed information display screen according to the first embodiment of the present invention.
8A is a diagram showing an example of a variant character related diagram display screen according to the first embodiment of the present invention, and FIG. 8B is a table showing the data structure of the kanji related file 115 in FIG. is there.
FIG. 9 is a block diagram showing a configuration of a device in which the Chinese character search device 100 according to the first embodiment of the present invention is realized.
FIG. 10 is a flowchart showing the flow of a kanji search operation according to the first embodiment of the present invention.
FIG. 11 is a block diagram showing a configuration of a Chinese character search apparatus 200 according to a second embodiment of the present invention.
FIG. 12 is a flowchart showing the flow of a kanji search operation according to the second embodiment of the present invention.
FIG. 13 is a diagram for explaining a radical position defined in a third embodiment of the present invention.
FIG. 14 is a diagram for explaining assignment of radical positions and keys on a keyboard defined in a third embodiment of the present invention.
FIG. 15 is a block diagram showing a configuration of a Chinese character search apparatus 300 according to a third embodiment of the present invention.
16 is a table showing the data structure of the kanji information file 314 in FIG. 15. FIG.
FIG. 17 is a flowchart showing the flow of a kanji search operation according to the third embodiment of the present invention.
FIG. 18 is a block diagram showing a configuration of a document creation apparatus 400 according to a fourth embodiment of the present invention.
FIG. 19 is a flowchart showing the flow of a kanji input operation according to the fourth embodiment of the present invention.
FIG. 20 is a block diagram showing a configuration of a Chinese character search apparatus 500 according to a fifth embodiment of the present invention.
[Explanation of symbols]
11 CPU
12 RAM
13 ROM
14 Display device
15 Input device
16 Storage device
17 Network interface
18 Bus
100, 200, 300, 500 Kanji search device
101 Search type assembly means
102, 502 Part 1 retrieval means
103, 503 Part 2 retrieval means
104, 504 Part 3 retrieval means
105, 205, 305 Kanji search means
106 Detailed information retrieval means
107 Means for creating variant-related figures
111,511 parts 1 file
112, 512 parts 2 file
113, 513 parts 3 files
114, 314 Kanji information file
115 Kanji related files
121 Input means
122 Display means
210 Character code file
400 Document creation device
405 Term search means
420 Term input dictionary file

Claims (13)

Kanji management means for managing kanji registered in a predetermined character code and elements and / or strokes obtained by dividing the kanji into characters with readings; and the elements and the readings and / or strokes of the elements. Element management means for managing, element search means for searching for elements corresponding to reading and / or number of strokes from the element management means, and kanji for searching for kanji including elements searched by the element search means from the kanji management means In a kanji search device having search means and search result display means for displaying kanji searched by the kanji search means,
The element includes a radical, and the kanji managing means manages the position of the radical in the kanji and designates the radical position and the radical position, and the designated radical position. A designated radical position kanji specifying means for specifying a corresponding kanji from the kanji management means, and the kanji search means executes a search for the kanji specified by the designated radical position kanji specifying means. Kanji search device characterized by that. For each kanji, detailed information management means for managing detailed information including at least one of reading, total stroke number, at least one type of character shape and related characters, and the detailed information of the kanji searched by the kanji search means 2. The kanji search apparatus according to claim 1, further comprising: detailed information specifying means for specifying; and detailed information display means for displaying the detailed information specified by the detailed information specifying means. Related character management means for managing related characters, related character specifying means for specifying related characters of the kanji searched by the kanji search means from the related character management means, kanji searched by the kanji search means and the related A system diagram creating means for creating a system diagram showing the relationship between the kanji and the related characters based on the related characters identified by the character identifying means, and a system for displaying the system diagram created by the system diagram creating means The kanji search device according to claim 1, further comprising a figure display unit. The kanji search device according to any one of claims 1 to 3, further comprising voice recognition means for recognizing voice, wherein the reading of the element and / or the number of strokes are input from the voice recognition means. . A kanji search method for searching kanji based on an element obtained by reading and / or dividing kanji registered in a predetermined character code into characters with strokes, and corresponding to the input readings and / or strokes An element search step for searching for an element from an element management means for managing the element and the reading and / or number of strokes of the element, and an element selection for causing the user to select the element searched in the element search step on the display means A kanji search step for searching a kanji including the element selected in the element selection step from a kanji management means for managing kanji and elements constituting the kanji, and the kanji searched in the kanji search step A kanji search result display step for displaying a kanji search method,
  The element includes a radical, and the kanji managing means manages the position of the radical in the kanji and designates the radical and radical positions, and the designated radical position. A designated radical position kanji identifying step for identifying a corresponding kanji character from the kanji management means, wherein the kanji search step executes a search for the kanji character identified in the designated radical position kanji identifying step. Kanji search method characterized by that. From the detailed information management means for managing the kanji and the detailed information, the kanji searched in the kanji search step includes detailed information including at least one of the reading, the total number of strokes, one or more types of character shapes, and related characters 6. The kanji search method according to claim 5, further comprising: a detailed information specifying step for specifying, and a detailed information displaying step for displaying the detailed information specified in the detailed information specifying step.   A related character specifying step of specifying related characters of the kanji searched in the kanji search step from related character management means for managing related characters of a predetermined kanji, and a kanji searched in the kanji search step and the related character specifying A system diagram creation step for creating a system diagram showing the relationship between the kanji and the related characters based on the related characters identified in the step, and a system diagram display for displaying the system diagram created in the system diagram creation step The kanji search method according to claim 5, further comprising: a step. 8. A speech recognition step for recognizing speech, wherein the reading of the element and / or the number of strokes are the number of readings and / or the number of strokes recognized in the speech recognition step. The kanji search device according to item. Kanji management means for managing kanji registered in a predetermined character code and elements obtained by reading and / or dividing the kanji into characters having a stroke number; and the elements and the reading of the element and / or the stroke number An element management means for managing a computer having the element management means, and an element search process for searching for an element corresponding to the reading and / or number of strokes from the element management means, and the element search process In a program for causing the computer to execute a kanji search process for searching for kanji including elements from the kanji management means, and a search result display process for displaying kanji searched for in the kanji search process.
  14. The program according to claim 13, wherein the element includes a radical, and the kanji management means causes the computer to manage the position of the radical in the kanji, wherein the position of the radical and the radical is determined. A radical position specifying process to be specified and a specified radical position kanji specifying process for specifying a kanji corresponding to the specified radical position from the kanji management means are executed by the computer, and the kanji search process includes: A program for searching for a Chinese character specified in the designated radical position Chinese character specifying process. 11. The computer according to claim 9, further comprising: detailed information management means for managing detailed information including at least one of reading, total number of strokes, at least one type of character shape, and related characters for each Chinese character. The detailed information specifying process for specifying the detailed information of the kanji searched in the kanji search process and the detailed information display process for displaying the detailed information specified in the detailed information specifying process And a program for causing the computer to execute. 11. The program according to any one of claims 9 to 10, for causing the computer to have a related character management means for managing related characters, wherein the related characters of the kanji searched in the kanji search process are displayed. Based on the related character specifying process specified by the related character management means, the kanji searched by the kanji search process, and the related characters specified by the related character specifying process, the relationship between the kanji and the related characters is shown. A program for causing the computer to execute a system diagram creation document process for creating a system diagram and a system diagram display process for displaying the system diagram created by the system diagram creation process. 12. The program according to claim 9, wherein the computer executes speech recognition processing for recognizing speech, and the reading of the elements and / or the number of strokes are recognized by the speech recognition processing. A program characterized by being read and / or the number of strokes. A recording medium on which the program according to any one of claims 9 to 12 is recorded.

Images