1999 search results - page 22 / 400 » Dependently Typed Grammars |
115
Voted
FCT
2005
Springer
15 years 7 months ago
2005
Springer
Leftist grammars can be characterized in terms of rules of the form a → ba and cd → d, without distinction between terminals and nonterminals. They were introduced by Motwani e...
113
Voted
IJCAI
1997
15 years 3 months ago
1997
Recently researchers working in the LFG framework have proposed algorithms for taking advantage of the implicit context-free components of a unification grammar [Maxwell and Kapla...
161
Voted
TOCL
2012
13 years 4 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
84
Voted
CSL
2000
Springer
15 years 6 months ago
2000
Springer
We show that dependent sums and dependent products of continuous parametrizations on domains with dense, codense, and natural totalities agree with dependent sums and dependent pro...
109
Voted
ACL
2006
15 years 3 months ago
2006
In this paper we investigate the benefit of stochastic predictor components for the parsing quality which can be obtained with a rule-based dependency grammar. By including a chun...