112 search results - page 5 / 23 » Functor-Driven Natural Language Generation with Categorial-U... |
GG
2004
Springer
14 years 28 days ago
2004
Springer
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
FSMNLP
2009
Springer
13 years 5 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
SOUPS
2006
ACM
14 years 1 months ago
2006
ACM
Today organizations do not have good ways of linking their written privacy policies with the implementation of those policies. To assist organizations in addressing this issue, ou...
FSMNLP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present a formalization of lexicalized Recursive Transition Networks which we call Automaton-Based Generative Dependency Grammar (gdg). We show how to extract a gdg fr...
POPL
2004
ACM
14 years 7 months ago
2004
ACM
For decades we have been using Chomsky's generative system of grammars, particularly context-free grammars (CFGs) and regular expressions (REs), to express the syntax of prog...