Abstract
Graph theory is one of the central foundations for this work. All relevant data structures and mechanisms can be traced back to operations over graphs. Therefore, this chapter will present some concepts from graph theory, which are important for the definition and discussion of algorithms for speech processing. We begin with general definitions used throughout this monograph and finish with incremental graph search algorithms.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1999). Graph Theory and Natural Language Processing. In: Incremental Speech Translation. Lecture Notes in Computer Science(), vol 1735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46761-0_2
Download citation
DOI: https://doi.org/10.1007/3-540-46761-0_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66753-7
Online ISBN: 978-3-540-46761-8
eBook Packages: Springer Book Archive