18 search results - page 3 / 4 » Directly-Executable Earley Parsing |
COLING
2000
13 years 7 months ago
2000
We define state transition grammars (STG) as an intermediate tbrmalism between grammars and parsing algorithms which is intended to separate the description of a parsing strategy ...
ACL
1989
13 years 7 months ago
1989
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
LOGCOM
2008
13 years 6 months ago
2008
This paper defines the grammar class of sequentially indexed grammars (SIGs) that results of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. SIG...
TCS
2010
13 years 4 months ago
2010
Robustness, the ability to analyze any input regardless of its grammaticality, is a desirable property for any system dealing with unrestricted natural language text. Error-repair...
COLING
1999
13 years 6 months ago
1999
languages into a general system for describing parsers. Eachparser performs abstract computations using theoperations ofasemiring. Thesystem allows asingle, simple representation t...