Jun-ichi Aoe

According to our database1, Jun-ichi Aoe authored at least 152 papers between 1983 and 2016.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
A compression method of double-array structures using linear functions.
Knowl. Inf. Syst., 2016

Videophone Conversation of Two Individuals with Dementia Using an Anime Agent System.
Proceedings of the Digital Human Modeling: Applications in Health, Safety, Ergonomics and Risk Management, 2016

2015
A Method of Music Retrieval Using Impression Keywords.
JSW, 2015

Experimental Observations of Construction Methods for Double Array Structures Using Linear Functions.
JSW, 2015

A new compression method for double-array structures by a hierarchical representation.
IJISTA, 2015

Improved dialogue communication systems for individuals with dementia.
IJCAT, 2015

Double array structures based on byte segmentation for n-gram.
IJCAT, 2015

Trie compact representation using double-array structures with string labels.
Proceedings of the IEEE 8th International Workshop on Computational Intelligence and Applications, 2015

2014
A Cloud Based Communication System for Elders Using Dialogue Control.
JSW, 2014

Compression of double array structures for fixed length keywords.
Inf. Process. Manage., 2014

2013
A method of extraction and visualisation for relationships among objects on web.
IJISTA, 2013

Agent-based communication systems for elders using a reminiscence therapy.
IJISTA, 2013

An incremental construction method of a large-scale thesaurus using co-occurrence information.
IJCAT, 2013

Document summarisation on mobile devices using non-negative matrix factorisation.
IJCAT, 2013

Effectiveness of an implementation method for retrieving similar strings by trie structures.
IJCAT, 2013

An Efficient Method of Summarizing Documents Using Impression Measurements.
Computing and Informatics, 2013

2011
Extraction, selection and ranking of Field Association (FA) Terms from domain-specific corpora for building a comprehensive FA terms dictionary.
Knowl. Inf. Syst., 2011

A new approach for Arabic text classification using Arabic field-association terms.
JASIST, 2011

Context constraint disambiguation of word semantics by field association schemes.
Inf. Process. Manage., 2011

A method of extracting malicious expressions in bulletin board systems by using context analysis.
Inf. Process. Manage., 2011

A fast search method of similar strings from dictionaries.
IJCAT, 2011

A new approach for summarizing documents using generic impressions expressions.
Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 2011

A study of dialogue robots with haptic interactions.
Proceedings of the 7th International Conference on Natural Language Processing and Knowledge Engineering, 2011

2010
New methods for compression of MP double array by compact management of suffixes.
Inf. Process. Manage., 2010

A new method for solving context ambiguities using field association knowledge.
Proceedings of the 6th International Conference on Natural Language Processing and Knowledge Engineering, 2010

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, 2010

New Method using Declinable Words and Concurrent Words to Create a Large Number of FA Words.
Proceedings of the ICAART 2010 - Proceedings of the International Conference on Agents and Artificial Intelligence, Volume 1, 2010

2009
Relevant estimation among fields using field association words.
IJCAT, 2009

A compressed trie structure using divided keys.
IJCAT, 2009

An automatic extraction method of word tendency judgement for specific subjects.
IJCAT, 2009

A method to implement effective My-page service system using three-dimensional vectors.
IJCAT, 2009

A method of building Chinese field association knowledge from Wikipedia.
Proceedings of the 5th International Conference on Natural Language Processing and Knowledge Engineering, 2009

Intelligent QA Systems Using Semantic Expressions.
Proceedings of the Knowledge-Based and Intelligent Information and Engineering Systems, 2009

2008
Ranking of field association terms using Co-word analysis.
Inf. Process. Manage., 2008

Automatic acquisition for sensibility knowledge using co-occurrence relation.
IJCAT, 2008

A method for extracting knowledge from medical texts including numerical representation.
IJCAT, 2008

Estimation of FAQ knowledge bases by using semantic expressions for questions and answers.
IJCAT, 2008

2007
An efficient deletion method for a minimal prefix double array.
Softw., Pract. Exper., 2007

A compact static double-array keeping character codes.
Inf. Process. Manage., 2007

Improvement of building field association term dictionary using passage retrieval.
Inf. Process. Manage., 2007

2006
Automatic building of new Field Association word candidates using search engine.
Inf. Process. Manage., 2006

An automatic filtering method for field association words by deleting unnecessary words.
Int. J. Comput. Math., 2006

A New Approach for Improving Field Association Term Dictionary Using Passage Retrieval.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2006

Estimation of FAQ Knowledge Bases by Introducing Measurements.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2006

Building New Field Association Term Candidates Automatically by Search Engine.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2006

A New Approach for Automatic Building Field Association Words Using Selective Passage Retrieval.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2006

2005
A method of extracting and evaluating good and bad reputations for natural language expressions.
International Journal of Information Technology and Decision Making, 2005

A sentence classification technique using intention association expressions.
Int. J. Comput. Math., 2005

New Approach for Speeding-up Technique of the Retrieval Using Dynamic Full-Text Search Algorithm.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

A New Technique of Determining Speaker's Intention for Sentences in Conversation.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

