Ontologically promiscuous flat logical forms for NLP

Diego Mollá

Ontologically promiscuous flat logical forms for NLP

School of Computing

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

Abstract

In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.

Original language	English
Title of host publication	Proceedings of the Fourth International Workshop on Computational Semantics
Editors	Harry Bunt, Ielka van der Sluis, Elias Thijsse
Place of Publication	Tilburg The Netherlands
Publisher	Tilburg University
Pages	249-265
Number of pages	17
ISBN (Print)	9074029167
Publication status	Published - 2001
Event	Fourth International Workshop on Computational Semantics - Duration: 10 Jan 2001 → 12 Jan 2001

Workshop

Workshop	Fourth International Workshop on Computational Semantics
Period	10/01/01 → 12/01/01

Keywords

flat logical form
reification
underspecifcation
partial logical form
answer extraction

Access to Document

http://www.ics.mq.edu.au/~diego/publications/iwcs4.pdf

Cite this

@inproceedings{50994de5c3994017878cb51aa2b30094,

title = "Ontologically promiscuous flat logical forms for NLP",

abstract = "In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.",

keywords = "flat logical form, reification, underspecifcation, partial logical form, answer extraction",

author = "Diego Moll{\'a}",

year = "2001",

language = "English",

isbn = "9074029167",

pages = "249--265",

editor = "Harry Bunt and {van der Sluis}, Ielka and Elias Thijsse",

booktitle = "Proceedings of the Fourth International Workshop on Computational Semantics",

publisher = "Tilburg University",

note = "Fourth International Workshop on Computational Semantics ; Conference date: 10-01-2001 Through 12-01-2001",

}

Mollá, D 2001, Ontologically promiscuous flat logical forms for NLP. in H Bunt, I van der Sluis & E Thijsse (eds), Proceedings of the Fourth International Workshop on Computational Semantics. Tilburg University, Tilburg The Netherlands, pp. 249-265, Fourth International Workshop on Computational Semantics, 10/01/01. <http://www.ics.mq.edu.au/~diego/publications/iwcs4.pdf>

Ontologically promiscuous flat logical forms for NLP. / Mollá, Diego.
Proceedings of the Fourth International Workshop on Computational Semantics. ed. / Harry Bunt; Ielka van der Sluis; Elias Thijsse. Tilburg The Netherlands: Tilburg University, 2001. p. 249-265.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution › peer-review

TY - GEN

T1 - Ontologically promiscuous flat logical forms for NLP

AU - Mollá, Diego

PY - 2001

Y1 - 2001

N2 - In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.

AB - In this paper a flat notation for logical forms is described. This notation allows the logical forms to be easy to build, easy to work with, and able to deal with ambiguity by underspecification. The main mechanism to convert a logical form into the corresponding flat form is the reification of all the predicates and operators used in an otherwise nested expression. The resulting flat logical forms are convenient for natural language processing applications that require the use of partial logical forms. In particular, it is shown how partial logical forms(encoded in flat notation) can be used to perform answer extraction.

KW - flat logical form

KW - reification

KW - underspecifcation

KW - partial logical form

KW - answer extraction

M3 - Conference proceeding contribution

SN - 9074029167

SP - 249

EP - 265

BT - Proceedings of the Fourth International Workshop on Computational Semantics

A2 - Bunt, Harry

A2 - van der Sluis, Ielka

A2 - Thijsse, Elias

PB - Tilburg University

CY - Tilburg The Netherlands

T2 - Fourth International Workshop on Computational Semantics

Y2 - 10 January 2001 through 12 January 2001

ER -

Ontologically promiscuous flat logical forms for NLP

Abstract

Workshop

Keywords

Access to Document

Fingerprint

Cite this