742 search results - page 57 / 149 » Formal Grammar for Java |
ICGI
2000
Springer
13 years 11 months ago
2000
Springer
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
DLT
2010
13 years 9 months ago
2010
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...
ACL
2000
13 years 9 months ago
2000
As an application of NLP to computer-assisted language learning(CALL) , we propose a diagnostic processing of Japanese being able to detect errors and inappropriateness of sentenc...
NAACL
1994
13 years 9 months ago
1994
This paper presents a model for generating prosodically appropriate synthesized responses to database queries using Combinatory Categorial Grammar (CCG - cf. [22]), a formalism wh...
COLING
1992
13 years 9 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...