Estimation of the PCFG building the dependency constraint

Toshifumi Tanabe; Yoichi Tomiura; Toru Hitaka

Estimation of the PCFG building the dependency constraint

Toshifumi Tanabe, Yoichi Tomiura, Toru Hitaka

Intelligence Science

Research output: Contribution to journal › Article › peer-review

Abstract

In Natural Languages Processing, there are lots of syntax trees corresponding to an input sentence. If we can choose the correct syntax tree meaningfully, the quality of the processing is improved. We proposed the method of building the dependency constraint into a context free grammar by subdividing nonterminals according to the meaning of the phrase generated from the nonterminal and by grasping production rules from superordinate-subordinate relation of their meanings in the thesaurus. This paper shows estimation of the PCFG building the Dependency Constraint by the experiment of disambiguating which of N₂ or N₃ governs N₁ in the noun phrase "N₁ N₂N₃".

Original language	English
Pages (from-to)	93-97
Number of pages	5
Journal	Research Reports on Information Science and Electrical Engineering of Kyushu University
Volume	2
Issue number	1
Publication status	Published - Mar 1 1997

All Science Journal Classification (ASJC) codes

Computer Science(all)
Electrical and Electronic Engineering

Cite this

@article{c93d7f6956a948a39217163140bf67cf,

title = "Estimation of the PCFG building the dependency constraint",

abstract = "In Natural Languages Processing, there are lots of syntax trees corresponding to an input sentence. If we can choose the correct syntax tree meaningfully, the quality of the processing is improved. We proposed the method of building the dependency constraint into a context free grammar by subdividing nonterminals according to the meaning of the phrase generated from the nonterminal and by grasping production rules from superordinate-subordinate relation of their meanings in the thesaurus. This paper shows estimation of the PCFG building the Dependency Constraint by the experiment of disambiguating which of N2 or N3 governs N1 in the noun phrase {"}N1 N2N3{"}.",

author = "Toshifumi Tanabe and Yoichi Tomiura and Toru Hitaka",

year = "1997",

month = mar,

day = "1",

language = "English",

volume = "2",

pages = "93--97",

journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",

issn = "1342-3819",

publisher = "Kyushu University, Faculty of Science",

number = "1",

}

TY - JOUR

T1 - Estimation of the PCFG building the dependency constraint

AU - Tanabe, Toshifumi

AU - Tomiura, Yoichi

AU - Hitaka, Toru

PY - 1997/3/1

Y1 - 1997/3/1

N2 - In Natural Languages Processing, there are lots of syntax trees corresponding to an input sentence. If we can choose the correct syntax tree meaningfully, the quality of the processing is improved. We proposed the method of building the dependency constraint into a context free grammar by subdividing nonterminals according to the meaning of the phrase generated from the nonterminal and by grasping production rules from superordinate-subordinate relation of their meanings in the thesaurus. This paper shows estimation of the PCFG building the Dependency Constraint by the experiment of disambiguating which of N2 or N3 governs N1 in the noun phrase "N1 N2N3".

AB - In Natural Languages Processing, there are lots of syntax trees corresponding to an input sentence. If we can choose the correct syntax tree meaningfully, the quality of the processing is improved. We proposed the method of building the dependency constraint into a context free grammar by subdividing nonterminals according to the meaning of the phrase generated from the nonterminal and by grasping production rules from superordinate-subordinate relation of their meanings in the thesaurus. This paper shows estimation of the PCFG building the Dependency Constraint by the experiment of disambiguating which of N2 or N3 governs N1 in the noun phrase "N1 N2N3".

UR - http://www.scopus.com/inward/record.url?scp=0031101920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0031101920&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0031101920

SN - 1342-3819

VL - 2

SP - 93

EP - 97

JO - Research Reports on Information Science and Electrical Engineering of Kyushu University

JF - Research Reports on Information Science and Electrical Engineering of Kyushu University

IS - 1

ER -

Estimation of the PCFG building the dependency constraint

Abstract

All Science Journal Classification (ASJC) codes

Other files and links

Fingerprint

Cite this