Tokushima University / Educator and Researcher Directory --- Aoe, Jun-ichi

Personal Web Page

https://researchmap.jp/read0017420 (researchmap)

Field of Study

○	Affective Computing

Subject of Study

○	Information Retrieval System, Medical Information Processing, Man-Machine Interface (dialogue understanding, dictionary retrieval)

Book / Paper

Book:

1.	Masao Fuketa, Atlam EL-Sayed, Kazuhiro Morita and Jun-ichi Aoe : Information Extraction from the Internet - Chapter 2 Field-Association Knowledge and its Application, iConcept Press, Aug. 2011. (Summary) Humans can judge a field of a document by reading a few lines in the document, because words called field association terms exist in documents. In this book, the field association terms are defined and the method to collect them from documents on the Internet is explained. Moreover, an application to conduct a document classification, passage retrieval and such by field association terms is explained, and the effectiveness of field association terms is shown by experiments.
2.	Jun-ichi Aoe : 情報処理ハンドブック, Ohmsha, Ltd., Tokyo, Nov. 1995. (Summary) 本書は人工知能の応用分野であるエキスパートシステム，機械翻訳，画像処理，CAD/CAM,CAIに関する解説的な書物であり，3章のコンピュータによる自然言語処理において，解析と辞書構築技術を説明し，機械翻訳システムの構成方法を記述した．
3.	Jun-ichi Aoe : Computer Algorithms -String Pattern Matching Strategies-, IEEE Computer Society Press, Jun. 1994. (Summary) 本書は文書検索における文字列照合技術を先端手法を紹介したものであり，単一キーワード，複数キーワードの照合エンジン，曖昧検索技術，特徴ベクトルによる文書検索技術，ハードウェアによる高速化技術に分割して，記述されている．
4.	Jun-ichi Aoe : Computer Algorithms -Key Search Strategies-, IEEE Computer Society Press, Jun. 1991. (Summary) 本書は情報検索におけるキー検索技術の先端手法を紹介したものであり，ハッシュ法，探索木法，トライ法などの技術の特徴がまとめられ，約400件の文献に関する分類と概要もまとめられている．
5.	Jun-ichi Aoe : 情報科学ーパソコンと人工知能ー, KYORITSU SHUPPAN.CO.,LTD, Tokyo, Sep. 1988. (Summary) 本書は人工知能の応用分野であるエキスパートシステム，機械翻訳，画像処理，CAD/CAM,CAIに関する解説的な書物であり，3章のコンピュータによる自然言語処理において，解析と辞書構築技術を説明し，機械翻訳システムの構成方法を記述した．

Academic Paper (Judged Full Paper):

