Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
We present a novel approach, called selectional branching, which uses confidence estimates to decide when to employ a beam… Expand
  • table 1
  • table 2
  • figure 1
  • table 3
  • figure 2
Is this relevant?
2012
2012
We investigate the stacking of dependency and phrase structure parsers, i.e. we define features from the output of a phrase… Expand
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
We evaluate the statistical dependency parser, Malt, on a new dataset of sentences taken from tweets. We use a version of Malt… Expand
  • table 1
  • table 2
  • table 3
  • table 6
  • table 7
Is this relevant?
2010
2010
A monadic parser combinator library which guarantees termination of parsing, while still allowing many forms of left recursion… Expand
  • figure 1
Is this relevant?
2008
2008
Parser combinators are well-known in functional programming languages such as Haskell. In this paper, we describe how they are… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Despite the long list of publications on parser combinators, there does not yet exist a monadic parser combinator library that… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We describe a practical parser for unrestricted dependencies. The parser creates links between words and names the links… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1995
Highly Cited
1995
SUMMARY Despite the parsing power of LR=LALR algorithms, e.g. YACC, programmers often choose to write recursive-descent parsers… Expand
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This thesis gives a theory of sentence comprehension that attempts to explain a number of linguistic performance effects… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?