On building a more efficient grammar by exploiting types

Natural Language Engineering

Volumn 6, Issue 1, 2000, Pages 15-28

  Flickinger, Dan ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937330388     PISSN: 13513249     EISSN: 14698110     Source Type: Journal    
DOI: 10.1017/S1351324900002370     Document Type: Article

References (34)

1. The Core Language Engine, H., Alshawi, In this paper I report on three experiments in making systematic modifications to a broad-coverage grammar of English in order to gain efficiency without loss of linguistic elegance., 1992.
2. Boguraev, B., Carroll, J., Briscoe, E. and Grover, C. (1998) Software support for practi-cal grammar development. Proc. 12th Int. Conf. on Computational Linguistics, pp. 54–58. Budapest, Hungary.
3. Kyoto, Japan. Oepen, S. and Callmeier, U. (2000) Measure for measure: Parser cross-fertilization. Towards increased component comparability and exchange. Proc. 6th Int. Workshop on Parsing Technologies, pp. 183–194. Trento, Italy.
4. Proc, T., Bub, W., Wahlster, A., Weibel, Verbmobil: The combination of deep and shallow processing for spontaneous speech translation, 71, 74, Int. Conf. on Acoustics, Speech, and Signal Processing, Miinchen Germany., 1997.
5. Butt, M., King, T. H., Nirio M.-E. and Segond, F. (1999) A Grammar Writer's Cookbook. CSLI Publications.
6. 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.
7. J. Carroll, A. Copestake, D. Flickinger, Proc. 7th European Workshop on Natural Language Generation, An efficient chart gen-erator for (semi-)lexicalist grammars, 1999, 86-95, Toulouse, France.
8. Carter, D. (1990) Efficient disjunctive unification for bottom-up parsing. Proc. 13th Int. Conf. on Computational Linguistics. Helsinki, Finland.
9. Copestake, A. (1992) The ACQUILEX LKB. Representation issues in semi-automatic ac-quisition of large lexicons. Proc. 3rd ACL Conf. on Applied Natural Language Processing, pp. 88–96. Trento, Italy.
10. Copestake, A. (1999) The (new) LKB system. CSLI, Stanford University: http://www-csli.Stanford.edu/~aac/doc5-2.pdf
11. Copestake, A., Flickinger, D., Malouf, R., Riehemann, S. and Sag, I. (1995) Translation using minimal recursion semantics. Proc. 6th Int. Conf. on Theoretical and Methodological Issues in Machine Translation. Leuven, Belgium.
12. of Eisele, A. and Doerre, J. (1988) Unification of disjunctive feature structures. Proc. 26th Meeting the Association for Computational Linguistics, pp. 286–294. Buffalo, NY.
13. Emele, M. (1997) Der TLS-Repraesentationsformalismus, Arbeitspapiere des IMS. Stuttgart, Germany: University of Stuttgart.
14. Emele, M. C. (1991) Unification with lazy non-redundant copying. Proc. 29th Meeting of the Association for Computational Linguistics, pp. 323–330). Berkeley, CA.
15. Gerdemann, D. and King, P. (1994) The correct and efficient implementation of appropri-ateness specifications for typed feature structures. Proc. 15th Int. Conf. on Computational Linguistics, pp. 956–960. Kyoto, Japan.
16. Gotz, T. (1993) A normal form for typed feature structures. Magisterarbeit, Universitat Tiibingen Germany.
17. GOtz T. and Meurers, W. D. (1995) Compiling HPSG type constraints into definite clause programs. Proc. 33rd Meeting of the Association for Computational Linguistics. Cambridge, MA.
18. Karttunen, L. (1984) Features and values. Proc. 10th International Conference on Computa-tional Linguistics. Stanford, CA.
19. Kasper, R. (1987) A unification method for disjunctive feature descriptions. Proc. 25th Meeting of the Association for Computational Linguistics, pp. 235–242.
20. Kasper, R., Kiefer, B., Netter, K. and Yijay-Shanker, K. (1995) Compilation of HPSG to TAG. Proc. 33rd Meeting of the Association for Computational Linguistics, pp. 92–99). Cambridge, MA.
21. 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.
22. Krieger, H.-U. and Schafer, U. (1994) J-g,r - A type description language for constraint-based grammars. Proc. 15th Int. Conf. on Computational Linguistics, pp. 893–899. Kyoto, Japan.
23. Maxwell III, J. T. and Kaplan, R. M. (1995) The interface between phrasal and functional constraints, In: M. Dalrymple, R. M. Kaplan, J. T. Maxwell III and A. Zaenen, editors, Lormal issues in Lexical-Lunctional Grammar, pp. 403–429. CSLI Publications., In: M. Dalrymple, R. M. Kaplan, J. T. Maxwell III and A, Lormal issues in Lexical-Lunctional Grammar, CSLI Publications.
24. Meurers, W. D. and Minnen, G. (1995) The covariation approach as a computational treatment of HPSG lexical rules. Proc. AQUILEX II Workshop on Lexical Rules. Cambridge, UK.
25. Nagata, M. (1992) An empirical study on rule granularity and unification interleaving to-ward an efficient unification-based parsing system. Proc. 14th Int. Conf. on Computational Linguistics. Nantes, France.
26. Nakano, M. (1991) Constraint projection: An efficient treatment of disjunctive feature de-scriptions. Proc. 29th Meeting of the Association for Computational Linguistics, pp. 307–314. Berkeley, CA.
27. van Noord, G. and Bouma, G. (1994) Adjuncts and the processing of lexical rules. Proc. 15th Int. Conf. on Computational Linguistics, pp. 250–256.
28. 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.
29. Oepen, S., Netter, K. and Klein, J. (1997) tsnlp - Test Suites for Natural Language Processing, Nerbonne, 13-36.
30. Pollard, C. and Sag, I. A. (1994) Head-Driven Phrase Structure Grammar. University of Chicago Press/CSLI Publications.
31. Pulman, S. (1996) Unification encodings of grammatical notations. Computational Linguistics, 22(3): 295–328.
32. Sag, I. A. (1997) English relative clause constructions. J. Linguistics 33(2): 431–484.
33. Uszkoreit, H., Backofen, R., Busemann, S., Diagne, A. K., Hinkelman, E. A., Kasper, W., Kiefer, B., Krieger, H.-U., Netter, K., Neumann, G., Oepen, S. and Spackman, S. P. (1994) DISCO - an HPSG-based NLP system and its application for appointment scheduling. Proc. 15th Int. Conf. on Computational Linguistics. Kyoto, Japan.
34. Verlinden, M. (1999) A constraint-based grammar for dialogue utterances. PhD, University of Tilburg, Tilburg, The Netherlands.