Parse thicket representations of text paragraphs

P. 239–255.

Galitsky B., Ilvovsky D., Kuznetsov S., Strok F. V.

We develop a graph representation and learning technique for parse structures
for sentences and paragraphs of text. We introduce parse thicket
as a set of syntactic parse trees augmented by a number of arcs for intersentence
word-word relations such as coreference and taxonomies. These
arcs are also derived from other sources, including Rhetoric Structure and
Speech Act theory. We introduce respective indexing rules that identify inter-
sentence relations and join phrases connected by these relations in the
search index. We propose an algorithm for computing parse thickets from
parse trees. We develop a framework for automatic building and generalizing
of parse thickets. The proposed approach is used for evaluation in the
product search where search queries include multiple sentences. We draw
the comparison for search relevance improvement by pair-wise sentence
generalization and thicket-level generalization.

Keywords: syntactic generalization, search relevance, parse thicket, question answering

Publication based on the results of: Mathematical Models, Algorithms, and Software Tools for the Intelligent Analysis of Big Textual and Structural Data (2013)

In book

Компьютерная лингвистика и интеллектуальные технологии: По материалам ежегодной Международной конференции «Диалог» (Бекасово, 29 мая - 2 июня 2013 г.). В 2-х т.

Т. 1: Основная программа конференции. Вып. 12 (19). , М.: РГГУ, 2013.