ICARUS-Search-Perspective

The perspective provides the following search types:

• Dependency-Search
• * Coreference-Documents

• * ErrorMining for Part-Of-Speech Tags

• * ErrorMining for Dependency Structure

  • * under development will be available soon

Index:

1. How to set up a new search

2. Search Parameter (Dependency-Search)

3. Result Outline(Dependency-Search)

4. Search Menu

5. Graph Query Editor

6. Result Outline

7. Tutorial Dependency Search (passive constructions) with one grouping operator

8. Tutorial Dependency Search (passive constructions with overt logical subjects)

9. Tutorial Dependency Search (passive constructions with overt logical subjects and object)

How to set up a new search:

1. Click on to create a new search.

2. Afterwards the search need to be configured:

3. 

   • Type: Select one of the following search types described above.
   • Data-Set: The Treebank/Document used for the query.

   • Query: Clicking opens the query editor. There may be different types of query editors depending on the search type.

   • Parameters: Search pararameters depending on the search type.

4. Execute Search using the button

5. View the Result by double-clicking the search result or use the inspect-button

Back To Index

Search Parameter (Dependency-Search):

• Search-Mode: Non-Exhaustive (stop after first hit), Exhaustive (add each sentence to the result at most one) and Exhaustive search with Grouping
• Direction: Left-To-Right or Right-To-Left
• Case-Sensitiv: On/Off
• Result Limit: limit the search result (number of hits)

Back To Index

Result Outline(Dependency-Search):

• Aggregated result visualization depending on the number of grouping operators (dimensions) for up to three groups (3D)
• Result highlighting for instances of query constraints
• Fully customizable graph visualization
• Easy navigation through results for up to three groups (3D)

Back To Index

Search Menu:

• = Open the preferences

• = Create a new search

• = Executes the search. Note if no data-set was set the button is disabled

Search History Toolbar: . Every executed search is listed in the search history. The history is available until you close your ICARUS session. The figure shows three search history items. During the search process the icons to the left may change:

• Search is active (first icon) but the target data-set is not loaded yet (second icon)

• Search is active (first icon) and target data-set is loaded (second icon)

• Search finished successful (first icon) and target data-set is loaded (second icon)

• Search was not successful.

• = Clear all search history items

• = Remove the selected search result from the history

• = Display the query of the selected search

• = Display the result of selected search

• Cancel selected search

Back To Index

Graph Query Editor:

This tab is used to build a query. Graph Editor Toolbar:

• = Open the preferences

• = Change the current graph layout. There are three different layout types available

  1. Arc layout

  2. No layout

  3. Tree

• = Clear graph panel - every nodes/edges are deleted

• = Save the current search graph to XML file (may be imported later)

• = Import a search graph XML file

• = Print the current graph

• = Add a new node to the current search graph

• = Adds a new disjunction to the current search graph

• = Connects two nodes (two nodes must be selected before this action can be performed)

• = Connects two nodes with a precedence relation (two nodes must be selected before this action can be performed)

• = Delete selected node/edge (multi selection possible)

• = Opens the edit node/edge dialog (Instead of using this button you may doubleclick a node/edge to open the edit dialog)

• = Duplicate (copy and insert) the selected nodes/edges. Quick way to duplicate a graph. Note: edges are only copied when their source and target node is selected.

• = Copy and the selected nodes/edges. Note: edges are only copied when their source and target node is selected. (strg+c)

• = Paste previously copied nodes/edges. (strg+p)

• = Redraw the graph, can be useful while adding new nodes, edges or constraints may mess up the graph layout. Example (arc-layout): (left nodes/edges unsorted; right nodes/edges reorderes)

Note: The copy&paste nodes/edges can be used to copy graphs from/into other perspectives (e.g. Tutorial 1D,..)

• = Undo the last graph editor operation

• = Redo the last graph editor operation

• = Increase zoom level

• = Switch back to the default zoom level

• = Decrease zoom level

• = Autofit zoom level to the current graph panel size (default off)

• = Compress graph (right-left). Merge node/edge information into a node. Search annotation highlight is never merged and always visible even. (default off)

• = If there are different (unconnected) graphs A, B the search will use the following query (A v B).

Text Query Editor Toolbar:

• = Undo the last text editor operation

• = Redo the last text editor operation

• = Copy and the selected text. (strg+c)

• = Paste previously copied text. (strg+p)

• = Select the entire query text (strg+a)

• = Clear the text query panel.

• = Save query graph to the current selected search history item

• = Generate search graph from text query

• = Generate text query from search graph

Back To Index

Result Outline:

Use this tab to browse the search results. The visialization may be seperated into four differnet presentation styles. We describe the different types in the following section.

Toolbar

• = Open the preferences

• Short query description and number of matches (here 3 grouping operators and 10 matches)

• = Refresh the result outline

• = Save the current search result to a XML file (may be imported later)

• = Import search result XML file

• = Close the result outline

• Grouping operator result informations. The corresponding color and the number of matches for each (ICARUS supports up to three grouping operators) (In this example we have 1. lemma- (red) 8 matches, 2. lemma- (green) 5 matches and 3. pos- 4 matches)

0. No grouping operator is used.

• Query:

• Text Query: [lemma=be [relation=VC, pos=VBN]]

• Result Toolbar:

The result is presented as a list of sentences. Every occurence that matches the query is colored blue. Results (0D)

1. One grouping operator used.

• Query:

• Text Query: [lemma=be [relation=VC, lemma<*>1, pos=VBN]]

• Result Toolbar:

All lemma types found are shown in the list (red) to the left. The user may select one lemma type to get all instances with matching query. Every occurence that matches the query is colored blue and the "grouped" lemma colored red. Results (1D)

