Adjacency pair recognition, a necessary component of discussion thread reconstruction, is the task of recognizing reply-to relations between pairs of discussion turns. Previously, dialogue act classification and metadata-based features have been shown useful in adjacency pair recognition. However, for certain forums such as Wikipedia discussions, metadata is not available, and existing dialogue...

This investigation aimed to analyze the use of turn-takings, organization adjacency pairs that are practised in Pakistani drama. Drawing on framework presented by Young (2011), this research has provided insight into relationship between conversational and situational features which conversations were performed, figure out purpose operating a conversation specific situation, especially entertai...

Our main theoretical result is that, if a simple polytope has a pair of complementary vertices (i.e., two vertices with no facets in common), then it has a second such pair. Using this result, we improve adjacency testing for vertices in both simple and non-simple polytopes: given a polytope in the standard form {x ∈ R |Ax = b and x ≥ 0} and a list of its V vertices, we describe an O(n) test to...

A problem in dialogue research is that of finding and managing expectations. Adjacency pair theory has widespread acceptance, but traditional classification features (in particular, ‘previous-tag’ type features) do not exploit this information optimally. We suggest a method of dialogue segmentation that verifies adjacency pairs and allows us to use dialogue-level information within the entire s...

In digital topology, Euclidean n-space Rn is usually modeled either by the set of points of a discrete grid, or by the set of n-cells in a convex cell complex whose union is Rn. For commonly used grids and complexes in the cases n = 2 and 3, certain pairs of adjacency relations (κ, λ) on the grid points or n-cells (such as (4,8) and (8,4) on Z2) are known to be “good pairs”. For these pairs of ...

In this paper we propose several equivalent definitions of digital curves and hypersurfaces in arbitrary dimension. The definitions involve properties such as one-dimensionality of curves and (n − 1)dimensionality of hypersurfaces that make them discrete analogs of corresponding notions in topology. Thus this work appears to be the first one on digital manifolds where the definitions involve th...

In this text we show that the notion of a “good pair” that was introduced in the paper [6] has actually known models. We will show, how to choose cubical adjacencies, the generalizations of the well known 4and 8-neighborhood to arbitrary dimensions, in order to find good pairs. Furthermore, we give another proof for the well known fact that the Khalimsky-topology [7] implies good pairs. The out...