Sciweavers

325 search results - page 6 / 65
» MIX Is Not a Tree-Adjoining Language
Sort
View
ACL
2001
14 years 11 months ago
Guided Parsing of Range Concatenation Languages
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation langu...
François Barthélemy, Pierre Boullier...
COGSCI
2004
82views more  COGSCI 2004»
14 years 9 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
ACL
2003
14 years 11 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
1992
14 years 10 months ago
Recognition of Linear Context-Free Rewriting Systems
The class of linear context-free rewriting systems has been introduced as a generalization of a class of grammar formalisms known as mildly context-sensitive. The recognition prob...
Giorgio Satta
COLING
1999
14 years 9 months ago
Semiring Parsing
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...
Joshua Goodman