Graph Branch Algorithm: An Optimum Tree Search Method for Scored Dependency Graph with Arc Co-occurrence Constraints

DOI Web Site Web Site 被引用文献1件 参考文献27件

この論文をさがす

抄録

Preference Dependency Grammar (PDG) is a framework for the morphological, syntactic and semantic analysis of natural language sentences.PDG gives packed shared data structures for encompassing the various ambiguities in each levels of sentence analysis with preference scores and a method for calculating the most plausible interpretation of a sentence.This paper proposes the Graph Branch Algorithm for computing the optimum dependency tree (the most plausible interpretation of a sentence) from a scored dependency forest which is a packed shared data structure encompassing all possible dependency trees (interpretations) of a sentence.The graph branch algorithm adopts the branch and bound principle for managing arbitrary arc co-occurrence constraints including the single valence occupation constraint which is a basic semantic constraint in PDG.This paper also reports the experiment using English texts showing the computational complexity and behavior of the graph branch algorithm.

収録刊行物

  • 自然言語処理

    自然言語処理 13 (4), 3-31, 2006

    一般社団法人　言語処理学会

被引用文献 (1)*注記

もっと見る

参考文献 (27)*注記

もっと見る

キーワード

詳細情報 詳細情報について

問題の指摘

ページトップへ