Section 2 discusses the formalizations of the different models, showing the ways to transform the certain treebank into preferred forms which the parser can use directly. We will mainly focus on the DOP model, since PCFG model in our view can be seen as the elemental case of DOP model and other models we will consider also follow the similar extraction method of PCFG with only the tree forms va...

We present a hybrid machine learning approach for information extraction from unstructured documents by integrating a learned classifier based on the Maximum Entropy Modeling (MEM), and a classifier based on our work on Data–Oriented Parsing (DOP). The hybrid behavior is achieved through a voting mechanism applied by an iterative tag–insertion algorithm. We have tested the method on a corpus of...

In accordance with the general DOP architecture outlined by (Bod 1995b), a particular DOP model is described by specifying settings for the following four parameters: (1) a formal definition of a well-formed representation for utterance-analyses; (2) a definition of the fragments of the utterance-analyses that may be used as units in constructing an analysis of a new utterance; (3) a set of com...

In accordance with the general DOP architecture outlined by Bod (1995b), a particular DOP model is described by specifying settings for the following four parameters: (1) a formal definition of a well-formed representation for utteranceanalyses; (2) a definition of the fragments of the utterance-analyses that may be used as units in constructing an analysis of a new utterance; (3) a set of comp...

We question whether Adele Goldberg fulfills her self-declared goal in ‘‘Constructions at Work’’, i.e. to develop a usage-based theory that ‘‘can produce an open-ended number of novel utterances based on a finite amount of input’’. We point out converging trends in computational linguistics that suggest formalizations of Construction Grammar. In particular, we go into recent developments in Data...

We study the practicability and performance of different classes of bounding volume hierarchies for self collision detection in complex human hair styles with authentic geometrical properties. In particular, we focus on topology based hierarchies which allow for fast update schemes as well as conventional spatially adapted hierarchies. In this context, we introduce a parameterized k-DOP approac...

In this paper we reconsider pairwise collision detection for rigid motions using a k-DOP bounding volume hierarchy. This data structure is particularly attractive because it is equally efficient for rigid motions as for arbitrary point motions (deformations). We propose a new efficient realignment algorithm, which produces tighter results compared to all known algorithms. It can be implemented ...

This paper presents an optimization of a syntactic disambiguation algorithm for Data Oriented Parsing (DOP) (Bod 93) in particular, and for Stochastic Tree-Substitution Grammars (STSGs) in general. The main advantage of this algorithm on existing alternatives ((Bod 93), (Schabes & Waters 93), (Sima'an et al. 94)) is that its time-complexity is linear, instead of square, in grammar-size (and cub...