Skip to content

Language Archiving Technology

Sections
Personal tools
You are here: Home » Tools » Annex/Trova » Annex Online Manual » 3.3. Multiple Layer Search tab

3.3. Multiple Layer Search tab

Document Actions

3.3. Multiple Layer Search tab

The Multiple Layer Search tab houses the most comprehensive search in Annex. Similar to the Single Layer Search tab a Query History is kept, enabling the user to go back to previous queries. The two modes case sensitive/case insensitive and substring match/exact match/regular expression are also similar to the Single Layer Search tab. The first new element is the Clear-button. Clicking this button will clear all data of a query.

The buttons Minimal Duration and Maximal Duration enables you to constrict the minimal and maximal duration of each result. When you click on one of the buttons, a dialog window appears, e.g.:

Minimal Duration

Figure 3.8. Minimal Duration


Here you can enter the minimal or maximal duration as the total number of milliseconds or in hours:minutes:seconds.milliseconds. A value of 0 milliseconds or 00:00:00.000 yields as undefined. Searching for annotations with a maximum duration being less then the minimum duration is impossible. Hence, entering conflicting values results in an error message saying that the combination is impossible. After entering a correct duration, it will be displayed in the corresponding button.

The buttons Begin After and End Before give a dialog similar to that of the previous two buttons. They give the possibility to restrict the annotations in the result to begin after a certain time and end before a certain time. Entering a Begin After-time that is greater than the End Before-time or vice versa results in an error message saying it is impossible. After entering a correct time, it will be displayed in the corresponding button.

Search string and constraints

Beneath the buttons discussed above, you will find a table consisting of white and green fields. Search strings are entered in the white fields while a green field between two non-empty white fields must contain a constraint.

Multiple Layer Search

Figure 3.9. Multiple Layer Search


The fields on one row give the search strings and constraints to be matched by annotations on one tier. The result of having three rows in the query table is that the search engine may find annotations on three tiers as one hit. Furthermore, it is possible to restrict the search to one (type of) tier for each row by choosing the appropriate option in the pull-down menu on the right of each row.

Let us first take a look at search strings and constraints in one row. If you enter two search strings in two white fields separated by a green field, you must fill in that green field i.e. make a constraint. Right clicking on the green field gives a context menu offering the following constraints:

  • = N annotations: between the annotations containing the two search strings, there must be exactly N annotations.

  • > N annotations: between the annotations containing the two search strings, there must be more than N annotations.

  • < N annotations: between the annotations containing the two search strings, there must be less than N annotations.

  • = X milliseconds: between the annotations containing the two search strings, there must be exactly X milliseconds.

  • > X milliseconds: between the annotations containing the two search strings, there must be more than X milliseconds.

  • < X milliseconds: between the annotations containing the two search strings, there must be exactly X milliseconds.

  • No constraints: there are no constraints.

  • Clear: clear the current constraint.

When you click on Find and there is an empty constraint between two non-empty search string fields, you will get an error message. You will also get an error message if there is an empty search string field and constraint fields between two non-empty search string fields.

As we saw earlier the search mechanism on this tab has the possibility to construct a query for up to three tiers. Besides the constraints on annotations on a tier, one can also apply constraints on annotations on different tiers. This means that if the search engine has found an annotation that matches a search string on one tier, the engine looks if the search string for another tier can be matched on another tier while considering the constraint that is between the two search strings.

The top down hierarchy of the rows in the query table does not reflect the hierarchy of the tiers in your data. That means, for instance, that search strings and constraints in the upper query table row may be matched by a child tier of the tier that matches search strings and constraints in the middle query table row.

