Sciweavers

284 search results - page 41 / 57
» Efficient Parsing for French
Sort
View
DEDS
2002
119views more  DEDS 2002»
13 years 8 months ago
Diagnosing Discrete-Event Systems: Extending the "Diagnoser Approach" to Deal with Telecommunication Networks
Abstract. Detection and isolation of failures in large and complex systems such as telecommunication networks are crucial and challenging tasks. The problem considered here is that...
Laurence Rozé, Marie-Odile Cordier
COLING
2008
13 years 10 months ago
Classifying Chart Cells for Quadratic Complexity Context-Free Inference
In this paper, we consider classifying word positions by whether or not they can either start or end multi-word constituents. This provides a mechanism for "closing" cha...
Brian Roark, Kristy Hollingshead
NIPS
2000
13 years 10 months ago
The Use of Classifiers in Sequential Inference
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we deve...
Vasin Punyakanok, Dan Roth
ACL
1990
13 years 9 months ago
Algorithms for Generation in Lambek Theorem Proving
We discuss algorithms for generation within the Lambek Theorem Proving Framework. Efficient algorithms for generation in this framework take a semantics-driven strategy. This stra...
Erik-Jan van der Linden, Guido Minnen
BMCBI
2006
128views more  BMCBI 2006»
13 years 8 months ago
Lexical adaptation of link grammar to the biomedical sublanguage: a comparative evaluation of three approaches
Background: We study the adaptation of Link Grammar Parser to the biomedical sublanguage with a focus on domain terms not found in a general parser lexicon. Using two biomedical c...
Sampo Pyysalo, Tapio Salakoski, Sophie Aubin, Adel...