Shared-Packed Parse Forests and Logical Form

为了同时处理句法和语义歧义，我们 建议使用Seo和Simmons的共享打包解析森林 （1989）结合一个逻辑形式表示， 由哈珀（1990）发展的句子。如果打包的分析森林 单独使用，对语义歧义做出明智的决定 在解决句法歧义时不能进行。 如果 如果只使用逻辑形式，则所有语法歧义都必须 在提供句子的逻辑形式之前解决。 给定一个解析树，可以精确地指定逻辑形式，但是 对于一次提供一个解析树的解析器， 正确的解析树需要指数时间。 逻辑形式与 压缩森林将生成紧凑的中间表示 在多项式时间内得到一个模棱两可的句子 作为句法和 语义歧义是相互制约的， 中间代表应集中注意力， 有效性 随着更多的信息被处理， 中间表示将递增地更新， 解析森林被简化为包含一个 逻辑形式。 此外，这种方法的模块化将 减少自然语言问题的概念复杂性。

To simultaneously handle syntactic and semantic ambiguity, we propose using the shared-packed parse forest of Seo and Simmons (1989) in conjunction with the logical form representation of a sentence developed by Harper (1990). If the packed parse forest is used alone, informed decisions about semantic ambiguities cannot be made while addressing syntactic ambiguities. If logical form alone is used, all syntactic ambiguities must be resolved before providing the logical form for the sentence. Logical form can be specified precisely given a parse tree, but with a parser that provides one parse tree at a time, finding the correct parse tree requires exponential time. The algorithm resulting from the wedding of logical form to packed forests will produce a compact intermediate representation for an ambiguous sentence in polynomial time. As syntactic and semantic ambiguity are mutually constraining, maintaining both in the intermediate representation should focilitate their inter- effectiveness. As more information is processed this intermediate representation will be incrementally updated until the parse forest is reduced to a single tree containing one logical form. In addition, the modularity of this approach will reduce the conceptual complexity of the natural language problem.