34 search results - page 1 / 7 » Parsing Schemata and Correctness of Parsing Algorithms |
TCS
1998
13 years 5 months ago
1998
Parsing schemata provide a high-level formal description of parsers. These can be used, among as an intermediate level of abstraction for deriving the formal correctness of a pars...
ACL
2008
13 years 6 months ago
2008
We define a new formalism, based on Sikkel's parsing schemata for constituency parsers, that can be used to describe, analyze and compare dependency parsing algorithms. This ...
EUROCAST
2007
Springer
13 years 9 months ago
2007
Springer
abstract Parsing schemata [4] provide a formal, simple and uniform way to describe, analyze and compare different parsing algorithms. The notion of a parsing schema comes from cons...
DEXA
2007
Springer
13 years 9 months ago
2007
Springer
Abstract. The parsing schemata formalism allows us to describe parsing algorithms in a simple, declarative way by capturing their fundamenntics while abstracting low-level detail. ...
COLING
2000
13 years 6 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 ...