Sciweavers

742 search results - page 4 / 149
» Formal Grammar for Java
Sort
View
ACTA
2007
114views more  ACTA 2007»
13 years 7 months ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
JOLLI
2010
69views more  JOLLI 2010»
13 years 6 months ago
A Faithful Representation of Non-Associative Lambek Grammars in Abstract Categorial Grammars
in Abstract Categorial Grammars Christian Retor´e, Sylvain Salvati This paper solves a natural but still open question: can Abstract Categorial Grammars (ACGs) have been defined ...
Christian Retoré, Sylvain Salvati
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 7 months ago
Feature Unification in TAG Derivation Trees
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, fea...
Sylvain Schmitz, Joseph Le Roux
ACL
2006
13 years 9 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
COLING
2010
13 years 2 months ago
A Learnable Constraint-based Grammar Formalism
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
Smaranda Muresan