Sciweavers

376 search results - page 13 / 76
» Grammar Development in GF
Sort
View
COLING
2010
13 years 3 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
ESOP
2011
Springer
13 years 6 days ago
A New Method for Dependent Parsing
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...
Trevor Jim, Yitzhak Mandelbaum
FLAIRS
2006
13 years 10 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...
LREC
2010
136views Education» more  LREC 2010»
13 years 10 months ago
The Spanish Resource Grammar
This paper describes work on the development of an open-source HPSG grammar for Spanish implemented within the LKB system. Following a brief description of the main features of th...
Montserrat Marimon
TC
2008
13 years 8 months ago
High-Performance Architecture of Elliptic Curve Scalar Multiplication
A high performance architecture of elliptic curve scalar multiplication over finite field GF(2m ) is proposed. A pseudo-pipelined word serial finite field multiplier with word siz...
B. Ansari, M. A. Hasan