Skip to main content

Grammars, Inference, Parsing and Transduction

  • Chapter
  • 356 Accesses

Part of the book series: Text, Speech and Language Technology ((TLTB,volume 3))

Abstract

At the very beginning of my own work on TTS synthesis, I was looking for a short but accurate introduction to grammars, parsers, and lexicons; an introduction in which the related terminology would be comprehensively explained, with not too many details, but not being too cursory either; an introduction in which the goals and, better still, the coverage limits of grammar models and the efficiency limits of parsers could be perceived.1 I now know that this research was bound to fail, for even though grammars are often based on simple facts, their implications are particularly hard to appreciate. What is more, linguistic theories often insist on their peculiarities, rather than on their common properties. I thus grasped pieces of information throughout my research and painfully tried to form a coherent view. It was not, however, until I read the inescapable (Gazdar and Mellish, 1989), the didactic (Charniak, 1993) and (Winograd, 1983), the very complete (Sabah, 1989), the rigorous (Miclet, 1984) and the brilliant (and concise) (Gibbon, 1991), and after I had attended the comprehensive introduction to natural language processing courses of Prof. Martin Kay at the ELSNET summer school on prosody (University College of London, 1993) that I began to have deeper insights in this intricate area. The following pages are merely a concise presentation of some basic facts extracted from these references. It does not claim to be complete nor truly accurate, for it inevitably oversimplifies some aspects of grammars.

