1519 search results - page 71 / 304 » The Domain Dependence of Parsing |
159
click to vote
MICS
2010
15 years 4 months ago
2010
Strategies specify how a wide range of exercises can be solved incrementally, such as bringing a logic proposition to disjunctive normal form, reducing a matrix, or calculating wit...
149
click to vote
AAAI
1992
15 years 7 months ago
1992
In this paper, we examine how the complexity of domain-independent planning with strips-style operators depends on the nature of the planning operators. We show how the time compl...
179
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
—A common vulnerability of wireless networks, in particular, the mobile ad hoc network (MANET), is their susceptibility to node compromise/physical capture attacks since the wire...
199
Voted
COLING
2000
15 years 7 months ago
2000
We present some novel machine learning techniques for the identification of subcategorization information for verbs in Czech. We compare three different statistical techniques app...
174
click to vote
ACL
2003
15 years 7 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...