Efficient feature structure operations without compilation

Natural Language Engineering

Volumn 6, Issue 1, 2000, Pages 29-46

  Malouf, Robert ^a   Carroll, John ^b   Copestake, Ann ^c  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

^c STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937327723     PISSN: 13513249     EISSN: 14698110     Source Type: Journal    
DOI: 10.1017/S1351324900002382     Document Type: Article

References (22)

1. The Design and Analysis of Computer Algorithms, A., Aho, J., Hoperoft, J., Ullman, Reading, MA: Addison-Wesley., 1974.
2. Report of the EAGLES Workshop on Implemented Formalisms, Technical Report, R., Backofen, H.-U., Krieger, The TDL/UDiNe system, In: R. Backofen, H.-U. Krieger, S. Spackman and H. Uszkoreit, editors., Saarbriicken, Germany: Deutsches Forschungszentrum fiir Kiinstliche Intelligenz GmbH., 1993.
3. Bresnan, editor, J., Bresnan, R.M., Kaplan, Lexical-Functional Grammar: a formal system for grammatical representation, In: R. Backofen, H.-U. Krieger, S. Spackman and H. Uszkoreit, editors, Report of the EAGLES Workshop on Implemented Formalisms, Technical Report, Saarbriicken, Germany: Deutsches Forschungszentrum fiir Kiinstliche Intelligenz GmbH., In: J, The Mental Representation of Grammatical Relations. MIT Press., 1982.
4. Carpenter, B. (1992) The Logic of Typed Feature Structures. The Mental Representation of Grammatical Relations. MIT Press., Cambridge University Press.
5. Carpenter, B. and Penn, G. (1999) ALE. The Attribute Logic Engine. User's guide version 3.2. Universitat Tubingen: http://wwww.sfs.nphil.uni-tuebingen.de/~gpenn/ale.html
6. Carroll, J., Copestake, A., Flickinger, D. and Poznanski, V. (1999) An efficient chart generator for (semi-)lexicalist grammars. Proc. 7th European Workshop on Natural Language Generation, pp. 86–95. Toulouse, France.
7. Copestake, A. (1992) The ACQUILEX LKB. Representation issues in semi-automatic acquisition of large lexicons. Proc. 3rd ACL Conference on Applied Natural Language Processing, pp. 88–96. Trento, Italy.
8. Copestake, A. (1999) The (new) LKB system. CSLI, Stanford University: http://www-csli.Stanford.edu/~aac/doc5-2.pdf
9. Dorna, M. (1992) Erweiterung der Constraint-Logiksprache CUF um ein Typsystem. Diplomar-beit # 896, Institut fur Informatik, Universitat Stuttgart, Stuttgart, Germany.
10. Emele, M. C. (1991) Unification with lazy non-redundant copying. Proc. 29th Meeting of the Association for Computational Linguistics, pp. 323–330. Berkeley, CA.
11. Huet, G. (1976) Resolution d'equations dans les langages d'or der 1,2, co. These de Doctor at d'Etat, Universite Paris VII, Paris, France.
12. Kiefer, B. and Krieger, H.-U. (2000) A context-free approximation of Head-driven Phrase Structure Grammar. Proc. 6th Int. Workshop on Parsing Technologies, pp. 135–146. Trento, Italy.
13. Kiefer, B., Krieger, H.-U., Carroll, J. and Malouf, R. (1999) A bag of useful techniques for efficient and robust parsing. Proc. 37th Meeting of the Association for Computational Linguistics, pp. 473–480. College Park, MD.
14. Kogure, K. (1990) Strategic lazy incremental copy graph unification. Proceedings of the 13th International Conference on Computational Linguistics, pp. 223–228. Helsinki, Finland.
15. Lascarides, A. and Copestake, A. (1999) Default representation in constraint-based frameworks. Computational Linguistics, 25: 55–106.
16. Oepen, S. and Flickinger, D. P. (1998) Towards systematic grammar profiling: Test suite technology ten years after. J. Computer Speech & Language, 12(4): 411–436.
17. Pereira, F. C. N. (1985) A structure-sharing representation for unification-based grammar formalisms. Proc. 23rd Meeting of the Association for Computational Linguistics, pp. 137—144. Chicago, IL.
18. Pollard, C. and Sag, I. A. (1994) Head-Driven Phrase Structure Grammar. Univeristy of Chicago Press & CSLI Publications. SICS (1999) SICStus Prolog. User's manual release 3.8. Swedish Institute of Computer Science: http://www.sics.se/sicstus/
19. Sikkel, K. (1997) Parsing Schemata. Springer-Verlag.
20. Tomabechi, H. (1991) Quasi-destructive graph unification. Proc. 29th Meeting of the Association for Computational Linguistics, pp. 315–322). Berkeley, CA.
21. Tomabechi, H. (1992) Quasi-destructive graph unification with structure-sharing. Proc. 14th Int. Conf. on Computational Linguistics, pp. 440–446). Nantes, France.
22. Wroblewski, D. A. (1987) Non-destructive graph unification. Proc. 6th National Conference on Artificial Intelligence, pp. 582–587. Seattle, WA.