A probabilistic top-down parser for minimalist grammars

Details A probabilistic top-down parser for minimalist grammars A probabilistic top-down parser for minimalist grammars

2010-10-09

arxiv.org/abs/1010.1826v1

Computer Science

Computation and Language

Scientific paper

This paper describes a probabilistic top-down parser for minimalist grammars. Top-down parsers have the great advantage of having a certain predictive power during the parsing, which takes place in a left-to-right reading of the sentence. Such parsers have already been well-implemented and studied in the case of Context-Free Grammars, which are already top-down, but these are difficult to adapt to Minimalist Grammars, which generate sentences bottom-up. I propose here a way of rewriting Minimalist Grammars as Linear Context-Free Rewriting Systems, allowing to easily create a top-down parser. This rewriting allows also to put a probabilistic field on these grammars, which can be used to accelerate the parser. Finally, I propose a method of refining the probabilistic field by using algorithms used in data compression.

Affiliated with

Also associated with

No associations

Rating

A probabilistic top-down parser for minimalist grammars does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A probabilistic top-down parser for minimalist grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A probabilistic top-down parser for minimalist grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-221038