Sciweavers

112 search results - page 18 / 23
» Functor-Driven Natural Language Generation with Categorial-U...
Sort
View
ACL
1990
13 years 8 months ago
An Efficient Parsing Algorithm for Tree Adjoining Grammars
In the literature, Tree Adjoining Grammars (TAGs) are propagated to be adequate for natural language description -- analysis as well as generation. In this paper we concentrate on...
Karin Harbusch
CICLING
2003
Springer
14 years 23 days ago
Starting with Complex Primitives Pays Off
In setting up a formal system to specify a grammar formalism, the conventional (mathematical) wisdom is to start with primitives (basic primitive structures) as simple as possible...
Aravind K. Joshi
IJCAI
2003
13 years 9 months ago
Evaluating Coverage for Large Symbolic NLG Grammars
After many successes, statistical approaches that have been popular in the parsing community are now making headway into Natural Language Generation (NLG). These systems are aimed...
Charles B. Callaway
DLT
2010
13 years 9 months ago
Algorithmic Properties of Millstream Systems
Abstract. Millstream systems have recently been proposed as a formalization of the linguistic idea that natural language should be described as a combination of different modules r...
Suna Bensch, Henrik Björklund, Frank Drewes
ENTCS
2006
117views more  ENTCS 2006»
13 years 7 months ago
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
Hans-Jörg Tiede, Stephan Kepser