Sciweavers

415 search results - page 30 / 83
» Tree Unification Grammar
Sort
View
PLILP
1992
Springer
14 years 23 days ago
Strictness Analysis for Attribute Grammars
Attribute grammars may be seen as a (rather specialised) lazy or demand-driven programming language. The "programs" in this language take text or parse trees as input an...
Mads Rosendahl
LREC
2010
150views Education» more  LREC 2010»
13 years 10 months ago
Spanish FreeLing Dependency Grammar
This paper presents the development of an open-source Spanish Dependency Grammar implemented in FreeLing environment. This grammar was designed as a resource for NLP applications ...
Marina Lloberes, Irene Castellón, Llu&iacut...
COLING
2000
13 years 10 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
CL
2000
Springer
13 years 8 months ago
Associative definition of programming languages
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
Stefano Crespi-Reghizzi, Matteo Pradella, Pierluig...
NAACL
2010
13 years 6 months ago
Why Synchronous Tree Substitution Grammars?
Synchronous tree substitution grammars are a translation model that is used in syntax-based machine translation. They are investigated in a formal setting and compared to a compet...
Andreas Maletti