40 search results - page 4 / 8 » Working for Two: A Bidirectional Grammar for a Controlled Na... |
IANDC
2010
13 years 6 months ago
2010
Categorial grammars in the tradition of Lambek [18, 19] are asymmetric: sequent statements are of the form Γ ⇒ A, where the succedent is a single formula A, the antecedent a st...
ICGI
1998
Springer
13 years 11 months ago
1998
Springer
This paper describes a new sampling-based heuristic for tree search named SAGE and presents an analysis of its performance on the problem of grammar induction. This last work has b...
CSLP
2004
Springer
14 years 26 days ago
2004
Springer
In this paper we introduce a general framework for describing the lexicon of a lexicalised grammar by means of elementary descriptive fragments. The system described hereafter cons...
ACL
1990
13 years 8 months ago
1990
We describe a system of reversible grammar in which, given a logic-grammar specification of a natural language, two efficient PROLOGprograms are derived by an off-line compilation...
TAGT
1994
Springer
13 years 11 months ago
1994
Springer
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...