首页> 外国专利> Method and system for the representation of multiple analyses in dependency grammar and parser for generating such representation

Method and system for the representation of multiple analyses in dependency grammar and parser for generating such representation

机译:在相关性语法中用于表示多个分析的方法和系统以及用于生成这种表示的解析器

摘要

Method for unambiguously coding multiple parsing analyses of a natural language word sequence in dependency grammar in which dependencies are defined between pairs of words, each pair consisting of a superordinate word or governor and a thereto related word or dependent. For each word in the sequence a word index is determined, representing the rank of order of said word in the sequence. All possible dependents of each word are determined as well as the relation between the word and the dependents using a parsing algorithm in combination with a grammar and a dictionary in which all words of the language are stored together with their syntactic interpretation and an interpretation index, representing the rank order of the syntactic interpretation of the word in the dictionary in order to distinguish between multiple syntactic interpretations of said word. A syntactic network is determined which is represented as a tree consisting of nodes mutually coupled by edges and comprising at least one top node, one or more terminal nodes and eventually a number of intermediate nodes, each node being interpreted as an exlusive OR node serving as a pointer if there is only one alternative and serving as a choice point if there are several alternatives, whereby each of the pointer nodes is assigned to a word of the sequence and each edge is assigned to the syntactic relation between the two nodes coupled by said edge, whereby each node is coded by an identifier which in case of a pointer node is directly related to the entry of a word in the dictionary and in the case of a choice point comprises a list of further identifiers one of which has to be selected.
机译:在依赖关系语法中对自然语言单词序列的多个解析分析进行明确编码的方法,其中在单词对之间定义了依赖关系,每对单词由上位单词或调控器以及与其相关的单词或从属关系组成。对于序列中的每个单词,确定单词索引,其表示所述单词在序列中的顺序等级。使用解析算法结合语法和字典来确定每个单词的所有可能的从属关系以及单词与从属关系之间的关系,语法和字典中存储了该语言的所有单词及其句法解释和解释索引,表示字典中单词的句法解释的等级顺序,以便区分所述单词的多种句法解释。确定一个语法网络,该网络表示为一棵树,该树由由边缘相互耦合的节点组成,并包括至少一个顶部节点,一个或多个终端节点以及最终多个中间节点,每个节点都被解释为一个独占的OR节点,如果只有一个替代项,则为指针;如果有多个替代项,则作为选择点,从而将每个指针节点分配给该序列的一个单词,并将每个边沿分配给由所述耦合的两个节点之间的句法关系边缘,由此每个节点都由一个标识符进行编码,在指针节点的情况下,该标识符与字典中单词的输入直接相关,在选择点的情况下,还包括一系列其他标识符,必须选择其中一个。

著录项

  • 公开/公告号US5060155A

    专利类型

  • 公开/公告日1991-10-22

    原文格式PDF

  • 申请/专利权人 BSO/BURO VOOR SYSTEEMONTWIKKELING B.V.;

    申请/专利号US19900472831

  • 发明设计人 JOB M. VAN ZUIJLEN;

    申请日1990-01-31

  • 分类号G06F15/38;G06F1/00;

  • 国家 US

  • 入库时间 2022-08-22 05:45:42

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号