Abstract
Formal grammars, first developed as specifications of linguistic theories and programming languages, have found a rich variety of applications in computer science, especially in natural language processing and, more recently, biological sequence analysis. Grammars can be expressed in a variety of competing grammar formalisms, and the question naturally arises: What makes one grammar formalism better than another?
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
Corresponding author
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Chiang, D. (2012). Introduction. In: Grammars for Language and Genes. Theory and Applications of Natural Language Processing. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20444-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-20444-9_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-20443-2
Online ISBN: 978-3-642-20444-9
eBook Packages: Computer ScienceComputer Science (R0)