Probabilistic Grammars and Languages

Journal of Logic, Language and Information

Volumn 20, Issue 3, 2011, Pages 317-328

  Kornai, András ^a,b  

^a INSTITUTE OF EXPERIMENTAL MEDICINE   (Hungary)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Probabilistic finite automata; Probabilistic grammars; Probabilistic languages

Indexed keywords

EID: 80051951273     PISSN: 09258531     EISSN: 15729583     Source Type: Journal    
DOI: 10.1007/s10849-011-9135-z     Document Type: Article

References (35)

1. Berstel J. (1973) Sur la densité asymptotique de langages formels. In: Nivat M. (Ed.) Automata, languages, and programming. North-Holland, Amsterdam, pp 345-358.
2. Berstel J. (1979) Transductions and context-free languages. Teubner Studienbücher, Stuttgart, Germany.
3. Berstel, J (1988). Finite automata and rational languages, an introduction. In Lecture notes in computer science, (Vol. 386), Springer.
4. Brants, T (2000). Tnt-A statistical part-of-speech tagger. In Proc ANLP 2000 (pp. 224-231).
5. Brown P., Cocke J., Pietra S. D., Pietra V. J. D., Jelinek F., Lafferty J. D. et al (1990) A statistical approach to machine translation. Computational Linguistics 16: 79-85.
6. Chomsky N. (1957) Syntactic structures. Mouton, The Hague.
7. Chomsky N. (1961) Degrees of grammaticalness. Word 17: 219-239.
8. Chomsky N. (1975) The logical structure of linguistic theory. Springer, Berlin.
9. Chomsky N., Halle M. (1968) The sound pattern of English. Harper and Row, New York.
10. Chomsky N., Schützenberger M. P. (1963) The algebraic theory of context-free languages. In: Braffort P., Hirschberg D. (eds) Computer programming and formal systems. North-Holland, Amsterdam, pp 118-161.
11. De Leeuw K., Moore E. F., Shannon C. E., Shapiro N. (1956) Computability by probabilistic machines. In: Shannon C. E., McCarthy J. (eds) Automata studies. Princeton University Press, Princeton, pp 185-212.
12. Ellis, C. A. (1969). Probabilistic languages and automata. PhD thesis, University of Illinois, Urbana.
13. Hacking I. (1987) Was there a probabilistic revolution 1800-1930?. In: Krüger L., Daston L., Heidelberger M., Gigerenzer G., Morgan S. (eds) The probabilistic revolution. MIT Press, Cambridge.
14. Harris Z. (1951) Methods in structural linguistics. University of Chicago Press, Chicago.
15. Johnson, C. D. (1970). Formal aspects of phonological representation. PhD thesis, UC Berkeley.
16. Joshi A. K., Hopely P. (1999) A parser from antiquity. In: Kornai A. (Ed.) Extended finite state models of language. Cambridge University Press, Cambridge, pp 6-15.
17. Kaplan R. M., Kay M. (1994) Regular models of phonological rule systems. Computational Linguistics 20: 331-378.
18. Kleene S. C. (1956) Representation of events in nerve nets and finite automata. In: Shannon C., McCarthy J. (eds) Automata Studies. Princeton University Press, Princeton, pp 3-41.
19. Kornai, A. (1996). Comments on Mohri, Pereira and Riley. In A. Kornai (Ed.), Proceedings of the W1 workshop of the 12th European conference on artificial intelligence (pp. 26-27), Budapest. John von Neumann Society for Computer Science.
20. Kornai, A. (Ed.) (1999) Extended finite state models of language. Cambridge University Press, Cambridge.
21. Kornai A. (2008) Mathematical linguistics. Springer, Berlin.
22. Levelt W. J. M. (1974) Formal grammars in linguistics and psycholinguistics, volume 1-3. Mouton, The Hague.
23. Mealy G. H. (1955) A method for synthesizing sequential circuits. Bell System Technical Journal 34: 1045-1079.
24. Miller G. A., Chomsky N. (1963) Finitary models of language users. In: Luce R. D., Bush R. R., Galanter E. (eds) Handbook of mathematical psychology. Wiley, London, pp 419-491.
25. Mohri, M. (1994). Minimisation of sequential transducers. In Lecture notes in computer science, proceedings of the conference on computational pattern matching 1994, Springer.
26. Mohri M., Pereira F. C. N., Riley M. (1996) Weighted automata in text and speech processing. In: Kornai A. (Ed.) Proceedings of the ECAI-96 workshop on extended finite state models of language. Budapest, John von Neumann Computer Society, pp 46-50.
27. Pereira F. (2000) Formal grammar and information theory: Together again?. Philosophical Transactions of the Royal Society 358(1769): 1239-1253.
28. Pullum G. K., Scholz B. C. (2002) Empirical assessment of stimulus poverty arguments. The Linguistic Review 19: 9-50.
29. Rabin M. O. (1963) Probabilistic automata. Information and Control 6: 230-245.
30. Reutenauer C., Schutznberger M. P. (1991) Minimization of Rational Word Functions. SIAM Journal on Computing 20(4): 669-685.
31. Schützenberger M. P. (1976) Sur les relations rationnelles entre monoides libres. Theoretical Computer Science 3: 243-259.
32. Spencer, H. (1986). regexp(3). Posted on mod. sources 3(89).
33. Suppes P. (1970) Probabilistic grammars for natural languages. Synthese 22: 95-116.
34. Thompson K. (1968) Regular expression search algorithm. Communications of the ACM 11(6): 419-422.
35. Woods, W. A., Bates, M., Brown, G., Bruce, B., Cook, C., Klovstad, J., et al. (1976). Speech understanding systems: final technical progress report.