13 search results - page 1 / 3 » Regular Tree Grammars as a Formalism for Scope Underspecific... |
ACL
2008
13 years 7 months ago
2008
We propose the use of regular tree grammars (RTGs) as a formalism for the underspecified processing of scope ambiguities. By applying standard results on RTGs, we obtain a novel a...
CORR
2008
Springer
13 years 5 months ago
2008
Springer
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, fea...
ACL
1998
13 years 7 months ago
1998
This paper describes a wide-coverage Japanese grammar based on HPSG. The aim of this work is to see the coverage and accuracy attainable using an underspecified grammar. Underspec...
SIGCSE
1997
ACM
13 years 9 months ago
1997
ACM
We present a collection of new and enhanced tools for experimenting with concepts in formal languages and automata theory. New tools, written in Java, include JFLAP for creating a...
SAS
2001
Springer
13 years 10 months ago
2001
Springer
This paper describes the precise speci cation, design, analysis, implementation, and measurements of an e cient algorithm for solving regular tree grammar based constraints. The p...