573 search results - page 25 / 115 » Probabilistic Parsing Strategies |
ACL
2006
13 years 11 months ago
2006
Pipeline computation, in which a task is decomposed into several stages that are solved sequentially, is a common computational strategy in natural language processing. The key pr...
ACL
2003
13 years 11 months ago
2003
This paper presents a new bottom-up chart parsing algorithm for Prolog along with a compilation procedure that reduces the amount of copying at run-time to a constant number (2) p...
ACL
2003
13 years 11 months ago
2003
We demonstrate that an unlexicalized PCFG can parse much more accurately than previously shown, by making use of simple, linguistically motivated state splits, which break down fa...
ATAL
2010
Springer
13 years 11 months ago
2010
Springer
Alternating-time Temporal Logic (ATL) [1] is used to reason about strategic abilities of agents. Aiming at strategies that can realistically be implemented in software, many varia...
TCC
2005
Springer
14 years 3 months ago
2005
Springer
The standard class of adversaries considered in cryptography is that of strict polynomial-time probabilistic machines. However, expected polynomial-time machines are often also co...