pet- a platform for experimentation with efficient hpsgprocessing techniques

Natural Language Engineering

Volumn 6, Issue 1, 2000, Pages 99-107

  Callmeier, Ulrich ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85011176708     PISSN: 13513249     EISSN: 14698110     Source Type: Journal    
DOI: 10.1017/S1351324900002369     Document Type: Article

References (15)

1. Ait-Kaci, H. (1991) Warren's Abstract Machine: A tutorial reconstruction. MIT Press.
2. Ait-Kaci, H., Boyer, R., Lincoln, P. and Nasr, R. (1989) Efficient implementation of lattice operations. ACM Trans. Programming Languages and Systems, 11(1) :115-146.
3. Carpenter, B. and Qu, Y. (1995) An abstract machine for attribute-value logics. Proceedings of the 4th International Workshop on Parsing Technologies. Prague, Czech Republik.
4. Carroll, J. (1994) Relating complexity to practical performance in parsing with wide-coverage unification grammars. Proc. 32nd Meeting of the Association for Computational Linguistics, pp. 287–294. Las Cruces, NM.
5. Ciortuz, L. (2000) Compiling HPSG into C. DFKI Research Report, Saarbrucken, Germany.
6. Gerdemann, D. (1995) Term encoding of typed feature structures. Proc. 4th Int. Workshop on Parsing Technologies, pp. 89–97. Prague, Czech Republik.
7. Gotz, T. (1993) A normal form for typed feature structures. Magisterarbeit, Universitat Tubingen, Tubingen, Germany.
8. 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.
9. Krieger, H.-U. and Schafer, U. (1994) 5ar - A type description language for constraint-based grammars. Proc. 15th Int. Conf. on Computational Linguistics, pp. 893–899. Kyoto, Japan.
10. Krieger, H.-U. and Schafer, U. (1995) Efficient parameterizable type expansion for typed feature formalisms. Proc. 14th Int. Joint Conf. on Artificial Intelligence, pp. 1428–1434. San Francisco, CA.
11. Oepen, S. and Carroll, J. (2000) Ambiguity packing in constraint-based parsing. Practical results. Proc. 1st Conf. of the North American Chapter of the ACL. Seattle, WA.
12. 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.
13. Tomabechi, H. (1991) Quasi-destructive graph unification. Proc. 29th Meeting of the Association for Computational Linguistics, pp. 315–322. Berkeley, CA.
14. Wintner, S. (1997) An abstract machine for unification grammars with applications to an HPSG grammar for Hebrew. PhD, Technion, Israel Institute of Technology, Haifa, Israel.
15. Wroblewski, D. A. (1987) Non-destructive graph unification. Proc. 6th Nat. Conf. on Artificial Intelligence, pp. 582–587. Seattle, WA.