Implementing systemic classification by unification
Computational Linguistics
The logic of typed feature structures
The logic of typed feature structures
Systemic classification and its efficiency
Computational Linguistics
Object-Oriented Concurrent Constraint Programming in Oz
Grundlagen und Anwendungen der Künstlichen Intelligenz, 17. Fachtagung für Künstliche Intelligenz, Humboldt-Universität zu
Deterministic consistency checking of LP constraints
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
An attributive logic of set descriptions and set operations
ACL '94 Proceedings of the 32nd annual meeting on Association for Computational Linguistics
COLING '90 Proceedings of the 13th conference on Computational linguistics - Volume 3
TDL: a type description language for constraint-based grammars
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Self-monitoring with reversible grammars
COLING '92 Proceedings of the 14th conference on Computational linguistics - Volume 2
Computational Linguistics
Finite-Tree Analysis for Constraint Logic-Based Languages
SAS '01 Proceedings of the 8th International Symposium on Static Analysis
Generating Symbolic and Natural Language Partial Solutions for Inclusion in Medical Plans
AIME '01 Proceedings of the 8th Conference on AI in Medicine in Europe: Artificial Intelligence Medicine
High-level authoring of illustrated documents
Natural Language Engineering
Parsing with discontinuous phrases
Natural Language Engineering
Deterministic consistency checking of LP constraints
EACL '95 Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics
Generating referring expressions with a unification grammar
EACL '99 Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics
LiLFeS: towards a practical HPSG parser
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Translating a unification grammar with disjunctions into logical constraints
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Head-driven generation with HPSG
COLING '98 Proceedings of the 17th international conference on Computational linguistics - Volume 2
Binding constraints as instructions of binding machines
COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 1
A generalized reconstruction algorithm for ellipsis resolution
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Reversible delayed lexical choice in a bidirectional framework
COLING '96 Proceedings of the 16th conference on Computational linguistics - Volume 2
Finite-tree analysis for constraint logic-based languages
Information and Computation
Ellipsis resolution with underspecified scope
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Generating full paraphrases of fragments in a dialogue interpretation system
SIGDIAL '01 Proceedings of the Second SIGdial Workshop on Discourse and Dialogue - Volume 16
Lexicalising word order constraints for implemented linearisation grammar
EACL '06 Proceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop
Generic querying of relational databases using natural language generation techniques
INLG '06 Proceedings of the Fourth International Natural Language Generation Conference
Decision support tools for clinical trial design
Artificial Intelligence in Medicine
Fluid construction grammar: the new kid on the block
EACL '12 Proceedings of the Demonstrations at the 13th Conference of the European Chapter of the Association for Computational Linguistics
| Hi-index | 0.00 |
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.