14 search results - page 1 / 3 » Automatically Generating Tree Adjoining Grammars from Abstra... |
CI
2005
13 years 4 months ago
2005
TRACT SPECIFICATIONS FEI XIA AND MARTHA PALMER Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104 K. VIJAY-SHANKER Department of Com...
ACL
2003
13 years 5 months ago
2003
We introduce a MetaGrammar, which allows us to automatically generate, from a single and compact MetaGrammar hierarchy, parallel Lexical Functional Grammars (LFG) and Tree-Adjoini...
ACL
1996
13 years 5 months ago
1996
Lexicalized Tree Adjoining Grammars have proved useful for NLP. However, numerous redundancy problems face LTAGs developers, as highlighted by Vijay-Shanker and Schabes (92). We p...
DEXA
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
COGSCI
2004
13 years 4 months ago
2004
of natural language syntax often characterize grammatical knowledge as a form of abstract computation. This paper argues that such a characterization is correct, and that fundamen...