20 search results - page 1 / 4 » A Learnable Constraint-based Grammar Formalism |
COLING
2010
13 years 1 months ago
2010
Lexicalized Well-Founded Grammar (LWFG) is a recently developed syntacticsemantic grammar formalism for deep language understanding, which balances expressiveness with provable le...
ICGI
2004
Springer
14 years 5 days ago
2004
Springer
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 ...
CSLP
2004
Springer
14 years 5 days ago
2004
Springer
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...
LACL
2005
Springer
14 years 8 days ago
2005
Springer
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 ...
FPCA
1995
13 years 10 months ago
1995