期刊名称：Conference on European Chapter of the Association for Computational Linguistics (EACL)
出版年度：2009
卷号：2009
出版社：ACL Anthology
摘要：Many parsing techniques including parameter
estimation assume the use of a
packed parse forest for efficient and accurate
parsing. However, they have several
inherent problems deriving from the
restriction of locality in the packed parse
forest. Deterministic parsing is one of
solutions that can achieve simple and fast
parsing without the mechanisms of the
packed parse forest by accurately choosing
search paths. We propose (i) deterministic
shift-reduce parsing for unification-
based grammars, and (ii) best-first
shift-reduce parsing with beam thresholding
for unification-based grammars. Deterministic
parsing cannot simply be applied
to unification-based grammar parsing,
which often fails because of its hard
constraints. Therefore, it is developed by
using default unification, which almost
always succeeds in unification by overwriting
inconsistent constraints in grammars.
