Sciweavers

Share
14 search results - page 1 / 3
» Automatically Generating Tree Adjoining Grammars from Abstra...
Sort
View
CI
2005
99views more  CI 2005»
11 years 11 months ago
Automatically Generating Tree Adjoining Grammars from Abstract Specifications
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...
Fei Xia, Martha Palmer, K. Vijay-Shanker
ACL
2003
12 years 1 months ago
Generating Parallel Multilingual LFG-TAG Grammars from a MetaGrammar
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...
Lionel Clément, Alexandra Kinyon
ACL
1996
12 years 1 months ago
Generating an LTAG out of a Principle-based Hierarchical Representation
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...
Marie-Hélène Candito
DEXA
2007
Springer
126views Database» more  DEXA 2007»
12 years 3 months ago
Compiling Declarative Specifications of Parsing Algorithms
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. ...
Carlos Gómez-Rodríguez, Jesús...
COGSCI
2004
82views more  COGSCI 2004»
11 years 11 months ago
Restricting grammatical complexity
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...
Robert Frank
books