• Options:

  • = Switch between numeric/percentage result numbers (total)

  • = Sort by wordform or by occurence (ascending/descending)

  • = Reset list sorting

2. Two grouping operator used.

• Query:

• Text Query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]]]]

• Result Toolbar:

The result is presented as a table. Grouping operator one (red) is on the y-axis and grouping operator two (green) on the x-axis (Note: The x-/y-axis may be fliped clicking on ). Every occurence that matches the query is colored blue. Results (2D)

• Options:

  • = Switch between numeric/percentage result numbers (total)

  • = Sort y-axis by wordform or by occurence (ascending/descending)

  • = Sort x-axis by wordform or by occurence (ascending/descending)

  • = Swap the x-/y-axis (e.g.: (old) x-axis = (new) y-axis and vice versa)

  • = Reset table sorting

3. Two grouping operator used.

• Query:

• Text Query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]][relation=OBJ, lemma<*>3]]]

• Result Toolbar:

The result is presented as a list of sentences. Every occurence that matches the query is colored blue. Results (3D)

• Options:

  • = Switch between numeric/percentage result numbers (total)

  • = Sort by wordform or by occurence (ascending/descending)

  • = Reset list sorting

  • = Sort y-axis by wordform or by occurence (ascending/descending)

  • = Sort x-axis by wordform or by occurence (ascending/descending)

  • = Swap the x-/y-axis (e.g.: (old) x-axis = (new) y-axis and vice versa)

  • = Reset table sorting

  • = Change the grouping operor ([0] = list, [1] = table y-axis and [2] = table x-axis). In this example we have [0] = first (red), [1] = second (green) and [3] = third (brown)

At the lower part of the graph panel is the text outline. The list contains all search results of the selected instance. The selected sentence is shown in the graph panel.

Toolbar:

• = Toggle a textpanel to copy the selected sentence. (see below)

  • 

• = First sentence

• = Previous sentence

• = Shows the current selected sentence (first number) and the total sentences (last number). In the example figure sentence 2 of 3 is selected. The user may navigate using the arrows to the left/right. It is possible to enter the sentence no. in this field by pressing "return" the sentence pops up. Note that the sentence numbers belong to the the internal index (the corpus index may differ for example if one sentence number have been skipped)

• = Next sentence

• = Last sentence

Back To Index

1) Tutorial Dependency Search (passive constructions) with one grouping operator:

If the the user doesn't exactly know the how passive constructions are annotated in a treebank. Then he can use e.g. mate-tools or weblicht to parse a sentence contains a passice construction and copy&paste the structure to the search graph.

1. Parsed sentence "Mary was kissed by a boy." .

2. Select the passice construction

3. Copy the selected cells and edges and switch to the

4. Paste selected cells and edges into the search query editor window

5. The resulting graph when using the arc-layout (recommended)

6. In the following step the search graph (query) will be generalized (double clicking the edge / nodes to open the edge/node editor).

   1. Node 1 properties changed to

   2. Edge properties changed to

   3. Node 2 properties changed to (added grouping operator <*>)

   4. These changes result in a new more generalized version of the search graph (below is the textual query representation) This query matches passive constructions in English as annotated in the CoNLL08 Shared Task data set.

7. Results (1D)

Back To Index

2) Tutorial Dependency Search (passive constructions with overt logical subjects):

We are interested in passive constructions with overt logical subjects, grouped by lemma of the verb and the lemma of the logical subject. We may use the search graph for passive constructions or build the query completly manually (shown here).

1. First of all clear the graph editor panel (if there is any remaining graph) using

2. Add four new nodes you may "automatic reorder" them by clicking

3. Your graph editor should look like

4. There are two ways connecting nodes / adding edges

   1. Select two nodes and connect them clicking on

   2. Place the cursor in the middle of the desired (source) node. A green border will show up . Hold the left mousebutton and move to the (target) node. When you reached the target node again a green border shows up. Release the left mousebutton to draw an edge between those node

5. Double click on the nodes/edges to specify the constraints. (Note: Adding constraints may mess up the graph layout. You may use to redraw the graph)

   1. Node 1: Lemma = be

   2. Node 2: Lemma = <*> (red grouping operator); Part-Of-Speech = VBN

   3. Node 3: Form = by

   4. Node 4: Lemma = <*> (green grouping operator)

   5. Edge 1: Relation = VC

   6. Edge 2: Relation = LGS

   7. Edge 3: Relation = PMOD

6. When every node, edge was linked and there was no error setting the constraints above the search graph should look like this:

   • (Textual query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]]]])

7. Results (2D)

Back To Index

3) Tutorial Dependency Search (passive constructions with overt logical subjects and object):

In tutorial 1) we showed how to create a query using a copied graph from the parser. Tutorial 2) shows how to create a query from scratch. In tutorial 3) we will extend the search graph used in 2) with an additional grouping operator.

1. We start with the following search graph

2. Add one new node you may "automatic reorder" them by clicking

3. Your graph editor should look like

4. Connect the "red" node with the new node using one of the following options

   1. Select the node and connect them clicking on

   2. Place the cursor in the middle of node 2. A green border will show up . Hold the left mousebutton and move to the new node. When you reached the target node again a green border shows up . Release the left mousebutton to draw an edge between those node

5. Double click on the new node/edge to specify the constraints. (Note: Adding constraints may mess up the graph layout. You may use to redraw the graph)

   1. Node 5: Lemma = <*> (browngrouping operator)

   2. Edge 4: Relation = OBJ

6. When every node, edge was linked and there was no error setting the constraints above the search graph should look like this:

   • (Textual query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]][relation=OBJ, lemma<*>3]]])

7. Results (3D)

Back To Index