Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Ambiguous grammarCleanContext-free grammarDomain-specific language

Broader (2)

Functional programmingParsing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2015
Highly Cited
2015
A Transition-based Algorithm for AMR Parsing
We present a two-stage framework to parse a sentence into its Abstract Meaning Representation (AMR). We first use a dependency… 
2012
2012
Stacking of Dependency and Phrase Structure Parsers
We investigate the stacking of dependency and phrase structure parsers, i.e. we define features from the output of a phrase… 
Highly Cited
2011
Highly Cited
2011
#hardtoparse: POS Tagging and Parsing the Twitterverse
We evaluate the statistical dependency parser, Malt, on a new dataset of sentences taken from tweets. We use a version of Malt… 
Highly Cited
2011
Highly Cited
2011
Event Extraction as Dependency Parsing
Nested event structures are a common occurrence in both open domain and domain specific extraction tasks, e.g., a "crime" event… 
Highly Cited
2008
Highly Cited
2008
Hardware Runtime Monitoring for Dependable COTS-Based Real-Time Embedded Systems
COTS peripherals are heavily used in the embedded market, but their unpredictability is a threat for high-criticality real-time… 
Highly Cited
2007
Highly Cited
2007
Fast Unsupervised Incremental Parsing
This paper describes an incremental parser and an unsupervised learning algorithm for inducing this parser from plain text. The… 
Highly Cited
2005
Highly Cited
2005
A Classifier-Based Parser with Linear Run-Time Complexity
We present a classifier-based parser that produces constituent trees in linear time. The parser uses a basic bottom-up shift… 
Highly Cited
2001
Highly Cited
2001
Building a tree-bank of modern hebrew text
This paper describes the process of building the first tree-bank for Modern Hebrew texts. A major concern in this process is the… 
Highly Cited
2000
Highly Cited
2000
Discriminative Reranking for Natural Language Parsing
This article considers approaches which rerank the output of an existing probabilistic parser. The base parser produces a set of… 
Review
2000
Review
2000
Professional XML Databases
From the Publisher: While this book will discuss some conceptual issues, its focus is on development and implementation. This is… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)