| Interface | Description |
|---|---|
| ProbabilisticGrammar |
| Class | Description |
|---|---|
| ProbCNFGrammar |
The CYK algorithm exploits the structure of grammars in
Chomsky Normal Form in order to parse efficiently.
|
| ProbContextFreeGrammar | |
| ProbContextSensitiveGrammar |
A context-sensitive grammar is less restrictive than context-free and more powerful, but
more restrictive than an unrestricted grammar (an less powerfull).
|
| ProbUnrestrictedGrammar |
Represents the most general grammatical formalism,
the Unrestricted (or Recrusively Enumerable) Grammar.
|
| Rule |
A derivation rule that is contained within a grammar.
|