blob: 6d7a58ed116e113fadc577db18a77c51eb6c488b [file] [log] [blame]
Nils Diewalda31a5152015-04-17 21:05:23 +00001% layout 'main', title => 'KorAP: Poliqarp+';
2
Akron1120a582017-10-17 12:29:16 +02003<h2 id="tutorial-top">Poliqarp+</h2>
Nils Diewalda31a5152015-04-17 21:05:23 +00004
5<p>The following tutorial introduces all features provided by our version of the Poliqarp Query Language and some KorAP specific extensions.</p>
6
Nils Diewaldfccfbcb2015-04-29 20:48:19 +00007<section id="segments">
Nils Diewalda31a5152015-04-17 21:05:23 +00008 <h3>Simple Segments</h3>
9
Akronae24e162018-02-13 18:48:44 +010010 <p>The atomic elements of Poliqarp queries are segments. Most of the time segments represent words and can be simple queried:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000011 %# footnote: In the polish national corpus, Poliqarp can join multiple segments when identifying a single word.
12
Akronbee660d2018-02-14 15:57:02 +010013 %= doc_query poliqarp => loc('Q_poliqarp_simple', '** Tree')
Nils Diewalda31a5152015-04-17 21:05:23 +000014
15 <p>Sequences of simple segments are expressed using a space delimiter:</p>
16
Akronbee660d2018-02-14 15:57:02 +010017 %= doc_query poliqarp => loc('Q_poliqarp_simpleseq', '** the Tree')
Nils Diewalda31a5152015-04-17 21:05:23 +000018
19 <p>Simple segments always refer to the surface form of a word. To search for surface forms without case sensitivity, you can use the <code>/i</code> flag.</p>
20
Akronbee660d2018-02-14 15:57:02 +010021 %= doc_query poliqarp => loc('Q_poliqarp_simpleci', '** run/i')
Nils Diewalda31a5152015-04-17 21:05:23 +000022
Akrona7cfd902017-12-21 19:28:36 +010023 <p>The query above will find all occurrences of the term irrespective of the capitalization of letters.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000024
Nils Diewaldfccfbcb2015-04-29 20:48:19 +000025 <h4 id="regexp">Regular Expressions</h4>
Nils Diewalda31a5152015-04-17 21:05:23 +000026
Nils Diewald61e6ff52015-05-07 17:26:50 +000027 <p>Segments can also be queried using <%= doc_link_to 'regular expressions', 'ql', 'regexp' %> - by surrounding the segment with double quotes.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000028
Akronbee660d2018-02-14 15:57:02 +010029 %= doc_query poliqarp => loc('Q_poliqarp_re', '** "r(u|a)n"'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000030
Akronae24e162018-02-13 18:48:44 +010031 <p>Regular expression segments will always match the whole segment, meaning the above query will find words starting with the first letter of the regular expression and ending with the last letter. To support subqueries, you can use the <code>/x</code> flag.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000032
Akronbee660d2018-02-14 15:57:02 +010033 %= doc_query poliqarp => loc('Q_poliqarp_rex', '** "r(u|a)n"/x'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000034
35 <p>The <code>/x</code> will search for all segments that contain a sequence of characters the regular expression matches. That means the above query is equivalent to:</p>
36
Akronbee660d2018-02-14 15:57:02 +010037 %= doc_query poliqarp => loc('Q_poliqarp_recontext', '** ".*?r(u|a)n.*?"'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000038
Akronae24e162018-02-13 18:48:44 +010039 <p>The <code>/x</code> flag can also be used in conjunction with strict expressions to search for substrings:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000040
Akronbee660d2018-02-14 15:57:02 +010041 %= doc_query poliqarp => loc('Q_poliqarp_simplex', '** part/xi'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000042
Akronae24e162018-02-13 18:48:44 +010043 <p>The above query will find all occurrences of segments including the defined substring regardless of upper and lower case.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000044
45 <blockquote class="warning">
Akronae24e162018-02-13 18:48:44 +010046 <p>Beware: Queries with prepended <code>.*</code> expressions can become extremely slow!</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000047 </blockquote>
48
Akronae24e162018-02-13 18:48:44 +010049 <p>You can again apply the <code>/i</code> flag to regular expressions to search case insensitive.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000050
Akronbee660d2018-02-14 15:57:02 +010051 %= doc_query poliqarp => loc('Q_poliqarp_rexi', '** "r(u|a)n"/xi'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000052</section>
53
Nils Diewaldfccfbcb2015-04-29 20:48:19 +000054<section id="complex">
Nils Diewalda31a5152015-04-17 21:05:23 +000055 <h3>Complex Segments</h3>
56
57 <p>Complex segments are expressed in square brackets and contain additional information on the resource of the term under scrutiny by providing key/value pairs, separated by an equal-sign.</p>
58
Akronae24e162018-02-13 18:48:44 +010059 <p>The KorAP implementation of Poliqarp provides three special segment keys: <code>orth</code> for surface forms, <code>base</code> for lemmata, and <code>pos</code> for Part-of-Speech. The following complex query finds all surface forms of the defined word.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000060 %# There are more special keys in Poliqarp, but KorAP doesn't provide them.
61
Akronbee660d2018-02-14 15:57:02 +010062 %= doc_query poliqarp => loc('Q_poliqarp_complexorth', '** [orth=Tree]')
Nils Diewalda31a5152015-04-17 21:05:23 +000063
64 <p>The query is thus equivalent to:</p>
65
Akronbee660d2018-02-14 15:57:02 +010066 %= doc_query poliqarp => loc('Q_poliqarp_simple', '** Tree')
Nils Diewalda31a5152015-04-17 21:05:23 +000067
68 <p>Complex segments expect simple expressions as values, meaning that the following expression is valid as well:</p>
69
Akronbee660d2018-02-14 15:57:02 +010070 %= doc_query poliqarp => loc('Q_poliqarp_complexre', '** [orth="r(u|a)n"/xi]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000071
Nils Diewald61e6ff52015-05-07 17:26:50 +000072 <p>Another special key is <code>base</code>, refering to the lemma annotation of the <%= doc_link_to 'default foundry', 'data', 'annotation' %>.
Akronae24e162018-02-13 18:48:44 +010073 The following query finds all occurrences of segments annotated as a specified lemma by the default foundry.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000074
Akronbee660d2018-02-14 15:57:02 +010075 %= doc_query poliqarp => loc('Q_poliqarp_complexlemma', '** [base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000076
Nils Diewald61e6ff52015-05-07 17:26:50 +000077 <p>The third special key is <code>pos</code>, refering to the part-of-speech annotation of the <%= doc_link_to 'default foundry', 'data', 'annotation' %>.
Nils Diewalda31a5152015-04-17 21:05:23 +000078 The following query finds all attributive adjectives:</p>
79
Akronbee660d2018-02-14 15:57:02 +010080 %= doc_query poliqarp => loc('Q_poliqarp_complexpos', '** [pos=ADJA]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000081
82 <p>Complex segments requesting further token annotations can have keys following the <code>foundry/layer</code> notation.
Akronae24e162018-02-13 18:48:44 +010083 For example to find all occurrences of plural words in a supporting foundry, you can search using the following query:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000084
Akronbee660d2018-02-14 15:57:02 +010085 %= doc_query poliqarp => loc('Q_poliqarp_complexplural', '** [mate/m=number:pl]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000086
87 <h4>Negation</h4>
Akron54740182017-06-17 14:17:23 +020088 <p>Negation of terms in complex expressions can be expressed by prepending the equal sign or the whole expression with an exclamation mark.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000089
Akronbee660d2018-02-14 15:57:02 +010090 %= doc_query poliqarp => loc('Q_poliqarp_neg1', '** [pos!=ADJA]'), cutoff => 1
91 %= doc_query poliqarp => loc('Q_poliqarp_neg2', '** [!pos=ADJA]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +000092
93 <blockquote class="warning">
Akronae24e162018-02-13 18:48:44 +010094 <p>Beware: Negated complex segments can't be searched as a single statement.
Nils Diewald61e6ff52015-05-07 17:26:50 +000095 However, they work in case they are part of a <%= doc_link_to 'sequence', 'ql', 'poliqarp-plus#syntagmatic-operators-sequence' %>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +000096 </blockquote>
97
98 <h4 id="empty-segments">Empty Segments</h4>
99
100 <p>A special segment is the empty segment, that matches every word in the index.</p>
101
Akronbee660d2018-02-14 15:57:02 +0100102 %= doc_query poliqarp => '[]', cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000103
Nils Diewald61e6ff52015-05-07 17:26:50 +0000104 <p>Empty segments are useful to express distances of words by using <%= doc_link_to 'repetitions', 'ql', 'poliqarp-plus#syntagmatic-operators-repetitions' %>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000105
106 <blockquote class="warning">
Akronae24e162018-02-13 18:48:44 +0100107 <p>Beware: Empty segments can't be searched as a single statement.
Nils Diewald9922edf2015-05-07 20:03:33 +0000108 However, they work in case they are part of a <%= doc_link_to 'sequence', 'ql', 'poliqarp-plus#syntagmatic-operators-sequence' %>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000109 </blockquote>
110</section>
111
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000112<section id="spans">
Nils Diewalda31a5152015-04-17 21:05:23 +0000113 <h3>Span Segments</h3>
114
115 <p>Not all segments are bound to words - some are bound to concepts spanning multiple words, for example noun phrases, sentences, or paragraphs.
116Span segments can be searched for using angular brackets instead of square brackets.</p>
117
Akronbee660d2018-02-14 15:57:02 +0100118 %= doc_query poliqarp => loc('Q_poliqarp_span', '** <corenlp/c=NP>'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000119
120 <p>Otherwise they can be treated in exactly the same way as simple or complex segments.</p>
121</section>
122
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000123<section id="paradigmatic-operators">
Nils Diewalda31a5152015-04-17 21:05:23 +0000124 <h3>Paradigmatic Operators</h3>
125
Akronae24e162018-02-13 18:48:44 +0100126 <p>A complex segment can have multiple properties a token requires. For example to search for all words with a certain surface form of a particular lemma (no matter if capitalized or not), you can search for:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000127
Akronbee660d2018-02-14 15:57:02 +0100128 %= doc_query poliqarp => loc('Q_poliqarp_and', '** [orth=run/i & base=Run]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000129
130 <p>The ampersand combines multiple properties with a logical AND.
131Terms of the complex segment can be negated as introduced before.</p>
132
Akronbee660d2018-02-14 15:57:02 +0100133 %= doc_query poliqarp => loc('Q_poliqarp_andneg1', '** [orth=run/i & base!=Run]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000134
135 <p>The following query is therefore equivalent:</p>
136
Akronbee660d2018-02-14 15:57:02 +0100137 %= doc_query poliqarp => loc('Q_poliqarp_andneg2', '** [orth=run/i & !base=Run]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000138
139 <p>Alternatives can be expressed by using the pipe symbol:</p>
140
Akronbee660d2018-02-14 15:57:02 +0100141 %= doc_query poliqarp => loc('Q_poliqarp_or', '** [base=run | base=go]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000142
143 <p>All these sub expressions can be grouped using round brackets to form complex boolean expressions:</p>
144
Akronbee660d2018-02-14 15:57:02 +0100145 %= doc_query poliqarp => loc('Q_poliqarp_group', '** [(base=run | base=go) & tt/pos=VVFIN]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000146</section>
147
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000148<section id="syntagmatic-operators">
Nils Diewalda31a5152015-04-17 21:05:23 +0000149 <h3>Syntagmatic Operators</h3>
150
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000151 <h4 id="syntagmatic-operators-sequence">Sequences</h4>
Nils Diewalda31a5152015-04-17 21:05:23 +0000152
Akronae24e162018-02-13 18:48:44 +0100153 <p>Sequences can be used to search for segments in order. For this, simple expressions are separated by whitespaces.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000154
Akronbee660d2018-02-14 15:57:02 +0100155 %= doc_query poliqarp => loc('Q_poliqarp_seq', '** the old man'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000156
157 <p>However, you can obviously search using complex segments as well:</p>
158
Akronbee660d2018-02-14 15:57:02 +0100159 %= doc_query poliqarp => loc('Q_poliqarp_seqcomplex', '** [orth=the][orth=old][orth=man]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000160
161 <p>Now you may see the benefit of the empty segment to search for words you don't know:</p>
162
Akronbee660d2018-02-14 15:57:02 +0100163 %= doc_query poliqarp => loc('Q_poliqarp_seqcomplexempty', '** [orth=the][][orth=man]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000164
Akronae24e162018-02-13 18:48:44 +0100165 <p>You are also able to mix segments and spans in sequences, for example to search for a word at the beginning of a sentence (which can be interpreted as the first word after the end of a sentence).</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000166
Akronbee660d2018-02-14 15:57:02 +0100167 %= doc_query poliqarp => loc('Q_poliqarp_seqspan', '** <base/s=s>[orth=The]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000168
169 <h4>Groups</h4>
170
171 ...
172
173 <h4>Alternation</h4>
174
Akronae24e162018-02-13 18:48:44 +0100175 <p>Alternations allow for searching alternative segments or sequences of segments, similar to the paradigmatic operator. You already have seen that you can search for a sequence with an alternative adjective in between by typing in:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000176
Akronbee660d2018-02-14 15:57:02 +0100177 %= doc_query poliqarp => loc('Q_poliqarp_seqor', '** the [orth=old | orth=young] man'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000178
Akronae24e162018-02-13 18:48:44 +0100179 <p>However, this formulation has problems in case you want to search for alternations of sequences rather than terms. In this case you can use syntagmatic alternations and groups:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000180
Akronbee660d2018-02-14 15:57:02 +0100181 %= doc_query poliqarp => loc('Q_poliqarp_seqorgroup1', '** the (young man | old woman)'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000182
Akronae24e162018-02-13 18:48:44 +0100183 <p>The pipe symbol works the same way as with the paradigmatic alternation, but supports sequences of different length as operands. The above query with an alternative adjective in a sequence can therefore be reformulated as:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000184
Akronbee660d2018-02-14 15:57:02 +0100185 %= doc_query poliqarp => loc('Q_poliqarp_seqorgroup2', '** the (old | young) man'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000186
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000187 <h4 id="syntagmatic-operators-repetitions">Repetition</h4>
Nils Diewalda31a5152015-04-17 21:05:23 +0000188
Nils Diewald61e6ff52015-05-07 17:26:50 +0000189 <p>Repetitions in Poliqarp are realized as in <%= doc_link_to 'regular expressions', 'ql', 'regexp' %>, by giving quantifieres in curly brackets.</p>
Akronae24e162018-02-13 18:48:44 +0100190 <p>To search for a sequence of three occurrences of a defined string, you can formulate your query in any of the following ways - they will have the same results:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000191
Akronbee660d2018-02-14 15:57:02 +0100192 %= doc_query poliqarp => loc('Q_poliqarp_repmanual', '** the the the'), cutoff => 1
193 %= doc_query poliqarp => loc('Q_poliqarp_repsimple', '** the{3}'), cutoff => 1
194 %= doc_query poliqarp => loc('Q_poliqarp_repcomplex', '** [orth=the]{3}'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000195
Akronae24e162018-02-13 18:48:44 +0100196 <p>In difference to regular expressions, the repetition operation won't refer to the match but to the pattern given. So the following query will give you a sequence of three words with a defined substring - but the words don't have to be identical.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000197
Akronbee660d2018-02-14 15:57:02 +0100198 %= doc_query poliqarp => loc('Q_poliqarp_repre', '** "ru.*?"/i{3}'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000199
Akronae24e162018-02-13 18:48:44 +0100200 <p>The same is true for annotations. The following query will find a sequence of 3 to 4 adjectives in a defined context. The adjectives do not have to be identical though.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000201
Akronbee660d2018-02-14 15:57:02 +0100202 %= doc_query poliqarp => loc('Q_poliqarp_repanno', '** [base=the][tt/p=ADJA]{3,4}[tt/p=NOUN]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000203
Akronae24e162018-02-13 18:48:44 +0100204 <p>In addition to numbered quantities, it is also possible to pass repetition information as Kleene operators <code>?</code>, <code>*</code>, and <code>+</code>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000205
Akronae24e162018-02-13 18:48:44 +0100206 <p>To search for a sequence with an optional segment, you can search for:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000207
Akronbee660d2018-02-14 15:57:02 +0100208 %= doc_query poliqarp => loc('Q_poliqarp_seqopt1', '** [base=the][tt/pos=ADJA]?[base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000209
210 <p>This query is identical to the numbered quantification of:</p>
211
Akronbee660d2018-02-14 15:57:02 +0100212 %= doc_query poliqarp => loc('Q_poliqarp_seqopt2', '** [base=the][tt/pos=ADJA]{,1}[base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000213
Akronae24e162018-02-13 18:48:44 +0100214 <p>To search for the same sequences but with unlimited adjectives in between, you can use the Kleene Star:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000215
Akronbee660d2018-02-14 15:57:02 +0100216 %= doc_query poliqarp => loc('Q_poliqarp_seqstar', '** [base=the][tt/pos=ADJA]*[base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000217
218 <p>And to search for this sequence but with at least one adjective in between, you can use the Kleene Plus (all queries are identical):</p>
219
Akronbee660d2018-02-14 15:57:02 +0100220 %= doc_query poliqarp => loc('Q_poliqarp_seqplus1', '** [base=the][tt/pos=ADJA]+[base=Tree]'), cutoff => 1
221 %= doc_query poliqarp => loc('Q_poliqarp_seqplus2', '** [base=the][tt/pos=ADJA]{1,}[base=Tree]'), cutoff => 1
222 %= doc_query poliqarp => loc('Q_poliqarp_seqplus3', '** [base=the][tt/pos=ADJA][tt/pos=ADJA]*[base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000223
224 <blockquote class="warning">
Akronae24e162018-02-13 18:48:44 +0100225 <p>Repetition operators like <code>{,n}</code>, <code>?</code>, and <code>*</code> make segments or groups of segments optional. In case these queries are used separated and not as part of a sequence (and there are no mandatory segments in the query), you will be warned by the system that your query won't be treated as optional.</p>
226 <p>Keep in mind that optionality may be somehow <i>inherited</i>, for example an entire query becomes optional as soon as one segment of an alternation is optional.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000227 </blockquote>
228
Nils Diewald61e6ff52015-05-07 17:26:50 +0000229 <p>Repetition can also be used to express distances between segments by using <%= doc_link_to 'empty segments', 'ql', 'poliqarp-plus#empty-segments' %>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000230
Akronbee660d2018-02-14 15:57:02 +0100231 %= doc_query poliqarp => loc('Q_poliqarp_seqdistance1', '** [base=the][][base=Tree]'), cutoff => 1
232 %= doc_query poliqarp => loc('Q_poliqarp_seqdistance2', '** [base=the][]{2}[base=Tree]'), cutoff => 1
233 %= doc_query poliqarp => loc('Q_poliqarp_seqdistance3', '** [base=the][]{2,}[base=Tree]'), cutoff => 1
234 %= doc_query poliqarp => loc('Q_poliqarp_seqdistance4', '** [base=the][]{,3}[base=Tree]'), cutoff => 1
235
Nils Diewalda31a5152015-04-17 21:05:23 +0000236 <p>Of course, Kleene operators can be used with empty segments as well.</p>
237
Akronbee660d2018-02-14 15:57:02 +0100238 %= doc_query poliqarp => loc('Q_poliqarp_seqdistanceopt', '** [base=the][]?[base=Tree]'), cutoff => 1
239 %= doc_query poliqarp => loc('Q_poliqarp_seqdistancestar', '** [base=the][]*[base=Tree]'), cutoff => 1
240 %= doc_query poliqarp => loc('Q_poliqarp_seqdistanceplus', '** [base=the][]+[base=Tree]'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000241
242 <h4>Position</h4>
243
Nils Diewald61e6ff52015-05-07 17:26:50 +0000244 <p>Sequences as shown above can all be nested in further complex queries and treated as subqueries (see <%= doc_link_to 'class operators', 'ql', 'poliqarp-plus#class-operators' %> on how to later access these subqueries directly).</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000245 <p>Positional operators compare two matches of subqueries and will match, in case a certain condition regarding the position of both is true.</p>
246 <p>The <code>contains()</code> operation will match, when a second subquery matches inside the span of a first subquery.</p>
247
Akronbee660d2018-02-14 15:57:02 +0100248 %= doc_query poliqarp => loc('Q_poliqarp_poscontains', '** contains(<base/s=s>, [tt/p=KOUS])'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000249
250 <p>The <code>startsWith()</code> operation will match, when a second subquery matches at the beginning of the span of a first subquery.</p>
251
Akronbee660d2018-02-14 15:57:02 +0100252 %= doc_query poliqarp => loc('Q_poliqarp_posstartswith', '** startsWith(<base/s=s>, [tt/p=KOUS])'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000253
254 <p>The <code>endsWith()</code> operation will match, when a second subquery matches at the end of the span of a first subquery.</p>
255
Akronbee660d2018-02-14 15:57:02 +0100256 %= doc_query poliqarp => loc('Q_poliqarp_posendswith', '** endsWith(<base/s=s>, [opennlp/p=NN])'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000257
Akronae24e162018-02-13 18:48:44 +0100258 <p>The <code>matches()</code> operation will match, when a second subquery has the exact same span as a first subquery.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000259
Akronbee660d2018-02-14 15:57:02 +0100260 %= doc_query poliqarp => loc('Q_poliqarp_posmatches', '** matches(<base/s=s>,[tt/p=CARD][tt/p="N.*"])'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000261
262 <p>The <code>overlaps()</code> operation will match, when a second subquery has an overlapping span with the first subquery.</p>
263
Akronbee660d2018-02-14 15:57:02 +0100264 %= doc_query poliqarp => loc('Q_poliqarp_posoverlaps', '** overlaps([][tt/p=ADJA],{1:[tt/p=ADJA]}[])'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000265
266 <blockquote class="warning">
267 <p>Positional operators are still experimental and may change in certain aspects in the future (although the behaviour defined is intended to be stable). There is also known incorrect behaviour which will be corrected in future versions.</p>
Akronae24e162018-02-13 18:48:44 +0100268 <p>Optional operands in position operators have to be mandatory at the moment and will be reformulated to occur at least once.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000269 <p>This behaviour may change in the future.</p>
270 </blockquote>
271
272 <!--
273 <blockquote>
274 <p>The KorAP implementation of Poliqarp also supports the postfix <code>within</code> operator, that works similar to the <code>contains()</code> operator, but is not nestable.</p>
275 </blockquote>
276 -->
277
278</section>
279
Nils Diewaldfccfbcb2015-04-29 20:48:19 +0000280<section id="class-operators">
Nils Diewalda31a5152015-04-17 21:05:23 +0000281 <h3>Class Operators</h3>
282
Akronae24e162018-02-13 18:48:44 +0100283 <p>Classes are used to group submatches by surrounding curly brackets and a class number <code>{1:...}</code>. Classes can be used to refer to submatches in a query, similar to captures in regular expressions. In Poliqarp+ classes have multiple purposes, with highlighting being the most intuitive one:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000284
Akronbee660d2018-02-14 15:57:02 +0100285 %= doc_query poliqarp => loc('Q_poliqarp_classes', '** the {1:{2:[]} man}'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000286
Akronae24e162018-02-13 18:48:44 +0100287 <p>In KorAP classes can be defined from 1 to 128. In case a class number is missing, the class defaults to the class number 1: <code>{...}</code> is equal to <code>{1:...}</code>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000288
289 <h4>Match Modification</h4>
290
291 <p>Based on classes, matches may be modified. The <code>focus()</code> operator restricts the span of a match to the boundary of a certain class.</p>
292
Akronbee660d2018-02-14 15:57:02 +0100293 %= doc_query poliqarp => loc('Q_poliqarp_focus', '** focus(the {Tree})'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000294
Akronae24e162018-02-13 18:48:44 +0100295 <p>The query above will search for a sequence but the match will be limited to the second segment. You can think of the first segment in this query as a <i>positive look-behind zero-length assertion</i> in regular expressions.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000296
Akronae24e162018-02-13 18:48:44 +0100297 <p>But focus is way more useful if you are searching for matches without knowing the surface form. For example, to find all terms between defined words you can search:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000298
Akronbee660d2018-02-14 15:57:02 +0100299 %= doc_query poliqarp => loc('Q_poliqarp_focusempty', '** focus(the {[]} Tree)'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000300
Akronae24e162018-02-13 18:48:44 +0100301 <p>Or you may want to search for all words following a known sequence immediately:</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000302
Akronbee660d2018-02-14 15:57:02 +0100303 %= doc_query poliqarp => loc('Q_poliqarp_focusextension', '** focus(the old and {[]})'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000304
Akronbee660d2018-02-14 15:57:02 +0100305 <p><code>focus()</code> is especially useful if you are searching for matches in certain areas,
306 for example in quotes using positional operators.
307 While not being interested in the whole quote as a match, you can focus on what's really relevant to you.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000308
Akronbee660d2018-02-14 15:57:02 +0100309 %= doc_query poliqarp => loc('Q_poliqarp_focusrelevance', '** focus(contains(she []{,10} said, {Tree}))'), cutoff => 1
Nils Diewalda31a5152015-04-17 21:05:23 +0000310
Akronae24e162018-02-13 18:48:44 +0100311 <p>In case a class number is missing, the focus operator defaults to the class number 1: <code>focus(...)</code> is equal to <code>focus(1: ...)</code>.</p>
Nils Diewalda31a5152015-04-17 21:05:23 +0000312
313 <blockquote class="warning">
314 <p>As numbers in curly brackets can be ambiguous in certain circumstances, for example <code>[]{3}</code> can be read as either &quot;any word repeated three times&quot; or &quot;any word followed by the number 3 highlighted as class number 1&quot;, numbers should always be expressed as <code>[orth=3]</code> for the latter case.</p>
315 </blockquote>
316</section>