DMCA
Efficient HPSG Parsing Algorithm with Array Unification (1999)
| Venue: | In Proceedings of the Natural Language Processing Pacific Rim Symposium 1999 (NLPRS’99 |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Nishida99efficienthpsg,
author = {Kenji Nishida and Kentaro Torisawa and Jun'ichi Tsujii},
title = {Efficient HPSG Parsing Algorithm with Array Unification},
booktitle = {In Proceedings of the Natural Language Processing Pacific Rim Symposium 1999 (NLPRS’99},
year = {1999},
pages = {144--149}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper present amet6 d for improving parsing performance of parsers for HPSG. ThemetL d wasobtjA4A by ext4#6F3 Torisawa's parsingmeti d for HPSG. His parsingmetn dutjL:LF a CFG compiled from a given HPSG-based grammar, and tn parserpredict te possible parse trse wit t CFG. Sincetn amount of unificatni is reduced because oftF6 predict3#A parsing performance is improved. However, we observedtFK tFKM is alimit of speedup bytK metj d. This is duet te fact tac a compiled CFGcannot captt all tl constjKM t in an original HPSG. We add anextK mechanism called array unification t a parser for Torisawa's parsingmeti d and overcometco limitKkLAj The mechanism performspart oft ypeunificat6: and improves precision of parsetrs predict:M wit a small overhead. We observed improvement of parsing speed by afact6 of 2.8wit anexist4# Japanese grammar and 1.7wit anexistLK English grammar. 1
Keyphrases
array unification efficient hpsg parsing algorithm parsetrs predict speedup bytk metj duet te fact paper present amet6 sincetn amount anexistlk english grammar mechanism performspart oft ypeunificat6 overcometco limitkklaj original hpsg compiled cfgcannot captt themetl wasobtja4a anextk mechanism parsing performance parsingmetn dutjl small overhead hpsg-based grammar anexist4 japanese grammar
