Skip to search formSkip to main contentSkip to account menu

Left corner parser

In computer science, a left corner parser is a type of chart parser used for parsing context-free grammars. It combines the top-down and bottom-up… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2002
2002
Tabular parsers can be de£ned as deduction systems where formulas, called items, are sets of complete or incomplete constituents… 
2002
2002
Tree Adjoining Grammar (TAG) is a grammar formalism that has become very popular for the description of natural languages… 
2002
2002
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' g rammar using a left… 
2001
2001
Recent contributions to statistical language modeling for speech recognition have shown that probabilistically parsing a partial… 
Highly Cited
1998
Highly Cited
1998
This paper describes how to construct a finite-state machine (FSM) approximating a 'unification-based' grammar using a left… 
Highly Cited
1997
Highly Cited
1997
We introduce a novel parser based on a probabilistic version of a left-corner parser. The left-corner strategy is attractive… 
1992
1992
This work is concerned with the way in which principled theories of syntax and modular theories of mind may participate in an… 
1991
1991
I describe a head-driven parser for a class of grammars that handle discontinuous constituency by a richer notion of string… 
1983
1983
A parser based on logic programming language (DCG) has very useful features; perspicuity, power, generality and so on. However… 
1977
1977
Brosgol [Br] formalizes the notion that parsing methods can be classified by the positions at which production rules are…