129 search results - page 2 / 26 » Towards Discontinuous Grammar |
GG
2004
Springer
13 years 10 months ago
2004
Springer
A string generating hypergraph grammar is a hyperedge replacement grammar where the resulting language consists of string graphs i.e. hypergraphs modeling strings. With the help of...
ACL
2001
13 years 6 months ago
2001
Polarized dependency (PD-) grammars are proposed as a means of efficient treatment of discontinuous constructions. PD-grammars describe two kinds of dependencies : local, explicit...
CSMR
2005
IEEE
13 years 10 months ago
2005
IEEE
Building reverse engineering or reengineering tools often requires parsers for many different programming languages. The diffusion of dialects and variants makes many available pa...
ECML
2000
Springer
13 years 9 months ago
2000
Springer
We examine the role of simplicity in directing the induction of context-free grammars from sample sentences. We present a rational reconstruction of Wol 's SNPR { the Gridssys...
ACL
2010
13 years 2 months ago
2010
Linear Context-Free Rewriting Systems (LCFRSs) are a grammar formalism capable of modeling discontinuous phrases. Many parsing applications use LCFRSs where the fan-out (a measure...