112 search results - page 3 / 23 » Functor-Driven Natural Language Generation with Categorial-U... |
KES
2004
Springer
14 years 27 days ago
2004
Springer
In this case study I argue for the usage of a machine-oriented controlled natural language as interface language to knowledge systems. Instead of using formal languages that are di...
GRAMMARS
2002
13 years 7 months ago
2002
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
ALT
2006
Springer
14 years 4 months ago
2006
Springer
Abstract. Recently, some non-regular subclasses of context-free grammars have been found to be efficiently learnable from positive data. In order to use these efficient algorithms ...
AMTA
2000
Springer
13 years 12 months ago
2000
Springer
This paper describes a language independent linearization engine, oxyGen. This system compiles target language grammars into programs that take feature graphs as inputs and genera...
WOLLIC
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...