Constraint Grammar - Revision history

Unhammer: /* External links */

2024-09-11T12:06:53Z

External links

Unhammer: /* Editor support */

2022-03-23T09:47:44Z

Editor support

Popcorndude: subreadings

2021-04-02T15:30:32Z

subreadings

Unhammer: /* Languages using CG in Apertium */

2020-09-10T13:30:40Z

Languages using CG in Apertium

Unhammer: direct links to rlxes

2020-09-10T13:24:15Z

direct links to rlxes

Popcorndude: /* Rules */

2019-03-06T00:15:14Z

Rules

Popcorndude: set names and typo in example

2019-03-06T00:14:19Z

set names and typo in example

Popcorndude: add rule examples

2019-03-06T00:10:37Z

add rule examples

Popcorndude: Add CG syntax cheatsheet

2019-03-05T15:09:35Z

Add CG syntax cheatsheet

Unhammer: /* See also */

2016-12-04T09:21:25Z

@@ Line 166: / Line 166: @@
 * [http://kevindonnelly.org.uk/2010/05/constraint-grammar-tutorial/ Kevin Donnelly's CG tutorial]
 * [http://www.lrec-conf.org/proceedings/lrec2012/pdf/1075_Paper.pdf Hulden M, Francom J (2012) Boosting Statistical Tagger Accuracy with Simple Rule-Based Grammars, Proc. LREC 2012, p. 2114-2117] shows how 20 hours (very little time!) writing disambiguation rules gives substantial improvements. Some of the rules shown may also be implemented in the [[TSX format]] used by apertium-tagger.
+* [https://gist.github.com/unhammer/f793d118e11dbc629a55d4e85d198a3d visualise CG dependency tree] with graphviz dot
 [[Category:Constraint Grammar|*]]

@@ Line 148: / Line 148: @@
 * [http://beta.visl.sdu.dk/cg3ide.html CG-3 IDE] – the official vislcg3 CG IDE
 * [https://github.com/goavki/syntxfile_gedit_CG/ Gedit] syntax highlighting (also for any other editor that uses gtksourceview)
+* [https://github.com/apertium/tree-sitter-apertium/tree/master/tree-sitter-cg tree-sitter] grammar for Atom
 * [[Emacs#CG|Emacs]] emacs mode for editing and testing CG grammars (highlighting + IDE-like features)

@@ Line 68: / Line 68: @@
  REMOVE (n) IF (-1 (adv)) ;    # disprefer <n> reading if preceding word has <adv> tag
  SELECT (p1) IF (-1* (prn p1)) # prefer 1st person reading for verbs
-                (0 (v)) ;      # preceded at any distance by a 1st person pronoun
+                (0 (v)) ;      # if any preceding word is a 1st person pronoun
 ==Note on parenthesis==
@@ Line 89: / Line 89: @@
  SELECT:1c  set1  (1 ("hello")) ; # equivalent to 1a (or 1b)
+==Subreadings==
+If you're dealing with compounds, the specific parts are called subreadings.
+By default the last subreading is treated as the primary one. If you want the first one to be primary, add
+ SUBREADINGS = LTR ;
+If you want to select the value of a subreading, you can use <code>SUB:N</code> (where <code>N</code> is the position of the subreading)
+ # input ^dog's/dog<n><sg>+'s<gen>/dog<n><sg>+has<vbmod><pres>$ ^eaten/eat<vblex><pp>$
+ SELECT SUB:1 (vbmod) IF (1 (vblex pp)) ;
+ # for the first subreading, choose "has" if the next word is a participle
+If you want to refer to a subreading in a pattern you can use <code>1/N</code>
+ # input ^I've/I<prn>+have<vbmod>$ ^hit/hit<vblex><pres>/hit<vblex><past>/hit<vblex><pp>$
+ SELECT (vblex pp) IF (-1/1 (vbmod)) ;
+ # if the first subreading of the preceding word is <vbmod>, then we're probably a participle
+ # rather than a finite verb
 ==Languages using CG in Apertium==

@@ Line 105: / Line 105: @@
 * 1524	[[apertium-fin]] (based on Fred Karlsson's)
 * 850	[[apertium-dan]]
-* 594	[[apertium-gle]] [https://github.com/apertium/apertium-gle-eng/blob/master/apertium-gle-eng.gle-eng.rlx]
+* 594	[[apertium-gle]] [https://github.com/apertium/apertium-gle-eng/blob/master/apertium-gle-eng.gle-eng.rlx 1207 in gle-eng.rlx]
 * 453	[[apertium-fao]] (from Giellatekno)
 * 298	[[apertium-spa]]
 * 279	[[apertium-bre]] [https://github.com/apertium/apertium-bre/blob/master/apertium-bre.bre.rlx]
 * 255	[[apertium-cat]]
-* 205	[[apertium-hbs]] [https://github.com/apertium/apertium-hbs-mkd/blob/master/apertium-hbs-mkd.hbs-mkd.rlx]
+* 205	[[apertium-hbs]] [https://github.com/apertium/apertium-hbs/blob/master/apertium-hbs.hbs.rlx], also [https://github.com/apertium/apertium-hbs-mkd/blob/master/apertium-hbs-mkd.hbs-mkd.rlx hbs-mkd.rlx with syntax rules]
 * 190	[[apertium-isl]]
 * 131	[[apertium-cym]] [https://github.com/apertium/apertium-cym/blob/master/apertium-cym.cym.rlx]
@@ Line 116: / Line 116: @@
 * 127	[[apertium-eng]]
 * 118	[[apertium-mkd]]
-*       [[apertium-tag]] [https://github.com/apertium/apertium-tat/blob/master/apertium-tat.tat.rlx]
+* {{#lst:apertium-tat/stats|rlx_rules}}  [[apertium-tat]] [https://github.com/apertium/apertium-tat/blob/master/apertium-tat.tat.rlx]
-*       [[apertium-rus]] [https://github.com/apertium/apertium-rus/blob/master/apertium-rus.rus.rlx]
+* {{#lst:apertium-rus/stats|rlx_rules}}  [[apertium-rus]] [https://github.com/apertium/apertium-rus/blob/master/apertium-rus.rus.rlx]
 * {{#lst:apertium-kaz/stats|rlx_rules}}	[[apertium-kaz]]

@@ Line 105: / Line 105: @@
 * 1524	[[apertium-fin]] (based on Fred Karlsson's)
 * 850	[[apertium-dan]]
+* 594	[[apertium-gle]] [https://github.com/apertium/apertium-gle-eng/blob/master/apertium-gle-eng.gle-eng.rlx]
-* 594	[[apertium-gle]]
 * 453	[[apertium-fao]] (from Giellatekno)
 * 298	[[apertium-spa]]
-* 279	[[apertium-bre]]
+* 279	[[apertium-bre]] [https://github.com/apertium/apertium-bre/blob/master/apertium-bre.bre.rlx]
 * 255	[[apertium-cat]]
+* 205	[[apertium-hbs]] [https://github.com/apertium/apertium-hbs-mkd/blob/master/apertium-hbs-mkd.hbs-mkd.rlx]
-* 205	[[apertium-hbs]]
 * 190	[[apertium-isl]]
-* 131	[[apertium-cym]]
+* 131	[[apertium-cym]] [https://github.com/apertium/apertium-cym/blob/master/apertium-cym.cym.rlx]
 * {{#lst:apertium-tur/stats|rlx_rules}}	[[apertium-tur]]
 * 127	[[apertium-eng]]
 * 118	[[apertium-mkd]]
+*       [[apertium-tag]] [https://github.com/apertium/apertium-tat/blob/master/apertium-tat.tat.rlx]
+*       [[apertium-rus]] [https://github.com/apertium/apertium-rus/blob/master/apertium-rus.rus.rlx]
 * {{#lst:apertium-kaz/stats|rlx_rules}}	[[apertium-kaz]]

@@ Line 19: / Line 19: @@
 Sets are defined like this:
- LIST verb = vblex vbser ;     # matches <vblex> or <vbser>
+ LIST VERB = vblex vbser ;     # matches <vblex> or <vbser>
- LIST Nsg = (n sg) ;           # matches <n><sg>
+ LIST NSG = (n sg) ;           # matches <n><sg>
- LIST to = "to" ;              # matches the lemma "to"
+ LIST TO = "to" ;              # matches the lemma "to"
- LIST case = (n nom) (n acc) ; # matches <n><nom> or <n><acc>
+ LIST CASE = (n nom) (n acc) ; # matches <n><nom> or <n><acc>
 ===Context Patterns===
@@ Line 49: / Line 49: @@
  (0 (v))      # the current word must have a verb reading
- (1 verb)     # the following word matches the set "verb"
+ (1 VERB)     # the following word matches the set "VERB"
  (-1 "to")    # the previous word must be "to"
  (2C (n))     # every reading of the word after the next one must be a noun
@@ Line 65: / Line 65: @@
 Where FORM is a lemma, set of tags, or the name of a set and CONTEXT is a set of patterns.
- SELECT verb IF (1 (det)) ;    # prefer verb reading if following word has <det> tag
+ SELECT VERB IF (1 (det)) ;    # prefer reading from set "VERB" if following word has <det> tag
  REMOVE (n) IF (-1 (adv)) ;    # disprefer <n> reading if preceding word has <adv> tag
  SELECT (p1) IF (-1* (prn p1)) # prefer 1st person reading for verbs
-                (0 (v p1)) ;   # preceded at any distance by a 1st person pronoun
+                (0 (v)) ;   # preceded at any distance by a 1st person pronoun
 ==Note on parenthesis==

@@ Line 12: / Line 12: @@
 ::Apertium equivalent: <code>^word<n><pl>$</code>
 * ''wordform'' &mdash; a [[surface form]] of a word.
+==Basic Rule Format==
+===Sets===
+Sets are defined like this:
+ LIST verb = vblex vbser ;     # matches <vblex> or <vbser>
+ LIST Nsg = (n sg) ;           # matches <n><sg>
+ LIST to = "to" ;              # matches the lemma "to"
+ LIST case = (n nom) (n acc) ; # matches <n><nom> or <n><acc>
+===Rules===
+Rules look like this:
+ SELECT [FORM] [CONTEXT] ;
+ REMOVE [FORM] [CONTEXT] ;
+Where FORM is a lemma, set of tags, or the name of a set and CONTEXT is a set of patterns.
+===Context Patterns===
+Context patterns look like this:
+ ([LOCATION][MODIFIERS] [PATTERN])
+PATTERN can be a lemma, set of tags, or the name of a set.
+{|
+| Symbol || Meaning
+|-
+| 0 || The current word
+|-
+| 1 || The word following the current word
+|-
+| -1 || The word preceding the current word
+|-
+| 2 || The word 2 words after the current word
+|-
+| C || Every reading this position must match the pattern (normally only 1 has to)
+|-
+| * || In that position or further in that direction
+|}
+ (0 (v))      # the current word must have a verb reading
+ (-1 "to")    # the previous word must be "to"
+ (2C (n))     # every reading of the word after the next one must be a noun
+ (1* (pr))    # the current word has a preposition after it
+ (-2* (pron)) # there is a pronoun at least two words before the current word
 ==Note on parenthesis==

@@ Line 64: / Line 64: @@
 Currently some of the CG rules written in the above language pairs may be written as forbid rules in the [[TSX format]] used by apertium-tagger. If the rules for your language pair can be written in the .tsx format, you can go for an easier design without a CG module in that language pair.
+==Editor support==
+* [http://beta.visl.sdu.dk/cg3ide.html CG-3 IDE] – the official vislcg3 CG IDE
+* [https://github.com/goavki/syntxfile_gedit_CG/ Gedit] syntax highlighting (also for any other editor that uses gtksourceview)
+* [[Emacs#CG|Emacs]] emacs mode for editing and testing CG grammars (highlighting + IDE-like features)
 ==See also==
@@ Line 70: / Line 75: @@
 * [[Introduksjon til føringsgrammatikk]] -- a HOWTO, in Norwegian bokmål
 * [[Rule-based finite-state disambiguation]] -- GsoC 2012 project by [[User:Krvoje]], a "CG light" (or, a more apertiummy CG) with rules in XML compiled to an FST
-* [[Emacs#CG]] – emacs mode for editing and testing CG grammars
 * [[Constraint Grammar/Speed]] – some tips on speeding up your rules
 * [[Constraint Grammar/Optimisation]] – ideas on how to optimise the vislcg3 engine