发明名称 PARSING SYSTEM FOR LANGUAGE PROCESSING
摘要 <p>PURPOSE:To save wasteful trouble by inspecting the presence or absence of a component tree containing an unsuitable partial tree (constitutes a part of a tree and has a shape of a tree) to discontinue a parsing operation according to circumstances. CONSTITUTION:In an all searching method parser main part APSM, a component tree generating terminal PSMPT is a part for generating a component tree which uses a nodal generated newly as a result of applying some rewriting rule, as the most significant nodal point. A result receiving terminal PLSI is a part for receiving a binary information as to whether a component tree generated in the PSMPT terminal coincides with an inhibited partial tree or not, for instance, ''1'' or ''0''. When an information stating that the component tree corresponds to the inhibited partial tree is inputted to a terminal RLSI, the main part APSM executes an operation for dicarding a parsing operation of a tree group relation having the component tree containing the subsequent inhibited partial tree thereof.</p>
申请公布号 JPS59160269(A) 申请公布日期 1984.09.10
申请号 JP19830032985 申请日期 1983.03.02
申请人 KOKUSAI DENSHIN DENWA KK 发明人 SAKAKI HIROSHI;HASHIMOTO KAZUO;YAGAKINAI IZURU
分类号 G06F17/27;G06F17/28;(IPC1-7):G06F15/38 主分类号 G06F17/27
代理机构 代理人
主权项
地址