On how to write rules in Constraint Grammar (CG-3) - VISL
On how to write rules in Constraint Grammar (CG-3) - VISL
On how to write rules in Constraint Grammar (CG-3) - VISL
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Set Unification<br />
➢ SET labels can be def<strong>in</strong>ed and unified as variables by<br />
prefix<strong>in</strong>g &&.<br />
➢ Unlike list unification, set unification does not unify list<br />
members ("term<strong>in</strong>al" set members). Instead, it unifies<br />
subsets belong<strong>in</strong>g <strong>to</strong> a superset. Two contexts will setunify<br />
if they have tags shar<strong>in</strong>g the same subset.<br />
LIST N-SEM = <br />
;<br />
(not: LIST N-SEM = r r ;)<br />
SET N-SEMS = N-HUM OR N-LOC ... OR N-SEM ... OR N-SUBSTANCE ;<br />
REMOVE @SUBJ><br />
(0 $$@