论文信息 - Revisiting Supertagging and Parsing: How to Use Supertags in Transition-Based Parsing

Revisiting Supertagging and Parsing: How to Use Supertags in Transition-Based Parsing

We discuss the use of supertags derived from a TAG in transition-based parsing. We show some initial experimental results which suggest that using a representation of a supertag in terms of its structural and linguistic dimensions outperforms the use of atomic supertags.

Alexis Nasr | Srinivas Bangalore | Owen Rambow | Wonchang Chung | Suhas Siddhesh Mhatre

[1] Alexis Nasr,et al. MICA: A Probabilistic Dependency Parser Based on Tree Insertion Grammars (Application Note) , 2009, HLT-NAACL.

[2] Koby Crammer,et al. Online Passive-Aggressive Algorithms , 2003, J. Mach. Learn. Res..

[3] Yuji Matsumoto,et al. Improving Dependency Parsers with Supertags , 2014, EACL.

[4] Yoav Freund,et al. Large Margin Classification Using the Perceptron Algorithm , 1998, COLT.

[5] Srinivas Bangalore,et al. Supertagging: An Approach to Almost Parsing , 1999, CL.

[6] Vijay K. Shanker,et al. Towards efficient statistical parsing using lexicalized grammatical information , 2002 .

[7] Alexis Nasr,et al. Parsing with Lexicalized Probabilistic Recursive Transition Networks , 2005, FSMNLP.

[8] Joakim Nivre,et al. Memory-Based Dependency Parsing , 2004, CoNLL.

[9] Alexandra Kinyon. Hypertags , 2000, COLING.