905 search results - page 21 / 181 » Parsing of Context-Sensitive Languages |
113
click to vote
TOOLS
1992
IEEE
15 years 2 months ago
1992
IEEE
This paper describes an Ei el system for rapid testing of grammars. Grammars are de ned in an extended BNF notation that allows actions on the parse tree nodes to be de ned as add...
EMNLP
2009
14 years 7 months ago
2009
We investigate the effectiveness of selftraining PCFG grammars with latent annotations (PCFG-LA) for parsing languages with different amounts of labeled training data. Compared to...
IBPRIA
2003
Springer
15 years 3 months 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...
IFL
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Parser combinators, often monadic, are a venerable and widelyused solution to read data from some external format. However, the capability to return a partial parse has, ...
ESOP
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Dependent grammars extend context-free grammars by allowing semantic values to be bound to variables and used to constrain parsing. Dependent grammars can cleanly specify...