Incremental LTAG parsing

HLT/EMNLP 2005 - Human Language Technology Conference and Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference

Volumn , Issue , 2005, Pages 811-818

  Shen, Libin ^a   Joshi, Aravind K ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

NATURAL LANGUAGE PROCESSING SYSTEMS; SYNTACTICS;

F-SCORE; GENERATIVE CAPACITY; GOLD STANDARDS; PREDICATE COORDINATIONS; SYNTACTIC DEPENDENCIES;

COMPUTATIONAL LINGUISTICS;

EID: 48549104227     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1220575.1220677     Document Type: Conference Paper

References (39)

1. T. Becker, A. K. Joshi, and O. Rambow. 1991. Long distance scrambling and Tree Adjoining Grammars. In EACL 1991.
2. M. Candito. 1998. Building parallel ltag for french and italian. In ACL-COLING 1998.
3. E. Charniak. 2000. A maximum-entropy-inspired parser. In NAACL 2000.
4. C. Chelba and F. Jelinek. 2000. Structured language modeling. Computer Speech and Language, 14(4):283-332.
5. D. Chiang. 2000. Statistical Parsing with an Automatically- Extracted Tree Adjoining Grammar. In ACL 2000.
6. M. Collins and B. Roark. 2004. Incremental parsing with the perceptron algorithm. In ACL 2004.
7. M. Collins. 1999. Head-Driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
8. M. Collins. 2002. Discriminative training methods for hidden markov models: Theory and experiments with perceptron algorithms. In EMNLP 2002.
9. R. Evans and D. Weir. 1997. Automaton-based parsing for lexicalized grammars. In IWPT 1997.
10. F. Ferreira. 2000. Syntax in language production: An approach using tree-adjoining grammars. In L. Wheeldon, editor, Aspects of Language Production. MIT Press.
11. R. Frank. 2002. Phrase Structure Composition and Syntactic Dependencies. MIT Press.
12. Y. Freund and R. E. Schapire. 1999. Large margin classification using the perceptron algorithm. Machine Learning, 37(3):277-296. (Pubitemid 32210619)
13. A. Fujiyoshi and T. Kasai. 2000. Spinal-formed context-free tree grammars. Theory Computing Systems, 33(1).
14. J. Henderson. 2000. A neural network parser that handles sparse data. In IWPT 2000.
15. J. Henderson. 2003. Generative versus discriminative models for statistical left-corner parsing. In IWPT 2003.
16. A. K. Joshi and Y. Schabes. 1997. Tree-adjoining grammars. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3, pages 69 - 124. Springer.
17. A. K. Joshi and B. Srinivas. 1994. Disambiguation of super parts of speech (or supertags): Almost parsing. In COLING 1994.
18. A. Kinyon and C. Prolo. 2002. A classification of grammar development strategies. In COLING 2002 Workshop: Grammar Engineering and Evaluation.
19. J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In ICML 2001.
20. A. Lavelli and G. Satta. 1991. Bidirectional parsing of lexicalized tree adjoining grammars. In EACL 1991.
21. M. P. Marcus, B. Santorini, and M. A. Marcinkiewicz. 1994. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19(2):313-330.
22. R. Mooney. 2004. Learning semantic parsers: An important but under-studied problem. In AAAI 2004 Spring Symposium on Language Learning: An Interdisciplinary Perspective.
23. M. Palmer, D. Gildea, and P. Kingsbury. 2005. The proposition bank: An annotated corpus of semantic roles. Computational Linguistics, 31(1).
24. C. Prolo. 2003. LR Parsing for Tree Adjoining Grammars and its Application to Corpus-based Natural Language Parsing. Ph.D. thesis, University of Pennsylvania.
25. V. Punyakanok and D. Roth. 2001. The use of classifiers in sequential inference. In NIPS 2001.
26. A. Ratnaparkhi. 1997. A linear observed time statistical parser based on maximum entropy models. In EMNLP 1997.
27. S. Riezler, T. King, R. Kaplan, R. Crouch, J. Maxwell, and M. Johnson. 2002. Parsing the wall street journal using a lexical-functional grammar and discriminative estimation techniques. In ACL 2002.
28. B. Roark. 2001. Probabilistic top-down parsing and language modeling. Computational Linguistics, 27(2):249-276. (Pubitemid 33597448)
29. A. Sarkar and A. K. Joshi. 1996. Coordination in tree adjoining grammars. In COLING 1996.
30. Y. Schabes and R. C. Waters. 1995. A cubic-time, parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics, 21(4).
31. L. Shen and A. K. Joshi. 2005. Building an LTAG treebank. Technical Report MS-CIS-05-15, CIS Dept., UPenn.
32. L. Shen. 2005. Statistical Natural Language Processing with Lexicalized Tree Adjoining Grammar. Ph.D. proposal, University of Pennsylvania.
33. S. Shieber and M. Johnson. 1993. Variations on incremental interpretation. Journal of Psycholinguistic Research, 22(2):287-318.
34. B. Srinivas. 1997. Performance evaluation of supertagging for partial parsing. In IWPT 1997.
35. P. Sturt and V. Lombardo. 2005. Processing coordinated structures: Incrementality and connectedness. Cognitive Science, to appear.
36. B. Taskar, C. Guestrin, and D. Koller. 2003. Max-margin markov networks. In NIPS 2003.
37. G. van Noord. 1994. Head corner parsing for TAG. Computational Intelligence, 10(4).
38. K. Vijay-Shanker and A. K. Joshi. 1985. Some computational properties of tree adjoining grammars. In ACL 1985.
39. H. Yamada and Y. Matsumoto. 2003. Statistical dependency analysis with Support Vector Machines. In IWPT 2003.