Left Corner Parser for Tree Insertion Grammars

1. Alonso, M.A., Cabrero, D., de la Clergerie, E., Vilares, M.: Tabular algorithms for TAG parsing. In Proc. of EACL’99 (1999) 150–157

   Google Scholar 

2. Diaz, V., Carrillo, V., Alonso, M.A.: A left corner parser for tree adjoining grammars. In Proc. of TAG+6 (2002) 90–95

   Google Scholar 

3. Diaz, V., Carrillo, V., Toro, M.: A review of Earley-based parser for TIG. Lecture Notes in Artificial Intelligence. Subseries of LNCS 1415 (1998) 732–738

   Google Scholar 

4. Joshi, A.K., Schabes, Y.: Tree-adjoining grammars. Handbook of Formal Languages 3 (1997) 69–123

   MathSciNet  Google Scholar 

5. Nederhof, M.: The computational complexity of the correct-prefix property for TAGs. Computational Linguistics 25(3) (1999) 345–360

   MathSciNet  Google Scholar 

6. Schabes, Y., Waters, R.C.: Tree insertion grammar: A cubic-time parsable formalism that lexicalizes context-free grammar without changing the trees produced. Computational Linguistics 21(4) (1995) 479–513

   MathSciNet  Google Scholar 

7. Schabes, Y., Waters, R.C.: Stochastic lexicalized tree-insertion grammar. Recent Advances in Parsing Technology (1996) 281–294

   Google Scholar 

8. Shieber, S.M., Schabes, Y., Pereira, F.C.N.: Principles and implementation of deductive parsing. Journal of Logic Programming 24(1–2) (1995) 3–36

   Article  MATH  MathSciNet  Google Scholar 

9. Sikkel, K.: Parsing Schemata — A Framework for Specification and Analysis of Parsing Algorithms (1997)

   Google Scholar 

10. XTAG Research Group: A Lexicalized Tree Adjoining Grammar for English. Technical Report IRCS-01-03, University of Pennsylvania,USA (2001)

    Google Scholar 

Download references