20 search results - page 2 / 4 » A Learnable Constraint-based Grammar Formalism |
110
click to vote
CSLP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. This paper presents the basis of Property Grammars, a fully constraintbased theory. In this approach, all kinds of linguistic information is represented by means of const...
119
click to vote
IJCNLP
2005
Springer
15 years 6 months ago
2005
Springer
This paper proposes a variation of synchronous grammar based on the formalism of context-free grammar by generalizing the first component of productions that models the source text...
113
click to vote
ICGI
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Kanazawa has shown that several non-trivial classes of categorial grammars are learnable in Gold’s model. We propose in this article to adapt this kind of symbolic lear...
COLING
1992
15 years 2 months ago
1992
The normal method for representing anaphoric dependencies in Unification Based grammar tbrmalisms is that of re-entrance. In this paper, we address the problems that this represen...
100
click to vote
LATA
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. Learnability is a vital property of formal grammars: representation classes should be defined in such a way that they are learnable. One way to build learnable represent...