A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as...
In this paper, we study PAC-leaming algorithms for specialized classes of deterministic finite automata (DFA). Inpartictdar, we study branchingprogrsms, and we investigate the int...
Abstract. Humans demonstrate a remarkable ability to parse complicated motion sequences into their constituent structures and motions. We investigate this problem, attempting to le...
We propose an algorithm for extracting fields from HTML search results. The output of the algorithm is a database table– a data structure that better lends itself to high-level...
This paper analyzes the impact of several lexical and grammatical features in automated assessment of students' finegrained understanding of tutored concepts. Truly effective...