Parser combinator

Known as: Combinator parser, Combinatory parsing, Parser combinators

In functional programming, a parser combinator is a higher-order function that accepts several parsers as input and returns a new parser as its…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2016

We present a shift-reduce CCG semantic parser. Our parser uses a neural network architecture that balances model capacity and…

2012

We investigate the stacking of dependency and phrase structure parsers, i.e. we define features from the output of a phrase…

2011

As the accumulated research base of the behavioral sciences have grown, the amount of actual knowledge discovery has not kept…

2009

We describe a pattern-based system for polarity classification from texts. Our system is currently restricted to the positive…

2008

The automatic extraction of definitions from natural language texts has various applications such as the creation of glossaries…

2003

Dislocation phenomena in natural language can be, and often are, thought of as the effects of movement transformations. We…

2000

Bagging and boosting, two effective machine learning techniques, are applied to natural language parsing. Experiments using these…

1996

In this paper, we propose a novel strategy which is designed to enhance the accuracy of the parser by simplifying complex…

1992

We describe an approach to training a statistical parser from a bracketed corpus, and demonstrate its use in a software testing…

1988

A technique for generating parsers which is an extension to LR techniques and is based on parsing table splitting, is presented…