Sciweavers

Share
20 search results - page 1 / 4
» A Learnable Constraint-based Grammar Formalism
Sort
View
COLING
2010
9 years 9 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
ICGI
2004
Springer
10 years 8 months ago
Learnability of Pregroup Grammars
Abstract. This paper investigates the learnability of Pregroup Grammars, a context-free grammar formalism recently defined in the field of computational linguistics. In a first ...
Denis Béchet, Annie Foret, Isabelle Tellier
CSLP
2004
Springer
10 years 8 months ago
Problems of Inducing Large Coverage Constraint-Based Dependency Grammar for Czech
Abstract. This article describes an attempt to implement a constraintbased dependency grammar for Czech, a language with rich morphology and free word order, in the formalism Exten...
Ondrej Bojar
LACL
2005
Springer
10 years 8 months ago
Learnable Classes of General Combinatory Grammars
Abstract. Kanazawa has shown that k-valued classical categorial grammars have the property of finite elasticity [1], which is a sufficient condition for learnability. He has also ...
Erwan Moreau
books