An Improvement Approach for Word Tendency Using Decision Tree.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

2004
A retrieval method of a double array in secondary storage.
Systems and Computers in Japan, 2004

A Fast Dynamic Full-Text Search Method Using Efficient Block Management Structure.
JACIII, 2004

Fast and compact updating algorithms of a double-array structure.
Inf. Sci., 2004

A compression algorithm using integrated record information for translation dictionaries.
Inf. Sci., 2004

An efficient e-mail filtering using time priority measurement.
Inf. Sci., 2004

Estimating sentence types in computer related new product bulletins using a decision tree.
Inf. Sci., 2004

An improvement key deletion method for double-array structure using single-nodes.
Inf. Process. Manage., 2004

Word classification and hierarchy using co-occurrence word information.
Inf. Process. Manage., 2004

A high-speed dynamic full-text search method by using memory management.
Int. J. Comput. Math., 2004

A new compression method of double array for compact dictionaries.
Int. J. Comput. Math., 2004

A New Method of Detecting Time Expressions for E-mail Messages.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

A Method of Extracting and Evaluating Popularity and Unpopularity for Natural Language Expressions.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

A Fast Dynamic Method Using Memory Management.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

A New Classification Method of Determining the Speaker's Intention for Sentences in Conversation.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

New Hierarchy Technique Using Co-occurrence Word Information.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2004

An new E-mail filtering technique using time priority measurement.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

A new classification sentence technique using intension expressions.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

A compact memory space of dynamic full-text search using Bi-gram index.
Proceedings of the 9th IEEE Symposium on Computers and Communications (ISCC 2006), June 28, 2004

2003
A fast and compact elimination method of empty elements from a double-array structure.
Softw., Pract. Exper., 2003

Documents similarity measurement using field association terms.
Inf. Process. Manage., 2003

An Evaluation Method of Words Tendency using Decision Tree.
Proceedings of the ACL 2003, 2003

2002
Improvement of the LR parsing table and its application to grammatical error correction.
Inf. Sci., 2002

Extraction of field-coherent passages.
Inf. Process. Manage., 2002

A dynamic construction algorithm for the Compact Patricia trie using the hierarchical structure.
Inf. Process. Manage., 2002

An evaluation method of words tendency depending on time-series variation and its improvements.
Inf. Process. Manage., 2002

A new method for selecting English field association terms of compound words and its knowledge representation.
Inf. Process. Manage., 2002

An Efficient Trie Construction for Natural Language Dictionaries.
Int. J. Comput. Math., 2002

2001
Fast insertion methods of a double-array structure.
Softw., Pract. Exper., 2001

An efficient substring search method by using delayed keyword extraction.
Inf. Process. Manage., 2001

A method for improving full text search using signature files.
Int. J. Comput. Math., 2001

Implementation of update algorithms for a double-array structure.
Proceedings of the IEEE International Conference on Systems, 2001

On the construction of reduced double array structures by dividing tries.
Proceedings of the IEEE International Conference on Systems, 2001

Automatic text summarization based on keyword derivation.
Proceedings of the IEEE International Conference on Systems, 2001

A E-mail Filtering System Based on Personal Profiles.
Proceedings of the Sixth Natural Language Processing Pacific Rim Symposium, 2001

A Compression Method of Double Array Structures.
Proceedings of the World Multiconference on Systemics, Cybernetics and Informatics, 2001

A Method of Pre-computing Connectivity Relations for Japanese/Korean POS Tagging.
Proceedings of the Computational Linguistics and Intelligent Text Processing, 2001

2000
An efficient representation for implementing finite state machines based on the double-array.
Inf. Sci., 2000

A fast and compact technique of implementing transition tables for finite state automata.
Inf. Sci., 2000

A document classification method by using field association words.
Inf. Sci., 2000

Two improved access methods on compact binary (CB) trees.
Inf. Process. Manage., 2000

Similarity measurement using term negative weight and its application to word similarity.
Inf. Process. Manage., 2000

Conceptual and Quantitative Representations of Time Expressions.
Int. J. Comput. Proc. Oriental Lang., 2000

1999
Efficient Controlling of Parsing-Stack Operation for LR Parsers.
Inf. Sci., 1999

A link trie structure of storing multiple attribute relationships for natural language dictionaries.
Int. J. Comput. Math., 1999

Multi-lingual Multi-media Information Retrieval System.
Proceedings of the First NTCIR Workshop on Research in Japanese Text Retrieval and Term Recognition, 1999

1998
A Substring search Algorithm in Extendible Hashing.
Inf. Sci., 1998

A fast Algorithm of Retrieving Common Sentences.
Inf. Sci., 1998

An Efficient Algorithm for Full Text Retrieval for Multiple Keywords.
Inf. Sci., 1998

An Improvement ofthe Aho-Corasick Machine.
Inf. Sci., 1998

A Fast Retrieving Algorithm of Hierarchical Relationships Using Trie Structures.
Inf. Process. Manage., 1998

A Fast Method of Determining Weighted Compound Keywords from Text Databases.
Inf. Process. Manage., 1998

