Differences between revisions 4 and 5
⇤ ← Revision 4 as of 2014-01-22 08:19:43 →
Size: 3676
Editor: GregorThiele
Comment:
← Revision 5 as of 2014-01-23 08:59:29 → ⇥
Size: 8252
Editor: GregorThiele
Comment:
Deletions are marked like this. Additions are marked like this.
Line 36: Line 36:
===== Tutorial Dependency Search (passive constructions) with one grouping operator: ===== ===== 1) Tutorial Dependency Search (passive constructions) with one grouping operator: =====
Line 50: Line 50:

===== 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 {{attachment:search_clear.png}}
 1. Add four new nodes {{attachment:search_add-node.png}} you may "automatic reorder" them by clicking {{attachment:search_reorder-graph.png}}
 1. Your graph editor should look like {{attachment:search_t2_4nodes.png}}
 1. There are two ways connecting nodes / adding edges
  1. Select two nodes {{attachment:search_t2_addingedge-a.png}} and connect them clicking on {{attachment:search_add-edge.png}}
  1. Place the cursor in the middle of the desired (source) node. A green border will show up {{attachment:search_hl-node.png}}. 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 {{attachment:search_t2_addingedge-b.png}}
 1. Double click on the nodes/edges to specify the constraints. (Note: Adding constraints may mess up the graph layout. You may use {{attachment:search_reorder-graph.png}} to redraw the graph)
  1. Node 1: Lemma = be {{attachment:search_t2-n1.png}}
  1. Node 2: Lemma = <*> (red grouping operator); Part-Of-Speech = VBN {{attachment:search_t2-n2.png}}
  1. Node 3: Form = by {{attachment:search_t2-n3.png}}
  1. Node 4: Lemma = <*> (green grouping operator) {{attachment:search_t2-n4.png}}
  1. Edge 1: Relation = VC {{attachment:search_t2-e1.png}}
  1. Edge 2: Relation = LGS {{attachment:search_t2-e2.png}}
  1. Edge 3: Relation = PMOD {{attachment:search_t2-e3.png}}
 1. When every node, edge was linked and there was no error setting the constraints above the search graph should look like this: {{attachment:search_t2-sg.png}}
  (Textual query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]]]])
 1. Results (2D) [[attachment:search_result_2D-a.png|{{attachment:search_result_2D-a.png|attachment:search_result_2D-a.png|width="400"}}]] [[attachment:search_result_2D-b.png|{{attachment:search_result_2D-b.png|attachment:search_result_2D-b.png|width="400"}}]]


===== 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 {{attachment:search_t2-sg.png}}
 1. Add one new node {{attachment:search_add-node.png}} you may "automatic reorder" them by clicking {{attachment:search_reorder-graph.png}}
 1. Your graph editor should look like {{attachment:search_t3-n5added.png}}
 1. Connect the "red" node with the new node using one of the following options
  1. Select the node {{attachment:search_t3-addedge-c.png}} and connect them clicking on {{attachment:search_add-edge.png}}
  1. Place the cursor in the middle of node 2. A green border will show up {{attachment:search_t3-addedge-a.png}}. Hold the left mousebutton and move to the new node. When you reached the target node again a green border shows up {{attachment:search_hl-node.png}}. Release the left mousebutton to draw an edge between those node {{attachment:search_t3-addedge-b.png}}
 1. Double click on the new node/edge to specify the constraints. (Note: Adding constraints may mess up the graph layout. You may use {{attachment:search_reorder-graph.png}} to redraw the graph)
  1. Node 5: Lemma = <*> (browngrouping operator) {{attachment:search_t3-n5.png}}
  1. Edge 4: Relation = OBJ{{attachment:search_t3-e4.png}}
 1. When every node, edge was linked and there was no error setting the constraints above the search graph should look like this: {{attachment:search_t3-sg.png}}
  (Textual query: [lemma=be [relation=VC, lemma<*>1, pos=VBN [relation=LGS, form=by [relation=PMOD, lemma<*>2]][relation=OBJ, lemma<*>3]]])
 1. Results (3D) [[attachment:search_result_3D-a.png|{{attachment:search_result_3D-a.png|attachment:search_result_3D-a.png|height="170"}}]] [[attachment:search_result_3D-b.png|{{attachment:search_result_3D-b.png|attachment:search_result_3D-b.png|width="400"}}]]

ICARUS-Search-Perspective

The search_perspective.png 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

How to set up a new search:

  1. Click on search_new.png to create a new search.

  2. Afterwards the search need to be configured:

  3. search_configuration.png

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

    • Query: Clicking search_query.png 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 search_execute.png button

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

Search Parameters (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)

Result View (Dependency-Search):

attachment:search_result_1D.png

  • 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)

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." search_example_mt.png .

  2. Select the passice construction search_example_mt_selected.png

  3. Copy the selected cells and edges search_copy.png and switch to the search_perspective.png

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

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

  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 search_edit-node.png changed to search_edit-node-b.png

    2. Edge search_example-edge.png changed to search_example-edge-b.png

    3. Node 2 search_example-node2.png changed to (added grouping operator <*>) search_example-node2-b.png search_example-node2-c.png

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

  7. Results (1D) attachment:search_result_1D.png

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 search_clear.png

  2. Add four new nodes search_add-node.png you may "automatic reorder" them by clicking search_reorder-graph.png

  3. Your graph editor should look like search_t2_4nodes.png

  4. There are two ways connecting nodes / adding edges

    1. Select two nodes search_t2_addingedge-a.png and connect them clicking on search_add-edge.png

    2. Place the cursor in the middle of the desired (source) node. A green border will show up search_hl-node.png. 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 search_t2_addingedge-b.png

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

    1. Node 1: Lemma = be search_t2-n1.png

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

    3. Node 3: Form = by search_t2-n3.png

    4. Node 4: Lemma = <*> (green grouping operator) search_t2-n4.png

    5. Edge 1: Relation = VC search_t2-e1.png

    6. Edge 2: Relation = LGS search_t2-e2.png

    7. Edge 3: Relation = PMOD search_t2-e3.png

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

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

  7. Results (2D) attachment:search_result_2D-a.png attachment:search_result_2D-b.png

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 search_t2-sg.png

  2. Add one new node search_add-node.png you may "automatic reorder" them by clicking search_reorder-graph.png

  3. Your graph editor should look like search_t3-n5added.png

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

    1. Select the node search_t3-addedge-c.png and connect them clicking on search_add-edge.png

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

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

    1. Node 5: Lemma = <*> (browngrouping operator) search_t3-n5.png

    2. Edge 4: Relation = OBJsearch_t3-e4.png

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

    • (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) attachment:search_result_3D-a.png attachment:search_result_3D-b.png

extern/ICARUS-Search-Perspective (last edited 2014-04-25 12:09:32 by GregorThiele)