Estimation of the PCFG building the dependency constraint

Toshifumi Tanabe, Yoichi Tomiura, Toru Hitaka

Research output: Contribution to journalArticle

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".

Original languageEnglish
Pages (from-to)93-97
Number of pages5
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume2
Issue number1
Publication statusPublished - Mar 1997

Fingerprint

Context free grammars
Thesauri
Processing
Experiments

All Science Journal Classification (ASJC) codes

  • Hardware and Architecture
  • Engineering (miscellaneous)
  • Electrical and Electronic Engineering

Cite this

Estimation of the PCFG building the dependency constraint. / Tanabe, Toshifumi; Tomiura, Yoichi; Hitaka, Toru.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 2, No. 1, 03.1997, p. 93-97.

Research output: Contribution to journalArticle

@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 = "3",
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

Y1 - 1997/3

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

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

SN - 1342-3819

IS - 1

ER -