An efficient algorithm for retrieving example sentences.
Int. J. Comput. Math., 1998

Efficient multi-attribute pattern matching.
Int. J. Comput. Math., 1998

A Fast Morphological Analysis Using the Extended AC Machine for Oriental Languages.
Proceedings of the Prague Stringology Club Workshop 1998, Prague, Czech Republic, 1998

Automatic error recovery in the natural language interface.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

A fast and compact data structure of storing multi-attribute relations among words.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

A method for understanding time expressions.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

An efficient retrieval algorithm for case structures using TRIE.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

A multi-stage retrieval algorithm for postings on index tables.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

An efficient dictionary access method for morphological analysis.
Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, 1998

1997
Improvement of binary digital search trees using hierarchical structures.
Systems and Computers in Japan, 1997

An efficient method for storing and retrieving graph structures.
Systems and Computers in Japan, 1997

An order searching algorithm of extensible hashing.
Int. J. Comput. Math., 1997

An Efficient Trie Hashing Method Using a Compact Binary Trie.
Proceedings of the Prague Stringology Club Workshop 1997, 1997

1996
A Trie Compaction Algorithm for a Large Set of Keys.
IEEE Trans. Knowl. Data Eng., 1996

A method for understanding intentions of indirect speech acts in natural language interfaces.
Systems and Computers in Japan, 1996

Fast Allocation of Diagrams Without Backtracking Processes.
Inf. Sci., 1996

A New Approach to Phoneme Recognition by Phoneme Filter Neural Networks.
Inf. Sci., 1996

The Time-Sliced Paradigm - A Connectionist Method for Continous Speech Recognition.
Inf. Sci., 1996

A fast retrieval technique for large graph structures.
Int. J. Comput. Math., 1996

An Efficient Multi-Attribute Pattern Matching Machine.
Proceedings of the Prague Stringology Club Workshop 1996, 1996

1995
A dictionary retrieval algorithm using two trie structures.
Systems and Computers in Japan, 1995

A Method for the Expansion and Contraction of Texts Size by Using the String Replacement Algorithm.
Inf. Sci., 1995

An Automatic Selection Method and Its Application to Key Search Algorithms.
Inf. Sci., 1995

A Robust Method for Understanding NL Interface Commands in the ICI Intelligent Command Interpreter.
Inf. Sci., 1995

A Shift-First Strategy for Interleaved LD Parsing.
Inf. Sci., 1995

An incremental algorithm for string pattern matching machines.
Int. J. Comput. Math., 1995

Word category prediction based on neural network.
Int. J. Comput. Math., 1995

An Automatic Selection Method of Key Search Algorithms.
IEICE Transactions, 1995

Unification-Failure Filter for Natural Language.
IEICE Transactions, 1995

A parallel recurrent cascade-correlation neural network with natural connectionist glue.
Proceedings of International Conference on Neural Networks (ICNN'95), Perth, WA, Australia, November 27, 1995

1994
A Method of Compressing Trie Structures.
Softw., Pract. Exper., 1994

Automatic Synthesis of State Machines from Trace Diagrams.
Softw., Pract. Exper., 1994

An Automatic Selection Method of Key Search Algorithms Based on Expert Knowledge Bases.
SIGIR Forum, 1994

1992
An Efficient Implementation of Trie Structures.
Softw., Pract. Exper., 1992

A practical method for implementing string pattern matching machines.
Inf. Sci., 1992

1990
A Compendium of Key Search References.
SIGIR Forum, 1990

A Method for Building Knowledge Bases with Morphological Semantics.
SIGIR Forum, 1990

A practical method for compressing sparse matrices with variant entries.
Int. J. Comput. Math., 1990

1989
An Efficient Digital Search Algorithm by Using a Double-Array Structure.
IEEE Trans. Software Eng., 1989

An Efficient Implementation of Static String Pattern Matching Machines.
IEEE Trans. Software Eng., 1989

An Efficient Implementation of String Pattern Matching Machines for a Finite Number of Keywords.
SIGIR Forum, 1989

Storing a Tree Structure by Using Decimal Notations.
SIGIR Forum, 1989

A fast digital search algorithm using a double-array structure.
Systems and Computers in Japan, 1989

Intelligent machine translation using a contextual knowledge representation.
Proceedings of the IEEE International Workshop on Tools for Artificial Intelligence: Architectures, 1989

An efficient algorithm of compressing decimal notations for tree structures.
Proceedings of the 13th Annual International Computer Software and Applications Conference, 1989

1988
Contextual knowledge for summarizing Japanese texts and generating English sentences.
Proceedings of the Twelfth International Computer Software and Applications Conference, 1988

An efficient digital search algorithm by using a double-array structure.
Proceedings of the Twelfth International Computer Software and Applications Conference, 1988

1985
Nonbinary Arithmetic AN Codes Using Odd Radix Expressions.
IEEE Trans. Computers, 1985

1984
A Method for Improving String Pattern Matching Machine.
IEEE Trans. Software Eng., 1984

1983
A Practical Method for Reducing Weak Precedence Parsers.
IEEE Trans. Software Eng., 1983


  Loading...