Get Parse Thicket essential facts below. View Videos
or join the Parse Thicket discussion
. Add Parse Thicket
to your PopFlock.com topic list for future reference or share
this resource on social media.
A Parse Thicket
is a graph that represents the syntactic structure of a paragraph of text in natural language processing. A Parse Thicket includes Parse tree for each sentence for this paragraph plus some arcs for other relations between words other than syntactic. Parse thickets can be constructed for both constituency parse trees and dependency parse trees. The relations which link parse trees within a Parse Thicket are:
To assess similarity between texts, such as a question and its candidate answers, parse thickets can be generalized 
In the image of parse thicket coreferences and entity-entity links are shown in solid red, and rhetoric/speech act relations are shown in dotted red. ETAP parser and tree visualization software is used.
To compute generalization of two parse thickets, one needs to find their maximum common sub-graph (sub-thicket).
Generalizing two parse thickets
A fragment showing particular cases of generalizing
- ^ Galitsky B, Kuznetsov SO, Usikov DA. Parse Thicket Representation for Multi-sentence Search. Lecture Notes in Computer Science. 2013;7735:1072-1091. doi:10.1007/978-3-642-35786-2_12.
- ^ Galitsky B, Ilvovsky D, Kuznetsov SO, Strok F. Matching sets of parse trees for answering multi-sentence questions. Recent Advances in Natural Language Processing. 2013.
- ^ Galitsky B. Machine learning of syntactic parse trees for search and classification of text. Engineering Applications of Artificial Intelligence. 2013;26(3):153-172. doi:10.1016/j.engappai.2012.09.017.
- ^ Boguslavsky, I., Iomdin, L., Sizov V.. Interactive enconversion by means of the ETAP-3 system. Culture, Language and Information Technologies. 2003.
- ^ Galitsky B, Ilvovsky D, Kuznetsov SO, Strok F. Finding Maximal Common Sub-parse Thickets
for Multi-sentence Search. Lecture Notes in Artificial Intelligence. 2013;8323.