1999 search results - page 19 / 400 » Dependently Typed Grammars |
199
click to vote
PLPV
2010
ACM
16 years 2 months ago
2010
ACM
Singleton types are often considered a poor man’s substitute for dependent types. But their generalization in the form of GADTs has found quite a following. The main advantage o...
190
click to vote
JMLR
2010
15 years 25 days ago
2010
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
152
click to vote
ICGI
1994
Springer
15 years 10 months ago
1994
Springer
We describe a framework for inducing probabilistic grammars from corpora of positive samples. First, samples are incorporated by adding ad-hoc rules to a working grammar; subseque...
158
click to vote
ACL
2001
15 years 7 months ago
2001
We describe a new framework for dependency grammar, with a modular decomposition of immediate dependency and linear precedence. Our approach distinguishes two orthogonal yet mutua...
169
click to vote
CSLP
2004
Springer
15 years 11 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...