The structure of shared forests

Xem 1-2 trên 2 kết quả The structure of shared forests
  • The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambiguation process that may be based on the finer features of the language. We study the structure of these forests with respect to optimality of sharing, and in relation with the parsing schema used to produce them. In addition to a theoretical and experimental framework for studying these issues, the main results presented are: sophistication in chart parsing schemata (e.g.

    pdf9p bungio_1 03-05-2013 40 2   Download

  • Various kinds of scored dependency graphs are proposed as packed shared data structures in combination with optimum dependency tree search algorithms. This paper classifies the scored dependency graphs and discusses the specific features of the “Dependency Forest” (DF) which is the packed shared data structure adopted in the “Preference Dependency Grammar” (PDG), and proposes the “Graph Branch Algorithm” for computing the optimum dependency tree from a DF. This paper also reports the experiment showing the computational amount and behavior of the graph branch algorithm. ...

    pdf8p hongvang_1 16-04-2013 31 1   Download



p_strKeyword=The structure of shared forests

nocache searchPhinxDoc


Đồng bộ tài khoản