Computer Science – Computation and Language
Scientific paper
1995-08-28
International Workshop on Parsing Technologies (IWPT 95)
Computer Science
Computation and Language
uuencoded compressed ps file. A4 format. 10 pages
Scientific paper
There are currently two philosophies for building grammars and parsers -- Statistically induced grammars and Wide-coverage grammars. One way to combine the strengths of both approaches is to have a wide-coverage grammar with a heuristic component which is domain independent but whose contribution is tuned to particular domains. In this paper, we discuss a three-stage approach to disambiguation in the context of a lexicalized grammar, using a variety of domain independent heuristic techniques. We present a training algorithm which uses hand-bracketed treebank parses to set the weights of these heuristics. We compare the performance of our grammar against the performance of the IBM statistical grammar, using both untrained and trained weights for the heuristics.
Doran Christine
Kulick Seth
Srinivas B.
No associations
LandOfFree
Heuristics and Parse Ranking 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 Heuristics and Parse Ranking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Heuristics and Parse Ranking will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-437738