Abstract
This chapter, which may be omitted without loss of context, presents a more precise specification of the algorithm. Section 4.2 presents a formal specification of the algorithm as a recognizer (i.e. no parse forest is produced), and section 4.3 gives a formal specification of the algorithm as a parser (i.e. a parse forest is produced).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tomita, M. (1986). Formal Specification of the Algorithm. In: Efficient Parsing for Natural Language. The Springer International Series in Engineering and Computer Science, vol 8. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-1885-0_4
Download citation
DOI: https://doi.org/10.1007/978-1-4757-1885-0_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5198-4
Online ISBN: 978-1-4757-1885-0
eBook Packages: Springer Book Archive