Skip to search formSkip to main contentSkip to account menu

Deterministic parsing

In natural language processing, deterministic parsing refers to parsing algorithms that do not back up. LR-parsers are an example. (This meaning of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
AlgorithmBacktrackingChart parserCompiler

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Deterministic Parsing with P Colony Automata
We investigate the possibility of the deterministic parsing (that is, parsing without backtracking) of languages described by… 
2009
2009
Verifiable Parse Table Composition for Deterministic Parsing
One obstacle to the implementation of modular extensions to programming languages lies in the problem of parsing extended… 
2007
2007
A Three-Step Deterministic Parser for Chinese Dependency Parsing
This paper presents a three-step dependency parser to parse Chinese deterministically. By dividing a sentence into several parts… 
2006
2006
Extremely Lexicalized Models for Accurate and Fast HPSG Parsing
This paper describes an extremely lexicalized probabilistic model for fast and accurate HPSG parsing. In this model, the… 
2001
2001
Guided Parsing of Range Concatenation Languages
The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be… 
2000
2000
A Deterministic Shift-Reduce Parser Generator for a Logic Programming Language
This paper addresses efficient parsing in the context of logical inference for the purpose of using logic programming languages… 
1991
1991
Statistical Agenda Parsing
This paper presents the results of converting a standard Graham/Harrison/Ruzzo (GHR) parser for a unification grammar into an… 
1985
1985
Deterministic parsing and subjacency
Abstract It has previously been claimed that a deterministic model of the human sentence parsing mechanism provides an… 
Highly Cited
1985
Highly Cited
1985
Automatic Natural Language Parsing
This collection of papers on automatic natural language parsing examines research and development in language processing over the… 
1979
1979
Towards Minimal Data Structures for Deterministic Parsing
The determinism hypothesis suggests that natural language may be parsed in a single pass without resort to backtracking… 
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)