1999 search results - page 135 / 400 » Dependently Typed Grammars |
171
click to vote
CONCUR
2009
Springer
16 years 26 days ago
2009
Springer
Bisimulation equivalence is decidable in polynomial time for both sequential and commutative normed context-free processes, known as BPA and BPP, respectively. Despite apparent sim...
289
click to vote
NLP
2000
15 years 10 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
179
click to vote
ANLP
1997
15 years 7 months ago
1997
This paper describes a new finite-state shallow parser. It merges constructive and reductionist approaches within a highly modular architecture. Syntactic information is added at ...
159
click to vote
ACTAC
1998
15 years 6 months ago
1998
In a semi-structured database there is no clear separation between the data and the schema, and the degree to which it is structured depends on the application. Semi-structured da...
201
click to vote
COLING
2010
15 years 1 months ago
2010
An unsupervised discriminative training procedure is proposed for estimating a language model (LM) for machine translation (MT). An English-to-English synchronous context-free gra...