Three-Word Dependency Relations and Their Application to Structural Ambiguity Resolution (特集:マルチメディア通信と分散処理)
スポンサーリンク
概要
- 論文の詳細を見る
Resolving syntactic ambiguities is an important issue in natural language processing. By measuring the strengths of association that hold among the words in co-occurrence relations, one may be able to determine the correct syntactic structure for an ambiguous construction. In this paper, we propose a syntactic disambiguation method that uses lexical preferences estimated in three-word dependency relations and, at the same time, conduct a disambiguation experiment in Japanese noun phrases containing the particle no. The result shows a better performance than those of other methods, and indicates the applicability of the method to resolving other syntactic ambiguities that appear in coordinated constructions, prepositional phrase attachments, and like.
- 一般社団法人情報処理学会の論文
- 1999-01-15
著者
-
Alves Eduardo
Department Of Computer Science
-
Alves Eduardo
Department Of Computer Science The University Of Electro-communications
-
FURUGORI TEIJI
Department of Computer Science, The University of Electro-Communications
-
Furugori Teiji
Department Of Computer Science The University Of Electro-communications
関連論文
- An Applicaion of Bayesian Networks to Lexical Ambiguituy Resolution
- Three-Word Dependency Relations and Their Application to Structural Ambiguity Resolution (特集:マルチメディア通信と分散処理)
- Information Extraction and Summarization for Newspaper Articles on Sassho-jiken(Special Issue on Text Processing for Information Access)