Efficient Parsing Using Filtered-Popping Recursive Transition Networks

  • Javier M. Sastre-Martínez
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5642)

Abstract

We present here filtered-popping recursive transition networks (FPRTNs), a special breed of RTNs, and an efficient parsing algorithm based on recursive transition network with string output (RTNSO) which constructs the set of parses of a potentially ambiguous sentence as a FPRTN in polynomial time. By constructing a FPRTN rather than a parse enumeration, we avoid the exponential explosion due to cases where the number of parses increases exponentially w.r.t. the input length. The algorithm is compatible with the grammars that can be manually developed with the Intex and Unitex systems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Woods, W.A.: Transition network grammars for natural language analysis. Commun. ACM 13(10), 591–606 (1970)CrossRefMATHGoogle Scholar
  2. 2.
    Sastre, J.M., Forcada, M.L.: Efficient parsing using recursive transition networks with string output. LNCS (LNAI), vol. 5603. Springer, Heidelberg (in press)Google Scholar
  3. 3.
    Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94–102 (1970)CrossRefMATHGoogle Scholar
  4. 4.
    Ratnaparkhi, A.: Statistical models for unsupervised prepositional phrase attachment. In: COLING-ACL 1998, Morristown, NJ, USA, ACL, pp. 1079–1085 (1998)Google Scholar
  5. 5.
    Silberztein, M.D.: Dictionnaires électroniques et analyse automatique de textes. Le système INTEX. Masson, Paris (1993)Google Scholar
  6. 6.
    Paumier, S.: Unitex 1.2 User Manual. Université de Marne-la-Vallée (2006)Google Scholar
  7. 7.
    Aycock, J., Horspool, N.: Practical Earley Parsing. The Computer Journal 45(6), 620–630 (2002)CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Javier M. Sastre-Martínez
    • 1
    • 2
  1. 1.Laboratoire d’Informatique de l’Institut Gaspard MongeUniversité Paris-EstMarne-la-Vallée Cedex 2France
  2. 2.Grup Transducens, Departament de Llenguatges i Sistemes InformàticsUniversitat d’AlacantAlacantSpain

Personalised recommendations