Inducing history representations for broad coverage statistical parsing

Proceedings of the 2003 Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, HLT-NAACL 2003

Volumn , Issue , 2003, Pages

  Henderson, James ^a  

^a UNIVERSITY OF GENEVA   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

'CURRENT; F MEASURE; INDEPENDENCE ASSUMPTION; LINGUISTIC KNOWLEDGE; NEURAL NETWORK METHOD; PERFORMANCE; STATISTICAL PARSER; STATISTICAL PARSING; TREEBANKS; VOCABULARY SIZE;

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

References (19)

1. Christopher M. Bishop. 1995. Neural Networks for Pattern Recognition. Oxford University Press, Oxford, UK.
2. Rens Bod. 2001. What is the minimal set of fragments that achieves maximal parse accuracy? In Proc. 34th Meeting of Association for Computational Linguistics, pages 66–73.
3. Eugene Charniak. 1997. Statistical parsing with a context-free grammar and word statistics. In Proc. 14th National Conference on Artificial Intelligence, Providence, RI. AAAI Press/MIT Press.
4. Eugene Charniak. 2000. A maximum-entropy-inspired parser. In Proc. 1st Meeting of North American Chapter of Association for Computational Linguistics, pages 132–139, Seattle, Washington.
5. Michael Collins and Nigel Duffy. 2002. New ranking algorithms for parsing and tagging: Kernels over discrete structures and the voted perceptron. In Proc. 35th Meeting of Association for Computational Linguistics, pages 263–270.
6. Michael Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania, Philadelphia, PA.
7. Michael Collins. 2000. Discriminative reranking for natural language parsing. In Proc. 17th Int. Conf. on Machine Learning, pages 175–182, Stanford, CA.
8. F. Costa, V. Lombardo, P. Frasconi, and G. Soda. 2001. Wide coverage incremental parsing by learning attachment preferences. In Proc. of the Conf. of the Italian Association for Artificial Intelligence.
9. James Henderson. 2000. A neural network parser that handles sparse data. In Proc. 6th Int. Workshop on Parsing Technologies, pages 123–134, Trento, Italy.
10. James Henderson. 2003. Generative versus discriminative models for statistical left-corner parsing. In Proc. 8th Int. Workshop on Parsing Technologies, Nancy, France.
11. K. Hornik, M. Stinchcombe, and H. White. 1989. Multilayer feedforward networks are universal approximators. Neural Networks, 2:359–366.
12. Mark Johnson. 1998. PCFG models of linguistic tree representations. Computational Linguistics, 24(4):613–632.
13. Peter Lane and James Henderson. 2001. Incremental syntactic parsing of natural language corpora with simple synchrony networks. IEEE Transactions on Knowledge and Data Engineering, 13(2):219–231.
14. Christopher D. Manning and Bob Carpenter. 1997. Probabilistic parsing using left corner language models. In Proc. Int. Workshop on Parsing Technologies, pages 147–158.
15. Mitchell P. Marcus, Beatrice Santorini, and Mary Ann Marcinkiewicz. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313–330.
16. Adwait Ratnaparkhi. 1996. A maximum entropy model for part-of-speech tagging. In Proc. Conf. on Empirical Methods in Natural Language Processing, pages 133–142, Univ. of Pennsylvania, PA.
17. Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151–175.
18. Brian Roark and Mark Johnson. 1999. Efficient probabilistic top-down and left-corner parsing. In Proc. 37th Meeting of Association for Computational Linguistics, pages 421–428.
19. D.J. Rosenkrantz and P.M. Lewis. 1970. Deterministic left corner parsing. In Proc. 11th Symposium on Switching and Automata Theory, pages 139–152.