Repository navigation
Experiment module
Kateryna Tymoshenko edited this page Mar 10, 2017
·
3 revisions
All the Experiment module implementations are available as classes in the it.unitn.nlpir.experiment.fqa package (except for CH-cQa and CONST-cQA). They generate structural representations for a pair of input texts (T1,T2)
See the descriptions of the structures in the tables below. Images are reduced in size to fit into the table. Open them in a new browser tab to see the full-size version.
| Abbreviation | Class | Example | Description |
|---|---|---|---|
| CH | CHExperiment |
![]() |
Here, T1 and T2 are both represented as shallow tree structures with lemmas as leaves, their POS-tags as their parent nodes. The POS- tag nodes are further grouped under chunk and sentence nodes. CH excludes punctuation marks and words not included into any chunk. |
| DT1 | DT1Experiment |
![]() |
A dependency tree in which grammatical relations become nodes and lemmas are located at the leaf level |
| DT2 | DT2Experiment |
![]() |
DT1 modified to include the chunking information, and lemmas in the same chunk are grouped under the same chunk node. |
| LCTQ-DT2A | LCTqDT2aExperiment |
![]() |
T2 is represented as DT2. T1 is represented as a lexical-centered dependency tree with the grammatical relation REL(head,child) represented as (head (child HEAD GR-REL POS-pos(head)). Here REL is a grammatical relation, head and child are the head and child lemmas in the relation, respectively, and pos(head) is the POS-tag of the head lemma. GR- and POS- tag in the node name indicates that the node is grammar relation or part-of-speech node, respectively. |
| CONST | ConstExperiment |
TO BE ADDED | Constituency tree |
| CHp | CHpExperiment |
![]() |
Same as CH, but punctuation marks and words not included into any chunk are included into the structure |
| CH-cQa | CHcQaExperiment |
TO BE ADDED | TO BE ADDED |
| CONST-cQA | ConstQaExperiment |
TO BE ADDED | TO BE ADDED |
Note that all the structures above, except for *-cQa, do relational linking (see the Home page for the list of the papers with the relational linking process description).




