Disambiguation grammar
From UNL Wiki
(Difference between revisions)
Martins (Talk | contribs)
(Created page with "The disambiguation grammar, or d-grammar, is the set of disambiguation rules, or d-rules, which are used to: *Prevent wrong lexical choices; *Provoke best matches; *Check the ...")
Newer edit →
(Created page with "The disambiguation grammar, or d-grammar, is the set of disambiguation rules, or d-rules, which are used to: *Prevent wrong lexical choices; *Provoke best matches; *Check the ...")
Newer edit →
Revision as of 16:15, 28 July 2012
The disambiguation grammar, or d-grammar, is the set of disambiguation rules, or d-rules, which are used to:
- Prevent wrong lexical choices;
- Provoke best matches;
- Check the consistency of the graphs, trees and lists.
As defined in the UNL Grammar Specs, the structure of a d-rule is the following:
STATEMENT=P;
Where
STATEMENT is any network, tree or list relation; and
P, which can range from 0 (impossible) to 255 (necessary), is the probability of occurrence of the STATEMENT