“Speak English!” said the Eaglet. “I don’t know the meaning of half those long word, and, what’s more, I don’t believe you do either!” Lewis Carroll, Alice’s Adventures in Wonderland

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • BOURLARD, H.A., and N. MORGAN, (1994), Connectionist Speech Recognition — A Hybrid Approach, Boston, Kluwer.

    Google Scholar 

  • BRESNAN, J.W., and R.M. KAPLAN, (1982), “Lexical Functional Grammar”, in The Mental Representation of Grammatical Relations, MIT press, Cambridge, MA.

    Google Scholar 

  • CHARNIAK, E., (1993), Statistical Language Learning, MIT press, Cambridge, MA.

    Google Scholar 

  • CHOMSKY, N., (1957), Syntactic Structures, Mouton, The Hague.

    Google Scholar 

  • EARLEY, J., (1970), “An Efficient Context-Free Parsing”, Communications of the ACM, n°14, pp. 453–460. Reprinted in Readings in Natural Language Processing, Barbara J. Grosz, Karen Sparck Jones, and Bonnie Lynn Webber, eds., 1986, pp. 25–33, Morgan Kaufmann, Los Altos, CA.

    Google Scholar 

  • FORNEY, G.D., (1978), “The Viterbi Algorithm”, Proc. IEEE, vol. 61, pp. 268–278.

    Article  MathSciNet  Google Scholar 

  • GAZDAR, G, and C. MELLISH, (1989), Natural Language Processing in Prolog: an Introduction to Computional Linguistics, Addison-Wesley, Reading, MA.

    Google Scholar 

  • GAZDAR, G., E. KLEIN, G.I. PULLUM, and I.A. SAG, (1985), Generalized Phrase Structure Grammar, Harvard University Press and Blackwell’s, Cambridge, MA.

    Google Scholar 

  • GIBBON, D., (1991), “Linguistic Aspects of Speech Material Complexity”, SAM stage report Se.8, UBI-SAM-1/91.

    Google Scholar 

  • HARRIS, M.D., (1985), Introduction to Natural Language Processing, Reston.

    Google Scholar 

  • HOPCROFT, J., and J. ULLMAN, (1979), Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, MA.

    MATH  Google Scholar 

  • JOHNSON, C.D., (1972), Formal Aspects of Phonological Description, Mouton, The Hague.

    Google Scholar 

  • KAY, M., and R.M. KAPLAN, (1994), “Regular Models of Phonological Rule Systems”, Computational Linguistics, 20 (3), pp. 331–378.

    Google Scholar 

  • LARI, K., and S.J. YOUNG, (1990), “The Estimation of Stochastic Context-Free Grammars Using the Inside-Outside Algorithm”, Computer Speech and Language, n°4, pp. 35–56.

    Google Scholar 

  • LIPPMAN, R.P., (1987), “An Introduction to Computing with Neural Nets”, IEEE Magazine on Acoustics, Speech, and Signal Processing, vol. 4, n°2, pp. 4–22.

    MathSciNet  Google Scholar 

  • MICLET, L., (1979), Inférence de Grammaires Régulières, Ph.D. dissertation, ENST.

    Google Scholar 

  • MICLET, L., (1984), Methodes Structurelles pour la Reconnaissance des Formes, Eyrolles, Paris.

    Google Scholar 

  • MOHRI, M., (1994), “Compact Representations by Finite State Transducers”, Proceedings of the 32 nd meeting of the Association of Computational Linguistics, Las Cruces, New Mexico.

    Google Scholar 

  • MOHRI, M., and R. SPROAT, (1996), “An Efficient Compiler for Weighted Rewrite Rules”, cmp-lg/960602617.

    Google Scholar 

  • PEREIRA, F., and M. D. RILEY, (1996), “Speech Recognition by Composition of Weighted Finite Automata”, cmp-lg/9603001

    Google Scholar 

  • PEREIRA, F., and D. ROE, (1992), “Empirical Properties of Finite-State Approximations for Phrase Structure Grammars”, Proceedings of the International Conference on Spoken Language, Alberta, pp.261–264.

    Google Scholar 

  • PEREIRA, F., and S.M. SHIEBER, (1987), Prolog and Natural-Language Analysis, CSLI Lecture Notes N°10.

    MATH  Google Scholar 

  • PEREIRA, F., and D. WARREN, (1980), “Definite Clause Grammars for Language Analysis — a Survey of the Formalism and a Comparison with Augmented Transition Networks”, Artificial Intelligence,13(3).

    Google Scholar 

  • POLLARD, C.J., and I.A. SAG, (1987, 1991), Information-Based Syntax and Semantics, Vol.1: Fundamentals, CSLI Lecture Notes N°13, Chicago University Press; Vol.2: Agreement, Binding and Control.

    Google Scholar 

  • RABINER, L.R., and B.H. JUANG, (1986), “An Introduction to Hidden Markov Models”, IEEE ASSP magazine, January, pp. 4–16.

    Google Scholar 

  • RUMELHART, D.E., G.E. HINTON, and R.J. WILLIAMS, (1986), “Learning Internal Representations by Error Propagation”, in Parallel Distributed Processing: Exploration of the Microstructures of Cognition, vol. 1, D.E. Rumelhart and R.J. McClelland, eds, MIT Press, Cambridge, MA, pp. 318–362.

    Google Scholar 

  • SABAH, G., (1898), L’Intelligence Artificielle et le Langage, tome 1 Représentation des Connaissances, tome2: Processus de Compréhension, Hermes, Paris.

    Google Scholar 

  • SHIEBER, S.M., (1986), An Introduction to Unification-Based Approaches to Grammar, Chicago University Press, Chicago.

    Google Scholar 

  • WINOGRAD, T., (1983), Language as a Cognitive Process, Vol.1, Syntax, Addison-Wesley, Reading, MA.

    Google Scholar 

  • WINSTON, P.H., (1979), Artificial Intelligence, Addison-Wesley, Reading, MA.

    MATH  Google Scholar 

  • WOODS, W.A., (1979), “Transition Networks Grammars for Natural Language Analysis”, Communication of the Association for Computer Machinery, vol. 13, n°10, October.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer Science+Business Media Dordrecht

About this chapter

Cite this chapter

Dutoit, T. (1997). Grammars, Inference, Parsing and Transduction. In: An Introduction to Text-to-Speech Synthesis. Text, Speech and Language Technology, vol 3. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-5730-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-94-011-5730-8_2

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-0369-1

  • Online ISBN: 978-94-011-5730-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics