21 search results - page 3 / 5 » Testing Grammars For Top-Down Parsers |
MUC
1992
13 years 9 months ago
1992
The GE-CMU team is developing the TIPSTER/SHOGUN system under the governmentsponsored TIPSTER program, which aims to advance coverage, accuracy, and portability in tex t interpret...
KBSE
2005
IEEE
13 years 11 months ago
2005
IEEE
The term grammar-based software describes software whose input can be specified by a context-free grammar. This grammar may occur explicitly in the software, in the form of an in...
ENTCS
2008
13 years 5 months ago
2008
In its recogniser form, Earley's algorithm for testing whether a string can be derived from a grammar is worst case cubic on general context free grammars (CFG). Earley gave ...
LREC
2010
13 years 6 months ago
2010
In this paper we present a partial dependency parser for Irish, in which Constraint Grammar (CG) rules are used to annotate dependency relations and grammatical functions in unres...
RIDE
2003
IEEE
13 years 10 months ago
2003
IEEE
In this paper, we present a scheme for identifying instances of events and extracting information about them. The scheme can handle all events with which an action can be associat...