Efficient parsing algorithm for CFG with robust dependency constraints

D. Toushinbatto, Yoichi Tomiura, Toru Hitaka

Research output: Contribution to journalArticle

Abstract

A context-free grammar (CFG) in which dependency constraints are tucked into production rules has been proposed, where syntactic categories are subdivided by the headword of the phrase. It's difficult to collect all necessary rules expressing dependency constraints in the grammar, so taking superordinate-subordinate relations in the word hierarchy into the grammar as production rules has been considered. However, because there are huge number of syntactic trees for an input sentence in this grammar, how to select a preferable syntactic tree is very important. This paper shows an efficient parsing algorithm, specialized to the heuristics for selecting the most plausible syntactic tree.

Original languageEnglish
Pages (from-to)223-227
Number of pages5
JournalResearch Reports on Information Science and Electrical Engineering of Kyushu University
Volume5
Issue number2
Publication statusPublished - Sep 2000

Fingerprint

Context free grammars
Syntactics

All Science Journal Classification (ASJC) codes

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

Cite this

Efficient parsing algorithm for CFG with robust dependency constraints. / Toushinbatto, D.; Tomiura, Yoichi; Hitaka, Toru.

In: Research Reports on Information Science and Electrical Engineering of Kyushu University, Vol. 5, No. 2, 09.2000, p. 223-227.

Research output: Contribution to journalArticle

@article{213d017109b74827b13600f5ba984ab4,
title = "Efficient parsing algorithm for CFG with robust dependency constraints",
abstract = "A context-free grammar (CFG) in which dependency constraints are tucked into production rules has been proposed, where syntactic categories are subdivided by the headword of the phrase. It's difficult to collect all necessary rules expressing dependency constraints in the grammar, so taking superordinate-subordinate relations in the word hierarchy into the grammar as production rules has been considered. However, because there are huge number of syntactic trees for an input sentence in this grammar, how to select a preferable syntactic tree is very important. This paper shows an efficient parsing algorithm, specialized to the heuristics for selecting the most plausible syntactic tree.",
author = "D. Toushinbatto and Yoichi Tomiura and Toru Hitaka",
year = "2000",
month = "9",
language = "English",
volume = "5",
pages = "223--227",
journal = "Research Reports on Information Science and Electrical Engineering of Kyushu University",
issn = "1342-3819",
publisher = "Kyushu University, Faculty of Science",
number = "2",

}

TY - JOUR

T1 - Efficient parsing algorithm for CFG with robust dependency constraints

AU - Toushinbatto, D.

AU - Tomiura, Yoichi

AU - Hitaka, Toru

PY - 2000/9

Y1 - 2000/9

N2 - A context-free grammar (CFG) in which dependency constraints are tucked into production rules has been proposed, where syntactic categories are subdivided by the headword of the phrase. It's difficult to collect all necessary rules expressing dependency constraints in the grammar, so taking superordinate-subordinate relations in the word hierarchy into the grammar as production rules has been considered. However, because there are huge number of syntactic trees for an input sentence in this grammar, how to select a preferable syntactic tree is very important. This paper shows an efficient parsing algorithm, specialized to the heuristics for selecting the most plausible syntactic tree.

AB - A context-free grammar (CFG) in which dependency constraints are tucked into production rules has been proposed, where syntactic categories are subdivided by the headword of the phrase. It's difficult to collect all necessary rules expressing dependency constraints in the grammar, so taking superordinate-subordinate relations in the word hierarchy into the grammar as production rules has been considered. However, because there are huge number of syntactic trees for an input sentence in this grammar, how to select a preferable syntactic tree is very important. This paper shows an efficient parsing algorithm, specialized to the heuristics for selecting the most plausible syntactic tree.

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

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

M3 - Article

AN - SCOPUS:0034266931

VL - 5

SP - 223

EP - 227

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 - 2

ER -