Efficiency in unification-based N-best parsing

IWPT 2007 - Proceedings of the 10th International Conference on Parsing Technologies

Volumn , Issue , 2007, Pages 48-59

  Zhang, Yi ^a   Oepen, Stephan ^b   Carroll, John ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b UNIVERSITY OF OSLO   (Norway)

^c UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY;

LINEAR RELATIONSHIPS; MAXIMUM-ENTROPY; NON-LOCAL FEATURES; NONLOCALITIES; PARSE FOREST; PROCESSING TIME; SELECTION MODEL;

FEATURE EXTRACTION;

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

References (28)

1. Abney, S. P. (1997). Stochastic attribute-value grammars. Computational Linguistics, 23, 597 – 618.
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. Callmeier, U. (2002). Preprocessing and encoding techniques in PET. In S. Oepen, D. Flickinger, J. Tsujii, & H. Uszkoreit (Eds.), Collaborative language engineering. A case study in efficient grammar-based processing. Stanford, CA: CSLI Publications.
4. Caraballo, S. A., & Charniak, E. (1998). New figures of merit for best-first probabilistic chart parsing. Computational Linguistics, 24(2), 275 – 298.
5. Carroll, J., & Oepen, S. (2005). High-efficiency realization for a wide-coverage unification grammar. In R. Dale & K. F. Wong (Eds.), Proceedings of the 2nd International Joint Conference on Natural Language Processing (Vol. 3651, pp. 165 – 176). Jeju, Korea: Springer.
6. Clark, S., & Curran, J. R. (2004). Parsing the WSJ using CCG and log-linear models. In Proceedings of the 42nd Meeting of the Association for Computational Linguistics (pp. 104 – 111). Barcelona, Spain.
7. Copestake, A. (2002). Implementing typed feature structure grammars. Stanford, CA: CSLI Publications.
8. Crysmann, B. (2005). Relative clause extraposition in German. An efficient and portable implementation. Research on Language and Computation, 3(1), 61 – 82.
9. Erbach, G. (1991). A flexible parser for a linguistic development environment. In O. Herzog & C.-R. Rollinger (Eds.), Text understanding in LILOG (pp. 74 – 87). Berlin, Germany: Springer.
10. Flickinger, D. (2000). On building a more efficient grammar by exploiting types. Natural Language Engineering, 6 (1), 15 – 28.
11. Geman, S., & Johnson, M. (2002). Dynamic programming for parsing and estimation of stochastic unification-based grammars. In Proceedings of the 40th Meeting of the Association for Computational Linguistics. Philadelphia, PA.
12. Huang, L., & Chiang, D. (2005). Better k-best parsing. In Proceedings of the 9th International Workshop on Parsing Technologies (pp. 53 – 64). Vancouver, Canada.
13. Jiménez, V. M., & Marzal, A. (2000). Computation of the n best parse trees for weighted and stochastic context-free grammars. In Proceedings of the Joint International Workshops on Advances in Pattern Recognition (pp. 183 – 192). London, UK: Springer-Verlag.
14. Johnson, M., Geman, S., Canon, S., Chi, Z., & Riezler, S. (1999). Estimators for stochastic ‘unification-based’ grammars. In Proceedings of the 37th Meeting of the Association for Computational Linguistics (pp. 535 – 541). College Park, MD.
15. Kasami, T. (1965). An efficient recognition and syntax algorithm for context-free languages (Technical Report # 65-758). Bedford, MA: Air Force Cambrige Research Laboratory.
16. Klein, D., & Manning, C. D. (2003). A* parsing. Fast exact Viterbi parse selection. In Proceedings of the 4th Conference of the North American Chapter of the ACL. Edmonton, Canada.
17. Lang, B. (1994). Recognition can be harder than parsing. Computational Intelligence, 10(4), 486 – 494.
18. Langkilde, I. (2000). Forest-based statistical sentence generation. In Proceedings of the 1st Conference of the North American Chapter of the ACL. Seattle, WA.
19. Malouf, R. (2002). A comparison of algorithms for maximum entropy parameter estimation. In Proceedings of the 6th Conference on Natural Language Learning. Taipei, Taiwan.
20. Malouf, R., & van Noord, G. (2004). Wide coverage parsing with stochastic attribute value grammars. In Proceedings of the IJCNLP workshop Beyond Shallow Analysis. Hainan, China.
21. Miyao, Y., Ninomiya, T., & Tsujii, J. (2005). Corpus-oriented grammar development for acquiring a Head-Driven Phrase Structure Grammar from the Penn Treebank. In K.-Y. Su, J. Tsujii, J.-H. Lee, & O. Y. Kwong (Eds.), Natural language processing (Vol. 3248, pp. 684 – 693). Hainan Island, China.
22. Miyao, Y., & Tsujii, J. (2002). Maximum entropy estimation for feature forests. In Proceedings of the Human Language Technology Conference. San Diego, CA.
23. 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.
24. Müller, S., & Kasper, W. (2000). HPSG analysis of German. In W. Wahlster (Ed.), Verbmobil. Foundations of speech-to-speech translation (Artificial Intelligence ed., pp. 238 – 253). Berlin, Germany: Springer.
25. Oepen, S., & Carroll, J. (2002). Efficient parsing for unification-based grammars. In S. Oepen, D. Flickinger, J. Tsujii, & H. Uszkoreit (Eds.), Collaborative language engineering. A case study in efficient grammar-based processing (pp. 195 – 225). Stanford, CA: CSLI Publications.
26. Oepen, S., Flickinger, D., Toutanova, K., & Manning, C. D. (2004). LinGO Redwoods. A rich and dynamic treebank for HPSG. Journal of Research on Language and Computation, 2(4), 575 – 596.
27. Riezler, S., King, T. H., Kaplan, R. M., Crouch, R., Maxwell III, J. T., & Johnson, M. (2002). Parsing the Wall Street Journal using a Lexical-Functional Grammar and discriminative estimation techniques. In Proceedings of the 40th Meeting of the Association for Computational Linguistics. Philadelphia, PA.
28. Toutanova, K., Manning, C. D., Flickinger, D., & Oepen, S. (2005). Stochastic HPSG parse selection using the Redwoods corpus. Journal of Research on Language and Computation, 3(1), 83 – 105.