3 search results - page 1 / 1 » Guaranteeing Parsing Termination of Unification Grammars |
COLING
2002
13 years 5 months ago
2002
Unification grammars are known to be Turingequivalent; given a grammar and a word
COLING
1992
13 years 6 months ago
1992
An arbitrary definite clause grammar can be transforaled into a so-called Generalized Greibach Normal Form (GGNF), a generalization of the classical Greibach Normat Form (GNF) for...
RSCTC
2000
Springer
13 years 8 months ago
2000
Springer
Abstract. Classic parsing methods are based on complete search techniques to find the different interpretations of a sentence. However, the size of the search space increases expon...