More Web Proxy on the site http://driver.im/

Article

Free access

ProFIT: prolog with features, inheritance and templates

Author:

Gregor ErbachAuthors Info & Claims

EACL '95: Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics

Pages 180 - 187

https://doi.org/10.3115/976973.976999

Published: 27 March 1995 Publication History

PDF eReader Publisher Site

Abstract

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.

References

[1]

Hassan Aït-Kaci and Patrick Lincoln. 1989. Life, a natural language for natural language. T. A. Informations, 30(1-2):37 - 67.

[2]

H. Alshawi, D. J. Arnold, R. Backofen, D. M. Carter, J. Lindop, K. Netter, J. Tsujii, and H. Uszkoreit. 1991. Eurotra 6/1: Rule formalism and virtual machine design study --- Final report. Technical report, SRI International, Cambridge.

[3]

Hiyan Alshawi, editor. 1991. The Core Language Engine. MIT Press.

[4]

Chris Brew. 1991. Systemic classification and its efficiency. Computational Linguistics, 17(4):375 - 408.

Digital Library

[5]

Bob Carpenter. 1992. The logic of typed feature structures. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, Cambridge.

Digital Library

[6]

Bob Carpenter, 1993. ALE Version ß: User Manual. University of Pittsburgh.

[7]

Michael Covington. 1989. GULP 2.0: an extension of Prolog for unification-based grammar. Technical Report AI-1989-01, Advanced Computational Methods Center, University of Georgia.

[8]

Jochen Dörre and Michael Dorna. 1993. CUF - A formalism for linguistic knowledge representation. In Jochen Dörre, editor, Computational Aspects of Constraint-Based Linguistic Description. Deliverable R1.2.A. DYANA-2 - ESPRIT Basic Research Project 6852.

[9]

Martin Emele and Rémi Zajac. 1990. Typed unification grammars. In Proceedings of the 13th International Conference on Computational Linguistics, Helsinki.

Digital Library

[10]

Gregor Erbach. 1994. Multi-dimensional inheritance. In H. Trost, editor, Proceedings of KONVENS '94, pages 102 - 111, Vienna. Springer.

[11]

Susan Beth Hirsh. 1986. P-PATR: A compiler for unification-based grammars. Master's the-sis, Stanford University, Stanford, CA.

[12]

Draft ISO Standard for the Prolog language, ISO/IEC JTC1 SC22 WG17 N110 "Prolog: Part 1, General core".

[13]

Hans-Ulrich Krieger and Ulrich Schäfer. 1994. TDL---a type description language for constraint-based grammars. In Proceedings of the 15th International Conference on Computational Linguistics, COLING-94, Kyoto, Japan.

Digital Library

[14]

Suresh Manandhar. 1994. An attributive logic of set descriptions and set operations. In 32nd Annual Meeting of the Association for Computational Linguistics (ACL), pages 255 - 262, Las Cruces, NM.

Digital Library

[15]

Suresh Manandhar. 1995. Deterministic consistency checking of LP constraints. In Seventh Conference of the European Chapter of the Association for Computational Linguistics (EACL), Dublin.

Digital Library

[16]

Johannes Matiasek. 1994. Conditional constraints in a CLP-based HPSG implementation. In Harald Trost, editor, KONVENS '94, pages 230 - 239, Vienna.

[17]

Christopher S. Mellish. 1988. Implementing systemic classification by unification. Computational Linguistics, 14(1):40--51.

Digital Library

[18]

Christopher S. Mellish. 1992. Term-encodable description spaces. In D. R. Brough, editor, Logic Programming: New Frontiers, pages 189 - 207. Intellect, Oxford.

[19]

Günter Neumann and Gertjan van Noord. 1992. Self-monitoring with reversible grammars. In Proceedings of the 14th International Conference on Computational Linguistics, Nantes, F.

Digital Library

[20]

Günter Neumann. 1994. A Uniform Computational Model for Natural Language Parsing and Generation. Ph.D. thesis, Universität des Saarlandes, Saabrücken.

[21]

Christer Samuelsson. 1994. Fast Natural-Language Parsing Using Explanation-Based Learning. Ph.D. thesis, The Royal Institute of Technology and Stockholm University, Stockholm.

[22]

Andreas P. Schöter. 1993. Compiling feature structures into terms: A case study in Prolog. Technical Report RP-55, University of Edinburgh, Centre for Cognitive Science.

[23]

Gert Smolka, Martin Henz, and Jörg Würtz. 1995. Object-oriented concurrent constraint programming in Oz. In P. van Hentenryck and V. Saraswat, editors, Principles and Practice of Constraint Programming, chapter 2, pages 27-48. The MIT Press.

Digital Library

Cited By

