Assignment of Data Types to Words in a Natural Language Specification

Yasunori ISHIHARA; Atsushi OHSAKI; Hiroyuki SEKI; Tadao KASAMI

Assignment of Data Types to Words in a Natural Language Specification

Yasunori ISHIHARA, Atsushi OHSAKI, Hiroyuki SEKI, Tadao KASAMI

Full Text Views

0

Cite this

Summary :

When a natural language specification is translated into a formal one, it is important for objects and operations appearing in the natural language specification to be appropriately classified according to the framework of data types in the formal specification. In this paper, we propose a semi-automatic method of constructing a context-free grammar (cfg) representing an assignment of data types to words in a given natural language specification. In our method, a cfg is mechanically constructed from sample sentences in a natural language specification, where the cfg represents type declarations of expressions and type hierarchy. Then, the cfg is appropriately modified by adding nonterminals/production rules that represent type inclusion relations. In this modification process, candidates for the productions to be added are presented to the user. Finally, the cfg is simplified based on structural equivalence. The result of applying this method to a part of the OSI session protocol specification (39 sentences) is also presented. There was an example in which ambiguity of anaphoric bindings was solved by type checking based on the resulting cfg.

Publication: IEICE TRANSACTIONS on Information Vol.E79-D No.6 pp.820-828

Publication Date: 1996/06/25

Publicized

Online ISSN

DOI

Type of Manuscript: PAPER

Category: Automata,Languages and Theory of Computing

Cite this

Copy

Yasunori ISHIHARA, Atsushi OHSAKI, Hiroyuki SEKI, Tadao KASAMI, "Assignment of Data Types to Words in a Natural Language Specification" in IEICE TRANSACTIONS on Information, vol. E79-D, no. 6, pp. 820-828, June 1996, doi: .
Abstract: When a natural language specification is translated into a formal one, it is important for objects and operations appearing in the natural language specification to be appropriately classified according to the framework of data types in the formal specification. In this paper, we propose a semi-automatic method of constructing a context-free grammar (cfg) representing an assignment of data types to words in a given natural language specification. In our method, a cfg is mechanically constructed from sample sentences in a natural language specification, where the cfg represents type declarations of expressions and type hierarchy. Then, the cfg is appropriately modified by adding nonterminals/production rules that represent type inclusion relations. In this modification process, candidates for the productions to be added are presented to the user. Finally, the cfg is simplified based on structural equivalence. The result of applying this method to a part of the OSI session protocol specification (39 sentences) is also presented. There was an example in which ambiguity of anaphoric bindings was solved by type checking based on the resulting cfg.
URL: https://global.ieice.org/en_transactions/information/10.1587/e79-d_6_820/_p

Copy

@ARTICLE{e79-d_6_820,
author={Yasunori ISHIHARA, Atsushi OHSAKI, Hiroyuki SEKI, Tadao KASAMI, },
journal={IEICE TRANSACTIONS on Information},
title={Assignment of Data Types to Words in a Natural Language Specification},
year={1996},
volume={E79-D},
number={6},
pages={820-828},
abstract={When a natural language specification is translated into a formal one, it is important for objects and operations appearing in the natural language specification to be appropriately classified according to the framework of data types in the formal specification. In this paper, we propose a semi-automatic method of constructing a context-free grammar (cfg) representing an assignment of data types to words in a given natural language specification. In our method, a cfg is mechanically constructed from sample sentences in a natural language specification, where the cfg represents type declarations of expressions and type hierarchy. Then, the cfg is appropriately modified by adding nonterminals/production rules that represent type inclusion relations. In this modification process, candidates for the productions to be added are presented to the user. Finally, the cfg is simplified based on structural equivalence. The result of applying this method to a part of the OSI session protocol specification (39 sentences) is also presented. There was an example in which ambiguity of anaphoric bindings was solved by type checking based on the resulting cfg.},
keywords={},
doi={},
ISSN={},
month={June},}

Copy

TY - JOUR
TI - Assignment of Data Types to Words in a Natural Language Specification
T2 - IEICE TRANSACTIONS on Information
SP - 820
EP - 828
AU - Yasunori ISHIHARA
AU - Atsushi OHSAKI
AU - Hiroyuki SEKI
AU - Tadao KASAMI
PY - 1996
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E79-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1996
AB - When a natural language specification is translated into a formal one, it is important for objects and operations appearing in the natural language specification to be appropriately classified according to the framework of data types in the formal specification. In this paper, we propose a semi-automatic method of constructing a context-free grammar (cfg) representing an assignment of data types to words in a given natural language specification. In our method, a cfg is mechanically constructed from sample sentences in a natural language specification, where the cfg represents type declarations of expressions and type hierarchy. Then, the cfg is appropriately modified by adding nonterminals/production rules that represent type inclusion relations. In this modification process, candidates for the productions to be added are presented to the user. Finally, the cfg is simplified based on structural equivalence. The result of applying this method to a part of the OSI session protocol specification (39 sentences) is also presented. There was an example in which ambiguity of anaphoric bindings was solved by type checking based on the resulting cfg.
ER -