Efficient Parsing Using Filtered-Popping Recursive Transition Networks

  • Javier M. Sastre-Martínez
Conference paper

DOI: 10.1007/978-3-642-02979-0_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5642)
Cite this paper as:
Sastre-Martínez J.M. (2009) Efficient Parsing Using Filtered-Popping Recursive Transition Networks. In: Maneth S. (eds) Implementation and Application of Automata. CIAA 2009. Lecture Notes in Computer Science, vol 5642. Springer, Berlin, Heidelberg

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.

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