|
|
| (2 intermediate revisions by one user not shown) |
| Line 1: |
Line 1: |
| − | The disambiguation grammar, or '''d-grammar''', is the set of disambiguation rules, or '''d-rules''', which are used to:
| + | #REDIRECT [[Grammar]] |
| − | *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<br />
| + | |
| − | STATEMENT is any network, tree or list relation; and<br />
| + | |
| − | P, which can range from 0 (impossible) to 255 (necessary), is the probability of occurrence of the STATEMENT<br />
| + | |
| − | | + | |
| − | == How to use d-grammars ==
| + | |
| − | D-grammars must be uploaded to or provided directly at the tab '''d-rules''' in [[IAN]] or [[EUGENE]].
| + | |
| − | | + | |
| − | == When to use d-grammars ==
| + | |
| − | D-grammars are necessary to deal with lexical and syntactic ambiguities.
| + | |
| − | | + | |
| − | == Examples of d-rules ==
| + | |
| − | *[[English Disambiguation Grammar]]
| + | |
