Details

Autor(en) / Beteiligte

• Oles, Frank J.

Titel

Precedence–inclusion patterns and relational learning

Ist Teil von

• Theoretical computer science, 2005-09, Vol.342 (2), p.262-315

Ort / Verlag

Amsterdam: Elsevier B.V

Erscheinungsjahr

2005

Link zum Volltext

Quelle

EZB-FREE-00999 freely available EZB journals

Beschreibungen/Notizen

• In this paper we introduce precedence–inclusion patterns, which are sets with a strictly partially ordered set of strict partial orders, along with some additional structure. The definition of these structures reflects how multiple partial orders interact in a number of situations such as in text, images, and video. In particular, precedence–inclusion patterns generalize constituent structure trees familiar to computational linguists. Our interest in these objects was initially sparked by their connection with problems of relational learning. We develop the general mathematical theory of precedence–inclusion patterns, we show that each finite set of finite precedence–inclusion relations has a minimal most specific generalization that is unique up to isomorphism, and we explain how this result relates to relational learning.