36 search results - page 3 / 8 » Unambiguous Boolean grammars |
COLING
1992
13 years 8 months ago
1992
We describe a method and its implementation for self-monitoring during natural language generation. In situations of communication where the generation of ambiguous utterances sho...
ENTCS
2008
13 years 7 months ago
2008
Although programs convey an unambiguous meaning, the grammars used in practice to describe their syntax are often ambiguous, and completed with disambiguation rules. Whether these...
IJFCS
2006
13 years 7 months ago
2006
The generalized LR parsing algorithm for context-free grammars is extended for the case of Boolean grammars, which are a generalization of the context-free grammars with logical c...
MFCS
2004
Springer
14 years 1 months ago
2004
Springer
A binary language-theoretic operation is proposed, which is dual to the concatenation of languages in the same sense as the universal quantifier in logic is dual to the existenti...
JACM
2002
13 years 7 months ago
2002
In 1975, Valiant showed that Boolean matrix multiplication can be used for parsing contextfree grammars (CFGs), yielding the asympotically fastest (although not practical) CFG par...