Efficient Parameterizable Type Expansion for Typed Feature Formalisms
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence. Natural Language. Pages 1428-1433.
Abstract
Over the l ast few years, constraint-based grammar formalisms have become the predominant paradigm in natural language processing and computational linguistics. From the viewpoint of computer science, typed feature structures can be seen as data structures that allow the representation of linguistic knowledge in a uniform fashion. Type expansion is an operation that makes constraints of a typed feature structure explicit and determines its satisfiability. We describe an efficient expansion algorithm that takes care of recursive type definitions and permits the exploration of different expansion strategies through the use of control knowledge. This knowledge is specified on a separate layer, independent of grammatical information. The algorithm, as presented in the paper, has been fully implemented in COMMON LISP and is an integrated part of the typed feature formalism TDC that is emp lo yed in several large NL projects.
@inproceedings{ijcai1995p184,
title = {Efficient Parameterizable Type Expansion for Typed Feature Formalisms},
author = {Krieger, Hans-Ulrich and Schäfer, Ulrich},
booktitle = {Proceedings of the Fourteenth International Joint Conference on
Artificial Intelligence, {IJCAI-95}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Chris S. Mellish},
pages = {1428--1433},
year = {1995},
note = {Natural Language},
url = {https://ijcai.org/proceedings/1995/184},
}
TY - CPAPER TI - Efficient Parameterizable Type Expansion for Typed Feature Formalisms AU - Krieger, Hans-Ulrich AU - Schäfer, Ulrich T2 - Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI-95 PB - International Joint Conferences on Artificial Intelligence PY - 1995 SP - 1428 EP - 1433 UR - https://ijcai.org/proceedings/1995/184 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: