Sciweavers

1242 search results - page 10 / 249
» The Theory of Grammar Constraints
Sort
View
COLING
2000
13 years 8 months ago
Parsing Schemata for Grammars with Variable Number and Order of Constituents
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
Karl-Michael Schneider
GRAMMARS
2000
89views more  GRAMMARS 2000»
13 years 7 months ago
Monotonic C-Command: A New Perspective on Tree Adjoining Grammar
In this paper we argue for a reconceptualization of the Tree Adjoining Grammar (TAG) formalism, in which the elementary structures are collections of c-command relations, and the ...
Robert Frank, Seth Kulick, K. Vijay-Shanker
FLAIRS
2006
13 years 8 months ago
Annotation of the Complex Terms in Multilingual Corpora
For a long time categorial grammars were regarded as "toys grammars". Indeed, in spite of a very solid theoretical base, categorial grammars remain rather marginal as so...
Ismaïl Biskri, Boubaker Meddeb-Hamrouni, Nico...
ACL
2004
13 years 8 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
ACL
1998
13 years 8 months ago
Know When to Hold 'Em: Shuffling Deterministically in a Parser for Nonconcatenative Grammars
Nonconcatenative constraints, such as the shuffle relation, are frequently employed in grammatical analyses of languages that have more flexible ordering of constituents than Engl...
Robert T. Kasper, Mike Calcagno, Paul C. Davis