On the Ambiguity Reduction Ability of a Probabilistic Context-Free Grammar(Special Section on Discrete Mathematics and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• This paper studies the ambiguity reduction ability of a probabilistic context-free grammar. We theoretically analyze a common behavior of any probabilistic context-free grammar. Moreover, we confirm by experments that a probabilistic context-free grammar learnt from Japanese corpus has the ambiguity reduction ability as expected by the theoretical analysis.

• 社団法人電子情報通信学会の論文
• 1998-05-25

著者

• Masuyama Shigeru

  Toyohashi Univ. Technol. Toyohashi‐shi Jpn

• ATSUMI Kiyotaka

  Toyohashi University of Technology

• Atsumi Kiyotaka

  Toyohashi University Of Technology:jsps Research Fellow Shizuoka University

関連論文

• A Polynomial Time Algorithm for Obtaining a Minimum Vertex Ranking Spanning Tree in Outerplanar Graphs(Invited Papers from New Horizons in Computing)
• Formulation of Mobile Agent Allocation and Its Strong NP-Completeness(Complexity Theory)
• An Efficient Parallel Parsing Algorithm for Context-Free Languages Based on Earley's Method (Special Section on Discrete Mathematics and Its Applications)
• Minimum Vertex Ranking Spanning Tree Problem(TUTORIAL SPEECH)
• On the Ambiguity Reduction Ability of a Probabilistic Context-Free Grammar(Special Section on Discrete Mathematics and Its Applications)
• Extraction of Effect and Technology Terms from a Patent Document(Theory and Methodology)
• Extraction of Effect and Technology Terms from a Patent Document

スポンサーリンク