1.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A compression method of double-array structures using linear functions, Knowledge and Information Systems, Vol.48, No.1, 55-80, 2016. (Link to Publication Site) ● Publication site (DOI): 10.1007/s10115-015-0873-0 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1007/s10115-015-0873-0 (DOI: 10.1007/s10115-015-0873-0)
2.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita, Akio Tomotoshi and Jun-ichi Aoe : A new compression method for double-array structures by a hierarchical representation, International Journal of Intelligent Systems Technologies and Applications, Vol.14, No.3/4, 221-236, 2015. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJISTA.2015.074331 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84965079079 (DOI: 10.1504/IJISTA.2015.074331, Elsevier: Scopus)
3.	Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe and Kiyoshi Yasuda : Improved dialogue communication systems for individuals with dementia, International Journal of Computer Applications in Technology, Vol.52, No.2/3, 127-134, 2015. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2015.071973 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84942782541 (DOI: 10.1504/IJCAT.2015.071973, Elsevier: Scopus)
4.	Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Double array structures based on byte segmentation for n-gram, International Journal of Computer Applications in Technology, Vol.52, No.2/3, 110-116, 2015. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2015.071971 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84942785774 (DOI: 10.1504/IJCAT.2015.071971, Elsevier: Scopus)
5.	Ubul ABDUNABI, Hidekazu Kakei and Jun-ichi Aoe : Research on Document Summary Geneeration Using Attribute Information, International Journal of Computing and Technology, Vol.1, No.11, 557-569, 2014. (Keyword) blog document / field association / attributes grammar / sensibility
6.	Masao Fuketa, Hiroya Kitagawa, Takuki Ogawa, Kazuhiro Morita and Jun-ichi Aoe : Compression of double array structures for fixed length keywords, Information Processing & Management, Vol.50, No.5, 796-806, 2014. (Summary) A trie is one of the data structures for keyword matching. The double array representation combines retrieval speed of the matrix form with compactness of the list form. LOUDS is a succinct data structure using bit-string. Retrieval speed of LOUDS is not faster than that of the double array, but its space usage is smaller. This paper proposes a compressed version of the double array by dividing the trie into multiple levels and removing the BASE array from the double array. According to the presented experimental results the retrieval speed of the presented method is almost the same as the double array, and its space usage is compressed to 66% comparing with LOUDS. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2014.04.004 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84904401848 (DOI: 10.1016/j.ipm.2014.04.004, Elsevier: Scopus)
7.	Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Agent based communication systems for elders using a reminiscence therapy, International Journal of Intelligent Systems Technologies and Applications, Vol.12, No.3/4, 254-267, 2013. (Summary) A dialogue communication between persons is efficient for dementia care for elderly people. Also, a reminiscence therapy is to activate brains by telling his/her experience and past life memories. Therefore, this paper proposes agent-based communication system using questions about personal histories as topics of dialogue communications. We examine how dialogues of dementia patients are induced or continued by questions and answers by personal history, and which topics are effective for dementia patients. From experimental results, it turns out that especially "Place of birth", "Old song" and "Favorite food" are interested questions for the elders. Moreover, "Question Topic" is more efficient than "Question difficulty level" for dialogue supports. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJISTA.2013.056533 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84892179613 (DOI: 10.1504/IJISTA.2013.056533, Elsevier: Scopus)
8.	Kazuhiro Morita, Takuki Ogawa, Hiroya Kitagawa, Masao Fuketa and Jun-ichi Aoe : A method of extraction and visualisation for relationships among objects on web, International Journal of Intelligent Systems Technologies and Applications, Vol.12, No.3/4, 316-327, 2013. (Summary) This paper aims to extract object relationships including the direction of the relation considering context information. In the proposal method, related words that are objects related to the object given as an input word are acquired at first. And object relationships between an input word and each related word are extracted. Moreover, the system that visualises related words and the object relationships as a correlation diagram is implemented. From the experiment for extraction of object relationships, the accuracy of the correct answer rate of 80% or more, was obtained by using the proposal method. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJISTA.2013.056541 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJISTA.2013.056541 (DOI: 10.1504/IJISTA.2013.056541)
9.	Takuki Ogawa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : The Determination of Affirmative and Negative Intentions for Indirect Speech Acts by a Recommendation Tree, International Journal of Advanced Computer Science and Applications, Vol.4, No.8, 228-235, 2013. (Summary) This paper defines a recommendation tree and proposes an algorithm of deriving intentions of indirect speech acts by the tree. In the proposed method, a recommendation condition (RC) is introduced and it is classified into a required RC, a selectable RC, and a not-selectable RC. The recommendation tree is constructed by nodes and edges corresponding to these three conditions. The deriving algorithm determines affirmative and negative intentions of indirect speech acts by tracing the trees. From experimental results, it is verified that the accuracy of the proposed method is about 40 points higher than the traditional method. (Link to Publication Site) ● Publication site (DOI): 10.14569/IJACSA.2013.040831 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.14569/IJACSA.2013.040831 (DOI: 10.14569/IJACSA.2013.040831)
10.	Kazuhiro Morita, Hiroya Kitagawa, Masao Fuketa and Jun-ichi Aoe : An incremental construction method of a large-scale thesaurus using co-occurrence information, International Journal of Computer Applications in Technology, Vol.48, No.2, 120-129, 2013. (Summary) This paper aims to construct a hierarchical large-scale thesaurus by a clustering scheme based on co-occurrence information among words. In the proposed clustering algorithm, the Kullback-Leibler divergence is introduced as a similarity measurement in order to judge superordinate and subordinate relations. Besides, the thesaurus tree can be incrementally updated in each node for a minute change such as the addition of unknown words. In order to evaluate the presented method, a thesaurus consisting of about 60,000 words is made by using about 16 million co-occurrence relationships extracted from the Google N-gram. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2013.056018 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84883226230 (DOI: 10.1504/IJCAT.2013.056018, Elsevier: Scopus)
11.	Masao Fuketa, Toshiyuki Tamai, Kazuhiro Morita and Jun-ichi Aoe : Effectiveness of an implementation method for retrieving similar strings by trie structures, International Journal of Computer Applications in Technology, Vol.48, No.2, 130-135, 2013. (Summary) Demands for retrieving similar strings have been increasing. There are many methods for retrieving similar strings, and most methods must build dedicated dictionaries. In Ubiquitous Environments, because the storage capacity is often limited, the dictionary size must be compact. Therefore, this paper proposes a data structure and a fast retrieval algorithm for similar strings by existing tries. Moreover the retrieval speed for some implementation methods of a trie is compared. From experimental results, the retrieval speed of the proposed method is 2.6-3.5 times faster than that of the conventional method. The retrieval speed of list structures as an implementation method is the fastest. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2013.056019 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84883229999 (DOI: 10.1504/IJCAT.2013.056019, Elsevier: Scopus)
12.	Abdunabi UBUL, Atlam EL-Sayed, Hiroya Kitagawa, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Method of Summarizing Documents Using Impression Measurements, Computing and Informatics, Vol.32, No.2, 371-391, 2013. (Summary) Generally, novels are typical documents providing sentimental impression for readers. However, newspapers deliver different impressions for new knowledge because they inform readers about current events, informative articles and diverse features. The proposed method introduces impressive expressions for newspapers and their measurements are applied to the NMF method. From 100 KB text data of experimental results by the proposed method, it turns out that the matrix size reduces by 80 % and the computation of the NMF method becomes 7 times faster than with the original method, without degrading the relevancy of extracted sentences. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84879100752 (Elsevier: Scopus)
13.	Hiroya Kitagawa, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Document summarisation on mobile devices using non-negative matrix factorisation, International Journal of Computer Applications in Technology, Vol.46, No.1, 13-23, 2013. (Summary) This paper proposes compact and fast approaches that can summarise documents on mobile devices efficiently. The proposed method improves unsupervised schemes using the original non-negative matrix factorisation (NMF) that can determine the paragraph precedence without morphological and syntax analyses. In order to speed up the summarisation, the proposed technique is applied to the NMF method. From simulation results for test data of DUC2006, it turns out that the matrix size could be reduced by about 95% and the precision of summarisation speeding becomes 8.5 times faster than the original method without degrading the precision of extracted paragraphs. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2013.051384 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84872468731 (DOI: 10.1504/IJCAT.2013.051384, Elsevier: Scopus)
14.	Takuki Ogawa, Hiroaki Bando, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Method of Combination of Language Understanding with Touch-Based Communication Robots, International Journal of Intelligence Science, Vol.2, No.4, 71-82, 2012. (Summary) Studies of robots which aim to entertain and to be conversational partners of the live-alone become very important. The robots are classified into DBC (Dialogue-Based Communication) robots and TBC (Touch-Based Communication) robots. This paper proposes a response algorithm that can combine conversational information and touch information from humans. From the experiment for impressions of robot responses with 11 subjects, it turns out that the proposed method with combination of DBC and TBC is improved compared to only TBC or DBC. (Link to Publication Site) ● Publication site (DOI): 10.4236/ijis.2012.24010 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.4236/ijis.2012.24010 (DOI: 10.4236/ijis.2012.24010)
15.	Toshihiro Satomi, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Context Analysis Scheme of Detecting Personal and Confidential Information, International Journal of Innovative Computing, Information and Control, Vol.8, No.5(A), 3115-3134, 2012. (Summary) In order to support the supervision of personal and confidential (PC) information, there are many detection systems depending on PC texts. This paper presents a new detection scheme for non-PC texts by using context analysis. The heart of the new approach is introducing neglect (NEG) expressions that can cancel the detected PC information. It enables us to reduce extra-detections or human efforts for non-PC texts. Experimental results for context data show that the improvement of the presented method becomes 66.5% compared with the traditional methods. Moreover, the human efforts reduce by about 80% comparing to by using the traditional methods. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84860806044 (Elsevier: Scopus)
16.	Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A new approach for Arabic text classification using Arabic field-association terms, Journal of the American Society for Information Science and Technology, Vol.62, No.11, 2266-2276, 2011. (Summary) Field-association (FA) terms give us the knowledge to identify document fields using a limited set of discriminating terms. However, previous studies are based on FA terms in English and Japanese, and the extension of FA terms to other languages such as Arabic could benefit future research in the field. This paper proposes amended text classification methodology based on field association terms in Arabic language. Presented approach is compared with Naive Bayes (NB) and kNN classifiers on 5,959 documents from Wikipedia dumps and Alhayah news. The new approach achieved a precision of 80.65% followed by NB (72.79%) and kNN (36.15%). (Link to Publication Site) ● Publication site (DOI): 10.1002/asi.21604 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1002/asi.21604 (DOI: 10.1002/asi.21604)
17.	Masao Fuketa, Atlam EL-Sayed, Nobuo Fujisawa, Hiroshi Hanafusa, Kazuhiro Morita and Jun-ichi Aoe : A fast search method of similar strings from dictionaries, International Journal of Computer Applications in Technology, Vol.40, No.4, 265-272, 2011. (Summary) Demands for retrieving similar strings to an input string from dictionaries have been increasing. The edit distance is necessary to retrieve information from a large amount of data using the similarity between two strings. However, drawback of this method is time consumption because the input string must be compared with all strings in dictionaries. This study proposes a new technique for retrieving similar strings from dictionaries at high speed. The method presented can retrieve all similar strings 14 times faster than unigram methods although the edit distance is 3. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2011.041655 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2011.041655 (DOI: 10.1504/IJCAT.2011.041655)
18.	Li Wang, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Context Constraint Disambiguation of Word Semantics by Field Association Schemes, Information Processing & Management, Vol.47, No.4, 560-574, 2011. (Summary) This paper presents a new scheme for solving context ambiguities using a field association scheme. In this paper, a formal disambiguation algorithm is proposed to control the scope for a set of variable number of sentences with ambiguities as well as solve ambiguities by calculating the weight of fields. In the experiments, 52 English and 20 Chinese words are disambiguated by using 104,532 Chinese and 38,372 English field association terms. The accuracy of the proposed field association scheme for context ambiguities is 65% higher than the case frame method. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2011.01.001 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2011.01.001 (DOI: 10.1016/j.ipm.2011.01.001)
19.	Hiroshi Hanafusa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A method of extracting malicious expressions in bulletin board systems by using context analysis, Information Processing & Management, Vol.47, No.3, 323-335, 2011. (Summary) Malicious postings to bulletin board systems about crimes are serious problems for serving companies and users. This paper presents a new filtering algorithm that can recover the error rate of false positive for non-malicious articles by using context analysis. The presented scheme builds detecting knowledge by introducing multi-attribute rules. By the experimental results for 11,019 test data, it turns out that sensitivity and specificity of the presented method become 38.7 and 24.1 points higher than traditional method, respectively. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2010.08.003 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2010.08.003 (DOI: 10.1016/j.ipm.2010.08.003)
20.	Tshering C. Dorji, Atlam EL-Sayed, Susumu Yata, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Extraction, selection and ranking of Field Association (FA) Terms from domain-specific corpora for building a comprehensive FA terms dictionary, Knowledge and Information Systems, Vol.27, No.1, 141-161, 2011. (Summary) Field Association (FA) Terms words or phrases that serve to identify document fields are effective in document classification and similar file retrieval. But the problem lies in the lack of an effective method to extract and select relevant FA Terms to build a comprehensive dictionary of FA Terms. This paper presents a new method to extract, select and rank FA Terms from domain-specific corpora. Experimental evaluation on 21 fields selected up to 2,517 FA Terms at precision and recall of 74-97and 65-98. This is better than the traditional methods. (Link to Publication Site) ● Publication site (DOI): 10.1007/s10115-010-0296-x (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1007/s10115-010-0296-x (DOI: 10.1007/s10115-010-0296-x)
21.	Tshering C. Dorji, Atlam EL-Sayed, Susumu Yata, Mahmoud Rokaya, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : New methods for compression of MP double array by compact management of suffixes, Information Processing & Management, Vol.46, No.5, 502-513, 2010. (Summary) Minimal Prefix (MP) double array is an efficient data structure for a trie. However, its space efficiency is degraded by the non-compact management of suffixes. This paper presents three methods to compress the MP double array. The first two methods compress the MP double array by accommodating short suffixes inside the leaf nodes, and pruning leaf nodes corresponding to the end marker symbol. The third method eliminates empty spaces in the array that holds suffixes. Compared to a Ternary Search Tree, the key retrieval of the compressed MP double array is 50% faster and its size is 3-5 times smaller. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2009.08.004 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2009.08.004 (DOI: 10.1016/j.ipm.2009.08.004)
22.	Akihiro Tanaka, Atlam EL-Sayed, Kazuhiro Morita, Yohei Tsukuda, Masao Fuketa and Jun-ichi Aoe : Relevant estimation among fields using field association words, International Journal of Computer Applications in Technology, Vol.35, No.2/3/4, 296-306, 2009. (Summary) In recent years, there has been a tremendous growth of online text information related to the explosive growth of the web. Humans can recognise subjects of document fields by reading only some relevant specific words called field association words in the field. This paper presents a method of relevant estimation among fields by using field association words. Two methods are proposed in this paper: first is a method of extraction of co-occurrence among fields and the second is a method of judgment of similarity among fields as the methods of relevant estimation among fields. From experimental results, precision of the first method is high when relevance among fields is very high and considering direction of fields, preferable results are obtained in the second method. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2009.026605 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2009.026605 (DOI: 10.1504/IJCAT.2009.026605)
23.	Kazuhiro Morita, Atlam EL-Sayed, Masao Fuketa, Yuya Iwabu and Jun-ichi Aoe : An automatic extraction method of word tendency judgement for specific subjects, International Journal of Computer Applications in Technology, Vol.35, No.2/3/4, 281-295, 2009. (Summary) This paper focuses on word tendencies in documents and presents an automatic extraction method for specific subject. Field judgment is conducted by using field association words and similarity among word tendencies, and other word tendencies are computed with information. Then word tendencies which have the same subject are grouped as one group and the important word tendencies are chosen from that group. Finally, a system suggests word tendencies from specific subjects and fields are implemented. From the experimental result, about 67% of suggested word tendencies have been associated with popular subjects. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2009.026604 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2009.026604 (DOI: 10.1504/IJCAT.2009.026604)
24.	Masayuki Kessoku, Kazuhiko Tsuda, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A method to implement effective My-page service system using three-dimensional vectors, International Journal of Computer Applications in Technology, Vol.35, No.2/3/4, 262-270, 2009. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2009.026602 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2009.026602 (DOI: 10.1504/IJCAT.2009.026602)
25.	Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : An Implementations Method for Word Tendency Using Decision Tree, INFORMATION, Vol.12, No.3, 655-661, 2009.
26.	Masaki Oono, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A compressed trie structure using divided keys, International Journal of Computer Applications in Technology, Vol.34, No.2, 101-107, 2009. (Summary) We present a data structure to retrieve compound words efficiently. Compound words are created by combining in infinitum. Purpose of this research is to improve the space efficiency by dividing keys based on double array structure. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2009.023615 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2009.023615 (DOI: 10.1504/IJCAT.2009.023615)
27.	Kumiko Kiyoi, Atlam EL-Sayed, Masao Fuketa, Tomoko Yoshinari and Jun-ichi Aoe : A method for extracting knowledge from medical texts including numerical representation, International Journal of Computer Applications in Technology, Vol.33, No.2/3, 226-236, 2008. (Summary) Numeric information is very important to understand numbers in texts of medical opinions. This paper presents a method for determining not only numbers but also expressions of modification to expand the range of corresponding numbers. The meaning of sentences is often determined by the combination of number expressions and their object words. Therefore, the presented method categories with each meaning of expressions of modification and range expressions. According to experimental results for 948 Computer Tomography (CT) findings, the precision and recall for the extraction of number expressions are 98.23% and 97.62%, respectively. Moreover, the accuracy for the extraction of object words is 90.22%. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2008.021945 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2008.021945 (DOI: 10.1504/IJCAT.2008.021945)
28.	Tomoko Yoshinari, Atlam EL-Sayed, Kazuhiro Morita, Kumiko Kiyoi and Jun-ichi Aoe : Automatic acquisition for sensibility knowledge using co-occurrence relation, International Journal of Computer Applications in Technology, Vol.33, No.2/3, 218-225, 2008. (Summary) When companies obtain customer opinions and requests from free-styled writings, sensibility expressions are important because they include personal subjectivity such as claims `Too much dust'. Sensibility knowledge registered in the expressions is difficult to build manually. In order to reduce personal burden for building sensibility knowledge, this paper presents a method to acquire sensibility expressions automatically by using co-occurrence relation. According to experimental results of co-occurrence knowledge registered 1,300,000 terms, the rate of correct answers included in acquired sensibility expressions is 73.5%. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2008.021944 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2008.021944 (DOI: 10.1504/IJCAT.2008.021944)
29.	Jun Harada, Masao Fuketa, Kazuhiro Morita, Toru Sumitomo, Wataru Hiraishi, Atlam EL-Sayed and Jun-ichi Aoe : Estimation of FAQ knowledge bases by using semantic expressions for questions and answers, International Journal of Computer Applications in Technology, Vol.32, No.1, 69-81, 2008. (Summary) This paper presents an estimation method of the FAQ service by introducing the following measurements: 1) user's disrepute for products which defined by four types of classifying questions (IMPOSSIBLE, SIDE EFFECT, INSUFFICIENT and UNCLEAR) and the degree for each type is defined. 2) kindness for solutions replied which defined by four types of classifying answers (ACTION, CONFIRMATION, EXPLANATION, and NO PROBLEM) and the degree for each type is defined. 3) comprehension for answers which defined by semantic expressions of questions and answers. 4) sufficiency and quality for the whole FAQ service that introduced by the measurements 1, 2 and 3. (Link to Publication Site) ● Publication site (DOI): 10.1504/IJCAT.2008.019491 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1504/IJCAT.2008.019491 (DOI: 10.1504/IJCAT.2008.019491)
30.	Mahmoud Rokaya, Elsayed Atlam, Masao Fuketa, Tshering C. Dorji and Jun-ichi Aoe : Ranking of field association terms using Co-word analysis, Information Processing & Management, Vol.44, No.2, 738-755, 2008. (Summary) Information retrieval involves finding some desired information in a store of information or a database. In this paper, Co-word analysis will be used to achieve a ranking of a selected sample of FA terms. Based on this ranking a better arranging of search results can be achieved. Experimental results achieved using 41 MB of data. This corpus was chosen to be distributed over 11 sub-fields of the field sports from the experimental results, the average precision increased by 18.3%, and the average precision increased by 17.2% after applying the proposed arranging scheme depending on a formula based on ``TF∗IDF'' to count the terms weights. (Keyword) FA terms / bibliometric / term weight / TF*IDF / absolute frequency / information retrieval / word co-occurrence / co-word analysis / INFORMATION-RETRIEVAL / SCIENTOMETRICS (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2007.06.001 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2007.06.001 (DOI: 10.1016/j.ipm.2007.06.001)
31.	Uddin Md. Sharif, Elmarhomy Ghada, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Improvement of building field association term dictionary using passage retrieval, Information Processing & Management, Vol.43, No.6, 1793-1807, 2007. (Summary) This paper proposes a new approach for extracting FA terms using passage (portions of a document text) technique rather than extracting them from the whole documents. This approach extracts FA terms more accurately than the earlier approach. According to experimental results, it turns out that by using the new approach about 24% more relevant FA terms are appending to the earlier FA term dictionary and around 32% irrelevant FA terms are deleted. Moreover, precision and recall are achieved 98% and 94% respectively using the new approach. (Keyword) field association terms / passage retrieval / WWW search engine / FA terms dictionary / recall / precision / WORDS (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2006.12.006 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2006.12.006 (DOI: 10.1016/j.ipm.2006.12.006)
32.	Ghada El-Marhomy, Uddin Md. Sharif, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Disambiguation of Field Association Terms using Co-occurrence Information, INFORMATION, Vol.10, No.5, 631-647, 2007. (Summary) Human can recognize the subject of document fields by reading only some relevant specific word called Field Association terms. Various researches focused on how to extract FA terms depending on levels or frequency information. Therefore, the extracted FA terms are connected to several different fields. The traditional method causes misleading irrelevant terms to be registered because the quality of the resulting FA terms depends on levels and frequency information only. This paper proposes a new technique to disambiguate FA terms using co-occurrence information. From the experimental results, Recall and Precision are about 17% similar to 20% higher than the traditional methods. (Keyword) co-occurrence information / disambiguation / probability / in-field ambiguity / cross-field ambiguity / RETRIEVAL / DOCUMENTS / WORDS
33.	Susumu Yata, Masaki Oono, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : An efficient deletion method for a minimal prefix double array, Software: Practice and Experience, Vol.37, No.5, 523-534, 2007. (Summary) A minimal prefix (MP) double array is an efficient data structure for a trie. However, the space efficiency of the MP double array is degraded by deletion. This paper presents a fast and compact adaptive deletion algorithm for the MP double array. The presented method is implemented with C. (Keyword) trie search / dictionary / information retrieval / SEARCH (Link to Publication Site) ● Publication site (DOI): 10.1002/spe.778 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1002/spe.778 (DOI: 10.1002/spe.778)
34.	Susumu Yata, Masaki Oono, Kazuhiro Morita, Masao Fuketa, Toru Sumitomo and Jun-ichi Aoe : A compact static double-array keeping character codes, Information Processing & Management, Vol.43, No.1, 237-247, 2007. (Summary) A trie represented by a double-array enables us to search a key fast with a small space. However, the double-array uses extra space to be updated dynamically. This paper presents a compact structure for a static double-array. The new structure keeps character codes instead of indices in order to compress elements of the double-array. In addition, the new structure unifies common suffixes and consists of less elements than the old structure. Experimental results for English keys show that the new structure reduces space usage of the double-array up to 40%. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2006.04.004 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2006.04.004 (DOI: 10.1016/j.ipm.2006.04.004)
35.	Atlam EL-Sayed, Elmarhomy Ghada, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Automatic building of new Field Association word candidates using search engine, Information Processing & Management, Vol.42, No.4, 951-962, 2006. (Summary) Readers can know the subject of many document fields by reading only some specific Field Association words. Document fields can be decided efficiently if there are many FA words and if the frequency rate is high. This paper proposes a method for automatically building new FA words. A WWW search engine is used to extract FA word candidates from document corpora. New FA word candidates in each field are automatically compared with previously determined FA words. From the experiential results, our new system can automatically appended around 44% of new FA words. (Keyword) Field Association words / WWW search engine / FA word dictionary / concentration ratio / RETRIEVAL / TERMS (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2005.08.006 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2005.08.006 (DOI: 10.1016/j.ipm.2005.08.006)
36.	Susumu Yata, Masaki Oono, Kazuhiro Morita, Masao Fuketa, Tomoko Yoshinari and Jun-ichi Aoe : 接頭辞ダブル配列における空間効率を低下させないキー削除法, Transactions of Information Processing Society of Japan, Vol.47, No.6, 1894-1902, 2006. (Summary) Minimal Prefix (MP) double-array represents a trie with two advantages - a fast retrieval and a compact dictionary. However, a key deletion produces empty elements and degrades the space efficiency of MP double-array. In addition, the deletion speed of MP double-array is degraded by the key deletion because the deletion time depends on the number of empty elements. This paper presents an efficient deletion method for MP double-array. The method dynamically removes keys from MP double-array without increasing empty elements. From experimental results for the key set which consists of 100,000 keys, it turned out that the presented method is about 17-460 times faster than the conventional method and maintains high space efficiency. (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1050001337882545536 (CiNii: 1050001337882545536)
37.	Ghada El-Marhomy, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : An automatic filtering method for field association words by deleting unnecessary words, International Journal of Computer Mathematics, Vol.83, No.3, 247-261, 2006. (Summary) Generally, humans can recognize fields such as <Sports> or <Politics> based on specific words called Field Association (FA) words in documents. The traditional method causes misleading redundant words (unnecessary words) to be registered because the quality of the resulting FA words depends on learning data pre-classified by hand. This paper propose two criteria: deleting unnecessary words with low frequencies, and deleting unnecessary words using category information. Moreover, using the proposed criteria unnecessary words can be deleted from the FA words dictionary created by the traditional method. Experimental results showed that precision and F-measure were improved by 26% and 15%, respectively. (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160600875234 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1080/00207160600875234 (DOI: 10.1080/00207160600875234)
38.	Yuki Kadoya, Kazuhiro Morita, Masao Fuketa, Masaki Oono, El-Sayed Atlam, Toru Sumitomo and Jun-ichi Aoe : A Sentence Classification Technique Using Intention Association Expressions, International Journal of Computer Mathematics, Vol.82, No.7, 777-792, 2005. (Summary) Although there are many text classification techniques depending on the vector space, it is difficult to detect the meaning related to the user's intention (complaint, encouragement, request, invitation, etc.). We present a technique for determining the speaker's intention for sentences in conversation. Intention association expressions are introduced, and formal descriptions with weights are defined using these expressions to construct an intention classification. A deterministic multi-attribute pattern-matching algorithm is used to determine the intention class efficiently. In simulation results for 681 email messages of 5,859 sentences, the multi-attribute pattern-matching algorithm is about 44.5 times faster than the Aho and Corasick method. (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160412331336071 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1080/00207160412331336071 (DOI: 10.1080/00207160412331336071)
39.	Masao Fuketa, Yuki Kadoya, Atlam EL-Sayed, Tsutomu Kunikata, Kazuhiro Morita, Shinkaku Kashiji and Jun-ichi Aoe : A Method of Extracting and Evaluating Good and Bad Reputations for Natural Language Expressions, International Journal of Information Technology & Decision Making, Vol.4, No.2, 177-196, 2005. (Summary) It is difficult to extract good and bad reputations of users from texts written in natural language. This paper presents a method of determining these reputations in commodity review sentences. Multi-attribute rule is introduced to extract the reputations from sentences, and four-stage-rules are defined in order to evaluate good and bad reputations. From simulation results for 2,240 review comments, it is verified that the multi-attribute pattern matching algorithm is 63.1 times faster than the Aho and Corasick method. The precision and recall of extracted reputations for each commodity are 94% and 93% respectively. (Keyword) good and bad reputations / text mining / natural language understanding / multi-attribute rules / deterministic multi-attribute pattern-matching / PATTERN-MATCHING MACHINES / TEXT CATEGORIZATION / ALGORITHM / CLASSIFICATION / SEARCH (Link to Publication Site) ● Publication site (DOI): 10.1142/S0219622005001477 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1142/S0219622005001477 (DOI: 10.1142/S0219622005001477)
40.	Hidekazu Tokunaga, EL-Sayed Atlam, Masao Fuketa, Kazuhiro Morita, Kazuhiko Tsuda and Jun-ichi Aoe : Estimating Sentence Types in Computer Related New Product Bulletins Using a Decision Tree, Information Sciences, Vol.168, No.1-4, 185-200, 2004. (Summary) This paper presents a method to extract information for user's intelligent activity supports from an enormous amount of new product articles related to computers on the Internet. This paper uses a decision tree in order to estimate effective sentence types. From experiments, the effectiveness of the presented method is proved. (Keyword) sentence categorization / information extraction / decision tree algorithm C4.5 / genetic algorithm / GENETIC ALGORITHM / GENERATION (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ins.2004.02.004 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ins.2004.02.004 (DOI: 10.1016/j.ins.2004.02.004)
41.	Shinkaku Kashiji, El-Sayed Atlam, Masao Fuketa, Masaki Oono, Kazuhiro Morita, Kazuhiko Tsuda and Jun-ichi Aoe : A High-speed Dynamic Full-Text Search Method by Using Memory Management, International Journal of Computer Mathematics, Vol.81, No.12, 1477-1492, 2004. (Summary) This paper proposes an adaptive block management algorithm that is efficient for dynamic data management method. The new method speeds up character string retrieval by first making a full-text search of uni-gram and a full-text search of bi-gram. This paper proposes a method for enhancing the static full-text search system of bi-gram to the dynamic full-text search system of bi-gram. (Keyword) full-text search / inverted file search / uni-gram index / bi-gram index / adaptive block management / algorithm (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160412331296643 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1080/00207160412331296643 (DOI: 10.1080/00207160412331296643)
42.	Kazuhiro Morita, Atlam EL-Sayed, Masao Fuketa, Kazuhiko Tsuda, Masaki Oono and Jun-ichi Aoe : Word classification and hierarchy using co-occurrence word information, Information Processing & Management, Vol.40, No.6, 957-972, 2004. (Summary) In the natural language processing system, dictionary is necessary and indispensable because the ability of the entire system is controlled by the amount and the quality of the dictionary. In this paper, the importance of co-occurrence word information in the natural language processing system is described. The classification technique of the co-occurrence word and the co-occurrence frequency is described and the classified group is expressed hierarchically. Moreover, this paper proposes a technique for an automatic construction system and a complete thesaurus. Experimental test operation of this system and effectiveness of the proposal technique is verified. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ipm.2003.08.009 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ipm.2003.08.009 (DOI: 10.1016/j.ipm.2003.08.009)
43.	Yuki Kadoya, Masao Fuketa, Atlam EL-Sayed, Kazuhiro Morita, Shinkaku Kashiji and Jun-ichi Aoe : An efficient e-mail filtering using time priority measurement, Information Sciences, Vol.166, No.1-4, 213-229, 2004. (Summary) With the spread of e-mails, it is getting very difficult to find urgent e-mails from a huge amount of received e-mails. This paper presents a method to determine the time priority for e-mail messages. The presented method can classify and rank missing messages with important time information according to time priority measurement automatically. From the simulation results for determination of the time priority, the presented pattern-matching method is about 4 times faster than the traditional string pattern-matching method. (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ins.2003.12.003 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ins.2003.12.003 (DOI: 10.1016/j.ins.2003.12.003)
44.	Yuki Kadoya, Masao Fuketa, EL-Sayed Atlam, Kazuhiro Morita, Toru Sumitomo and Jun-ichi Aoe : A compression algorithm using integrated record information for translation dictionaries, Information Sciences, Vol.165, No.3-4, 171-186, 2004. (Summary) This paper presents a method of merging individual dictionaries into the generalized dictionary. It enables us to reduce the total dictionary size and to expand the usage of individual dictionaries to that of the other applications. A fast trie structure, called a double-array structure is introduced and its compression scheme is proposed by replacing long strings into corresponding leaf node numbers of the Trie. Although the size of the presented records grows, the total number of them is extremely decreased by merging common information. The presented method is evaluated by the observation experimental results for nine dictionaries show that new method is more efficient than previous ones. (Keyword) natural language dictionaries / dictionary search / individual dictionaries compound words / Trie structure / natural language processing system / double-array / SPARSE TABLE / SEARCH (Link to Publication Site) ● Publication site (DOI): 10.1016/j.ins.2003.07.018 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/j.ins.2003.07.018 (DOI: 10.1016/j.ins.2003.07.018)
45.	Masao Fuketa, Kazuhiro Morita, Toru Sumitomo, Shinkaku Kashiji, Atlam EL-Sayed and Jun-ichi Aoe : A New Compression Method of Double Array for Compact Dictionaries, International Journal of Computer Mathematics, Vol.81, No.8, 943-953, 2004. (Summary) Double array is a well-known data structure to implement the trie, which is a widely used approach to retrieve strings in a dictionary. This paper presents a compression method by dividing the trie constructed into several pieces (pages). This compression method enables us to reduce the number of bits representing entries of the double array. The obtained trie must trace to the pages that cause slow retrieval time, because of a state connection. Experimental results applying for a large set of keys show that the storage capacity has been reduced to 50%. Moreover, our new approach has the same retrieval speed as the old one. (Keyword) information retrieval / double array / trie / natural language analysis / compression method (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160410001714600 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1080/00207160410001714600 (DOI: 10.1080/00207160410001714600)
46.	Kazuhiro Morita, EL-Sayed Atlam, Masao Fuketa, Kazuhiko Tsuda and Jun-ichi Aoe : Fast and compact updating algorithms of a double-array structure, Information Sciences, Vol.159, No.1-2, 53-67, 2004. (Summary) As a fast and compact data structure for a trie, a double-array is presented. However, the insertion time is not faster than other dynamic retrieval methods because the double-array is a semi-static retrieval method that cannot treat high frequent updating. Further, the space efficiency of the double-array degrades with the number of deletions because it keeps empty elements produced by deletion. This paper presents a fast insertion algorithm by linking empty elements to find inserting positions quickly and a compression algorithm by reallocating empty elements for each deletion. From the simulation results for 100 thousands keys, it turned out that the insertion time and the space efficiency are achieved. (Keyword) dictionary / digital search / information retrieval / key retrieval strategies / natural language processing / SEARCH (Link to Publication Site) ● Publication site (DOI): 10.1016/S0020-0255(03)00189-0 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/S0020-0255(03)00189-0 (DOI: 10.1016/S0020-0255(03)00189-0)
47.	Masaki Oono, Masao Fuketa, Kazuhiro Morita, Shinkaku Kashiji and Jun-ichi Aoe : An Improvement Key Deletion Method for Double-Array Structure using Single-nodes, Information Processing & Management, Vol.40, No.1, 47-63, 2004. (Summary) The drawback of the double-array is that the space efficiency degrades by empty elements produced in key deletion. The space efficiency of old method is low for high frequent deletion and deletion takes much time because the cost depends on the number of the empty elements. This paper presents a fast and compact deletion method by using the property of nodes of single. (Keyword) dictionary retrieval / information retrieval / trie search / double-array structure / natural language processing / search (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(02)00090-0 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/S0306-4573(02)00090-0 (DOI: 10.1016/S0306-4573(02)00090-0)
48.	Masaki Oono, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A Fast and Compact Elimination Method of Empty Elements from a Double-Array Structure, Software: Practice and Experience, Vol.33, No.13, 1229-1249, 2003. (Summary) This paper presents a fast and compact elimination method of empty elements using properties of the trie nodes that have no siblings. The present elimination method is implemented by C language. From simulation results for large sets of keys, the present elimination method is about 30-330 times faster than the conventional elimination method and maintains high space efficiency. (Keyword) dictionary / information retrieval / trie search / natural language processing / search (Link to Publication Site) ● Publication site (DOI): 10.1002/spe.545 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1002/spe.545 (DOI: 10.1002/spe.545)
49.	EL-Sayed Atlam, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Documents similarity measurement using field association terms, Information Processing & Management, Vol.39, No.6, 809-824, 2003. (Summary) This paper outlined a new text manipulation system FA-Sim that is useful for retrieving information in large heterogeneous texts and for recognizing content similarity in text excerpts. FA-Sim measures texts similarity by using specific field association (FA) terms instead of by comparing all text information. Similarity between texts is faster and higher by using FA-Sim than other two analysis methods. Therefore, Recall and Precision significantly improved by 39% and 37% over these two traditional methods. (Keyword) information retrieval / FA terms / FA-Sim / recall / precision / AUTOMATIC TEXT-RETRIEVAL / CLASSIFICATION / INFORMATION / MODELS / WORDS (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(03)00019-0 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/S0306-4573(03)00019-0 (DOI: 10.1016/S0306-4573(03)00019-0)
50.	Masaki Oono, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ダブル配列におけるキー削除の効率化手法, Transactions of Information Processing Society of Japan, Vol.44, No.5, 1311-1320, 2003. (Summary) ダブル配列構造の欠点はキーの削除によって生じる未使用要素により空間効率が低下する点である．本論文ではトライの兄弟を持たない節が多く，これらの節の遷移は容易に変更できるという特徴を利用し，削除を連続した場合でも空間使用率と削除速度を悪化させない効率的なキー削除手法を提案する．10万語の英単語に対する実験より，削除を連続した場合でも98%以上の空間使用率を維持でき，従来手法より約300倍高速に削除できることを実証した． (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1050564287837279872 (CiNii: 1050564287837279872)
51.	EL-Sayed Atlam, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A New Method for Selecting English Field Association Terms of Compound Words and Its Knowledge Representation, Information Processing & Management, Vol.38, No.6, 807-821, 2002. (Summary) This paper presents a strategy for building a morphological machine dictionary of English that infers meaning of derivations by considering morphological affixes and their semantic classification. This paper also proposes an efficient method for selecting compound Field Association terms from a large pool of single FA terms. For single FA terms, five levels of association are defined and two ranks are defined. About 85% of redundant compound FA terms can be removed effectively by using levels and ranks proposed in this paper. Recall averages of 60-80% are achieved. The proposed methods are applied to 22,000 relationships between verbs and nouns extracted. (Keyword) compound terms / field association term / semantic classification / redundant candidates (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(01)00062-0 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1016/S0306-4573(01)00062-0 (DOI: 10.1016/S0306-4573(01)00062-0)
52.	Masao Fuketa, Yuichiro Kashiwagi, Shinkaku Kashiji, Kazuhiro Morita and Jun-ichi Aoe : 2次記憶上のダブル配列の効率的検索法, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J85-DI, No.11, 1028-1037, 2002. (Summary) キー検索技法であるダブル配列は，大規模なキー集合を扱うとき，サイズが大きくなってしまう問題がある．本論文では，ダブル配列を2次記憶上に格納した時に，記憶量も圧縮し，更に少ない主記憶領域で効率的に検索できる手法を提案する．実験により従来法に比べ50%に圧縮されることが分かった． (Keyword) 自然言語処理 / 情報検索 / トライ / ダブル配列 / 2次記憶 (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520290883234315904 (CiNii: 1520290883234315904)
53.	Toru Sumitomo, Kazuhiro Morita, Masao Fuketa, Hidekazu Tokunaga and Jun-ichi Aoe : An Efficient Trie Construction for Natural Language Dictionaries, International Journal of Computer Mathematics, Vol.79, No.6, 703-713, 2002. (Summary) When the total number of nodes of the trie becomes large, it takes a lot of spaces for a huge set of keys. This paper presents a compression method for these long strings by using trie arc for single words. The theoretical and experimental observations show the presented method is more practical than traditional methods. (Keyword) natural language dictionaries / trie structures / digital search / key retrieval algorithm / data structure / SPARSE TABLE / algorithm / search (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160211286 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1080/00207160211286 (DOI: 10.1080/00207160211286)
54.	Minsoo Jung, Masami Shishibori, Akihiro Tanaka and Jun-ichi Aoe : A Dynamic Construction Algorithm for the Compact Patricia Trie using the Hierarchical Structure, Information Processing & Management, Vol.38, No.2, 221-236, 2002. (Summary) This paper proposes a new structure of the Compact Patricia trie (CPat tree) to avoid that it takes much time in search and update about much ket set, and a method to construct a new CPat tree dynamically and efficiently. This method divides a CPat tree consisting of bit string to fixed depth. In addition, it been divided CPat tree hierarchically. A construction algorithm that proves this update time requires alteration of only one tree among whole trees. (Keyword) information retrieval / access method / data structure / Patricia trie / hierarchical structure / EFFICIENT (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(01)00031-0 (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1573387449857435264 ● Search Scopus @ Elsevier (DOI): 10.1016/S0306-4573(01)00031-0 (DOI: 10.1016/S0306-4573(01)00031-0, CiNii: 1573387449857435264)
55.	Sangkon Lee, Masami Shishibori, Toru Sumitomo and Jun-ichi Aoe : Extraction of Field-coherent passages, Information Processing & Management, Vol.38, No.2, 173-207, 2002. (Summary) This paper presents a technique for dividing text into field-coherent passages. The method is based upon extracting field-associated words or phrases from the text. After collecting 12,500 documents, we obtained an average precision of 88% and recall of 78% in a training document set. (Keyword) field-associated term / topic matter / continuity and transition / document classification / RETRIEVAL (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(01)00032-2 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036497404 (DOI: 10.1016/S0306-4573(01)00032-2, Elsevier: Scopus)
56.	Atlam EL-Sayed, Makoto Okada, Masami Shishibori and Jun-ichi Aoe : An Evaluation Method of Words Tendency Depending on Time-series Variation and Its Improvements, Information Processing & Management, Vol.38, No.2, 157-171, 2002. (Summary) In this paper, a new method is proposed to estimate automatically the stability classes (increasing, relatively constant, and decreasing) that indicate word's popularity with time-series variation based on the frequency change in past text data. The learning data were produced by defining five attributes to measure the frequency change of a word quantitatively. These five attributes were extracted automatically from electronic texts. (Keyword) time-series variation / words popularity / decision tree / CNN newspaper (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(01)00028-0 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036497390 (DOI: 10.1016/S0306-4573(01)00028-0, Elsevier: Scopus)
57.	Kazuhiro Morita, Masao Fuketa, Masaki Oono and Jun-ichi Aoe : ダブル配列における動的更新の効率化アルゴリズム, Transactions of Information Processing Society of Japan, Vol.42, No.9, 2229-2238, 2001. (Summary) キー検索技法の一つであるダブル配列は，動的更新の速度が問題となっている．本論文では，追加を高速化する手法と，削除時に生じる未使用要素の詰め直しを行う手法を提案する．10万語のキーを用いた実験を行い，本手法の有効性を実証した
58.	Makoto Okada, Kazuaki Ando, Sangkon Lee, Yoshitaka Hayashi and Jun-ichi Aoe : An Efficient Substring Search Method by Using Delayed Keyword Extraction, Information Processing & Management, Vol.37, No.5, 741-761, 2001. (Summary) 本論文では，完全一致検索だけでなく，検索キーを接頭辞として持つ接頭検索，接尾辞として持つ接尾検索，検索キーが部分文字列として含まれるキーを検索する完全部分文字列検索を行うデータ構造と検索アルゴリズムを提案する． (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(00)00050-9 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0035452845 (DOI: 10.1016/S0306-4573(00)00050-9, Elsevier: Scopus)
59.	TeaHun Lee, Kazuaki Ando, Masaki Oono and Jun-ichi Aoe : A Method of Deriving Keywords Using Generation Rules of Compound Words, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J84-DII, No.4, 812-821, 2001. (Summary) 本論文では，文書を読むための判断材料となる要約キーワードの導出を目的に，複合語生成規則を用いて文書中に陽に現れないキーワードを導出する手法を提案した．本手法を実現するために，係り受け関係に基づく規則と概念を利用した規則を構築した． (Keyword) 自動文書要約 / 複合語キーワード導出 / 係り受け関係 / 概念共起 / 生成規則 (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520572359354590464 (CiNii: 1520572359354590464)
60.	Yoshihiro Yamakawa, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A Method for Improving Full Text Search Using Signature Files, International Journal of Computer Mathematics, Vol.77, No.1, 73-88, 2001. (Summary) Signature files are one of indexes for a fast full text search, but they causes a problem to degrade the search speed by false drops. This paper presents a method to reduce the problem by appearance ratio which is computed by scanning documents. (Link to Publication Site) ● Publication site (DOI): 10.1080/00207160108805051 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0034955108 (DOI: 10.1080/00207160108805051, Elsevier: Scopus)
61.	Kazuhiro Morita, Masao Fuketa, Yoshihiro Yamakawa and Jun-ichi Aoe : Fast insertion methods of a double-array structure, Software: Practice and Experience, Vol.31, No.1, 43-65, 2001. (Summary) A double-array structure degrades the speed of insertion for a large set of keys. This paper implements two methods; one is to skip elements to be checked and the other is to produce the linkage among empty elements, and proves that insertion by those two methods is faster than insertion by a traditional method. (Link to Publication Site) ● Publication site (DOI): 10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0035114148 (DOI: 10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R, Elsevier: Scopus)
62.	Shoji Mizobuchi, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Conceptual and Quantitative Representations of Time Expressions, Computer Processing of Oriental Languages, Vol.13, No.4, 313-331, 2000. (Summary) In natural language processing systems, it is very important to understand the meaning of time expressions. This paper proposes a method for understanding time expressions. For components of which time expressions consist, 31 concepts are introduced. Formal representations for these concepts are defined and an algorithm of analyzing the meaning of time expressions is proposed. The representation includes both conceptual and quantitative aspects in comparison with traditional approaches. An algorithm for translating time expressions into the corresponding formal representation is presented. Experiments for about 2,000 time expressions show that the proposed method yields correct interpretation in about 93%.
63.	Shoji Mizobuchi, Toru Sumitomo, Masao Fuketa and Jun-ichi Aoe : An Efficient Representation for Implementing Finite State Machines Based on the Double-Array, Information Sciences, Vol.129, 119-139, 2000. (Summary) When finite state machines are implemented, a problem is space efficiency. This paper proposes the extended double-array structure so that is can be applicable to general finite state machines and be operated dynamically with the insertion and the deletion of a state transition. The presented method has been evaluated by theoretical observations, and its space efficiency is verified in the experiment.
64.	Masafumi Koyama, Masaki Oono, Kazuhiro Morita and Jun-ichi Aoe : A Fast and Compact Technique of Implementing Transition Tables for Finite State Automata, Information Sciences, Vol.129, No.1-4, 141-154, 2000. (Summary) This paper proposes a method of compressing the triple-array structures. Although the approach is not optimal, it does realize a reasonable reduction in size. From the simulation results, it is verified that the presented method can produce fast and compact structures. (Link to Publication Site) ● Publication site (DOI): 10.1016/S0020-0255(00)00060-8 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0034315626 (DOI: 10.1016/S0020-0255(00)00060-8, Elsevier: Scopus)
65.	Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Similarity measures using negative weight and its application to word similarity, Information Processing & Management, Vol.36, No.5, 717-736, 2000. (Summary) A "term weighting" is a useful technique for keyword extraction and document classification. The traditional approach depends on high frequency terms. This paper presents a new weighting method that depends on low frequency terms. In this paper, word similarity for typical verbs and objects is focused as an example for the application field. The proposed method is applied to 11,000 relationships between verbs and nouns extracted from a large tagged corpus. By using this new method both recall and precision have improved by 33% and 18% respectively.
66.	Masami Shishibori, Kazuaki Ando, Yuuichirou Kashiwagi and Jun-ichi Aoe : A Fast Correction Method for Erroneous Sentences Using the LR Parser, IEICE Transactions on Information and Systems, Vol.E83-D, No.9, 1797-1804, 2000. (Summary) In this paper, we propose the method to improve the time efficiency, keeping the correction accuracy of the traditional method. This method makes use of a new parsing table that denotes the states to be transited after accepting each symbol. By using this table, the symbol which is allocated just after the error position can be utilized for selecting correction symbols, as a result, the number of candidates produced on the correction process is reduced, and fast system can be realized.
67.	Masami Shishibori, 藤井誠, 安藤一秋 and Jun-ichi Aoe : 多属性項目の履歴情報に基づく電子メイル文書のフィルタリング手法, Transactions of Information Processing Society of Japan, Vol.41, No.8, 2299-2308, 2000. (Summary) 本論文では，受信済みのメイル文書から送信元，テーマや類型等の多属性項目の組み合わせから成る構造化知識を獲得し，その知識を用いたフィルタリング手法を提案する．更に，各属性の意味に従って近似処理を適用すべき属性の順番を定義し，学習データ数が少ない場合にも，ノイズの混入を極力抑えて正確な重要度を算出する．4人の被験者に対する実験結果から，単語の出現頻度という単一属性のみと比べて，本手法の方が人間の判断と高い相関を示すことが確認できた．
68.	Masao Fuketa, Sangkon Lee, Takako Tsuji and Jun-ichi Aoe : A Document Classification Method by using Field Association Words, Information Sciences, Vol.126, No.1-4, 57-70, 2000. (Summary) Although there is much research of text classification based on vector spaces using word information in the whole text, generally humans can recognize the field by finding the specific words. In this paper, such words are called a field association (FA) word that can be directly related to the field classification. This paper presents an early field un- derstanding method using FA words. Five criteria of FA words are defined for hier- archical fields and a method of extracting shorter FA words of compound words is proposed. The presented approach is estimated by the simulation results of 140 fields' text files (Link to Publication Site) ● Publication site (DOI): 10.1016/S0020-0255(00)00042-6 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0034225063 (DOI: 10.1016/S0020-0255(00)00042-6, Elsevier: Scopus)
69.	Makoto Okada, Kazuaki Ando, Kazuhiro Morita and Jun-ichi Aoe : キーワードの遅延抽出を考慮した文書検索構造の効率的構成法, Transactions of Information Processing Society of Japan, Vol.41, No.4, 1171-1179, 2000. (Summary) 文書検索において，文書中のキーワードを利用する手法はよく利用されるが，複合語キーワードの的確な抽出は，重要な課題となっている．本論文では，複数キーワードの文字列照合マシンACを拡張し，複合語キーワードの全ての候補を格納できる検索構造を提案する．実験により，提案手法によるキーワード抽出の有効性，高速性を実証した．
70.	Takako Tsuji, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Method of Determining Field Association Terms of Compound Words, Journal of Natural Language Processing, Vol.7, No.2, 3-26, 2000. (Summary) 本論文では，短単位語の分野連想語情報を利用して，非常に多く造語される複合連想語を効率的に決定する手法を提案し，180分野の学習データを用いた実験により，提案手法の有効性を評価した．また，構築された連想語が文書断片の分野決定に有効であることも示した． (Keyword) Field determination / compound words / field association terms / document classification (Link to Publication Site) ● Publication site (DOI): 10.5715/jnlp.7.2_3 (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1390282679452139392 ● Search Scopus @ Elsevier (DOI): 10.5715/jnlp.7.2_3 (DOI: 10.5715/jnlp.7.2_3, CiNii: 1390282679452139392)
71.	Masami Shishibori, Masafumi Koyama, Makoto Okada and Jun-ichi Aoe : Two Improved Access Methods on Compact Binary (CB) Trees, Information Processing & Management, Vol.36, No.3, 379-399, 2000. (Summary) This paper proposes a new hierarchical CB-tree structure able to avoid the increase of the time-cost. As regards the space efficiency, in order to compress the binary trie into the CB-tree, the conventional method adopts the imaginary leaf, which is called a dummy leaf, for the nodes which have only one leaf. At this point, the number of dummy leaves has a bad influence on the space efficiency. This paper extends his tree representation for the Patricia binary trie and proposes the method for composing the CB-tree without the dummy leaf. (Link to Publication Site) ● Publication site (DOI): 10.1016/S0306-4573(99)00035-7 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0033904498 (DOI: 10.1016/S0306-4573(99)00035-7, Elsevier: Scopus)
72.	Kazuhiro Morita, Masafumi Koyama, Masao Fuketa and Jun-ichi Aoe : A Link Trie Structure of Storing Multiple Attribute Relationships for Natural Language Dictionaries, International Journal of Computer Mathematics, Vol.72, No.4, 463-476, 1999. (Summary) Word relation is primitive knowledge and it is very useful for natural language processing systems. In the traditional systems, although each knowledge dictionary is constructed in separation, recent natural language applications become more complex by integrating the above multi-attribute relationships. This paper presents an efficient data structure by introducing a trie that can define the linkage among their leaves. Theoretical observations show that the worst-case time complexity of retrieving multi-attribute relationships is a constant. From the simulation results, it is shown that the presented method is 1/3 smaller than the competitive methods.
73.	Shoji Mizobuchi, Toru Sumitomo, Masao Fuketa and Jun-ichi Aoe : 日本語時間表現の一解釈法, Transactions of Information Processing Society of Japan, Vol.40, No.9, 3408-3419, 1999. (Summary) 本論文では，自然言語による時間表現を意味解釈するために，意味解釈を時点，時点区間などの概念に分類し，時間表現に対する形式表現を定義した．また，形態素列からなる時間表現から形式表現に変換するアルゴリズムを提案し，実験により提案手法の有効性を実証した．
74.	Masao Fuketa, Kazuhiro Morita, Sangkon Lee and Jun-ichi Aoe : Efficient Controlling of Parsing-Stack Operations for LR Parsers, Information Sciences, Vol.118, No.1-4, 145-157, 1999. (Summary) This paper presents a new method of LR parsing based on the distinction of stack states and non-stack states. Non-stack states are states, which do not need to be pushed into the LR parsing stack, and stack states are states to be pushed into it. By using some properties based on the stack-controlling LR parser defined here, the parsing speed and the size of parsing tables can be remarkably improved and their improvement includes the traditional method eliminating unit productions. By empirical observations for a variety of programming languages, the efficiency is verified. Extending it to the generalized LR parsers for natural language is also discussed.
75.	Masafumi Koyama, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures, Information Processing & Management, Vol.34, No.6, 761-773, 1998. (Summary) This paper presents a faster method to determine the hierarchical relationships by using trie structures. The worst-case time complexity of determining relationships by the presented method could be remarkably improved for the one of linear (or sequential) searching, which depends on the number of concepts in the case slot. From the simulation result, it is shown that the presented algorithm is 6 to 30 times faster than linear searching, while keeping the smaller size of tries.
76.	Kazuhiro Morita, Hisatoshi Mochizuki, Yoshihiro Yamakawa and Jun-ichi Aoe : トライ構造を用いた共起情報の効率的検索アルゴリズム, Transactions of Information Processing Society of Japan, Vol.39, No.9, 2563-2571, 1998. (Summary) 本論文では，基本単語からなる共起情報をトライ構造で効率的に記録検索する手法を提案する．本手法では共起情報を構成する2つの基本単語を1つのトライに登録し，関係情報をトライの葉ノード間のリンク関数で定義する．共起情報の登録による記憶量の増加はこのリンク情報のみとなり，リンク情報もトライに格納する．
77.	Kazuaki Ando, Toshiharu Kinoshita, Masami Shishibori and Jun-ichi Aoe : An Improvement of the Aho-Corasick Machine, Information Sciences, Vol.111, 139-151, 1998. (Summary) This paper describes an efficient multi-attribute pattern matching machine to locate all occurrences of any of a finite number of the sequence of rule structures (called matching rules) in a sequence of input structures. The proposed algorithm enables us to match set representations containing multiple attributes.
78.	Masao Fuketa, Shoji Mizobuchi, Yoshitaka Hayashi and Jun-ichi Aoe : A Fast Method of Determining Weighted Compound Keywords from Text Databases, Information Processing & Management, Vol.34, No.4, 431-442, 1998. (Summary) This paper presents a technique for storing compound keywords about both short component keywords and long component keywords by extending Aho and Corasick (AC) string pattern matching machine. By theoretical analysis, it is verified that the total cost of the extended AC machine becomes O(n+k) in comparison with the total cost O(3n) of the original AC machine. By simulation results for 38 Japanese text files, it is shown that the extended AC machine is about three to six times faster than the original AC machine in SC and LC keyword processing
79.	Masao Fuketa and Jun-ichi Aoe : A Fast Algorithm of Retrieving Common Sentences, Information Sciences, Vol.109, No.1-4, 265-279, 1998. (Summary) Inverted filing is a well-known approach for retrieving common sentences, but there are some problems when storing a huge number of sentences. They arise when the intersection is computed for large postings indexed by terms, or keywords. Moreover, disk access for postings also takes a lot of time in this situation. This paper presents a technique for the storing of multi-stages of postings and retrieving them partly in order to compute efficiently the intersection between postings for the requested terms. From the simulation results, it is shown that the presented algorithm is 6 to 88 times faster than the traditional ap- proach
80.	Hisatoshi Mochizuki, Masafumi Koyama, Masami Shishibori and Jun-ichi Aoe : A Substring Search Algorithm in Extendible Hashing, Information Sciences, Vol.108, No.1-4, 13-30, 1998. (Summary) In this paper, in order to design this substring search in extendible hashing, signature vectors are introduced as hash values, and a trie structure as an extendible hash table, where each vector is composes by a bit stream.
81.	Masami Shishibori, Makoto Okada, Toru Sumitomo and Jun-ichi Aoe : Design of a Compact Data Structure for the Patricia Trie, IEICE Transactions on Information and Systems, Vol.E81-D, No.4, 364-371, 1998. (Summary) In several key strategies, the binary trie is famous as a fast access method able to retrieve keys in order. Especially, a Patricia trie gives the shallowest trie by eliminating all nodes which have only one arc. If trie structures are implemented, however, the greater the number of the registered keys, the larger storage is required. This paper proposes the improved trie representation for the Patricia trie, as well as the methods for searching and inserting the key on it. The theoretical and experimental results, using 50,000 Japanese nouns and 50,000 English words, show that this method generates 25∼39 percent shorter bit streams than the traditional method.
82.	Kazuaki Ando, Masami Shishibori and Jun-ichi Aoe : An Extended Pattern Matching Machine for Document Processing, Computer Processing of Oriental Languages, Vol.11, No.3, 223-248, 1998. (Summary) This paper describes an efficient multi-attribute pattern matching machine using the extended AC machine. The pattern matching algorithm is evaluated by the theoretical analysis, and the evaluation is supported by the simulation results with patterns for document processing such as text proofreading, text reduction, and examining a relation between sentences.
83.	Masafumi Koyama, Masao Fuketa, Makoto Okada and Jun-ichi Aoe : 格構造解析における概念階層の効率的判定アルゴリズム, Transactions of Information Processing Society of Japan, Vol.39, No.3, 551-558, 1998. (Summary) 本論文では，概念階層のデータ構造にトライ構造を導入して，判定効率を向上させる手法を提案する．また，本手法では複数の用言の格構造を1つのトライに併合して格納するので，トライ検索後に目的とする用言を効率的に確定する手法も提案する．同音語とEDRの共起データに対する実験結果により，本手法は6から25倍高速化されることが分かった．
84.	Kazuaki Ando, Shoji Mizobuchi, Masami Shishibori and Jun-ichi Aoe : Efficient Multi-Attribute Pattern Matching, International Journal of Computer Mathematics, Vol.66, No.1+2, 21-38, 1998. (Summary) The matching operation of the proposed machine is similar to the method of Aho-Corasick or the method of retrieval using a trie, however, the proposed machine has the following distinctive features: (1) The proposed machine enable us to match set representations containing multiple attribute; (2) It enables us to match separate components; (3) It enables us to match a rule consisting of an exclusive set. In this paper, their features are described in detail.
85.	Masao Fuketa, Shoji Mizobuchi, Masami Shishibori and Jun-ichi Aoe : 大規模文書データに対する用例文の効率的検索アルゴリズム, Transactions of Information Processing Society of Japan, Vol.38, No.10, 2004-2013, 1997. (Summary) 大量の用例文データから複数の索引要求に共通する用例文を検索する手法は，文書管理システムにおいて必要不可欠な技法である．本論文では，索引が指定する複数の文番号を文番号列とするとき，多くの索引要求があり，しかも索引に対する文番号列が非常に長くなる場合でも，目的とする用例文を高速に絞り込めるアルゴリズムを提案する．
86.	Takeshi Arita, Masami Shishibori and Jun-ichi Aoe : An Efficient Algorithm for Full Text Retrieval for Multiple Keywords, Information Sciences, Vol.104, No.9, 65-85, 1997. (Summary) This paper presents a fast retrieval algorithm for multiple keywords by using the characteristics of multiple signatures. The objective of this approach is to decrease the number of comparisons between multiple signatures. From the simulation result, it is shown that the presented algorithm is from two to six times faster than the traditional algorithm.
87.	Kazuaki Ando, Takako Tsuji, Masami Shishibori and Jun-ichi Aoe : 日本語定型表現のパターン記述規則と効率的な照合アルゴリズム, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J80-DII, No.7, 1860-1869, 1997. (Summary) 日本語の定型表現は，機械翻訳における正しい訳語の決定などに有用であり，その抽出や利用方法が研究されている．本論文では，各応用分野で必要とされる定型表現を広く捉えて分析し，多属性，分離，排他情報が記述できる規則を形式的に定義し，これら規則の効率的な照合アルゴリズムを提案する．
88.	Masami Shishibori and Jun-ichi Aoe : An Order Searching Algorithm of Extensible Hashing, International Journal of Computer Mathematics, Vol.63, No.3+4, 179-201, 1997. (Summary) Extensible hashing schemes provide fast key retrieval for dynamic key sets, but they can't keep order preserved searching. In order to solve this problem, Jonge et al. proposed the binary digital search tree (BDS-tree) that enables order preserved searching by extensible hashing schemes, however, searching and updating a key takes a lot of time for large key sets. This paper proposes a new method to preserve the key-order access property and to improve the time cost. This method separates the BDS-tree into smaller trees of a certain depth, and creates the pre-order bit stream for each of the separated trees.
89.	Yoshitaka Hayashi, Hideo Nakano, Masami Shishibori and Jun-ichi Aoe : 文字列照合マシンを利用した複合語キーワードの効率的抽出法, Transactions of Information Processing Society of Japan, Vol.38, No.4, 1860-1869, 1997. (Summary) 本論文では，日本語文書から複合語キーワードを効率的に抽出する手法を提案する．本手法は，まず，抽出条件に集合表現を導入した規則を定義し，規則集合の照合マシンと候補語に対する部分文字列処理マシンを用いてキーワードを抽出する．抽出マシンでは，包含関係に基づく照合アルゴリズムを提案し，候補マシンでは，候補語に対して部分文字列の関係が定義できる構成アルゴリズムを提案する．
90.	Hisatoshi Mochizuki, Kazuhiro Morita, Masami Shishibori and Jun-ichi Aoe : 拡張ハッシュ法における部分文字列検索の設計と実現, Transactions of Information Processing Society of Japan, Vol.38, No.2, 310-320, 1997. (Summary) 拡張ハッシュ法は動的なキー集合に対しても高速な検索ができるが，任意の文字列を部分文字列として含むキーを効率的に検索することはできない．本論文では，部分文字列検索を実現するため，特徴ベクトルと呼ばれるビット列をハッシュ値として用いる手法を提案する．更に，大規模なキー集合に対して均整ベクトルを導入し，そのベクトルを増進的に生成する手法を提案する．
91.	Masami Shishibori, Takeshi Arita, Hisatoshi Mochizuki and Jun-ichi Aoe : An Algorithm to Allocate Diagrams Automatically on Document Formatting Systems, IEICE Transactions on Information and Systems, Vol.E80-D, No.2, 259-273, 1997. (Summary) In a document processing system it is a very important issue to allocate diagrams on the most suitable places. This paper defines the criteria for allocating diagrams on the suitable positions by investigating published papers. These criteria concern 1) the order of diagrams to be allocated, 2) the stability of the diagram allocations, 3) the distance between the diagram and the location of the corresponding first reference in the text, 4) the allocation balance of diagrams in a text, 5) the restricted areas where diagrams shouldn't be allocated, 6) the allocation priorities between diagrams of different width. Moreover, this paper proposes a method for deciding the diagram allocations satisfying the above criteria automatically and fast on document formatting systems.
92.	Ingrid Kirschning and Jun-ichi Aoe : Neural Networks and the Time-Sliced Paradigm for Speech Recognition, IEICE Transactions on Information and Systems, Vol.E79-D, No.12, 1690-1699, 1996.
93.	Ingrid Kirschning, Hideto Tomabechi, Masafumi Koyama and Jun-ichi Aoe : The time-sliced paradigm a connectionist method for continuous speech recognition, Information Sciences, Vol.93, No.1-2, 133-158, 1996.
94.	入口浩一, Kazuhiko Tsuda, Masami Shishibori and Jun-ichi Aoe : グラフ構造に対する効率的記憶検索法, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J79-D-I, No.8, 502-510, 1996. (Summary) Ahoらは配列構造の高速性とリスト構造のコンパクト性を融合したグラフ構造に対するデータ構造を提案しているが，アークの更新法を与えていないため，適用範囲が静的なグラフ構造に限られていた．本論文では，Ahoらの手法に基づき，アークが更新できる手法を提案する．更に，大規模グラフ構造の更新処理に対して，先行順法による高速化手法を提案する．
95.	Masami Nakamura, Kazuhiko Tsuda and Jun-ichi Aoe : A new approach to phoneme recognition by phoneme filter neural networks, Information Sciences, Vol.90, No.1-4, 109-119, 1996.
96.	Hirokazu Iriguchi, Masafumi Koyama, Masami Shishibori and Jun-ichi Aoe : A Fast Retrieval Technique for Large Graph Structures, International Journal of Computer Mathematics, Vol.60, No.3+4, 215-228, 1996. (Summary) A two-dimensional array and a list are well-known as for the Graph representation. These data representations have contrasting features for retrieval time and space efficiency. By introducing three one-dimensional arrays based on Aho's data structure, called a triple-array structure, this paper proposes a method for updating arcs stored in the triple-array without degrading the worst-case retrieval time complexity O(1).
97.	Masami Shishibori and Jun-ichi Aoe : Fast Allocation of Diagrams without Backtracking Processes, Information Sciences, Vol.92, No.4, 65-85, 1996. (Summary) This paper defines the conditions of readability on a text including the ordered diagrams, and proposes a method for automatic and fast diagram layout creation, without backtracking, by considering the conditions. The conditions are concerning to 1) the distance between the diagram and the corresponding first reference location in a text, 2) the distance between the diagram and the related paragraph, 3) the allocation balance of diagrams and paragraphs. From the experimental results using various published papers, it has been shown that 93 percent of the diagrams in the original papers are adapted to the conditions. As for the execution time of the proposed method, it takes less than 1 second.
98.	Jun-ichi Aoe, Morimoto Katsushi, Masami Shishibori and Park Ki-Hong : A Trie Compaction Algorithm for a Large Set of Keys, EEE Transactions on Knowledge and Data Engineering, Vol.KDE-8, No.3, 476-491, 1996. (Summary) A trie structure is frequently used for various applications. However, the total number of states of a trie becomes large so that space cost may not be acceptable for a huge key set. In order to resolve this disadvantage, this paper presents a new scheme, called two-trie, that enables us to perform efficient retrievals, insertions, and deletions for the key sets.
99.	Masami Shishibori, 清原聡 and Jun-ichi Aoe : 階層化による2進ディジタル探索(BDS)木の改善, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J79-D-I, No.2, 79-87, 1996. (Summary) BDS(Binary Digital Search)木をコンパクトなビット列に圧縮する従来の手法は，大規模なキー集合に対しては，各種処理時間コストが悪化する短所があった．本論文では，木構造を階層的に管理するデータ構造を提案し，その構造に対する検索·更新·削除の各種アルゴリズムも提案する．本手法により，処理時間コストが従来法より大幅に改善することを実験により確認した．
100.	Kazuhiko Tsuda and Jun-ichi Aoe : A method for the expansion and contraction of text's size by using the string replacement algorithm, Information Sciences, Vol.87, No.1-3, 47-64, 1995.
101.	Hideki Mima, Masao Fuketa, Yoshitaka Hayashi and Jun-ichi Aoe : A method for Understanding Intentions of Indirect Speech-Act in Natural Language Interfaces, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J78-D-2, No.5, 803-810, 1995. (Keyword) 自然言語インタフェース / 間接発話理解 / 対話処理 / 意図属性 / 操作知識
102.	Masami Shishibori, Jun-ichi Aoe, Park Ki-Hong and Mochizuki Hisatoshi : An Automatic Selection Method of Key Search Algorithms, IEICE Transactions on Information and Systems, Vol.E78-D, No.4, 383-393, 1995. (Summary) An automatic selection method for key search algorithms is presented in this paper. The methodology has been implemented in a system called KESE2 (KEy-SEarch ALgorithm SElection). The selection algorithm presented is based on step by step reduction of unsuitable key search algorithms and searching properties. This paper also proposes assistance facilities that consist of both a support function and a program synthesis function.
103.	Alfredo M. Maeda, Hideto Tomabechi and Jun-ichi Aoe : Unification-Failure Filter for Natural Language, IEICE Transactions on Information and Systems, Vol.E78-D, No.1, 19-26, 1995.
104.	Park Ki-Hong, Jun-ichi Aoe, Morimoto Katsushi and Masami Shishibori : An Algorithm for Dynamic Processing of DAWG's, International Journal of Computer Mathematics, Vol.54, No.3+4, 155-173, 1994. (Summary) This paper proposes an algorithm that dynamically constructs DAWGs (Directed Acyclic Word Graphs) for the handling of dynamic key sets. The proposed method constructs a DAWG through the local separation of common suffixes for updating a key and the local transition merge of common suffixes. The proposed algorithm is theoretically evaluated and the data structure for the implementation is discussed.
105.	Yong-Seok Lee, Hideto Tomabechi and Jun-ichi Aoe : A Shift First Strategy for Generalized LR Parsing, IEICE Transactions on Information and Systems, Vol.E77-D, No.10, 1162-1169, 1994. (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1572261552262695552 (CiNii: 1572261552262695552)
106.	Masami Nakamura, Kazuhiko Tsuda and Jun-ichi Aoe : Word Category Prediction Based on Neural Network, Intern.J.Computer Math., Vol.57, 169-181, 1994. (Keyword) neural network / Text analysis / Word category prediction
107.	Kazuhiko Tsuda, Masao Fuketa and Jun-ichi Aoe : An Incremental Algorithm for String Pattern Matching Machines, Intern.J.Computer Math., Vol.58, 33-42, 1994. (Keyword) String pattern matching / Append a keyword / Bibliographic search / Text-editing / Information retrieval
108.	Kazuhiko Tsuda, Hirokazu Iriguti and Jun-ichi Aoe : A method of Constructing Dynamic String Pattern Matching Machines, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J77-D-1, No.4, 282-289, 1994. (Keyword) ストリンクハターンマッチンク / 動的構成法 / information retrieval / 文献検索 / 文書編集 (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520009410295800064 (CiNii: 1520009410295800064)
109.	Katsushi Morimoto, Hirokazu Iriguchi and Jun-ichi Aoe : A Method of Compressing Trie Structures, Software: Practice and Experience, Vol.24, No.3, 265-288, 1994. (Keyword) Dictionaries / Database systeme / Key search technique / Natural Ianguage processing / Trie structure (Link to Publication Site) ● Publication site (DOI): 10.1002/spe.4380240303 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0028393044 (DOI: 10.1002/spe.4380240303, Elsevier: Scopus)
110.	Masami Shishibori, Kazuhiko Tsuda and Jun-ichi Aoe : 片仮名異表記の生成および統一手法, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J77-DII, No.2, 380-387, 1994. (Summary) 日本語の片仮名表記には，表記の揺れを有するものが多く存在し，日本語文書校正支援システムでは，このような表記の揺れを吸収することが重要な課題である．本論文では，片仮名異表記の変換ルールを定義し，片仮名異表記の揺れを統一する手法を提案する．本手法を校正支援システムに組み込むことによって，片仮名表記の揺れを自動的に統一する事が可能になる．
111.	Katsushi Morimoto, Hirokazu Iriguchi and Jun-ichi Aoe : A Retrieval Algorithm of Dictionaries by Using Two Trie Structures, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J76-D-2, No.11, 2374-2383, 1993. (Keyword) 自然言語処理 / トライ構造 / 検索技法 / 辞書検索
112.	Jun-ichi Aoe, katushi Morimoto and Takashi Satou : An Efficient Implementation of Trie Structures, Software: Practice and Experience, Vol.22, No.9, 695-721, 1992. (Summary) トライ検索におけるダブル配列構造の具体的な実装方法を提案し，多くの実験結果に対するリスト構造との比較結果を検索速度と記憶領域の両面で示し，ダブル配列構造の有効性を示した． (Link to Publication Site) ● Publication site (DOI): 10.1002/spe.4380220902 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0026923005 (DOI: 10.1002/spe.4380220902, Elsevier: Scopus)
113.	Jun-ichi Aoe, katushi Morimoto and Miki Nagatani : トライ構造における接尾辞の圧縮アルゴリズム, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J75-DII, No.4, 770-779, 1992. (Summary) 本論文では，トライの共通接尾語を併合したDAWG(Directed Acyclic Word-Graph)を動的に構成できるアルゴリズムを提案し，トライの遷移数増加の問題点を解決する．提案アルゴリズムは理論的に評価され，それを実装するためのデータ構造が議論される． (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520572360235148544 (CiNii: 1520572360235148544)
114.	Kazuhiko Tsuda, Masami Nakamura and Jun-ichi Aoe : A Method of Reducing Texts by Using Morpheme Replacements, The Transactions of the Institute of Electronics, Information and Communication Engineers D-II, Vol.J75-D-2, No.3, 619-627, 1992. (Keyword) natural language processing / 文書短縮アルゴリズム / パターンマッチング / 文書校正支援
115.	Jun-ichi Aoe : A Practical Method for Implementing String Pattern Matching Machines, International Journal of Computer Mathematics, Vol.64, No.1, 95-114, 1992. (Summary) ストリングパターンマッチングにおける照合アルゴリズムにおける効率的な改善方法を定義し，無駄な演算の除去を実現した．特に，多く存在する状態遷移が一意である場合に対しては，格納構造も合わせて効率化を実現した． (Link to Publication Site) ● Publication site (DOI): 10.1016/0020-0255(92)90113-M (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-38249009104 (DOI: 10.1016/0020-0255(92)90113-M, Elsevier: Scopus)
116.	Takashi Sato and Jun-ichi Aoe : Optimal Code Generation for Arithmetic Expressions with Common Subexpressions, --- Two-Address Infinite Register Machine Model ---, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J73-D-1, No.12, 924-932, 1990.
117.	Toshiharu Kinoshita, Jun-ichi Aoe and Takashi Sato : A Metheod for Speeding up a hash Search Using a Substring Test, The Transactions of the Institute of Electronics, Information and Communication Engineers D-I, Vol.J73-D-1, No.5, 535-538, 1990.
118.	Jun-ichi Aoe : A Practical Method for Compressing Sparse Matrices with Variant Entries, International Journal of Computer Mathematics, Vol.36, No.1, 163-173, 1990. (Summary) スパース行列において，要素が動的に更新される場合の効率的な記憶検索構造を提案した．本手法は，最悪の検索時間計算量を常にO(1)にすることを前提としているので，高速な演算を必要とする分野に対しても応用性は高い．
119.	Jun-ichi Aoe : A Compact Representation of Hierarchical Relations Using Decimal Notations, International Journal of Computer Mathematics, Vol.33, No.1, 37-54, 1990. (Summary) 知識表現における階層構造は，非常によく利用されているが，その検索構造の研究は少ない．本論文では，階層表現をビットベクトルで圧縮し，且つ高速に検索できる構造を提案した． (Link to Publication Site) ● Publication site (DOI): 10.1080/00207169008803835 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0012800659 (DOI: 10.1080/00207169008803835, Elsevier: Scopus)
120.	Jun-ichi Aoe : An Efficient Digital Search Algorithm by Using a Double-Array Structure, IEEE Transactions on Software Engineering, Vol.SE-15, No.9, 1066-1077, 1989. (Summary) ディジタル検索における検索構造に対して，配列構造の高速化とリスト構造のコンパクト性を融合したダブル配列法を提案した．本手法により，大規模辞書が従来手法に比べて，著しく効率的になることを理論的ろ実験により明らかにした． (Link to Publication Site) ● Publication site (DOI): 10.1109/32.31365 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0024735522 (DOI: 10.1109/32.31365, Elsevier: Scopus)
121.	Jun-ichi Aoe : An Efficient Implementation of Static String Pattern Matching Machines, IEEE Transactions on Software Engineering, Vol.SE-15, No.8, 1010-1016, 1989. (Summary) ストリングパターンマッチングにおける有限状態機械の効率的データ構造を定義し，多くのキーワードを処理する場合の記憶量の軽減を実現した．特に，最悪の検索時間計算量がキーワード数に関係なくO(1)となることを保証した点は，実用化に有効である． (Link to Publication Site) ● Publication site (DOI): 10.1109/32.31357 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0024714756 (DOI: 10.1109/32.31357, Elsevier: Scopus)
122.	Jun-ichi Aoe and Seigo Yasutome : 行置換による動的スパース行列の縮小アルゴリズム, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J71-D, No.12, 2508-2516, 1988. (Summary) 行置換関数の決定に関係するデータ構造と追加アルゴリズムの改善法を提案し，この計算量からn の項が取り除かれることを理論的に示す．そしてパターンマッチングマシンの状態遷移表に対する種々の実験結果により，提案された手法の時間·空間的有効性を実証する．
123.	Jun-ichi Aoe : 形態論に基づく英語機械辞書の一構成法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J71-D, No.9, 1753-1760, 1988. (Summary) 本論文では，形態論における語形変化とその分類情報を導入した英語形態素辞書の構築法を提案する．実験により，約8.4万の派生語が約2．3万の枠組みにまとめられることがわかり，本手法の検索と記憶効率に対する有効性を確かめた．また，機械翻訳の対話辞書の構築や意味表現に対する有効性にも検討を加えた．
124.	Jun-ichi Aoe : ダブル配列による高速ディジタル検索アルゴリズム, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J71-D, No.9, 1592-1600, 1988. (Summary) 本論文では，複数の静的なキーのパターンマッチングに利用されていたデータ構造(ダブル配列と呼ぶ)を拡張する．このダブル配列とTAILを使ったディジタル検索の検索，追加，削除アルゴリズムを提案する．キーの長さをk;ダブル配列上で冗長に定義される状態番号数をm;入力記号の種類をeとするとき，検索，削除，追加の最悪の計算時間がそれぞれO(k)，O(m)，O(m·e+e·e)となることを示す． (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520572357310340992 (CiNii: 1520572357310340992)
125.	Jun-ichi Aoe : ダブル配列による有限状態機械の効率的インプリメンテーション, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J70-D, No.4, 653-662, 1987. (Summary) 本論文では，ダブル配列を一般の有限状態機械の状態遷移表に適用するための拡張方法が提案される．本手法では，この拡張を実現するために満足されるべきダブル配列の条件を定義する．この条件は，ダブル配列の要素(整数)の正と負を効率的に使用することによって設定される．そして，この条件を満足するダブル配列の構成アルゴリズム，および拡張されたダブル配列に対する遷移の追加と削除アルゴリズムを提案する．
126.	Jun-ichi Aoe and Mikako Yamauchi : 階層的知識構造の効率的記憶検索法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J70-D, No.2, 269-277, 1987. (Summary) 本論文では，階層表現を圧縮するためのアルゴリズムを提案する．本手法では，各節の共通なコード列を効率よく圧縮するために核節と呼ばれる特別な節を定義する．そして，この核節を利用したコード列の圧縮アルゴリズムと階層関係の判定アルゴリズムを与える．実験結果から，本手法によるコード列の圧縮率は約70%から85%のよい結果を得た．
127.	Ryosaku Shimada, Yoshiaki Okura and Jun-ichi Aoe : Nonbinary Arithmetic AN Codes Using Odd Radix Expressions, IEEE Transactions on Computers, Vol.C-34, No.11, 1050-1056, 1985. (Summary) 算術符号における2進表現の新しいクラスを定義し，R-Ary表現ろLee型算術距離を提案した．そして，この符号に対する誤り訂正能力を理論的に議論し，巡回AN符号への拡張性についても議論を加えた． (Link to Publication Site) ● Publication site (DOI): 10.1109/TC.1985.1676538 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0022151108 (DOI: 10.1109/TC.1985.1676538, Elsevier: Scopus)
128.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : Improvement of Lookahead Solution for Stack-Controlling LALR(1) Parsers, Transactions of the IEICE of Japan, Vol.E68, No.9, 575-578, 1985. (Summary) 本論文はLALR(1)パーサのスタック管理のための先読法の改善を示した．
129.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 局所的にスタックを使用するLALR(1)パーサの拡張, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J68-D, No.6, 1256-1263, 1985. (Summary) 本論文では，UP矛盾に対する二つの解決法を提案し，SCLRパーサの能力を拡張する．これらの解決法は，(1)状態の分割による方法と，(2)還元動作の分割による方法である．(1)の方法は直感的な方法であるので，適用範囲に制限がある．また，(2)の方法は(1)を補うために使用され，すべてのUP矛盾を解決できる．以上の解決法により，SCLRパーサはすべてのLALR(1)文法に対して構成可能となった．
130.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 行置換によるスパース行列の効率的縮小アルゴリズム, Transactions of Information Processing Society of Japan, Vol.26, No.2, 211-218, 1985. (Summary) 本論文では，種々のスパース行列に対する実験結果に基づいてffd法とHD条件を評価し，ffd法の改善法とHD条件に代わる経験的な条件を提案する．まず，ffd法の行置換法と行ソート法が改善され，改善された縮小法をffds法と呼ぶ．次にこのffds法が上記の(1)と(2)を満足するための条件(AV条件と呼ぶ)を提案する． (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1050282812867009024 (CiNii: 1050282812867009024)
131.	Jun-ichi Aoe, Takahiko Fudou, Yoneo Yamamoto and 島田良作 : Improvement of Stack-Controlling LALR(1) Parsers, Transactions of the IEICE of Japan, Vol.E67, No.11, 621-622, 1984. (Summary) 本論文はLALR(1)パーサのスタック管理の改良方を示した．
132.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : A Method for Improving String Pattern Matching Machines, IEEE Transactions on Software Engineering, Vol.SE-10, No.1, 116-120, 1984. (Summary) 本論文は文字列パターン照合のアルゴリズムの考察と改良の方法について論じた．
133.	Jun-ichi Aoe, Yoneo Yamamoto and Ryosaku Shimada : On the Definition of Stack Controlling LALR(1) Parsers, Transactions of the IEICE of Japan, Vol.E66-E, No.12, 722-723, 1983. (Summary) 本論文はLALR(1)パーサにおけるスタック管理法を提案し，その有効性を論じた．
134.	島田良作, Jun-ichi Aoe, Yoneo Yamamoto, 大倉良昭 and 堀江康雄 : HH型巡回ST-AN符号, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J66-D, No.12, 1239-1346, 1983. (Summary) 符号の誤り検出·訂正能力は，最小距離によって決まる．HwangとHartmannによって提案された2進巡回AN符号においては，最小距離が生成数の形から直接求まる．本論文は，その基本的な概念を巡回ST-AN符号に導入した新しいクラスの巡回ST-AN符号を提案する．
135.	Jun-ichi Aoe, Takashi Toujou, Yoneo Yamamoto, 島田良作 and Hiroshi Inada : パターンマッチングマシンの効率的記憶検索法, Transactions of Information Processing Society of Japan, Vol.24, No.4, 414-420, 1983. (Summary) 本論文では，Johnsonの方法をさらに改善する方法を提案する．本手法では，まずパターンマッチングマシンに対する状態遷移図の特徴を見いだし，これをJohnsonの記憶検索法の検索時間と記憶量の改善に利用する．次に，状態遷移図を構成するためのキーワードに長さの情報と状態番号を表現する二つの変数とを利用して，検索アルゴリズムを能率化する．
136.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : A Practical Method for Reducing Weak Precedence Parsers, IEEE Transactions on Software Engineering, Vol.SE-9, No.1, 25-30, 1983. (Summary) 本論文は弱優先順位文法を用いたパーサの実用的簡単化の方法を示した． (Link to Publication Site) ● Publication site (DOI): 10.1109/TSE.1983.236167 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0020597503 (DOI: 10.1109/TSE.1983.236167, Elsevier: Scopus)
137.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : A Practical Method for Reducing Sparse Matrices with Invariant Entries, International Journal of Computer Mathematics, Vol.12, 97-111, 1982. (Summary) 本論文はスパース行列を縮小·簡単化する方法において，実用的見地より関数を用いて実現し，その評価をおこなった． (Link to Publication Site) ● Publication site (DOI): 10.1080/00207168208803329 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0020242448 (DOI: 10.1080/00207168208803329, Elsevier: Scopus)
138.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 有限状態機械の効率的記憶検索法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J65-D, No.10, 1235-1242, 1982. (Summary) 本論文では，Johnsonの記憶検索法の改善点を指摘するとともに，この記憶法を実行する効率的縮小アルゴリズムを提案する．本手法は最適なものではないが，縮小化の部分処理単位毎に記憶量が最小となる条件を保証することでこの問題を実用的有効性の範囲内で解決している．又，縮小アルゴリズムで使用する主要なデータ構造にはビットベクトルを採用し，能率的演算を可能にしている．
139.	Jun-ichi Aoe, Yoneo Yamamoto, 島田良作 and 麻生真吾 : パターンマッチングマシンの一改善法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J65-D, No.8, 989-996, 1982. (Summary) 本論文では，Ahoらによるマッチングマシンの処理速度の高速化法と記憶量の縮小化法を提案し，改善されたマシンの構成法を与える．本手法では，マシンの各状態に処理速度と記憶量を改善するための各種条件を定義し，これらの条件の組み合わせによりマッチングアルゴリズムを何種類かの場合に分ける．
140.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 不変要素をもつスパース行列の縮小化に対する改善, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J64-D, No.10, 979-980, 1981. (Summary) 我々の提案した不変要素を持つスパース行列の縮小化に対する改善点を指摘する．
141.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 動作パターンによるLR(k)パーサの高速化, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J64-D, No.10, 940-946, 1981. (Summary) 本手法では，LALR(k)パーサのシフト，還元動作においてそれらの動作を能率化するための何種類かの条件を求め，それらの条件の組み合わせによってシフト，還元動作を実行する命令列のパターンをそれぞれ2，6種類定義する．従って，各状態からのシフト，還元動作はそれらが最も効率的に実行できるパターンの命令列を使用するので，個々の動作についてより綿密な能率化が実現できる．
142.	麻生真吾, Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 2回走査構文解析による誤り訂正, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J64-D, No.9, 903-904, 1981. (Summary) 構文誤りの検出と訂正に対して，2回走査構文解析を導入することで好結果を得たので報告する．
143.	Yasushi Kawamoto, Jun-ichi Aoe, Yoneo Yamamoto and Ryosaku Shimada : Application of BCH Codes to an Interminicomputer Communication System, Bulletin of Faculty of Engineering, The University of Tokushima, Vol.26, 69-76, 1981.
144.	Jun-ichi Aoe, ichirou Hukuoka, Yoneo Yamamoto and 島田良作 : 不変要素をもつスパース行列の実際的縮小法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J63-D, No.12, 1042-1049, 1980. (Summary) 語い解析部，パーサのようなオートマトンに基づく処理系の解析表は，その要素の値が変化しない静的スパース行列で表現できる．本論文では，これらの解析表の統一的縮小法を与えるために静的スパース行列を対象とする効率的な縮小法を提案する．
145.	Jun-ichi Aoe, Ichiro Fukuda, Yoneo Yamamoto and Ryosaku Shimada : Practical Method for Reducing Lexical and Syntax Analyzer Tables, Bulletin of Faculty of Engineering, The University of Tokushima, Vol.17, 11-27, 1980.
146.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 縮小された順位パーサのエラー回復とシュミレーション, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J62-D, No.10, 681-688, 1979. (Summary) 本論文ではこのパーサπに対して適用可能となるエラー回復法を与える．本回復法は，Wirthの回復法で使用するような余分な表を必要としないので，コンパクトなパーサの表現に対して有効なものである．実用プログラミング言語XPLに対する本回復法のシミュレーション結果より，パーサπの全体の記憶量が縮小された．
147.	島田良作, Yoneo Yamamoto, Jun-ichi Aoe, Yoshiaki Ookura and Yasuo Horie : HH型巡回ST-AN符号, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J66-D, No.12, 1339-1346, 1979. (Summary) 符号の誤り検出·訂正能力は，最小距離によって決まる．HwangとHartmannによって提案された2進巡回AN符号においては，最小距離が生成数の形から直接求まる．本論文は，その基本的な概念を巡回ST-AN符号に導入した新しいクラスの巡回ST-AN符号を提案する．
148.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 順位パーサの実際的縮小法に対する補足, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J62-D, No.9, 599-600, 1979. (Summary) 行列形式による順位パーサの縮小法に対する補足を与え，その有効性を実用のプログラミング言語に対して確かめる．
149.	Jun-ichi Aoe, Toshihiko Akitomo, Yoneo Yamamoto and 島田良作 : ALGOL(JIS3000)に対するGO TOグラフによるLR(I)パーサの構成と解析シミュレーション, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J62-D, No.8, 551-552, 1979. (Summary) ALGOL(JIS3000)に対して，GO TOグラフによるLR(I)パーサを構成し，その解析シミュレーション結果を与える．
150.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 行列形式を使用したLR(k)パーサの実際的最適化, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J62-D, No.7, 443-450, 1979. (Summary) 本論文では行列形式によるLR(k)解析表の新しい構成法と縮小法を提案し，コンパクトで且つ高速なパーサを得るための自動生成システムを開発し，実用のプログラミング言語EULER，XPL，ALGOLに対する適用結果を示す．これらの結果に基づき，本方法によるパーサが従来の表形式によるパーサより縮小率では26%∼33%改善され，解析速度では約1.8倍高速化されることが分かった．
151.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : LL(I)解析表の一構成法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J61-D, No.12, 948-949, 1978. (Summary) スパースなLL(I)行列を表形式で表現する方法を提案し，得られたパーサの解析の能率化に対する評価を与える．
152.	Jun-ichi Aoe, Yoneo Yamamoto and Ryosaku Shimada : A Technique for Generating Optimal Parsers for Precedence Grammars, Bulletin of Faculty of Engineering, The University of Tokushima, Vol.15, 39-49, 1978.
153.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 2組の弱順位関数の存在性, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J61-D, No.9, 722-723, 1978. (Summary) エラー検出位置の順位行列に対する等価性と文法修正を考慮した場合に対して，2組の弱順位関数の存在性を確かめる．
154.	Yoneo Yamamoto, Jun-ichi Aoe and 島田良作 : パージングテーブルによる弱順位パーサの補足, Transactions of Information Processing Society of Japan, Vol.19, No.8, 788-789, 1978. (Summary) 本論文はテーブルドリブン方式による弱順位パーサの改良点を述べ，効率の向上を図った．
155.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : Practical Method for Reducing Precedence Parsers, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J61-D, No.6, 387-394, 1978. (Summary) 本論文では順位行列をより小さな行列へと変換する方法を提案し，次の特徴を示す．(1)本方法は全ての順位文法に対して適用できる．(2)得られたパーサは有効なエラー検出能力をもち，その大きさも関数のものと同程度になる．本パーサは順位行列の冗長な情報を除去するために，従来の還元動作を示す順位関係を連続還元動作の情報として使用する．
156.	Jun-ichi Aoe, Yoneo Yamamoto and Ryosaku Shimada : An Algorithm for Constructing Syntax Analyzer of Context Free Languages, Bulletin of Faculty of Engineering, The University of Tokushima, Vol.23, 145-151, 1978. (Link to Search Site for Scientific Articles) ● CiNii @ National Institute of Informatics (CRID): 1520290885180187136 (CiNii: 1520290885180187136)
157.	Jun-ichi Aoe, Yoneo Yamamoto and 島田良作 : 右順位関係の一義化について, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J60-D, No.10, 890-891, 1977. (Summary) RDT，LDTを利用することにより，従来の右順位関係に対する一義化の方法に問題があることを指摘する．
158.	Jun-ichi Aoe, Yoneo Yamamoto, 島田良作 and 原田尚文 : 弱順位パーサに対する解析シミュレーションとその評価, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J60-D, No.10, 887-888, 1977. (Summary) 弱順位行列による弱順位パーサと2組の弱順位関数による弱順位パーサに対する解析シミュレーションを行い，解析速度について評価を与える．
159.	Jun-ichi Aoe and Yoneo Yamamoto : GO TOグラフによるLR(I)パーサの簡単化, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J60-D, No.8, 578-585, 1977. (Summary) LR(k)パーサの縮小法に関する試みは，数多く提案されているが，解析方法の簡単化に関する提案はまだ見あたらない．本論文では，この試みとしてLR(I)パーサに対する能率的な解析方法を提案する．この方法では，冗長な還元動作を明確にするためにGO TOグラフを構成する．そして，このグラフを使用したLR(I)パーサの解析方法と縮小法について述べる．
160.	Jun-ichi Aoe, Yoneo Yamamoto, 原田尚文 and 島田良作 : パージングテーブルによる弱順位パーサの構成法, Transactions of Information Processing Society of Japan, Vol.18, No.5, 438-444, 1977. (Summary) 本論文は弱順位パーサの構成法にテーブルを導入し，テーブルドリブン型のパーサの実現法を論じた．
161.	Jun-ichi Aoe, Yoneo Yamamoto, 原田尚文 and 島田良作 : 弱順位関数の一構成法, The Transactions of the Institute of Electronics, Information and Communication Engineers D, Vol.J60-D, No.1, 72-79, 1977. (Summary) 従来の弱順位関数によるパーサは，受理すると言語のクラス及びエラー処理能力が実用的なものでない．その理由として次の2点があげられる． (i)1対の関数(f,g)で3種類(還元，シフト，エラー)の関数を表現している． (ii)その表現が関数f,gの大小関係である．本論文で提案する関数化はこの2点を次のように改善する．その結果，有効なエラー処理能力をもつ実現規模のパーサが実現可能となった．
162.	Yoneo Yamamoto and Jun-ichi Aoe : Weak Precedence Parsers by Parsing Automaton, Bulletin of Faculty of Engineering, The University of Tokushima, Vol.22, 123-132, 1977.

Academic Letter:

1.	Takeshi Arita, Kazuhiro Morita, Shoji Mizobuchi and Jun-ichi Aoe : 特徴ベクトルによる全文検索の一改善法, Transactions of Information Processing Society of Japan, Vol.39, No.3, 826-829, 1998. (Summary) 本論文では，対象文書の文字列頻度を利用して，目標排除率を保証したベクトル構成法を提案する．同一ベクトル長では，提案手法が従来手法より排除率はつねに高くなることを，また排除率95%を達成する場合，提案手法のベクトル長は従来法の約1/6で実現できることを実証した．
2.	辻孝子, 安藤一秋, Masami Shishibori and Jun-ichi Aoe : 意味変化を考慮した文書短縮法, Transactions of Information Processing Society of Japan, Vol.37, No.11, 2142-2145, 1996. (Summary) 形態素置換による文書短縮では，文解釈の意味変化と処理の偏りが生じる．本論文では，意味変化の問題に対して，意味変化率の低い順に短縮規則を分類し，この順位に従った短縮アルゴリズムを提案する．提案手法は，20人の被験者を対象に行った実験結果により，短縮規則及び短縮アルゴリズムの有効性が実証された．

Review, Commentary:

1.	Jun-ichi Aoe : 仮名漢字変換にはどのようなアルゴリズムが使われているか, 情報処理学会会誌, Vol.35, No.2, 157-158, Feb. 1994.
2.	Jun-ichi Aoe : キー検索技法ートライ法とその応用, 情報処理学会会誌, Vol.34, No.2, 244-251, Feb. 1993.
3.	Jun-ichi Aoe and Takashi Sato : キー検索技法ー探査木法とその応用, 情報処理学会会誌, Vol.34, No.1, 106-113, Jan. 1993.
4.	Jun-ichi Aoe : キー検索技法ー動的ハッシュ法とその応用, 情報処理学会会誌, Vol.33, No.12, 1465-1472, Dec. 1992.
5.	Jun-ichi Aoe : キー検索技法ー静的ハッシュ法とその応用, 情報処理学会会誌, Vol.33, No.11, 1359-1366, Nov. 1992.
6.	Jun-ichi Aoe : スパース行列の圧縮アルゴリズム, bit, Vol.22, No.6, 68-75, Jun. 1990.
7.	Jun-ichi Aoe : 自然言語辞書の検索-ダブル配列による高速ディジタル検索アルゴリズム, bit, Vol.21, No.6, 68-75, Jun. 1989.

Proceeding of International Conference:

1.	Kiyoshi Yasuda, Masao Fuketa, Kazuhiro Morita, Jun-ichi Aoe and Noriaki Kuwahara : Videophone Conversation of Two Individuals with Dementia using an Anime Agent System, Proceedings of 7th International Conference on Digital Human Modeling and Applications in Health, Safety, Ergonomics and Risk Management (HCI International 2016), 317-326, Toronto, Jul. 2016. (Link to Publication Site) ● Publication site (DOI): 10.1007/978-3-319-40247-5_32 (Link to Search Site for Scientific Articles) ● Search Scopus @ Elsevier (DOI): 10.1007/978-3-319-40247-5_32 (DOI: 10.1007/978-3-319-40247-5_32)
2.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Trie Compact Representation using Double-array Structures with String Labels, Proceedings of 2015 IEEE 8th International Workshop on Computational Intelligence and Applications (IWCIA), Hiroshima, Nov. 2015. (Link to Publication Site) ● Publication site (DOI): 10.1109/IWCIA.2015.7449451 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84966691902 (DOI: 10.1109/IWCIA.2015.7449451, Elsevier: Scopus)
3.	Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Method of Music Retrieval Using Impression Keywords, Proceedings of 7th International Conference on Computer Science and Information Technology (ICCSIT2014), Barcelona, Dec. 2014. (Summary) This paper presents a music retrieval method focusing on the impression keywords. In the presented method, impression keywords as queries is constructed by using Twitter beforehand. The impression vector to music is generated by using this impression keyword set. And, the retrieval is processed by measuring the similarity to impression vectors with a query. From experimental results, it turns out that the recommended music displayed as a retrieval result appropriately expresses the impression of the user requests.
4.	Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Comparisons of Efficient Implementations for DAWG, Proceedings of 7th International Conference on Computer Science and Information Technology (ICCSIT2014), Barcelona, Dec. 2014.
5.	Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Experimental Observations of Construction Methods for Double Array Structures using Linear Functions, Proceedings of 7th International Conference on Computer Science and Information Technology (ICCSIT2014), Barcelona, Dec. 2014.
6.	Kiyoshi Yasuda, Masao Fuketa and Jun-ichi Aoe : An anime agent system for reminiscence therapy, The 9th World Conference of Gerontechnology(ISG 2014), 118-119, Taipei, Jun. 2014.
7.	Yoshia Bando, Hitoshi Tokushige, Jun Asatani, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Soft-input and output Decoding using Minimum Distance Search for Reed-Solomon Codes, 2014 RISP International Workshop on Nonlinear Circuits, Communications and Signal Processing, Honolulu, Feb. 2014.
8.	Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Cloud Based Communication System for Elders Using Dialogue Control, Proceedings of 6th International Conference on Computer Science and Information Technology (ICCSIT2013), Paris, Dec. 2013.
9.	Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A Retrieval Method for Double Array Structures by Using Byte N-Gram, Proceedings of 6th International Conference on Computer Science and Information Technology (ICCSIT2013), 155-159, Paris, Dec. 2013. (Summary) The key retrieval algorithm for the double array is fast and compact. An edge of the trie is represented by a character in previous researches related to the double array. Therefore, this paper proposes the data structure and the retrieval algorithm for the double array which represents an edge by n-byte. This paper also proposes a method to compress CODE array. From the experimental results, the size and the retrieval speed of the proposed method became 62-64% and 1.18-1.3 times, respectively. When the CODE is compressed, the sizes of the proposed method became 41-59%
10.	Takuki Ogawa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Effects of an Algorithm with a Recommendation Tree for Indirect Speech Acts, Proceedings of 6th International Conference on Computer Science and Information Technology (ICCSIT2013), 113-117, Paris, Dec. 2013.
11.	Kiyoshi Yasuda and Jun-ichi Aoe : A Computer Agent System for Conversing with Individuals with Dementia, 11th International Conference on Alzheimer's & Parkinson's Diseases, Florence, Mar. 2013.
12.	Masao Fuketa, Toshiyuki Tamai, Kazuhiro Morita and Jun-ichi Aoe : A Fast Retrieval Method of Similar Strings Using Trie, Proceedings of International Research Symposium on Interdisciplinary Approaches in Management, Engineering and Technology, 167-171, Singapore, Dec. 2012. (Summary) With the rapid growth of the Internet, demands for retrieving similar strings have been increasing. There are many methods for retrieving similar strings, and most methods must build dedicated dictionaries. Oflazer proposed a retrieval method of similar strings using trie which retrieves keywords exactly. We improve the Oflazer's method and propose a data structure and a fast retrieval algorithm for similar strings by the existing trie. From experimental results, the retrieval speed of the proposed method is about 3.5 times faster than that of the conventional method.
13.	Hiroya Kitagawa, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : An efficient method for the sequential pattern mining including restricted words, Proceedings of International Research Symposium on Interdisciplinary Approaches in Management, Engineering and Technology, 84-87, Singapore, Dec. 2012.
14.	Kazuhiro Morita, Hiroya Kitagawa, Takuki Ogawa, Masao Fuketa and Jun-ichi Aoe : An Extraction Technique for Object Relationships including the Direction of Relations, Proceedings of International Research Symposium on Interdisciplinary Approaches in Management, Engineering and Technology, 66-70, Singapore, Dec. 2012.
15.	Takuki Ogawa, Hiroaki Bando, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Effects of Collaborative Communication Robots by Touch Actions and Dialogues, Proceedings of International Research Symposium on Interdisciplinary Approaches in Management, Engineering and Technology, 39-43, Singapore, Dec. 2012.
16.	Abdunabi UBUL, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A New Approach for Summarizing Documents using Generic Impressions Expressions, Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2011), 469-474, Tokushima, Nov. 2011. (Link to Publication Site) ● Publication site (DOI): 10.1109/NLPKE.2011.6138245 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84857314090 (DOI: 10.1109/NLPKE.2011.6138245, Elsevier: Scopus)
17.	Takuki Ogawa, Kazuhiro Morita, Hiroya Kitagawa, Masao Fuketa and Jun-ichi Aoe : A study of dialogue robots with haptic interactions, Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2011), 285-288, Tokushima, Nov. 2011. (Link to Publication Site) ● Publication site (DOI): 10.1109/NLPKE.2011.6138210 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-84857286280 (DOI: 10.1109/NLPKE.2011.6138210, Elsevier: Scopus)
18.	Kazuhiro Morita, Shuto Arai, Hiroya Kitagawa, Masao Fuketa and Jun-ichi Aoe : Dynamic Construction of Hierarchical Thesaurus using Co-occurrence Information, Proceedings of 2nd International Conference on Networking and Information Technology (ICNIT 2011), 231-239, Hong Kong, Nov. 2011.
19.	Masao Fuketa, Hiroya Kitagawa, Takuki Ogawa, Kazuhiro Morita and Jun-ichi Aoe : Compression of Double Array Structures for Fixed Length Keywords, Proceedings of 2nd International Conference on Networking and Information Technology (ICNIT 2011), 158-165, Hong Kong, Nov. 2011.
20.	Hiroya Kitagawa, Atlam EL-Sayed, Takuki Ogawa, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A Fast and Compact Method for Document Summarization on Mobile Devices using Non-Negative Matrix Factorization, Proceedings of 2nd International Conference on Networking and Information Technology (ICNIT 2011), 150-157, Hong Kong, Nov. 2011.
21.	Toshihiro Satomi, Hiroya Kitagawa, Takuki Ogawa, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Rule-based Knowledge Representation of Detecting Personal and Confidential Contexts, Proceedings of Sixth International Knowledge Management in Organizations Conference (KMO 2011), Tokyo, Sep. 2011.
22.	Hiroya Kitagawa, Takuki Ogawa, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A String Searching Method for Multi-Keywords by Double Array Structures, Proceedings of Sixth International Knowledge Management in Organizations Conference (KMO 2011), Tokyo, Sep. 2011.
23.	Takuki Ogawa, Hiroaki Bando, Hiroya Kitagawa, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Empathic Robot Communication by Touch-based Dialog Interfaces, Proceedings of Sixth International Knowledge Management in Organizations Conference (KMO 2011), Tokyo, Sep. 2011.
24.	Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A New Method for Extracting Arabic FA Terms from Domain-Specific Corpora using Part-Of-Speech (POS), Proceedings of 5th International Conference on Intelligent Computing and Information Systems (ICICIS 2011), 88-94, Cairo, Egypt, Jun. 2011.
25.	Abdunabi UBUL, Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Method for Generating Document Summary using Field Association Knowledge and Subjectively Information, Proceedings of the 6th International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2010), 630-636, Beijing, Aug. 2010. (Link to Publication Site) ● Publication site (DOI): 10.1109/NLPKE.2010.5587853 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-78649291028 (DOI: 10.1109/NLPKE.2010.5587853, Elsevier: Scopus)
26.	Li Wang, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : A New Method for Solving Context Ambiguities using Field Association Knowledge, Proceedings of the 6th International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2010), 41-46, Beijing, Aug. 2010. (Link to Publication Site) ● Publication site (DOI): 10.1109/NLPKE.2010.5587858 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-78649273080 (DOI: 10.1109/NLPKE.2010.5587858, Elsevier: Scopus)
27.	Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Automatic Building an Extensive Arabic FA Terms Dictionary, Proceedings of World Academy of Science, Engineering and Technology, Vol.68, 1121-1127, Paris, Jul. 2010.
28.	Masao Fuketa, Nobuo Fujisawa, Hiroaki Bando, Kazuhiro Morita and Jun-ichi Aoe : A Retrieval Method of Similar Strings Using Substrings, Proceedings of 2nd International Conference on Computer Engineering and Applications (ICCEA 2010), Vol.2, 300-304, Bali, Indonesia, Mar. 2010. (Summary) With the rapid growth of the Internet, demand for retrieving similar strings to an input string has been increasing. Edit distance is the similarity of two strings. Moreover, an input string must be compared with all strings in a dictionary in order to retrieve similar strings by computing edit distance, and this process is very time-consuming work. This paper proposes a structure of a dictionary for retrieving similar strings effectively and a method to output edit distance of strings in descending order at high speed. This method can retrieve all similar strings and the speed of this method is faster than that of a n-gram method.
29.	Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Customized Tries for Weighted Key Completion, Proceedings of 2nd International Conference on Computer Engineering and Applications (ICCEA 2010), Vol.1, 286-290, Bali, Indonesia, Mar. 2010.
30.	Dorji C. Tshering, Atlam EL-Sayed, Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A New Text Classification Methodology Using Field Association Terms, Proceedings of 3rd International Conference on Data Management (ICDM 2010), Vol.1, 275-286, Ghaziabad, India, Mar. 2010.
31.	Atlam EL-Sayed, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : New Method using Declinable Words and Concurrent Words to create a large number of FA Words, Proceedings of 2nd International Conference on Agents and Artificial Intelligence (ICAART 2010), Vol.1, 527-531, Valencia, Jan. 2010.
32.	Yutaka Inada, Hideo Nakano, Shinkaku Kashiji and Jun-ichi Aoe : Intelligent QA Systems Using Semantic Expressions, Proceedings of 12th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2009), Vol.2, 308-316, Santiago, Chile, Sep. 2009.
33.	Li Wang, Susumu Yata, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita, Hiroaki Bando and Jun-ichi Aoe : A Method of Building Chinese Field Association Knowledge from Wikipedia, Proceedings of International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2009), 568-572, Dalian, Sep. 2009. (Link to Publication Site) ● Publication site (DOI): 10.1109/NLPKE.2009.5313781 (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-72249097881 (DOI: 10.1109/NLPKE.2009.5313781, Elsevier: Scopus)
34.	Dorji C. Tshering, Susumu Yata, Atlam EL-Sayed, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Building a dynamic and Comprehensive field Association Terms Dictionary from Domain-Specific Corpora using Linguistic Knowledge, Proceedings of The fifth Corpus Linguistics Conference, Liverpool, UK, Jul. 2009.
35.	Kazuhiro Morita, Yuya Iwabu, Atlam EL-Sayed, Masao Fuketa and Jun-ichi Aoe : A Method of Extracting Word Tendencies to Understand Popular Subjects, Proceedings of 5th International Conference on Innovations in Information Technology (Innovations'08), Al Ain, UAE, Dec. 2008.
36.	Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Fast String Matching with Space-efficient Word Graphs, Proceedings of 5th International Conference on Innovations in Information Technology (Innovations'08), Al Ain, UAE, Dec. 2008. (Summary) String matching is one of the fundamentals in various text-processing applications. This paper describes a fast string matching algorithm using a compact pattern matching machine DAWG. DAWG is traditionally implemented with a 2-dimensional linked list or matrix. However, DAWGs with these structures have drawbacks, the lookup time of the linked list based one is slow and the space requirement of the matrix based one is large. Therefore, this paper proposes a novel DAWG based on a compacted double-array, which overcomes the drawbacks of traditional ones. Experimental results show that the novel DAWG is more efficient than traditional ones.
37.	Mahmoud Rokaya, Atlam EL-Sayed, Masao Fuketa, Dorji C. Tshering and Jun-ichi Aoe : Ranking FA terms using Co-word analysis, Proceedings of 3rd International Computer Engineering Conference (ICENCO'2007), CI-19-CI-24, Giza,Egypt, Dec. 2007.
38.	Jun-ichi Aoe and Atlam EL-Sayed : An Estimation Method of FAQ Service Quality by Introducing Measurements, 11th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2007), Vietri sul Mare, Italy, Sep. 2007.
39.	Tomoko Yoshinari, Atlam EL-Sayed, Kazuhiro Morita, Kumiko Kiyoi and Jun-ichi Aoe : Automatically Combination with Expressions using Collocation Relation, Proceedings of International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2007), Beijing, Sep. 2007.
40.	Kumiko Kiyoi, Atlam EL-Sayed, Masao Fuketa, Tomoko Yoshinari and Jun-ichi Aoe : Extraction Method of Number Expressions and Knowledge from Medical Text using Numerical Representation, Proceedings of International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2007), Beijing, Sep. 2007.
41.	Atlam EL-Sayed, Elmarhomy Ghada, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Building New Field Association Word Candidates Automatically Using Search Engine-Data Analysis-, Proceedings of International Conference on Natural Language Processing and Knowledge Engineering (IEEE NLP-KE 2007), 22-27, Beijing, Aug. 2007.
42.	Masao Fuketa, Atlam EL-Sayed, Elmarhomy Ghada, Kazuhiro Morita and Jun-ichi Aoe : Building New Field Association Term Candidates Automatically by Search Engine, Proceedings of 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2006), Vol.2, 325-330, Bournemouth, UK, Oct. 2006.
43.	Kazuhiro Morita, Atlam EL-Sayed, Elmarhomy Ghada, Masao Fuketa and Jun-ichi Aoe : A New Approach for Improving Field Association Term Dictionary Using Passage Retrieval, Proceedings of 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2006), Vol.2, 303-309, Bournemouth, UK, Oct. 2006.
44.	Jun Harada, Masao Fuketa, Atlam EL-Sayed, Toru Sumitomo, Wataru Hiraishi and Jun-ichi Aoe : Estimation of FAQ Knowledge Bases by Introducing Measurements, Proceedings of 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2006), Vol.2, 275-280, Bournemouth, UK, Oct. 2006.
45.	Atlam EL-Sayed, Elmarhomy Ghada, Kazuhiro Morita and Jun-ichi Aoe : A New Approach for Automatic Building Field Association Words Using Selective Passage Retrieval, Proceedings of 10th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2006), Vol.2, 317-324, Bournemouth, UK, Oct. 2006.
46.	Susumu Yata, Masaki Oono, Kazuhiro Morita, Toru Sumitomo and Jun-ichi Aoe : Double-Array Compression by Pruning Twin Leaves and Unifying Common Suffixes, Proceedings of International Conference on Computing and Informatics (ICOCI 2006), Kuala Lumpur, Malaysia, Jun. 2006.
47.	Masaki Oono, Masao Fuketa, Kazuhiro Morita, Yutaka Inada, Yo Murakami and Jun-ichi Aoe : A Compression Method Using Link-Trie Structure for Natural Language Dictionaries, Proceedings of International Conference on Computing and Informatics (ICOCI 2006), Kuala Lumpur, Malaysia, Jun. 2006.
48.	Kazuhiro Morita, Atlam EL-Sayed, Masao Fuketa, Elmarhomy Ghada, Masaki Oono, Toru Sumitomo and Jun-ichi Aoe : New Approach for Speeding-up Technique of the Retrieval Using Dynamic Full-Text Search Algorithm, Proceedings of 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2005), Vol.4, 619-625, Melbourne, Sep. 2005.
49.	Masao Fuketa, Atlam EL-Sayed, Hiro Hanafusa, Kazuhiro Morita, Shinkaku Kashiji, Rokaya Mahmoud and Jun-ichi Aoe : A New Technique of Determining Speaker' s Intention for Sentences in Conversation, Proceedings of 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2005), Vol.4, 612-618, Melbourne, Sep. 2005.
50.	Atlam EL-Sayed, Elmarhomy Ghada, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : An Improvement Approach for Word Tendency Using Decision Tree, Proceedings of 9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2005), Vol.4, 606-611, Melbourne, Sep. 2005.
51.	Kazuhiro Morita, Yuki Kadoya, El-Sayed Atlam, Masao Fuketa, Shinkaku Kashiji and Jun-ichi Aoe : A Method of Extracting and Evaluating Popularity and Unpopularity for Natural Language Expressions, Proceedings of 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), 567-574, Wellington, New Zealand, Sep. 2004.
52.	Shinkaku Kashiji, Toru Sumitomo, Kazuhiro Morita, Masaki Oono, Masao Fuketa and Jun-ichi Aoe : A Fast Dynamic Method Using Memory Management, Proceedings of 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), 558-566, Wellington, New Zealand, Sep. 2004.
53.	Yuki Kadoya, El-Sayed Atlam, Kazuhiro Morita, Masao Fuketa, Toru Sumitomo and Jun-ichi Aoe : A New Classification Method of Determining the Speaker's Intention for Sentences in Conversation, Proceedings of 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), 549-557, Wellington, New Zealand, Sep. 2004.
54.	Toru Sumitomo, Yuki Kadoya, Atlam EL-Sayed, Kazuhiro Morita, Shinkaku Kashiji and Jun-ichi Aoe : A New Method of Detecting Time Expressions for E-mail Messages -Algorithm Version-, Proceedings of 8th International Conference on Knowledge-Based Intelligent Information and Engineering Systems (KES 2004), 541-548, Wellington, New Zealand, Sep. 2004.
55.	Kazuhiro Morita, Atlam EL-Sayed, Yuki Kadoya, Toru Sumitomo, Shinkaku Kashiji and Jun-ichi Aoe : A Time Priority Information for Determining Important E-mail Messages, Proceedings of Tenth International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU2004), 7-8, Perugia, Italy, Jul. 2004.
56.	Yuki Kadoya, Atlam EL-Sayed, Shinkaku Kashiji and Jun-ichi Aoe : A Sentence Classification Method by Using Intention Association Expressions, Proceedings of Tenth International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU2004), 5-6, Perugia, Italy, Jul. 2004.
57.	Toru Sumitomo, Yuki Kadoya, Masao Fuketa, Kazuhiro Morita, Shinkaku Kashiji and Jun-ichi Aoe : An New E-mail Filtering Technique Using Time Priority Measurement, Proceedings of the Ninth IEEE Symposium on Computers and Communications (ISCC'04), 122-127, Alexandria, EGYPT, Jun. 2004. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-10844244827 (Elsevier: Scopus)
58.	Kazuhiro Morita, El-Sayed Atlam, Masao Fuketa, Yuki Kadoya, Toru Sumitomo and Jun-ichi Aoe : A new Classification Sentence Technique Using Intension Expressions, Proceedings of the Ninth IEEE Symposium on Computers and Communications (ISCC'04), 98-103, Alexandria, EGYPT, Jun. 2004. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-10844264581 (Elsevier: Scopus)
59.	Kazuhiro Morita, El-Sayed Atlam, El-Marhomy Ghada and Jun-ichi Aoe : New Classification Technique Using Co-occurrence Word Information, Proceedings of Fourth International Conference on Intelligent Technologies (Intech'03), 36-42, Chiang Mai, Thailand, Dec. 2003.
60.	Masaki Oono, Kazuhiro Morita, Masao Fuketa, Mikio Oda, Jun Harada and Jun-ichi Aoe : An Efficient Key Updating Algorithm for Double-Array Structure, Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics (SCI2003), Vol.12, 311-313, Orlando, Jul. 2003.
61.	Kazuhiro Morita, Yuki Kadoya, El-Sayed Atlam, Yasuhiko Fujita, Atsushi Sakakibara and Jun-ichi Aoe : Word Classification and Systematization Using Co-Occurrence Word Information, Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics (SCI2003), Vol.12, 305-310, Orlando, Jul. 2003.
62.	El-Sayed Atlam, El-Marhomy Ghada, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Deriving English Language Field Association Terms from Compound Words, Proceedings of the 7th World Multiconference on Systemics, Cybernetics and Informatics (SCI2003), Vol.12, 293-298, Orlando, Jul. 2003.
63.	Masaki Oono, Kazuhiro Morita, EL-Sayed Atlam, Yuki Kadoya and Jun-ichi Aoe : A New Compact Deletion Algorithm for Double-Array Structures, Proceedings of 2002 IEEE International Conference on Systems, Man, and Cybernetics, Vol.4, 577-582, Hammamet, Tunisia, Oct. 2002. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036967133 (Elsevier: Scopus)
64.	EL-Sayed Atlam, Masao Fuketa, Shinkaku Kashiji, Hiroyuki Nakata and Jun-ichi Aoe : A New Method for Construction Filed Association Terms Using Co-occurrence Words and Declinable Words Information, Proceedings of 2002 IEEE International Conference on Systems, Man, and Cybernetics, Hammamet, Tunisia, Oct. 2002. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036966423 (Elsevier: Scopus)
65.	Masao Fuketa, EL-Sayed Atlam, Kazuhiro Morita, Masaki Oono and Jun-ichi Aoe : A Compression Algorithm Using Integrated Record Information for Translation Dictionaries, Proceedings of 2002 IEEE International Conference on Systems, Man, and Cybernetics, Vol.4, 588-593, Hammamet, Tunisia, Oct. 2002. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036968758 (Elsevier: Scopus)
66.	Kazuhiro Morita, Masao Fuketa, EL-Sayed Atlam, Yasuhiko Fujita and Jun-ichi Aoe : A Fast Attribute Matching Algorithm of Case Structures Using Trie Structures, Proceedings of 2002 IEEE International Conference on Systems, Man, and Cybernetics, 583-587, Hammamet, Tunisia, Oct. 2002. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0036966369 (Elsevier: Scopus)
67.	Masami Shishibori, Satoru Tsuge, Kazuaki Ando and Jun-ichi Aoe : A Filtering Method based on Multi-attribute Information, International Conference on Information-2002, Series of Information & Management Sciences, Vol.3, 160-165, Beijing, Jul. 2002. (Summary) ネットワーク技術の発展に伴い，メイルでの情報伝達手段が一般化してきたが，その反面，日々大量のスパムメイルが着信され，日常業務に支障をきたすことが社会問題となっている．本論文では，スパムメイルの形態に特徴があることに着目し，メイル文書内の多属性情報(文字種，表現方法，出現単語，URL，メイルアドレス等)でスパムメイルの形態を学習し，学習内容に応じてスパムメイルの判別分析する手法を提案する．
68.	Masami Shishibori, Kazuaki Ando and Jun-ichi Aoe : A E-mail Filtering System Based on Personal Profiles, Proceedings of the Sixth Natural Language Processing Pacific Rim Symposium, 609-616, Tokyo, Nov. 2001. (Summary) 個人の好みや履歴を反映したプロファイルを用いてメイル文書のフィルタリングを行うシステムにおいて，学習データ数が少ない場合に，作成されるプロファイルがスパース(疎)になり，適切なフィルタリングが行えないことが問題になる．本論文では，学習データが少ない場合にもプロファイルの内容を線形補完し，適切にフィルタリングする手法を提案し，実験により本手法の有効性を確認する．
69.	Kazuaki Ando, Toshinori Yamasaki, Masami Shishibori and Jun-ichi Aoe : Automatic Text Summarization based on Keyword Derivation, Proceedings of 2001 IEEE International Conference on Systems, Man, and Cybernetics, 464-469, Tucson, Arizona, USA, Oct. 2001. (Summary) 従来の文書要約技術は，本文の中に用いられて単語を取捨選択しながら要約文を生成するものが主流であった．本論文では，概念辞書，類義語辞書を用いてフレーズや単語を言い換えることによって，本文中に出現していない単語を派生し，派生させた単語を適時用いながら要約文を生成する手法を提案する． (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0035723574 (Elsevier: Scopus)
70.	Masao Fuketa, Masaki Oono, Kazuhiro Morita and Jun-ichi Aoe : On the Construction of Reduced Double Array Structures by Dividing Tries, Proceedings of 2001 IEEE International Conference on Systems, Man, and Cybernetics, 500-505, Tucson, Arizona, USA, Oct. 2001. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0035725622 (Elsevier: Scopus)
71.	Kazuhiro Morita, Akihiro Tanaka, Masao Fuketa and Jun-ichi Aoe : Implementation of Update Algorithms for a Double-Array Structure, Proceedings of 2001 IEEE International Conference on Systems, Man, and Cybernetics, 494-499, Tucson, Arizona, USA, Oct. 2001. (Link to Search Site for Scientific Articles) ● Summary page in Scopus @ Elsevier: 2-s2.0-0035723689 (Elsevier: Scopus)
72.	El-sayed Atlam, Masaki Oono, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Similarity Measurement using Two Objects Weight Function, Proceedings of 5th International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies (KES'2001), 596-600, Osaka, Sep. 2001.
73.	El-sayed Atlam, Akihiro Tanaka, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : An Efficient Construction Method of Compound Field Association Words, Proceedings of 5th International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies (KES'2001), 591-595, Osaka, Sep. 2001.
74.	Sangkon Lee, Akihiro Tanaka, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Knowledge Discovery for Document Classification, Proceedings of 5th International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies (KES'2001), 586-590, Osaka, Sep. 2001.
75.	Masami Shishibori, Minsoo Jung, Satoru Tsuge and Jun-ichi Aoe : Improvement of the Hierarchical Compact Patricia Trie for a Dynamic Large Key Set, Proceedings of 5th International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies (KES'2001), 581-585, Osaka, Sep. 2001. (Summary) パトリシアトライを階層的に分割管理し，分割した各パトリシアトライをコンパクトなビット列に圧縮する手法としてHPaCB-treeが獅々堀らにより提案されていたが，動的なキー集合に対しては適用できなかった．本論文では，HPaCB-treeの動的更新アルゴリズムを提案し，実験により本アルゴリズムの有効性を確認した．
76.	Makoto Okada, El-sayed Atlam, Masami Shishibori and Jun-ichi Aoe : A Method to Estimate the Trend of Words by Using a Decision Tree, Proceedings of 5th International Conference on Knowledge-Based Intelligent Information Engineering Systems & Allied Technologies (KES'2001), 372-376, Osaka, Sep. 2001. (Summary) 本論文では，単語の出現頻度の時間軸上での変化に着目し，決定木学習により単語の流行性を判定する手法を提案する．本手法では，各単語を安定語，衰退語，流行語といった3種類のクラスに分類し，各単語の時間軸上での頻度変化グラフから算出した回帰直線を基にして，入力単語のクラスを決定木を用いて判別分析する．
77.	Toru Sumitomo, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A method of compressing natural language dictionaries by using trie structures, Proceedings of the 5th World Multiconference on Systemics, Cybernetics and Informatics (SCI2001) and the 7th International Conference on Information Systems Analysis and Synthesis (ISAS 2001), Vol.7, 83-88, Florida, Jul. 2001.
78.	El-sayed Atlam, Masao Fuketa and Jun-ichi Aoe : An Improved Method of Indexing Words Based on Time-Series Variation, The 2001 International Technical Conference on Circuits/Systems, Computers and Communications, Vol.1, Tokushima, Jul. 2001.
79.	EL-Sayed Atlam, Sangkon Lee, Kazuhiro Morita, Masami Shishibori and Jun-ichi Aoe : Word Popularity based on Time-Series Variation, Proceedings of the 19th Int'l Conf. on Computer Processing of Oriental Languages, 205-210, Seoul, May 2001. (Summary) 一般的な情報検索技術では，単語の出現頻度が用いられるが，各単語の時間軸上での頻度変化を考慮したシステムは存在しなかった．本論文では，単語の時間軸上での頻度変化から，各単語の流行性，衰退性を判定し，より流行している単語の頻度に重みを持たせることで，より新鮮な情報を含む文書を検索できるシステムを開発しする．
80.	Sangkon Lee, Masami Shishibori, Kazuhiro Morita and Jun-ichi Aoe : Passage Retrieval based on Topic-Matter, Proceedings of the 19th Int'l Conf. on Computer Processing of Oriental Languages, 193-198, Seoul, May 2001. (Summary) 一般に，文書内には複数のテーマが記述されるにも関わらず，従来の文書検索技術では，文書単位に検索を行うのが通常であった．しかし，ユーザにより適切な結果を提示するためには，文書の中でも最もユーザの検索質問に関連のある箇所のみを検索する，パッセージ検索が必要となる．本論文では，分野連想語を用いてトピックの切り替わり位置を検出することでパッセージ検索を可能にする手法を提案する．
81.	Masami Shishibori, Kazuaki Ando and Jun-ichi Aoe : A Filtering Method for E-mail Documents base on Personal Profiles, Proceedings of the 19th Int'l Conf. on Computer Processing of Oriental Languages, 69-72, Seoul, May 2001. (Summary) 本論文では，学習データから抽出した基準に従って，入力メイルの重要度を基準に従って分類する手法を提案する．本手法では，送信元，テーマ，文のタイプ，時間的緊急度といった属性を対象にし，予め重要度付けされた学習データから抽出された各属性の頻度の組み合わせをフィルタリングの基準とする．その基準を用いて，重要度が未知のメイル文書を重要度毎にフィルタリングッする．
82.	Minsoo Jung, Masami Shishibori, Ki-Hong Park and Jun-ichi Aoe : An Efficient Search Algorithm for a Large Set of Keys by Compact Patricia Trie, Proceedings of the 19th Int'l Conf. on Computer Processing of Oriental Languages, 29-34, Seoul, May 2001. (Summary) 本論文では，パトリシアトライのコンパクトなビット列への圧縮手法，及び圧縮されたデータ構造内でのキー検索アルゴリズムを提案する．本手法を用いると，通常のリスト構造を用いたパトリシアトライに比べて40∼60%の圧縮率が得られる．また，パトリシアトライを階層的に管理することにより，検索時間効率の低下を防ぐことに成功した．
83.	El-sayed Atlam, Makoto Okada, Masami Shishibori and Jun-ichi Aoe : An Estimation Method of the Words Tendency Based on Time-Series Variation, Proceedings of the International NAISO Congress on Information Science Innovations (ISI'2001), 17-21, Dubai, U.A.E., Mar. 2001. (Summary) 新聞記事やWWW空間内での単語には，ある特定の時期のみに出現頻度が高くなる単語，時間の経過とともに衰退する単語，逆に流行語のように突発的に頻度が高くなっている単語等に分類できる．本論文では，単語の時系列上での頻度の変化に基づいて出現単語の流行性を判定する手法を提案し，実験により有効性を確認した．
84.	Makoto Okada, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Method to Construct a Substring Searching Structure by Extending AC Machine, Proceedings of the 3rd Int'l Conf. of Asian Digital Library, 295-300, Seoul, Dec. 2000.
85.	Kazuaki Ando, Masami Shishibori, Lee Tae-hun and Jun-ichi Aoe : Dictionary Structure for Agglutinative Languages, Proceedings of the 3rd International Conference of Asian Digital Library, 255-260, Seoul, Dec. 2000. (Summary) 日本語は英語やフランス語等と違って単語間の区切りを示す明確な空白が存在しない．このような言語を膠着語と呼び，膠着語の文章を解析する際には，単語の分割処理(形態素解析)が重要な処理になる．本論文では，膠着語を形態素解析する際の効率的な辞書データのデータ構造を提案する．
86.	El-Sayed Atlam, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Term Negative Weight and Its Application to Word Similarity, Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and 6th International Conference on Information Systems Analysis and Synthesis (ISAS 2000), Vol.7, 315-319, Florida, Jul. 2000.
87.	Makoto Okada, EL-Sayed Atlam, TeaHun Lee and Jun-ichi Aoe : An Efficient Methodof String Pattern Matching: An Aid to Delayed Keyword Extraction, Proceedings ofthe 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and 6th International Conference on Information Systems Analysisand Synthesis (ISAS 2000), Vol.6, 161-166, Florida, Jul. 2000.
88.	Masao Fuketa, Sangkon Lee, Toru Sumitomo and Jun-ichi Aoe : A Method of Determining Text Fields using Association Words, Proceedings of the 4th WorldMulticonference on Systemics, Cybernetics and Informatics (SCI2000) and 6thInternational Conference on Information Systems Analysis and Synthesis (ISAS 2000), Vol.8, 79-84, Florida, Jul. 2000.
89.	Kazuhiro Morita, Jung Minsoo, Masami Shishibori and Jun-ichi Aoe : Implementation of Efficient Insertion for a Double-Array Structure, Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and 6th International Conference on Information Systems Analysis and Synthesis (ISAS 2000), Vol.7, 469-474, Florida, Jul. 2000. (Summary) 自然言語処理システムの辞書データ構造に用いられるダブル配列は，記憶容量を抑えつつも高速な検索が可能なデータ構造として有名である．しかし，動的にキーを追加した場合，記憶領域内に無駄な空き領域が存在することが問題となっていた．本論文では，この空き領域を領域を抑えつつ高速にキーを追加できるアルゴリズムを提案する．
90.	Masami Shishibori, Toru Sumitomo, Makoto Okada and Jun-ichi Aoe : Automatic Error Detection and Recovery Using the Descendat Set(DS) Table, Proceedings of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and 6th International Conference on Information Systems Analysis and Synthesis (ISAS 2000), Vol.7, 359-364, Florida, Jul. 2000. (Summary) 本論文では，構文的誤り箇所を含む文に対する誤り訂正処理手法を提案する．本手法では，連続した還元動作が実行された後の遷移状態が示された子孫集合表を用いることにより，高速に訂正処理を行うことに特徴がある．実際に誤りを含む仮名漢字変換用入力データを用いた実験を行い，有効性を確認した
91.	Masami Shishibori, Lee Sangkon, Jung Minsoo and Jun-ichi Aoe : An Efficient Method to Retrive Passages in Documents Using Field-reminding Words, Proceedins of the 4th World Multiconference on Systemics, Cybernetics and Informatics (SCI2000) and 6th International Conference on Information Systems Analysis and Synthesis (ISAS 2000), Vol.7, 353-358, Florida, Jul. 2000. (Summary) 本論文では，予め定義した分野体系内の各分野を連想することができる単語(分野連想語と呼ぶ)の出現分布に基づいて，文書内をパッセージ単位で検索する手法を提案した．実際の新聞記事を用いた実験により，本手法の有効性を確認した．
92.	Shoji Mizobuchi, Sangkon Lee, Fumihiko Kawano, Tsuyoshi Kobayashi, Takahiro Komatsu and Jun-ichi Aoe : Multi-lingual Multi-media Information Retrieval System, Proceedings of the First NTCIR Workshop on Research in Japanese Text Retrieval and Term Recognition, 171-178, Tokyo, Aug. 1999.
93.	Makoto Okada, Kazuaki Ando, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Determination of Keywords for Compound Words, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 317-320, Tokushima, Mar. 1999.
94.	Takako Tsuji, Hiromichi Nigazawa, Makoto Okada and Jun-ichi Aoe : Early Field Recognition by Using Field Association Words, Proceedings of the 18th Int'l Conf. on Computer Processing of OrientalLanguages, 301-304, Tokushima, Mar. 1999.
95.	Hidekazu Tokunaga and Jun-ichi Aoe : Research of The Technical Interpretive Article Database by XML, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 281-284, Tokushima, Mar. 1999.
96.	Masafumi Koyama, Fumihiko Kawano, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Algorithm of Fixing Semantic Constraints for a Case Frame, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 269-272, Tokushima, Mar. 1999.
97.	EL-Sayed Atlam, Kazuhiro Morita, Masafumi Koyama and Jun-ichi Aoe : Representation Knowledge in Case Frames Using Verb and Noun Relationships, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 249-252, Tokushima, Mar. 1999.
98.	Sangkon Lee, Masafumi Koyama, Shoji Mizobuchi, Kyoko Uchibayashi, Fumihiko Kawano, Takahiro Komatsu and Jun-ichi Aoe : Closs-language Multi-media Information Retrieval System : BOSS, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 245-248, Tokushima, Mar. 1999.
99.	Kazuaki Ando, Masao Fuketa, Masami Shishibori and Jun-ichi Aoe : Dictionary Structure for Morphological Analysis of Oriental Languages, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 533-538, Tokushima, Mar. 1999. (Summary) 日本語を対象にした自然言語処理において，文章内の単語を分割する形態素解析処理は必要不可欠な技術である．通常，形態素解析に用いる辞書には単語表記やそれに対する品詞情報のみが登録されており，品詞間の接続情報は別テーブルに格納されている．本論文では，AC法により形態素辞書を構築することにより，品詞間の接続情報も同時に格納できる新しい辞書構築方法を提案する．
100.	Masami Shishibori, Kazuaki Ando, Shoji Mizobuchi and Jun-ichi Aoe : A Method of Correcting Errorneous Sentences on NL Interface Systems, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 403-408, Tokushima, Mar. 1999. (Summary) 従来のLRパーサーを用いた誤り訂正処理は，訂正処理過程において，訂正候補となる系列が指数関数的な数で生成されるため，処理時間が実用化への壁となっていた．本論文では，従来手法の時間的効率を改善し，LRパーサーを用いて高速に誤りを訂正する手法を提案する．本手法は子孫集合表という新しい解析表を用い，2個以上の記号を先読みしながら処理を行うため，余計な訂正候補系列の生成を押さえることができる．
101.	Masami Shishibori, Kazuaki Ando, Kazuhiro Morita and Jun-ichi Aoe : A Dynamic Construction Method for the PaCB-tree, The 18th Int'l Conf. on Computer Processing of Oriental Languages, Tokushima, Mar. 1999. (Summary) PaCB-treeとは，パトリシアトライ構造を通常の木構造ではなく，コンパクトなビット列で表現したデータ構造であり，全文検索の索引部や形態素解析の辞書を形成するのに用いられている．しかしながら，従来法は性的なデータに対してのみ適用可能であり，動的なデータに対する追加·削除処理は提案されていなかった．そこで，本論文ではPaCB-treeに対する追加·削除処理を提案し，実験により有効性を確認した．
102.	Masao Fuketa, Toru Sumitomo, Masami Shishibori and Jun-ichi Aoe : A Suffix Compression Algorithm of Tries, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 345-348, Tokushima, Mar. 1999. (Summary) ディジタル探索アルゴリズムの代表的な手法であるトライは，自然言語処理システムの単語登録辞書等，幅広い分野で用いられている．トライ構造は登録文字列の接頭辞部分は併合されているが，接尾辞部分までも併合する手法は提案されていない．本論文では，接尾辞部分を併合した構造を持つ新しいトライ構造，及びそのトライ構造を用いたキー検索アルゴリズムを提案する．
103.	Shoji Mizobuchi, Toru Sumitomo, Kazuaki Ando and Jun-ichi Aoe : A Method for Understanding Quantitative Time Expressions, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 545-550, Tokushima, Mar. 1999.
104.	Kazuhiro Morita, Makoto Okada, Masao Fuketa and Jun-ichi Aoe : A Method of Storing Multi-Attribute Relations in Natural Language Dictionaries, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 437-442, Tokushima, Mar. 1999.
105.	Yoshihiro Yamakawa, Kazuhiro Morita, Shoji Mizobuchi and Jun-ichi Aoe : A Method for Improving Full Text Search Using Signature Vectors, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 377-380, Tokushima, Mar. 1999.
106.	Toru Sumitomo, Masao Fuketa, Yoshihiro Yamakawa and Jun-ichi Aoe : A Vector Compression Algorithm for Example Sentence, Proceedings of the 18th Int'l Conf. on Computer Processing of Oriental Languages, 329-332, Tokushima, Mar. 1999.
107.	Kazuhiro Morita, Toru Sumitomo, Masao Fuketa and Jun-ichi Aoe : A Fast and Compact Data Structure of Storing Multi-Attribute Relations among Words, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 2791-2796, San Diego, Oct. 1998.
108.	Shoji Mizobuchi, Toru Sumitomo, Masao Fuketa and Jun-ichi Aoe : A Method for Understanding the Meaning of Time Expressions, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 1511-1155, San Diego, Oct. 1998.
109.	Masafumi Koyama, Kazuhiro Morita, Shoji Mizobuchi and Jun-ichi Aoe : An Efficient Retrieval Algorithm for Case Structures Using TRIE, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 4572-4577, San Diego, Oct. 1998.
110.	Kazuaki Ando, Takako Tsuji, Masao Fuketa and Jun-ichi Aoe : An Efficient Dictionary Access Method for Morphological Analysis, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 2876-2881, San Diego, Oct. 1998.
111.	Masami Shishibori, Kazuaki Ando, Masao Fuketa and Jun-ichi Aoe : Automatic Error Recovery in the Natural Language Interface, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 1353-1358, San Diego, Oct. 1998. (Summary) 本論文では，仮名漢字変換システムに対する誤り訂正処理として，以下の3種類の訂正処理を提案する．まず，正しい文字も替わりに誤った別の文字が入力された変換誤りに対する置換処理．また，正しい文字が脱落した脱落誤りに対する挿入処理．最後に，過剰な文字が入力された過剰誤りに対する削除処理を提案する．また，実際に誤りを含む仮名漢字変換用入力データを用いた実験を行い，有効性を確認した．
112.	Masao Fuketa, Takako Tsuji, Kazuaki Ando and Jun-ichi Aoe : A Multi-stage Retrieval Algorithm for Postings on Index Tables, Proceedings of 1998 IEEE International Conference on Systems, Man, and Cybernetics, 4578-4583, San Diego, Oct. 1998.
113.	Kazuaki Ando, Kimihiro Iwasaki, Masao Fuketa and Jun-ichi Aoe : A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages, The Prague Stringology Club Workshop (Czech University Meeting), Prague, Czech Republic, Sep. 1998.
114.	Kazuaki Ando, Makoto Okada, Toru Sumitomo and Jun-ichi Aoe : A High Speed Morphological Analysis for Human-Computer Systems, Proceedings of 2nd IEEE International Conference on Intelligent Processing Systems, 37-41, Gold Coast, Aug. 1998.
115.	Masami Shishibori, Kazuaki Ando, Masao Fuketa and Jun-ichi Aoe : Robust Human-Computer Interface Systems Using the Generalized LR Parsing, Proceedings of 2nd IEEE International Conference on Intelligent Processing Systems, 62-66, Gold Coast, Australia, Aug. 1998. (Summary) LRパーサーは自然言語文の構文を文脈自由文法に従って解析するアルゴリズムである．本論文では，LRパーサーが文法に適した記号を先読みしながら解析するという性質に着目し，LRパーサーを用いて誤っている記号を文法に準じた正しい記号に訂正する誤り訂正処理を提案する．誤りを含む入力系列に対する実験より，90%程度の誤りを自動訂正できることを確認した．
116.	Masao Fuketa, Toru Sumitomo, Masami Shishibori and Jun-ichi Aoe : A Compression Algorithm for Postings on Index Tables, Proceedings of the Natural Language Processing Pacific Rim Symposium 1997, 553-556, Phuket, Thailand, Dec. 1997. (Summary) 本論文では，用例文検索等で用いられる索引表の効率的な圧縮手法を提案する．一般に，用例文検索では，各文番号をビット位置に対応させた索引表を用いる．本手法は，このビット列から成る索引表を段階的に圧縮することにより，コンパクトな索引表を形成するだけでなく，2次記憶とのアクセス数，及び転送されるデータ量を抑えることが可能となる．実際に大規模な用例文に対する実験結果から，20倍∼40倍高速に検索できることを確認した．
117.	Kazuaki Ando, Tsutomu Hashimoto, Masami Shishibori and Jun-ichi Aoe : An Extension of Nondeterministic Finite Automaton for Multi-Attribute Information Retrieval, Proceedings of the Natural Language Processing Pacific Rim Symposium 1997, 653-656, Phuket, Thailand, Dec. 1997. (Summary) 情報検索の分野では，AC法(Aho-Corasick法)に代表される非決定性有限オートマトンが頻繁に用いられる．最近では，形態素辞書等も非決定性有限オートマトンにより構成する手法が報告されている．しかしながら，これらの手法は表記等の単一属性のみを取り扱った手法であるため，実用レベルでの拡張性に乏しい．そこで，本論文では，表記の他に品詞や意味·概念情報等の他属性情報を取り扱うことが出来る非決定性有限オートマトンの構成方法を提案する．
118.	Masami Shishibori, Kazuaki Ando, Masao Fuketa and Jun-ichi Aoe : An Efficient Access Method Using Compact Patricia Tries, Proceedings of the Natural Language Processing Pacific Rim Symposium 1997, 549-552, Phuket, Thailand, Dec. 1997. (Summary) 本論文では，パトリシアトライ構造の効率的な圧縮手法として，パトリシアトライ内に含まれる削除ノードに関する情報をコンパクトなビット列で表現する手法を提案する．また，動的なキー集合に対応できるように，圧縮されたデータ構造に対する更新アルゴリズムも提案する．本手法の検索·更新処理が従来手法よりも向上することを理論的·実験的に実証した．
119.	Kazuaki Ando, Makoto Okada, Masami Shishibori and Jun-ichi Aoe : Efficient Multi-Attribute Pattern Matching Using the Extended Aho-Corasick Method, Proceedings of 1997 IEEE International Conference on Systems, Man and Cybernetics, 3936-3941, Florida, Oct. 1997. (Summary) Aho-Corasick法(AC法と略す)は，文字列照合法の一手法であるが，文字列を一回走査するだけで登録されている全てのキーを照合することができる効率的な手法である．しかしながら，従来のAC法は多属性情報を一度に照合する機能は有していなかった．本論文では，多属性情報にも対応できるAC法の改良手法を提案する．
120.	Masami Shishibori, Masafumi Okuno, Kazuaki Ando and Jun-ichi Aoe : An Efficient Compression Method for Patricia Trie, Proceedings of 1997 IEEE International Conferenceon Systems, Man and Cybernetics, 415-420, Florida, Oct. 1997. (Summary) 本論文では，情報検索システム，特に全文検索システムの索引部として用いられるパトリシアトライの効率的な圧縮手法，及び圧縮されたデータ構造上でのキー検索手法を提案する．また，実際に行った実験結果より，従来の圧縮手法(CB-tree)に比べ，本手法が40%∼60%コンパクトに圧縮できることが分かった．
121.	Masami Shishibori, Masao Fuketa, Kazuaki Ando and Jun-ichi Aoe : A Construction Method for the Index Represented by a Pointerless Patricia Trie, Proceedings of the 2nd International Workshop on Information Retrieval with Asian Languages, 24-30, Tsukuba, Oct. 1997. (Summary) 木構造をインプリメントする際には，各ノードにポインターを持たせるデータ構造が通常である．しかしながら，このデータ構造では，大規模なキー集合を登録すると，使用されるポインター数が多くなり，多大な記憶容量が必要となる．本論文では，ポインターを用いずに木構造をインプリメントする手法を提案し，空間効率の問題点を解消する．
122.	Kazuaki Ando, Masami Shishibori and Jun-ichi Aoe : Rules for Describing Multi-Attribute Information and Its Efficient Pattern Matching, Proceedings of IEEE First International Conference on Intelligent Processing Systems, 953-957, Beijing, Oct. 1997. (Summary) 従来，単一のキーをマッチングする手法は存在するが，英語の熟語などに見られる"not only ∼, but also ∼"のように分離されたキーに対するマッチング手法は正規表現によるものであった．しかしながら，自然言語を対象にした場合，正規表現の記述能力では限界がある．そこで，本論文では，非決定性有限状態オートマトンを用いた記述言語と効率的なパターンマッチング手法を提案する．
123.	Masami Shishibori, Kazuaki Ando, Makoto Okada and Jun-ichi Aoe : A Key Search Algorithm Using the Compact Patricia Trie, Proceedings of IEEE First International Conference on Intelligent Processing Systems, 1581-1584, Beijing, Oct. 1997. (Summary) 本論文では，文書内の任意の位置から始まる文字列(半無限文字列)をパトリシアトライに格納した全文検索システムを提案する．本手法では，コンパクトなビット列でパトリシアトライを表現するため，大規模な文書データに対しても半無限文字列を格納することができ，文書内の任意の位置に存在する文字列を検索することもできる．
124.	Kazuaki Ando, Masami Shishibori and Jun-ichi Aoe : An Efficient Multi-Attribute Pattern Matching Prague Stringology Club Workshop (Czech University Meeting), Proceedings of the 17th International Conference on Computer Processing of Oriental Languages, Prague, Czech Republic, Sep. 1997.
125.	Masami Shishibori, Makoto Okada, Toru Sumitomo and Jun-ichi Aoe : An Efficient Trie Hashing Method Using a Compact Binary Trie, The Prague Stringologiy Club Workshop (Czech University Meeting), Prague, Czech, Jul. 1997. (Summary) 本論文では，CB木(Compact Binary Trie)と呼ばれるコンパクトなビット列によりハッシュ表を構成した拡張ハッシュ法を紹介する．CB木を拡張ハッシュ法に適用することにより，高速な順検索，更に，部分文字列検索が実現できる．実験により，時間効率が従来の拡張ハッシュ法より約15倍向上することを実証した．
126.	Masami Shishibori, Kazuhiro Morita, Kazuaki Ando and Jun-ichi Aoe : The Design of a Compact Data Structure for Binary Tries, Proceedings of the 17th International Conference on Computer Processing of Oriental Languages, 606-611, Kowloon Tong, Hong Kong, Apr. 1997. (Summary) 本論文では，2進木トライを先行順ビット列と呼ばれるコンパクトなビット列に圧縮する手法を提案する．また，時間効率を改善するため，木構造の階層化手法を提案し，階層数と各時間効率との関係を調査した結果を示す．その結果，木構造を10前後の深さで分割するのが最も効率が向上することが分かった．
127.	Masao Fuketa, Kazuhiro Morita, Masami Shishibori and Jun-ichi Aoe : Intelligent System of Selecting Key Search Algorithms Automatically, Proceedings of 1996 IEEE International Conference on Systems, Man and Cybernetics, 642-647, Beijing, Oct. 1996. (Summary) 現在までに数多くのキー検索手法が提案されているが，それぞれに一長一短があり，全ての機能を有する手法は存在しない．そのため，ユーザーは適切なキー検索手法を自分自身で選択する必要があった．本論文では，各キー検索手法の特徴を分類整理し，知識構造に格納する．そして，その知識を用いて，ユーザーとシステムの対話により，適切なキー検索手法を自動選択するシステムを提案する．
128.	Yoshitaka Hayashi, Hisatoshi Mochizuki, Masami Shishibori and Jun-ichi Aoe : A Speeding-up Method of Parsing-Stack Operations for LR Parsers, Proceedings of 1996 IEEE International Conference on Systems, Man and Cyber-netics, 619-624, Beijing, Oct. 1996. (Summary) LRパーサーはコンパイラでプログラミング言語の解析をするだけでなく，自然言語を文脈自由文法に従って解析するためにも用いられている．LRパーサーは解析表とスタックを用いて入力系列を構文解析するが，解析に要する時間の殆どがスタックに対する入出力処理である．本論文では，LRパーサーでのスタック処理の高速化手法を提案する．
129.	Hisatoshi Mochizuki, Yoshitaka Hayashi, Masami Shishibori and Jun-ichi Aoe : A Compact and Fast Structure for Trie Retrieval Algorithms, Proceedings of 1996 IEEE International Conference on Systems, Man and Cyber-netics, 2221-2226, Beijing, Oct. 1996. (Summary) 自然言語処理の基礎技術である形態素解析では各単語(形態素)を登録した辞書を用いる必要があるが，この辞書に大量の形態素を登録できるようになればなるほど，形態素解析の精度も良くなる．本論文では，形態素辞書のデータ構造として用いられるトライ構造の圧縮手法を提案する．本手法はコンパクトな配列構造でトライを実現できるため，通常の木構造よりも数十倍多い形態素を登録できるようになる．
130.	Takeshi Arita, Masafumi Koyama, Masami Shishibori and Jun-ichi Aoe : Improvement of a Row Displacement Algorithm for Sparse Table Compression, Proceedings of 1996 IEEE International Conference on Systems, Man and Cyber-netics, 1730-1735, Beijing, Oct. 1996. (Summary) 自然言語文の構文解析を行う手法としては，LR構文解析手法が有名である．この解析手法ではparsing tableと呼ばれる解析表が用いられるが，文法数が多くなると，解析表のサイズが大きくなるだけでなく，解析表自体がスパースになるため，なんだかの圧縮を行う必要がある．本論文では，スパースな表形式のデータをコンパクトな1次元の配列に圧縮する手法を提案する．
131.	Masami Shishibori, Hisatoshi Mochizuki, Takeshi Arita and Jun-ichi Aoe : An Efficient Method of Compressing Binary Tries, Proceedings of 1996 IEEE International Conference on Systems, Man and Cyber-netics, 2133-2138, Beijing, Oct. 1996. (Summary) 本論文では，情報検索システム，特に全文検索システムの索引部として頻繁に用いられる木構造，特に2進木トライ構造の圧縮手法を提案する．本手法は2進木トライ構造を先行順に辿りながら，treemap，leafmap，B_TBLから成る先行順ビット列と呼ばれるコンパクトなビット列に圧縮する．
132.	Takako Tsuji, Syouji Mizobuchi, Masami Shishibori and Jun-ichi Aoe : An Efficient Retrieval Algorithm of Two-trie Structures, Proceedings of the 19th International Conference on Research and Development in Information Retrieval, 340, Zurich, Switzerland, Aug. 1996.
133.	Masami Shishibori, Yoshitaka Hayashi, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Retrieval Algorithm of Binary Digital Search-trees Using Hierarchical Structures, Proceedings of the 19th International Conference on Research and Development in Information Retrieval, 340, Zurich, Switzerland, Aug. 1996. (Summary) 本論文では，2進ディジタル探索木(Binary Digital Search-tree: BDS木)の階層化による時間効率の改善方法を提案する．更に，木構造を完全木と仮定し，検索時間，及び更新時間効率の向上の割合を理論的に求める．また，階層化を行うことにより必要となる記憶量についても理論評価より求める．
134.	Masami Shishibori, Shoji Mizobuchi, Kazuhiro Morita and Jun-ichi Aoe : An Efficient Order Preserving Access Method Using Trie Hashing, Proceedings of the 3rd International Conference Natural Language Processing Pacific Rim Symposium, 102-107, Taejon, Korea, Jun. 1996. (Summary) 本論文では，拡張ハッシュ法に順検索機能を追加したトライハッシュ法を対象にし，索引部に用いられるトライ構造の新たなデータ構造を提案する．本手法では，トライ構造を分割し，各分割されたトライ毎にビット列に圧縮して管理することで，従来手法よりも高速な検索処理を実現する．更に，5万語の日本語名詞，及び英単語に対する具体的な実験結果を示し，改善手法の検索時間，更新時間に関する評価を行った．
135.	Hideki Mima, Kazuaki Ando and Jun-ichi Aoe : Incremental Generation of LR(1) Parse Tables, Proceedings of the third Natural Language Processing Pacific Rim Symposium, 600-605, Seoul, Dec. 1995.
136.	Hirokazu Iriguchi, Masashi Koyama, Masami Shishibori and Jun-ichi Aoe : Speeding up Updating of Large Graph Structure, Proceedings of the third Natural Language Processing Pacific Rim Symposium, 302-307, Seoul, Dec. 1995.
137.	Masami Shishibori, Kazuaki Ando, Hirokazu Iriguchi and Jun-ichi Aoe : An Order Preserving Access Method Using an Improved BDS-tree, Proceedings of the 3rd International Conference Natural Language Processing Pacific Rim Symposium, 473-479, Seoul, Dec. 1995. (Summary) 本論文では，圧縮版BDS(Binary Digital Search)木を用いた効率的な順検索法を提案する．従来の木構造では一つのノードにつき二つのポインターを準備しなければならず，大規模なキー集合を登録すると，多大な容量が必要となっていた．本手法では，コンパクトなビット列でBDS木を表現するため，5万語のキー集合に対して，約20∼30キロバイトの索引部で検索処理が実現できる．
138.	Ingrid Kirschning, Hideto Tomabechi and Jun-ichi Aoe : A Parallel Recurrent Cascade-Correlation Neural Network with Natural Connectionist Glue, Proceeding of the 1995 IEEE ICNN, 953-956, Perth,Australia, Nov. 1995.
139.	Hirokazu Iriguchi, Masashi Koyama, Masami Shishibori and Jun-ichi Aoe : An Efficient Method to Update Large Graph Structures, The 2nd International Joint Conference on Information Sciences, Wrightsville Beach, USA, Sep. 1995.
140.	Masami Shishibori, Kazuaki Ando, Hirokazu Iriguchi and Jun-ichi Aoe : Extensible Hashing Using an Improved Binary Digital Search-tree, Proceedings of the 2nd International Joint Conference on Information Science, 417-420, North Carolina, USA, Sep. 1995. (Summary) 従来のハッシュ法ではキー検索の分野で重要な順検索を行うことが不可能であった．本論文では，順検索を効率的に行うために，ハッシュ表として2進ディジタル探索木を用いた拡張ハッシュ法の検索アルゴリズムを提案する．更に，大規模なキー集合に対する時間効率の悪化を防ぐ一つの改善方法として，木構造を階層的に分割しする手法を提案する．
141.	Yong-Seok Lee, Jun-ichi Aoe and Masao Fuketa : A Shift-first Strategy for Generalized LR Parsing, Proceedings of International Computer Symposium 1994, 905-910, Hsinchu,Taiwan, Dec. 1994.
142.	Ki-hong Park, Hideto Tomabechi and Jun-ichi Aoe : A Method for Selecting Key Search Algorithms using Expert Knowledge, Proceedings of International Computer Symposium 1994, 138-143, Hsinchu,Taiwan, Dec. 1994.
143.	Masami Shishibori, Masao Fuketa, Park Ki-Hong and Jun-ichi Aoe : An Efficient Algorithm for Diagram Allocations on Automatic Document Layouts, Proceedings of International Computer Symposium, 630-637, Hsinchu, Taiwan, Dec. 1994. (Summary) 本論文では，複数の段組がなされた文書内に幅の異なる図表を高速にかつ正確に配置する手法を提案する．本手法では，図表を配置する位置(ページの上·下·中)により処理を分割し，キューを用いて配置の制御を行う．また，文章の量より図表のほうが多い場合でも，バックトラックを行わず，高速に配置を行えるアルゴリズムを提案する．
144.	Ki-hong Park, Jun-ichi Aoe and Masao Fuketa : An Algorithm for Dynamic Processing of Trie Common Suffixes, Proceedings of Joint Conference on Information Sciences, 52-55, Pinehurst,USA, Nov. 1994.
145.	Hideki Mima, Kazuaki Ando and Jun-ichi Aoe : A robust method for understanding NL interface commands in the ICI Intelligent Command Interpreter, Proceedings of International Joint Conference on Information Sciences, 40-43, Pinehurst, USA, Nov. 1994.
146.	Ki-hong Park, Jun-ichi Aoe and Masao Fuketa : An Automatic Selection Method of Key Search Algorithms Using Expert Knowledge, Proceedings of International Joint Conference on Information Sciences, 44-47, Pinehurst, USA, Nov. 1994.
147.	Masami Shishibori, Hisatoshi Mochizuki, Takeshi Arita and Jun-ichi Aoe : An Efficient Algorithm for Allocating Diagrams on Automatic Document Layouts, Proceedings of International Joint Conference on Information Science, 48-51, North Carolina, USA, Nov. 1994. (Summary) 文書編集システムや文書整形システムに代表される文書レイアウトシステムにおいて，如何に図表を適切な位置に自動的に配置するかは重要な課題である．本論文では，実際に出版されている文献のレイアウトを調査し，また，レイアウトの専門家へのインタビュー等を行い，読みやすく見やすい位置に図表を配置する基準を定義する．そして，その基準に従って図表の自動配置する手法を提案する．
148.	Katsushi Morimoto and Jun-ichi Aoe : Two Trie Structures for Natural Language Dictionaries, Natural Language Processing Pacific Rim Symposium(NLPRS'93), 302-311, Fukuoka, Dec. 1993. (Keyword) natural language processing / trie structure / searching strategy / dictionary retrieval
149.	Alfredo M. Maeda and Jun-ichi Aoe : Mental Models Representation, 2nd International Computer Science Conference(ICSC '92), 78-84, Hong Kong, Dec. 1992.
150.	Kazuhiko Tsuda, Masami Nakamura and Jun-ichi Aoe : An efficient string pattern matching algorithm : The application of reducing texts, International symposium on Computer and Information Sciences 7, 471-474, Paris, Nov. 1992.
151.	Jun-ichi Aoe, Alfredo M. Maeda and Masami Shishibori : An intelligent natural language user interface cooperating information systems, International symposium on Computer and Information Sciences 7, 271-277, Paris, Nov. 1992.
152.	Jun-ichi Aoe : Information Retrieval for Natural Language Processing, The Prague AC Machine Special Meeting (Czech University), Prague, Czech, Nov. 1992.
153.	Kazuhiko Tsuda, Masami Nakamura and Jun-ichi Aoe : A Method of Text Reduction for Text Proofreading Systems, International conference on Intelligent Systems SPICIS'92, 537-542, Singapore, Sep. 1992.
154.	Jun-ichi Aoe, Alfredo M. Maeda and Msami Shinshibori : An Intelligent Command Interpreter -ICI- with a Natural Language Interface, International conference on Intelligent Systems SPICIS'92, 525-530, Singapore, Sep. 1992.
155.	Alfredo M. Maeda and Jun-ichi Aoe : Expansion and Succession in the Merm Mental Representations Model, Proc. of the Int. Conf. on 5th Generation Computer Systems, 231-236, Tokyo, Jun. 1992.
156.	Alfredo Maeda, Jun-ichi Aoe and Katsushi Morimoto : An Intelligent Command Interpreter for Consultation and Use of Information System, Proceedings International Symposium on Artificial Intelligence, 533-539, Cancun, Mexico, Nov. 1991.
157.	Seigo Yasutome, Alfredo M. Maeda and Jun-ichi Aoe : Parallel Semantic Disambiguation for Unification-Based Grammars, Pacific Rim International Conference on Artificial Intelligence'90, 292-297, Nagoya, Nov. 1990.
158.	Jun-ichi Aoe : Compendium of Key Search Strategies, The Special Interest Group Forum, Nov. 1990.
159.	Jun-ichi Aoe : An Efficient Implementation of String Pattern Matching Machines for A Finite Number of Keywords, The Special Interest Group Forum, Nov. 1989. (Keyword) A string pattern matching algorithm / information retrieval / data structure / space saving / static set of keywords / text-scanning
160.	Jun-ichi Aoe : Storing A Tree Structure by Using Decimal Notations, The Special Interest Group Forum, Nov. 1989. (Keyword) Compression algorithm / data structure / decimal codes / semantic primitives / tree structures
161.	Jun-ichi Aoe : Intelligent Machine Translation Using A Contextual Knowledge Representation, Proceedings of the Tools for Artificial Intelligence, 114-121, Fairfax,VA,USA, Oct. 1989.
162.	Jun-ichi Aoe : An Efficient Algorithm of Compressing Decimal Notations for Tree Structures, Proceedings of the Thirteenth Annual International Computer.Software and Applications Conference, 316-323, Orlando, Sep. 1989.
163.	Jun-ichi Aoe : A Method for Representing English Semantics Based on Morphology, Proceedings of the First Lexical Acquisition Workshop (The 11th International Joint Conference on Artificial Intelligence), AAAI, Detroit, USA, Aug. 1989.
164.	Jun-ichi Aoe, Seigo Yasutome and Takashi Sato : An Efficient Digital Search Algorithm By Using A Double-Array Structure, Proceedings of the Twelfth Annual International Computer Software and Applications Conference, 472-479, Chicago, Oct. 1988.
165.	Jun-ichi Aoe, S. Jocelyn Liu, Yukiko Sasaki, R. Cohen and Takashi Sato : Coherent Analysis and Intelligent Machine Translantion from Japanese to English, Proceedings of the Twelfth Annual International Computer Software and Applications Conference, 463-471, Chicago, Oct. 1988.
166.	Jun-ichi Aoe, Masayuki Fujikawa and Ei-ichi Shinomiya : An Efficient Representation of Hierarchical Semantic Primitives, --- An Aid to Machine Translation Systems ---, Second International Conference on Supercomputing Proceedings Supercomputing'87 Industrial Supercomputer Applications and Computations, Santa Crala, USA, May 1987.
167.	Jun-ichi Aoe, Yoneo Yamamoto and Ryosaku Shimada : An Efficient Implementation of Static String Pattern Matching Machines, Proceedings of the First International Conference of Supercomputing Systems, 491-498, Florida, Dec. 1985.

Proceeding of Domestic Conference:

1.	Akio Tomotoshi, Jun-ichi Aoe, Kazuhiro Morita and Masao Fuketa : マイクロブログからの口コミ情報抽出に関する研究, FIT2015(第14回情報科学技術フォーラム), 117-118, Sep. 2015.
2.	Yusei Ueno, Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : Centroid Path Decomposition によるダブル配列の検索の高速化, FIT2015(第14回情報科学技術フォーラム), 145-146, Sep. 2015.
3.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : トライにおける逆方向遷移可能かつコンパクトな配列構造, 情報処理学会情報基礎とアクセス技術研究会報告, Vol.2015-IFAT-119, Aug. 2015.
4.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : 文字列ラベルを用いたダブル配列表現, 電子情報通信学会コンピュテーション研究会技術研究報告, Vol.COMP2015-15, 141-148, Jun. 2015.
5.	Motoki Ohara, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Extraction of Tourist Information from Contents of Tweets and Building an Analysis System, 人工知能学会第29回全国大会講演論文集, Jun. 2015.
6.	Yukiko Higuchi, Masao Fuketa, Jin Narumoto, Mayu Ogawa, Kazuhiro Morita and Jun-ichi Aoe : Feedback related to Mental States of Family Caregivers, 人工知能学会第29回全国大会講演論文集, May 2015.
7.	Yoshiaki Ichihashi, Masao Fuketa, Taro Mito, Kazuhiro Morita and Jun-ichi Aoe : DAWG を用いたダブル配列による全文検索手法, 情報処理学会第77回全国大会, 1-695-1-696, Mar. 2015.
8.	Shunsuke Kanda, Masao Fuketa, Kazuhiro Morita and Jun-ichi Aoe : 階層構造を用いたダブル配列の圧縮法, 情報処理学会第77回全国大会, 1-693-1-694, Mar. 2015.
9.	Yusuke Oomori, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 疑似訓練データを用いた Q&A サイトの質問分類, 言語処理学会第21回年次大会, Mar. 2015.
10.	Wataru Miyazaki, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : プロフィール文の属性に基づくツイート分類手法, 情報処理学会第77回全国大会, 1-521-1-522, Mar. 2015.
11.	Shota Sekimoto, Shun Watanabe, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Distributed Decoding Protocol of Secret Sharing Scheme using Secret Key, 2014 Shikoku-section Joint Convention Record of the Institutes of Electrical and Related Engineers, 255, Sep. 2014.
12.	Teppei Bando, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Tagging topic and sensitivity information from sound life-logs, 平成26年度電気関係学会四国支部連合大会講演論文集, 294, Sep. 2014.
13.	Akio Tomotoshi, Jun-ichi Aoe, Kazuhiro Morita and Masao Fuketa : Extraction of non-harmful information from the micro-blog, 平成26年度電気関係学会四国支部連合大会講演論文集, 277, Sep. 2014.
14.	Kenji Oyama, Jun-ichi Aoe, Masao Fuketa, Kazuhiro Morita and Takuki Ogawa : A Decision of Affirmative and Negative Intentions for Time Expressions, 平成26年度電気関係学会四国支部連合大会講演論文集, 276, Sep. 2014.
15.	Syusuke Kawasaki, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Polarity judgments of onomatopoeias for foods, 平成26年度電気関係学会四国支部連合大会講演論文集, 318, Sep. 2014.
16.	Yukiko Higuchi, Jun-ichi Aoe, Masao Fuketa and Kazuhiro Morita : A Recipe Retrieval Method Using Sensitivity Clustering, 平成26年度電気関係学会四国支部連合大会講演論文集, 317, Sep. 2014.
17.	Koichi Kawasaki, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Affirmative and negative intention understanding of responses for interrogative sentences, 平成26年度電気関係学会四国支部連合大会講演論文集, 316, Sep. 2014.
18.	Yusuke Ohmori, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Extraction of Advice from People's Problem in Q&A Sites, 平成26年度電気関係学会四国支部連合大会講演論文集, 302, Sep. 2014.
19.	Ryuki Hayashi, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Emotion movement by time on Twitter, 平成26年度電気関係学会四国支部連合大会講演論文集, 301, Sep. 2014.
20.	Motoki Ohara, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : An automatic construction method of area association word dictionaries for the world, 平成26年度電気関係学会四国支部連合大会講演論文集, 300, Sep. 2014.
21.	Shohei Matsubara, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ユーザの嗜好を考慮した顔文字推薦システムの提案, FIT2014(第13回情報科学技術フォーラム), 229-230, Sep. 2014.
22.	Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 近似直線を用いたダブル配列の圧縮法, 情報処理学会情報基礎とアクセス技術研究会報告, Vol.2014-IFAT-115, Aug. 2014.
23.	Kiyoshi Yasuda, Jun-ichi Aoe and Masao Fuketa : 回想を促すアニメエージェント:エージェント対認知症者2人のグループ会話観察, HAIシンポジウム 2013, Dec. 2013.
24.	Yoshia Bando, Hitoshi Tokushige, Jun Asatani, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : On an Iterative Minimum Distance Search Decoding Algorithm for RS Codes, 2013 Shikoku-section Joint Convention Record of the Institutes of Electrical and Related Engineers, 168, Sep. 2013.
25.	Yuya Tabuchi, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Method of Extracting Company Product Information from Newspapers, 平成25年度電気関係学会四国支部連合大会講演論文集, 325, Sep. 2013.
26.	Taturo Ikarimoto, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe and Kiyoshi Yasuda : A Method of Extracting Dialogue Contents in Communication Systems for Aged Individuals, 平成25年度電気関係学会四国支部連合大会講演論文集, 326, Sep. 2013.
27.	yusuke akasaki, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Twitterを用いた時制を表す特徴語の自動収集に関する研究, 言語処理学会第19回年次大会, Mar. 2013.
28.	Kiyoshi Yasuda, Yukiko Nakano, Jun-ichi Aoe and Noriaki Kuwahara : パソコンによる認知症向け会話支援:自由会話アニメエージェントの開発, 日本高次脳機能障害学会学術総会, Vol.36, 253, Nov. 2012.
29.	Sachie Kosyo, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 地域連想語辞書の構築に関する研究, 言語処理学会第18回年次大会, Mar. 2012.
30.	Takuki Ogawa, Kazuhiro Morita, Masao Fuketa, Mai Kankawa and Jun-ichi Aoe : 音声対話ロボットにおける触覚インタラクションの効果の検証, 言語処理学会第18回年次大会, Mar. 2012.
31.	Takuki Ogawa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 接触機能を持つ音声対話ロボットに関する研究, FIT2011(第10回情報科学技術フォーラム), 547-548, Sep. 2011.
32.	Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 順序木の簡潔表現を用いたトライ辞書の評価., 情報処理学会第72回全国大会, Mar. 2010.
33.	Satoru Nakayama, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 括弧表現の抽出・分類に関する研究, 言語処理学会第16回年次大会, Mar. 2010.
34.	Syotaro Yoshioka, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 部分文字列の組み合わせ索引を用いた類似文字列検索, 言語処理学会第16回年次大会, Mar. 2010.
35.	Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 転置ファイルによる大規模n-gramデータの検索システム, 情報処理学会情報学基礎研究会報告, Vol.2009-FI-95, No.12, 1-6, Jul. 2009.
36.	Hiroyuki Yasuhara, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : A Field Estimation Method for Unknown Words by Field Association Words, 人工知能学会第23回全国大会講演論文集, Jun. 2009.
37.	Susumu Yata, Masahiro Tamura, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ダブル配列による動的辞書の構成と評価, 情報処理学会第71回全国大会, 1-263-1-264, Mar. 2009.
38.	Shuto Arai, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 共起関係に基づく階層型単語概念体系の動的構築法, 情報処理学会第71回全国大会, 2-283-2-284, Mar. 2009.
39.	Susumu Yata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : パトリシアトライに対する簡潔な配列表現, IEICE Technical Report, Vol.107, No.127, 101-106, Jun. 2007.
40.	Nobuo Fujisawa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 部分文字列を用いた綴り誤りに対する訂正候補の高速検索手法, 言語処理学会第13回年次大会, 962-965, Mar. 2007.
41.	Masato Nobutane, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ダブル配列を用いたマシンACの効率的格納手法, 言語処理学会第13回年次大会, 831-834, Mar. 2007.
42.	Kenji Fukuda, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 係り受け関係コストを用いた高速な解探索手法に関する研究, 言語処理学会第13回年次大会, 179-182, Mar. 2007.
43.	Susumu Yata, Kazuhiro Morita, Masao Fuketa, Wataru Hiraishi and Jun-ichi Aoe : ダブル配列におけるキャッシュの効率化, FIT2006(第5 回情報科学技術フォーラム), 71-72, Sep. 2006.
44.	Yohei Tsukuda, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : Web検索エンジンを用いた分野連想語の自動抽出に関する研究, 言語処理学会第12回年次大会, 648-651, Mar. 2006.
45.	Masaki Oono, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ダブル配列による自然言語辞書の高速更新法, 言語処理学会第11回年次大会, 745-748, Mar. 2005.
46.	Syusuke Furusawa, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 人名の別表記の自動抽出手法, 言語処理学会第11回年次大会, 695-698, Mar. 2005.
47.	Yuki Kadoya, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 電子メールの重要文抽出と分類, 言語処理学会第11回年次大会, 321-324, Mar. 2005.
48.	Susumu Yata, Masaki Oono, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : ダブル配列構造による自然言語辞書の記憶量圧縮法, 言語処理学会第11回年次大会, 309-312, Mar. 2005.
49.	Daisuke Kuwata, Kazuhiro Morita, Masao Fuketa and Jun-ichi Aoe : 数量情報を用いた知的検索に関する研究, 言語処理学会第11回年次大会, 265-268, Mar. 2005.
50.	薗一春, 島田良作, Yoneo Yano, Jun-ichi Aoe and 大倉良昭 : 対称3進P1P2符号, 昭和60年度電気関係学会四国支部連合大会, No.14-10, 341-342, Nov. 1985.
51.	Orland Vanin Jr., Yoneo Yano, Jun-ichi Aoe and 島田良作 : Interface to a User-extensible Data Base, 昭和60年度電気関係学会四国支部連合大会, No.12-17, 299, Nov. 1985.
52.	山内美加子, Jun-ichi Aoe, Yoneo Yano and 島田良作 : 階層構造を持つ意味属性構築用ツールの開発, 昭和60年度電気関係学会四国支部連合大会, No.12-3, 271-272, Nov. 1985.
53.	鎌田敬, Jun-ichi Aoe, Yoneo Yano and 島田良作 : パターンマッチングマシンの効率的検索法, 昭和60年度電気関係学会四国支部連合大会, No.12-2, 269-270, Nov. 1985.
54.	藤川正之, Jun-ichi Aoe, Yoneo Yano and 島田良作 : 高速サブストリングテストによるハッシングの効率化, 昭和60年度電気関係学会四国支部連合大会, No.12-1, 267-268, Nov. 1985.
55.	村上博, 島田良作, Yoneo Yano, Jun-ichi Aoe and 大倉良昭 : Fire型巡回ST-AN符号, 昭和60年度電気関係学会四国支部連合大会, 343-344, Nov. 1985.
56.	村上龍太郎, 島田良作, Yoneo Yano, Jun-ichi Aoe and 大倉良昭 : 巡回ST-AN符号のk段多数決論理復号, 昭和59年度電気関係学会四国支部連合大会, No.14-2, 311-312, Nov. 1984.
57.	不動 (名), Jun-ichi Aoe, Yoneo Yano and 島田良作 : スタッフコントロールLALR(1)パーザ, 昭和59年度電気関係学会四国支部連合大会, No.12-12, Nov. 1984.
58.	辻敦生, Jun-ichi Aoe, Yoneo Yano and 島田良作 : 日英機械翻訳システムの開発, 昭和59年度電気関係学会四国支部連合大会, No.12-9, 263-264, Nov. 1984.
59.	森崎雅念, Yoneo Yano, Jun-ichi Aoe, 島田良作 and 吉川研一 : 計算機による分子の組み立てと表示, 昭和59年度電気関係学会四国支部連合大会, No.12-7, 259-260, Nov. 1984.
60.	Yoneo Yano, 松平芳典, Jun-ichi Aoe and 島田良作 : マイコンによる1-0得点表の処理(Ⅲ)マトリックスの操作, 昭和56年度電気関係学会四国支部連合大会, Vol.12-13, 275, Oct. 1981.
61.	Yoneo Yano, 松平芳典, Jun-ichi Aoe and 島田良作 : マイコンによる1-0得点表の処理(Ⅱ)AppleⅡによる処理, 昭和56年度電気関係学会四国支部連合大会, Vol.12-12, 273-274, Oct. 1981.
62.	Jun-ichi Aoe, Yoneo Yano, 原田尚文 and 島田良作 : 弱順位parserの一構成法, 四国支部連合大会, 253-254, Oct. 1975.

Patent:

1.	Jun-ichi Aoe, Masao Fuketa and Kazuhiro Morita : 医療所見文書の自由記述文からプロブレム抽出の規則定義を生成する専用ルールエディタ, 2008-091922 (Mar. 2008), .

Grants-in-Aid for Scientific Research (KAKEN Grants Database @ NII.ac.jp)

Dialogue continuation by utterance induction using multi-attribute sensitivity empathy (Project/Area Number: 15H02770 )
Creation of an evolutionary advanced intelligent robot (Project/Area Number: 15H01712 )
Multiattribute context analysis to "unclarity" sensibility and applications to malicious information judgment on the Web (Project/Area Number: 22240020 )
Sensibility and intension analysis connecting deep conversation structures for sensibility communication (Project/Area Number: 19300072 )
Research for a method of analysis for emotion expressions with relation of semantic collocation and an application of retrieval for emotion information (Project/Area Number: 15300072 )
A fast n-gram full text search independent of document size and it application to a huge text base (Project/Area Number: 10480082 )
A Method of retrieving sentences and its intersection on large text bases (Project/Area Number: 07680432 )
A Partial match technique for multi-attribute keys and its text retrieval application (Project/Area Number: 07558273 )
A Fast Retrieval Algorithm of Trie Structures for a Large Set of Keys (Project/Area Number: 04650317 )
Construction of Context Representations Early Semantic Analysis (Project/Area Number: 01550290 )
Search by Researcher Number (90108853)

Professor Emeritus : Aoe, Jun-ichi

Research

Personal Web Page

Field of Study

Subject of Study

Book / Paper

Book:

Academic Paper (Judged Full Paper):

Academic Letter:

Review, Commentary:

Proceeding of International Conference:

Proceeding of Domestic Conference:

Patent:

Grants-in-Aid for Scientific Research (KAKEN Grants Database @ NII.ac.jp)