Right clicking the green field between two search strings gives a context menu with the following constraints:

  • Fully aligned: the begin time and end time of both annotations are the same:

  • Overlap: part of both annotations overlap. This includes the other options Fully aligned, Left overlap, Right overlap, Surrounding and Within.

  • Left overlap: the begin time and end time of the annotation matching the lower search string lie before the begin time and end time of the annotation matching the upper search string:

  • Right overlap: the begin time and end time of the annotation matching the lower search string lie after the begin time and end time of the annotation matching the upper search string:

  • Surrounding: the begin time of the annotation matching the lower search string lies before the begintime of the annotation matching the upper search string and end time of the annotation matching the lower search string lies after the end time of the annotation matching the upper search string:

  • Within: the begin time of the annotation matching the lower search string lies after the begintime of the annotation matching the upper search string and end time of the annotation matching the lower search string lies before the end time of the annotation matching the upper search string:

  • No overlap: the begin time of the annotation matching a search string lies after the end time of the annotation matching the other search string:

  • begin time - begin time = X milliseconds: the begin time of the annotations matching the upper search string must lie exactly X milliseconds before the begin time of the annotation matching the lower search string.

  • begin time - begin time < X milliseconds: the begin time of the annotations matching the upper search string must lie less than X milliseconds before the begin time of the annotation matching the lower search string.

  • begin time - begin time > X milliseconds: the begin time of the annotations matching the upper search string must lie more than X milliseconds before the begin time of the annotation matching the lower search string.

  • begin time - end time = X milliseconds: the begin time of the annotations matching the upper search string must lie exactly X milliseconds before the end time of the annotation matching the lower search string.

  • begin time - end time < X milliseconds: the begin time of the annotations matching the upper search string must lie less than X milliseconds before the end time of the annotation matching the lower search string.

  • begin time - end time > X milliseconds: the begin time of the annotations matching the upper search string must lie more than X milliseconds before the end time of the annotation matching the lower search string.

  • end time - begin time = X milliseconds: the end time of the annotations matching the upper search string must lie exactly X milliseconds before the begin time of the annotation matching the lower search string.

  • end time - begin time < X milliseconds: the end time of the annotations matching the upper search string must lie less than X milliseconds before the begin time of the annotation matching the lower search string.

  • end time - begin time > X milliseconds: the end time of the annotations matching the upper search string must lie more than X milliseconds before the begin time of the annotation matching the lower search string.

  • end time - end time = X milliseconds: the end time of the annotations matching the upper search string must lie exactly X milliseconds before the end time of the annotation matching the lower search string.

  • end time - end time < X milliseconds: the end time of the annotations matching the upper search string must lie less than X milliseconds before the end time of the annotation matching the lower search string.

  • end time - end time > X milliseconds: the end time of the annotations matching the upper search string must lie more than X milliseconds before the end time of the annotation matching the lower search string.

  • No constraint: there are no constraints.

  • Clear: clear the current constraint.

Because the search mechanism offers the possibility to search for patterns in three tiers and there are possibly three search strings per tier, the search results also consist of nine elements per hit. The results are presented in the form of a table. In figure 3.10 the results are presented for a query that looked for you and go separated by 0 annotations where go is fully aligned with the category v in the part of speech tier.

Results of Multi Layer Search

Figure 3.10. Results of Multi Layer Search


Hints

If you would like to use both Exact match and Substring match in one query: use the Regular expression. In places where you would like to have an exact match use the ^ and $ signs to match the beginning and end of a string (e.g. ^of$) otherwise just enter a word for the substring match.

Wildcard. Instead of using the # as in the Single Layer Search, you can use the regular expression .+ to indicate any character (the dot) one or more times (the plus). The NOT(...) construction on the other hand can be used in the Multiple Layer Search in the same way as describe in Section 3.2.

One final but not less important remark concerns the placing of more and less restrictive search strings. As we saw earlier, the hierarchy of the rows in the query does not reflect the hierarchy in the data. While this is perfectly true, we advise you to place restrictive search strings in the left most field on the upper most row possible and the least restrictive search string in the right most field of the lowest row possible. The reason for this is the order in which the search engine considers the search strings in the query. If it finds a restrictive search string it can filter out all the other possibilities, but if it finds a less restrictive search string it has to consider all the matches of this search string. Because of this, the search might take much more time if the non-restrictive strings are placed before the restrictive ones.

Created by latadmin
Last modified 2012-02-11 00:15
 

Powered by Plone

This site conforms to the following standards: