Our method for TaskMine consists of three steps. Firstly, we search for seed Web pages by using the query string with a word houhou , which means method . We collect more pages in consideration of the anchor texts in the seed pages. Then, we nd pairs of chunks satisfying prede ned patterns by dependency parsing on the sentences. We extract a target and a postpositional particle from a depending...

We introduce a system focused on solving SemEval 2016 Task 2 – Interpretable Semantic Textual Similarity. The system explores machine learning and rule-based approaches to the task. We focus on machine learning and experiment with a wide variety of machine learning algorithms as well as with several types of features. The core of our system consists in exploiting distributional semantics to com...

This paper presents on-going research on automatic extraction of bilingual lexicon from English-Japanese parallel corpora. The main objective of this paper is to examine various Ngram models of generating translation units for bilingual lexicon extraction. Three N-gram models, a baseline model (Bound-length N-gram) and two new models (Chunk-bound Ngram and Dependency-linked N-gram) are compared...

Working memory (WM) uses knowledge and relations to organize store multiple items in fewer structured units, or chunks. We investigated: (a) whether a crowd that exceeds the WM capacity is retained better if individuals can be grouped social chunks; (b) what counts as chunk: two involved meaningful interaction just spatially close face-to-face. In delayed change-detection task, participants wer...

This paper discusses the intended balance between shallow parsing strategies and full parsing needs in the context of a treebank creation. Two kinds of mechanisms are described, which make the output of the shallow processors compatible for further stages of analyses. These mechanisms are divided into two groups: adapting and repairing ones.

We describe a stochastic approach to partial parsing, i.e., the recognition of syntactic structures of limited depth. The technique utilises Markov Models, but goes beyond usual bracketing approaches, since it is capable of recognising not only the boundaries, but also the internal structure and syntactic category of simple as well as complex NP’s, PP’s, AP’s and adverbials. We compare tagging ...

Familiar chunks can be processed highly efficiently, and this automatic process can prohibit the problem solver from developing novel and original ways to creatively solve difficult problems. For this reason, the role of the reverse process, chunk decomposition (CD), the process by which familiar patterns are broken down into their component elements in order to be regrouped in another meaningf...

To deal with autonomous agents’ knowledge and subjective beliefs in open, heterogeneous and inherently distributed settings, we need special formalisms that combine knowledge from multiple and potentially heterogeneous interconnected contexts. Each context contains a chunk of knowledge defining a logical theory, called ontology unit). While standard logics may be used, subjectiveness and hetero...