Ambiguity packing in constraint-based parsing - Practical results

1st Meeting of the North American Chapter of the Association for Computational Linguistics, NAACL 2000 - co-located with 6th Applied Natural Language Processing Conference, ANLP 2000 - Proceedings

Volumn , Issue , 2000, Pages 162-169

  Oepen, Stephan ^a   Carroll, John ^b  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BOTTOM UP; CONSTRAINT-BASED; EMPIRICAL ASSESSMENT; HPSG GRAMMAR; LINEAR TIME; TYPED FEATURE STRUCTURES;

FORMAL LANGUAGES;

EID: 33646005909     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Alshawi, H. (Ed.). (1992). The Core Language Engine. Cambridge, MA: MIT Press.
2. Billot, S., & Lang, B. (1989). The structure of shared forests in ambiguous parsing. In Proceedings of the 27th Meeting of the Association for Computational Linguistics (pp. 143-151). Vancouver, BC.
3. Carpenter, B. (1992). The logic of typed feature structures. Cambridge, UK: Cambridge University Press.
4. Carpenter, B., & Penn, G. (1999). ALE. The Attribute Logic Engine. User's guide version 3.2. (Universität Tübingen: http://wwww.sfs.nphil.uni-tuebingen.de/~gpenn/ale.html)
5. Carroll, J. (1993). Practical unification-based parsing of natural language (Technical Report #314). Cambridge, UK: Computer Laboratory, Cambridge University. (Online at: ftp://ftp. cl.cam.ac.uk/papers/reports/TR314-jac-practical-unif-parsing.ps.gz)
6. Copestake, A. (1992). The ACQUILEX LKB. Representation issues in semi-automatic acquisition of large lexicons. In Proceedings of the 3rd ACL Conference on Applied Natural Language Processing (pp. 88-96). Trento, Italy.
7. Copestake, A. (1999). The (new) LKB system. User's guide. (CSLI, Stanford University: http://www-csli.Stanford.edu/~aac/lkb.html)
8. Earley, J. (1970). An efficient context-free parsing algorithm. Communications of the ACM, 13(2), 94-102.
9. Flickinger, D., Oepen, S., Uszkoreit, H., & Tsujii, J. (Eds.). (2000). Journal of Natural Language Engineering. Special Issue on Efficient processing with HPSG: Methods, systems, evaluation. Cambridge, UK: Cambridge University Press, (in preparation)
10. Flickinger, D. P., & Sag, I. A. (1998). Linguistic Grammars Online. A multi-purpose broadcoverage computational grammar of English. In CSLI Bulletin 1999 (pp. 64-68). Stanford, CA: CSLI Publications.
11. Kiefer, B., Krieger, H.-U., Carroll, J., & Malouf, R. (1999). A bag of useful techniques for efficient and robust parsing. In Proceedings of the 37th Meeting of the Association for Computational Linguistics (pp. 473-480). College Park, MD.
12. Lavie, A., & Rosé, C. (2000). Optimal ambiguity packing in context-free parsers with interleaved unification. In Proceedings of the 6th International Workshop on Parsing Technologies (pp. 147-158). Trento, Italy.
13. Maxwell III, J. T., & Kaplan, R. M. (1995). A method for disjunctive constraint satisfaction. In M. Dalrymple, R. M. Kaplan, J. T. Maxwell III, & A. Zaenen (Eds.), Formal issues in Lexical-Functional Grammar (pp. 381-401). Stanford, CA: CSLI Publications.
14. Miyao, Y. (1999). Packing of feature structures for efficient unification of disjunctive feature structures. In Proceedings of the 37th Meeting of the Association for Computational Linguistics (pp. 579-84). College Park, MD.
15. Moore, R. C., & Alshawi, H. (1992). Syntactic and semantic processing. In H. Alshawi (Ed.), The Core Language Engine (pp. 129-148). Cambridge, MA: MIT Press.
16. Oepen, S., & Callmeier, U. (2000). Measure for measure: Parser cross-fertilization. Towards increased component comparability and exchange. In Proceedings of the 6th International Workshop on Parsing Technologies (pp. 183-194). Trento, Italy.
17. Oepen, S., & Flickinger, D. P. (1998). Towards systematic grammar profiling. Test suite technology ten years after. Journal of Computer Speech and Language, 12 (4) (Special Issue on Evaluation), 411-436.
18. Shieber, S. M. (1985). Using restriction to extend parsing algorithms for complex feature-based formalisms. In Proceedings of the 23rd Meeting of the Association for Computational Linguistics (pp. 145-152). Chicago, IL.
19. Tomabechi, H. (1991). Quasi-destructive graph unification. In Proceedings of the 29th Meeting of the Association for Computational Linguistics (pp. 315-322). Berkeley, CA.
20. Tomita, M. (1985). An efficient context-free parsing algorithm for natural languages. In Proceedings of the 9th International Joint Conference on Artificial Intelligence (pp. 756-764). Los Angeles, CA.
21. Wahlster, W. (1997). VerbMobil - Erkennung, Analyse, Transfer, Generierung und Synthese von Spontansprache (VerbMobil Report #198). Saarbrücken, Germany: Deutsches Forschungszentrum für Künstliche Intelligenz GmbH.