首页> 外文会议>19th International Conference on Computational Linguistics Coling 2002 Vol.1 Aug 26-30, 2002 Taipei, Taiwan >A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations
【24h】

A Novel Disambiguation Method For Unification-Based Grammars Using Probabilistic Context-Free Approximations

机译:基于概率上下文无关近似的基于统一语法的新型消歧方法

获取原文
获取原文并翻译 | 示例

摘要

We present a novel disambiguation method for unification-based grammars (UBGs). In contrast to other methods, our approach obviates the need for probability models on the UBG side in that it shifts the responsibility to simpler context-free models, indirectly obtained from the UBG. Our approach has three advantages: (ⅰ) training can be effectively done in practice, (ⅱ) parsing and disambiguation of context-free readings requires only cubic time, and (ⅲ) involved probability distributions are mathematically clean. In an experiment for a mid-size UBG, we show that our novel approach is feasible. Using unsupervised training, we achieve 88% accuracy on an exact-match task.
机译:我们提出了一种新颖的基于统一语法(UBGs)的消歧方法。与其他方法相比,我们的方法消除了UBG方面对概率模型的需要,因为它将责任转移到了从UBG间接获得的更简单的无上下文模型。我们的方法具有三个优点:(ⅰ)训练可以在实践中有效地进行;(ⅱ)解析和消除上下文无关的读数仅需要三次时间,并且(ⅲ)涉及的概率分布在数学上是干净的。在针对中型UBG的实验中,我们证明了我们的新颖方法是可行的。使用无监督培训,我们在精确匹配任务上的准确性达到88%。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号