Sciweavers

1999 search results - page 19 / 400
» Dependently Typed Grammars
Sort
View
PLPV
2010
ACM
15 years 10 months ago
Singleton types here, singleton types there, singleton types everywhere
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...
Stefan Monnier, David Haguenauer
137
Voted
JMLR
2010
137views more  JMLR 2010»
14 years 8 months ago
Covariance in Unsupervised Learning of Probabilistic Grammars
Probabilistic grammars offer great flexibility in modeling discrete sequential data like natural language text. Their symbolic component is amenable to inspection by humans, while...
Shay B. Cohen, Noah A. Smith
114
Voted
ICGI
1994
Springer
15 years 6 months ago
Inducing Probabilistic Grammars by Bayesian Model Merging
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...
Andreas Stolcke, Stephen M. Omohundro
110
Voted
ACL
2001
15 years 3 months ago
Topological Dependency Trees: A Constraint-Based Account of Linear Precedence
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...
Denys Duchier, Ralph Debusmann
117
Voted
CSLP
2004
Springer
15 years 7 months ago
Property Grammars: A Fully Constraint-Based Theory
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...
Philippe Blache