28 search results - page 4 / 6 » Faster Generalized LR Parsing |
IBPRIA
2003
Springer
14 years 25 days ago
2003
Springer
Abstract. In a previous work, a new probabilistic context-free grammar (PCFG) model for natural language parsing derived from a tree bank corpus has been introduced. The model esti...
OOPSLA
2005
Springer
14 years 1 months ago
2005
Springer
Generalized algebraic data types (GADTs) have received much attention recently in the functional programming community. They generalize the (type) parameterized algebraic datatype...
ASE
2010
13 years 7 months ago
2010
Recent developments in runtime verification and monitoring show that parametric regular and temporal logic specifications can be efficiently monitored against large programs. Howev...
FSMNLP
2009
Springer
13 years 5 months ago
2009
Springer
Weighted tree grammars (for short: WTG) are an extension of weighted context-free grammars that generate trees instead of strings. They can be used in natural language parsing to d...
PLDI
1997
ACM
13 years 11 months ago
1997
ACM
A major research goal for compilers and environments is the automatic derivation of tools from formal specifications. However, the formal model of the language is often inadequat...