Deterministic parsing
id:
deterministic-parsing-321-4349966
title:
Deterministic parsing
text:
In natural language processing, deterministic parsing refers to parsing algorithms that do not backtrack. LR-parsers are an example. The deterministic behavior is desired and expected in compiling programming languages. In natural language processing, it was thought for a long time that deterministic parsing is impossible due to ambiguity inherent in natural languages. Thus, non-deterministic approaches such as the chart parser had to be applied. However, Mitch Marcus proposed in 1978 the Parsif
brand slug:
wiki
category slug:
encyclopedia
description:
Parsing related to computer science
original url:
https://en.wikipedia.org/wiki/Deterministic_parsing
date created:
date modified:
2024-04-07T01:13:08Z
main entity:
{"identifier":"Q5265713","url":"https://www.wikidata.org/entity/Q5265713"}
image:
fields total:
13
integrity:
14