49 search results - page 6 / 10 » Parsing with Generative Models of Predicate-Argument Structu... |
COLING
1996
13 years 8 months ago
1996
This paper studies the computational complexity of disambiguation under probabilistic tree-grammars as in (Bod, 1992; Schabes and Waters, 1993). It presents a proof that the follo...
CVPR
1998
IEEE
14 years 8 months ago
1998
IEEE
A new approach to the recognition of temporal behaviors and activities is presented. The fundamental idea, inspired by work in speech recognition, is to divide the inference probl...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
We extend stochastic context-free grammars such that the probability of applying a production can depend on the length of the subword that is generated from the application and sho...
EMNLP
2009
13 years 4 months ago
2009
We present a scalable joint language model designed to utilize fine-grain syntactic tags. We discuss challenges such a design faces and describe our solutions that scale well to l...
FLAIRS
2007
13 years 9 months ago
2007
The difficulty of domain knowledge acquisition is one of the most sensible challenges of intelligent tutoring systems. Relying on domain experts and building domain models from sc...