Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars

Details Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars

1994-05-31

arxiv.org/abs/cmp-lg/9405033v1

32nd Annual Meeting of the ACL, 287-294

Computer Science

Computation and Language

8 pages, LaTeX source (one figure not included) To appear in ACL-94

Scientific paper

The paper demonstrates that exponential complexities with respect to grammar size and input length have little impact on the performance of three unification-based parsing algorithms, using a wide-coverage grammar. The results imply that the study and optimisation of unification-based parsing must rely on empirical data until complexity theory can more accurately predict the practical behaviour of such parsers.

Affiliated with

Also associated with

No associations

Rating

Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification 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 Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relating Complexity to Practical Performance in Parsing with Wide-Coverage Unification Grammars will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-299278