Deterministic parsing

From Wikipedia, the free encyclopedia

In natural language processing, deterministic parsing refers to parsing algorithms that are deterministic in the sense that given the input, the parser always knows which action to take. The LR-parsers, such as the Shift-Reduce Parser 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 (many sentences have more than one plausible parse). Thus, non-deterministic approaches such as the chart parser had to be applied. However, Mitch Marcus proposed in 1978 the Parsifal parser that was able to deal with ambiguities while still keeping the deterministic behavior.

[edit] References

  • Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman (1975): Deterministic parsing of ambiguous grammars. Comm. ACM 18:8:441-452.
  • Mitchell Marcus (1978): A Theory of Syntactic Recognition for Natural Language. PhD Thesis, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology.

[edit] See also


Comp Sci logo This computer science-related article is a stub. You can help Wikipedia by expanding it.