Van Trijp RSteels LBeuls KWellens P(2012)Fluid construction grammarProceedings of the Demonstrations at the 13th Conference of the European Chapter of the Association for Computational Linguistics10.5555/2380921.2380934(63-68)Online publication date: 23-Apr-2012
https://dl.acm.org/doi/10.5555/2380921.2380934
Hallett CColineau NParis CWan SDale R(2006)Generic querying of relational databases using natural language generation techniquesProceedings of the Fourth International Natural Language Generation Conference10.5555/1706269.1706289(95-102)Online publication date: 15-Jul-2006
https://dl.acm.org/doi/10.5555/1706269.1706289
Sato YPado SRead JSeretan V(2006)Lexicalising word order constraints for implemented linearisation grammarProceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop10.5555/1609039.1609042(23-30)Online publication date: 6-Apr-2006
https://dl.acm.org/doi/10.5555/1609039.1609042
Show More Cited By

ProFIT: prolog with features, inheritance and templates
1. Software and its engineering
  1. Software notations and tools
    1. General programming languages
2. Theory of computation
  1. Logic

Recommendations

Compiler verification for fun and profit
FMCAD '14: Proceedings of the 14th Conference on Formal Methods in Computer-Aided Design

Formal verification of software or hardware systems --- be it by model checking, deductive verification, abstract interpretation, type checking, or any other kind of static analysis --- is generally conducted over high-level programming or description ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Utility for communicability by profit and cost of agreement
EELC'06: Proceedings of the Third international conference on Emergence and Evolution of Linguistic Communication: symbol Grounding and Beyond

The inflection of words based on agreement, such as number, gender and case, is considered to contribute to clarify the dependency between words in a sentence. Our purpose in this study is to investigate the efficiency of word inflections with HPSG (...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image DL Hosted proceedings

EACL '95: Proceedings of the seventh conference on European chapter of the Association for Computational Linguistics

March 1995

322 pages

Conference Chairs:
Steven P. Abney,
Erhard W. Hinrichs

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 27 March 1995

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 100 of 360 submissions, 28%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

13
Total Citations
View Citations
219
Total Downloads

Downloads (Last 12 months)18
Downloads (Last 6 weeks)5

Reflects downloads up to 02 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Van Trijp RSteels LBeuls KWellens P(2012)Fluid construction grammarProceedings of the Demonstrations at the 13th Conference of the European Chapter of the Association for Computational Linguistics10.5555/2380921.2380934(63-68)Online publication date: 23-Apr-2012
https://dl.acm.org/doi/10.5555/2380921.2380934
Hallett CColineau NParis CWan SDale R(2006)Generic querying of relational databases using natural language generation techniquesProceedings of the Fourth International Natural Language Generation Conference10.5555/1706269.1706289(95-102)Online publication date: 15-Jul-2006
https://dl.acm.org/doi/10.5555/1706269.1706289
Sato YPado SRead JSeretan V(2006)Lexicalising word order constraints for implemented linearisation grammarProceedings of the Eleventh Conference of the European Chapter of the Association for Computational Linguistics: Student Research Workshop10.5555/1609039.1609042(23-30)Online publication date: 6-Apr-2006
https://dl.acm.org/doi/10.5555/1609039.1609042
Schiehlen MIsabelle P(2002)Ellipsis resolution with underspecified scopeProceedings of the 40th Annual Meeting on Association for Computational Linguistics10.3115/1073083.1073097(72-79)Online publication date: 6-Jul-2002
https://dl.acm.org/doi/10.3115/1073083.1073097
Ebert CLappin SGregory HNicolov N(2001)Generating full paraphrases of fragments in a dialogue interpretation systemProceedings of the Second SIGdial Workshop on Discourse and Dialogue - Volume 1610.3115/1118078.1118086(1-10)Online publication date: 1-Sep-2001
https://dl.acm.org/doi/10.3115/1118078.1118086
Branco AKay M(2000)Binding constraints as instructions of binding machinesProceedings of the 18th conference on Computational linguistics - Volume 110.3115/990820.990836(104-110)Online publication date: 31-Jul-2000
https://dl.acm.org/doi/10.3115/990820.990836
Power RThompson HLascarides A(1999)Generating referring expressions with a unification grammarProceedings of the ninth conference on European chapter of the Association for Computational Linguistics10.3115/977035.977038(9-14)Online publication date: 8-Jun-1999
https://dl.acm.org/doi/10.3115/977035.977038
Wilcock GMatsumoto YBoitet CWhitelock P(1998)Head-driven generation with HPSGProceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 210.3115/980691.980796(1393-1397)Online publication date: 10-Aug-1998
https://dl.acm.org/doi/10.3115/980691.980796
Nakano MShimazu ABoitet CWhitelock P(1998)Translating a unification grammar with disjunctions into logical constraintsProceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 210.3115/980691.980723(934-938)Online publication date: 10-Aug-1998
https://dl.acm.org/doi/10.3115/980691.980723
Takaki MMinoru YKentaro TJun'ichi TBoitet CWhitelock P(1998)LiLFeSProceedings of the 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics - Volume 210.3115/980691.980702(807-811)Online publication date: 10-Aug-1998
https://dl.acm.org/doi/10.3115/980691.980702
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

Figures

Tables

Media

View Table of Conten