627 search results - page 11 / 126 » Contextual Grammars as Generative Models of Natural Language... |
ICGI
1994
Springer
13 years 11 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...
LACL
1998
Springer
13 years 11 months ago
1998
Springer
Abstract. We investigate natural deduction proofs of the Lambek calculus from the point of view of tree automata. The main result is that the set of proofs of the Lambek calculus c...
ICDAR
2003
IEEE
14 years 25 days ago
2003
IEEE
This paper investigates the application of a probabilistic parser for natural language on the list of the Nbest sentences produced by an off-line recognition system for cursive h...
ACL
2009
13 years 5 months ago
2009
The development of Dialog-Based ComputerAssisted Language Learning (DB-CALL) systems requires research on the simulation of language learners. This paper presents a new method for...
JMLR
2010
13 years 2 months 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...