首页> 外文会议>International joint conference on artificial intelligence >Approximating Maximum-Entropy Ratings for Evidential Parsing and Semantic Interpretation
【24h】

Approximating Maximum-Entropy Ratings for Evidential Parsing and Semantic Interpretation

机译:近似最大熵评级,以获得证据解析和语义解释

获取原文

摘要

We consider the problem of assigning probabilistic ratings to hypotheses in a natural language interpretation system. To facilitate integrating syntactic, semantic, and conceptual constraints, we allow a fully compositional frame representation, which permits co-indexed syntactic constituents and/or semantic entities filling multiple roles. In addition the knowledge base contains probabilistic information encoded by marginal probabilities on frames. These probabilities are used to specify typicality of real-world scenarios on one hand, and conventionality of linguistic usage patterns on the other. Because the theoretical maximum-entropy solution is infea-sible in the general case, we propose an approximate method. This method's strengths are (1) its ability to rate compositional structures, and (2) its flexibility with respect to the inputs chosen by the system it is embedded in. Arbitrary sets of hypotheses from the front-end processor can be accepted, as well as arbitrary subsets of constraints heuristically chosen from the long-term knowledge base.
机译:我们考虑将概率评级分配到自然语言解释系统中的假设的问题。为了便于整合句法,语义和概念约束,我们允许完全组成帧表示,其允许共同索引的句法成分和/或语义实体填充多个角色。此外,知识库包含帧上的边际概率编码的概率信息。这些概率用于指定一方面的真实情景的典型性,另一方面是语言使用模式的常规性。由于理论最大熵解决方案是常规案例中的Ifea-Sible,所以我们提出了一种近似方法。该方法的优点是(1)其对组成结构的能力,(2)其嵌入系统中选择的输入的输入的灵活性。也可以接受来自前端处理器的任意一组假设,也是如此作为从长期知识库中选择的约束的任意子集。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号