Results 1 - 10
of
125
The GRAIL concept modelling language for medical terminology
- ARTIFICIAL INTELLIGENCE IN MEDICINE
, 1997
"... ..."
(Show Context)
An Expanded Logical Formalism for Head-Driven Phrase Structure Grammar
, 1994
"... . Though [Pollard and Sag 1994] assumes that an unspecified variant of the formal logic of [Carpenter 1992] will provide a formalism for HPSG, a precise formulation of the envisaged formalism is not immediately obvious, primarily because a principal tenet of [Carpenter 1992], that feature structures ..."
Abstract
-
Cited by 104 (8 self)
- Add to MetaCart
. Though [Pollard and Sag 1994] assumes that an unspecified variant of the formal logic of [Carpenter 1992] will provide a formalism for HPSG, a precise formulation of the envisaged formalism is not immediately obvious, primarily because a principal tenet of [Carpenter 1992], that feature structures represent partial information, seems to conflict with a principal tenet of [Pollard and Sag 1994], that feature structures represent abstract linguistic entities. This has caused many HPSGians to be mistakenly concerned with partial-information specific notions, such as subsumption, that are appropriate for the [Carpenter 1992] logic but inappropriate for the formalism [Pollard and Sag 1994] envisages. This paper hopes to allay this concern and the confusion it engenders by substituting [King 1989] for [Carpenter 1992] as the basis of the envisaged formalism. It demonstrates that the formal logic of [King 1989] provides a formalism for HPSG that meets all [Pollard and Sag 1994] asks of the ...
ProFIT: Prolog with features, inheritance and templates
- In EACL Proceedings, 7th Annual Meeting
, 1995
"... ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Sorted feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer descr ..."
Abstract
-
Cited by 67 (0 self)
- Add to MetaCart
ProFIT is an extension of Standard Prolog with Features, Inheritance and Templates. ProFIT allows the programmer or grammar developer to declare an inheritance hierarchy, features and templates. Sorted feature terms can be used in ProFIT programs together with Prolog terms to provide a clearer description language for linguistic structures. ProFIT compiles all sorted feature terms into a Prolog term representation, so that the built-in Prolog term unification can be used for the unification of sorted feature structures, and no special unification algorithm is needed. ProFIT programs are compiled into Prolog programs, so that no meta-interpreter is needed for their execution. ProFIT thus provides a direct step from grammars developed with sorted feature terms to Prolog programs usable for practical NLP systems. 1
Cases as terms : A feature term approach to the structured representation of cases
, 1995
"... this paper there is an Appendix A that shows that the result of this antiunification is indeed the greatest lower bound (report available at ..."
Abstract
-
Cited by 56 (4 self)
- Add to MetaCart
this paper there is an Appendix A that shows that the result of this antiunification is indeed the greatest lower bound (report available at
Stochastic HPSG
, 1995
"... In this paper we provide a probabilistic interpretation for typed feature structures very similar to those used by Pollard nd Sag. We begin with a version of the interpretation which lacks a treatment of re-entrant feature struc- tures, then provide an extended interpre- tation which allows t ..."
Abstract
-
Cited by 34 (1 self)
- Add to MetaCart
In this paper we provide a probabilistic interpretation for typed feature structures very similar to those used by Pollard nd Sag. We begin with a version of the interpretation which lacks a treatment of re-entrant feature struc- tures, then provide an extended interpre- tation which allows them. We sketch al- gorithms allowing the numerical parameters of our probabilistic interpretations of HPSG to be estimated from corpora.
QuickSet: Multimodal Interaction for Simulation Set-up and Control
- In Proceedings of the Fifth Applied Natural Language Processing meeting
, 1997
"... This paper presents a novel multimodal system applied to the setup and control of distributed interactive simulations. ..."
Abstract
-
Cited by 30 (1 self)
- Add to MetaCart
(Show Context)
This paper presents a novel multimodal system applied to the setup and control of distributed interactive simulations.
Efficient Feature Structure Operations without Compilation
, 2000
"... One major obstacle to efficient processing of large wide coverage grammars in unification-based grammatical frameworks such as HPSG is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which invo ..."
Abstract
-
Cited by 30 (1 self)
- Add to MetaCart
One major obstacle to efficient processing of large wide coverage grammars in unification-based grammatical frameworks such as HPSG is the time and space cost of the unification operation itself. In a grammar development system it is not appropriate to address this problem with techniques which involve lengthy compilation, since this slows down the edit-test-debug cycle. Nor is it possible to radically restructure the grammar. In this paper we describe novel extensions to an existing efficient unification algorithm which improve its space and time behaviour (without affecting its correctness) by substantially increasing the amount of structure sharing that takes place. We also describe a fast and automatically tunable pre-unification filter (the "quick check") which in practice detects a large proportion of unifications that if performed would fail. Finally, we present an efficient algorithm for checking for subsumption relationships between two feature structures; a special case of this gives a fast equality test. The subsumption check is used in a parser (described elsewhere in this volume) which "packs" local ambiguities to avoid performing redundant sub-computations.
Word Formation in Lexical Type Hierarchies - A Case Study of bar-Adjectives in German -
, 1993
"... This thesis describes a proposal for the treatment of derivation as part of a lexical component for HPSG. The system is not based on a `syntax of words', but solely on a hierarchical structure of the lexicon. The approach is motivated by a detailed study of bar-adjectives in German. The analysi ..."
Abstract
-
Cited by 29 (2 self)
- Add to MetaCart
This thesis describes a proposal for the treatment of derivation as part of a lexical component for HPSG. The system is not based on a `syntax of words', but solely on a hierarchical structure of the lexicon. The approach is motivated by a detailed study of bar-adjectives in German. The analysis of data from corpora has shown that a word-syntax alone is not sufficient to cover the data. The proposed alternative explains phenomena of affixation by multiple inheritance in a hierarchy of lexical types (cf. Pollard & Sag 1987 or Krieger & Nerbonne 1992), without assuming categorymarked lexical entries for affixes. The lexical types express generalizations about existing words and thus have the effect of eliminating redundant information in lexical entries. They explicitly serve as redundancy rules (cf. Jackendoff 1975), mainly giving structure to the lexicon and only secondarily being activated for productive word formation. By exploiting the fact that feature structures in HPSG are typed ...
Rapid Prototyping for Spoken Dialogue Systems
- in Proc. Internat. Conf. on Computational Linguistics
, 2002
"... We implemented a spoken dialogue system ar-chitecture for rapid prototyping. The features that support rapid prototyping include a clear separation of generic dialogue processing al-gorithms from domain and language specic knowledge sources. In an experiment, it could be shown that six individuals c ..."
Abstract
-
Cited by 24 (0 self)
- Add to MetaCart
(Show Context)
We implemented a spoken dialogue system ar-chitecture for rapid prototyping. The features that support rapid prototyping include a clear separation of generic dialogue processing al-gorithms from domain and language specic knowledge sources. In an experiment, it could be shown that six individuals could specify these domain and language specic knowledge sources within 8 to 12 hours to come up with a prototyp-ical implementation of a spoken dialogue sys-tem. To that end, no dialogue strategy had to be specied. Rather, it was suÆcient to provide an ontology, a description of the services oered by the system, parsing grammars, database con-version rules and generation templates. Fur-thermore, the experiment shows that it is possi-ble to formulate dialogue strategies in a domain and language independent manner; thus not re-quiring a system designer to be knowledgeable about dialogue processing. 1
The Correct and Efficient Implementation of Appropriateness Specifications for Typed Feature Structures
, 1994
"... In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider the expressive limits of this alternative approach. Throughout ..."
Abstract
-
Cited by 22 (5 self)
- Add to MetaCart
(Show Context)
In this paper, we argue that type inferencing incorrectly implements appropriateness specifications for typed feature structures, promote a combination of type resolution and unfilling as a correct and efficient alternative, and consider the expressive limits of this alternative approach. Throughout, we use feature cooccurence restrictions as illustration and linguistic motivation.
