Takuki Ogawa

Learn More
— Trie is one of the data structures for keyword matching. The trie is used in natural language processing, IP address routing, and so on. It is represented by the matrix form, the link form, the double array, and LOUDS. The double array combines retrieval speed of the matrix form with compactness of the list form. LOUDS is a succinct data structure using(More)
—For context-based recommendation systems, it is necessary to detect affirmative and negative intentions from answers. However, traditional studies cannot determine these intentions from indirect speech acts. In order to determine these intentions from indirect speech acts, this paper defines a recommendation tree and proposes an algorithm of deriving(More)
— With a fast paced economy, organization need to make a decision as fast as possible, access to large text documents or other information sources is important during decision making. Unfortunately, there are many shortcomings of the handheld devices, such as limited resolution and narrow bandwidth. In order to overcome the shortcomings, this paper proposes(More)
  • 1