{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,14]],"date-time":"2023-10-14T16:22:54Z","timestamp":1697300574792},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,5,3]],"date-time":"2011-05-03T00:00:00Z","timestamp":1304380800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J of Log Lang and Inf"],"published-print":{"date-parts":[[2011,7]]},"DOI":"10.1007\/s10849-011-9135-z","type":"journal-article","created":{"date-parts":[[2011,5,2]],"date-time":"2011-05-02T13:23:26Z","timestamp":1304342606000},"page":"317-328","source":"Crossref","is-referenced-by-count":4,"title":["Probabilistic Grammars and Languages"],"prefix":"10.1007","volume":"20","author":[{"given":"Andr\u00e1s","family":"Kornai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,5,3]]},"reference":[{"key":"9135_CR1","first-page":"345","volume-title":"Automata, languages, and programming","author":"J. Berstel","year":"1973","unstructured":"Berstel J. (1973) Sur la densit\u00e9 asymptotique de langages formels. In: Nivat M. (Ed.) Automata, languages, and programming. North-Holland, Amsterdam, pp 345\u2013358"},{"key":"9135_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and context-free languages","author":"J. Berstel","year":"1979","unstructured":"Berstel J. (1979) Transductions and context-free languages. Teubner Studienb\u00fccher, Stuttgart, Germany"},{"key":"9135_CR3","unstructured":"Berstel, J (1988). Finite automata and rational languages, an introduction. In Lecture notes in computer science, (Vol. 386), Springer."},{"key":"9135_CR4","unstructured":"Brants, T (2000). Tnt\u2014A statistical part-of-speech tagger. In Proc ANLP 2000 (pp. 224\u2013231)."},{"key":"9135_CR5","first-page":"79","volume":"16","author":"P. Brown","year":"1990","unstructured":"Brown P., Cocke J., Pietra S. D., Pietra V. J. D., Jelinek F., Lafferty J. D. et\u00a0al (1990) A statistical approach to machine translation. Computational Linguistics 16: 79\u201385","journal-title":"Computational Linguistics"},{"key":"9135_CR6","doi-asserted-by":"crossref","DOI":"10.1515\/9783112316009","volume-title":"Syntactic structures","author":"N. Chomsky","year":"1957","unstructured":"Chomsky N. (1957) Syntactic structures. Mouton, The Hague"},{"key":"9135_CR7","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1080\/00437956.1961.11659755","volume":"17","author":"N. Chomsky","year":"1961","unstructured":"Chomsky N. (1961) Degrees of grammaticalness. Word 17: 219\u2013239","journal-title":"Word"},{"key":"9135_CR8","volume-title":"The logical structure of linguistic theory","author":"N. Chomsky","year":"1975","unstructured":"Chomsky N. (1975) The logical structure of linguistic theory. Springer, Berlin"},{"key":"9135_CR9","volume-title":"The sound pattern of English","author":"N. Chomsky","year":"1968","unstructured":"Chomsky N., Halle M. (1968) The sound pattern of English. Harper and Row, New York"},{"key":"9135_CR10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/S0049-237X(08)72023-8","volume-title":"Computer programming and formal systems","author":"N. Chomsky","year":"1963","unstructured":"Chomsky N., Sch\u00fctzenberger 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\u2013161"},{"key":"9135_CR11","first-page":"185","volume-title":"Automata studies","author":"K. De Leeuw","year":"1956","unstructured":"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\u2013212"},{"key":"9135_CR12","unstructured":"Ellis, C. A. (1969). Probabilistic languages and automata. PhD thesis, University of Illinois, Urbana."},{"key":"9135_CR13","volume-title":"The probabilistic revolution","author":"I. Hacking","year":"1987","unstructured":"Hacking I. (1987) Was there a probabilistic revolution 1800\u20131930?. In: Kr\u00fcger L., Daston L., Heidelberger M., Gigerenzer G., Morgan S. (eds) The probabilistic revolution. MIT Press, Cambridge"},{"key":"9135_CR14","volume-title":"Methods in structural linguistics","author":"Z. Harris","year":"1951","unstructured":"Harris Z. (1951) Methods in structural linguistics. University of Chicago Press, Chicago"},{"key":"9135_CR15","unstructured":"Johnson, C. D. (1970). Formal aspects of phonological representation. PhD thesis, UC Berkeley."},{"key":"9135_CR16","first-page":"6","volume-title":"Extended finite state models of language","author":"A. K. Joshi","year":"1999","unstructured":"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\u201315"},{"key":"9135_CR17","first-page":"331","volume":"20","author":"R. M. Kaplan","year":"1994","unstructured":"Kaplan R. M., Kay M. (1994) Regular models of phonological rule systems. Computational Linguistics 20: 331\u2013378","journal-title":"Computational Linguistics"},{"key":"9135_CR18","first-page":"3","volume-title":"Automata Studies","author":"S. C. Kleene","year":"1956","unstructured":"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\u201341"},{"key":"9135_CR19","unstructured":"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\u201327), Budapest. John von Neumann Society for Computer Science."},{"key":"9135_CR20","volume-title":"Extended finite state models of language","year":"1999","unstructured":"Kornai, A. (Ed.) (1999) Extended finite state models of language. Cambridge University Press, Cambridge"},{"key":"9135_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-986-6","volume-title":"Mathematical linguistics","author":"A. Kornai","year":"2008","unstructured":"Kornai A. (2008) Mathematical linguistics. Springer, Berlin"},{"key":"9135_CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9783110889390","volume-title":"Formal grammars in linguistics and psycholinguistics, volume 1\u20133","author":"W. J. M. Levelt","year":"1974","unstructured":"Levelt W. J. M. (1974) Formal grammars in linguistics and psycholinguistics, volume 1\u20133. Mouton, The Hague"},{"key":"9135_CR23","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1002\/j.1538-7305.1955.tb03788.x","volume":"34","author":"G. H. Mealy","year":"1955","unstructured":"Mealy G. H. (1955) A method for synthesizing sequential circuits. Bell System Technical Journal 34: 1045\u20131079","journal-title":"Bell System Technical Journal"},{"key":"9135_CR24","first-page":"419","volume-title":"Handbook of mathematical psychology","author":"G.A. Miller","year":"1963","unstructured":"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\u2013491"},{"key":"9135_CR25","unstructured":"Mohri, M. (1994). Minimisation of sequential transducers. In Lecture notes in computer science, proceedings of the conference on computational pattern matching 1994, Springer."},{"key":"9135_CR26","first-page":"46","volume-title":"Proceedings of the ECAI-96 workshop on extended finite state models of language","author":"M. Mohri","year":"1996","unstructured":"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\u201350"},{"issue":"1769","key":"9135_CR27","doi-asserted-by":"crossref","first-page":"1239","DOI":"10.1098\/rsta.2000.0583","volume":"358","author":"F. Pereira","year":"2000","unstructured":"Pereira F. (2000) Formal grammar and information theory: Together again?. \u00a0Philosophical Transactions of the Royal Society 358(1769): 1239\u20131253","journal-title":"\u00a0Philosophical Transactions of the Royal Society"},{"key":"9135_CR28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1515\/tlir.19.1-2.9","volume":"19","author":"G. K. Pullum","year":"2002","unstructured":"Pullum G. K., Scholz B. C. (2002) Empirical assessment of stimulus poverty arguments. The Linguistic Review 19: 9\u201350","journal-title":"The Linguistic Review"},{"key":"9135_CR29","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. O. Rabin","year":"1963","unstructured":"Rabin M. O. (1963) Probabilistic automata. Information and Control 6: 230\u2013245","journal-title":"Information and Control"},{"issue":"4","key":"9135_CR30","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1137\/0220042","volume":"20","author":"C. Reutenauer","year":"1991","unstructured":"Reutenauer C., Schutznberger M.P. (1991) Minimization of Rational Word Functions. SIAM Journal on Computing 20(4): 669\u2013685","journal-title":"SIAM Journal on Computing"},{"key":"9135_CR31","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","volume":"3","author":"M. P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger M. P. (1976) Sur les relations rationnelles entre monoides libres. Theoretical Computer Science 3: 243\u2013259","journal-title":"Theoretical Computer Science"},{"key":"9135_CR32","unstructured":"Spencer, H. (1986). regexp(3). Posted on mod.sources 3(89)."},{"key":"9135_CR33","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF00413600","volume":"22","author":"P. Suppes","year":"1970","unstructured":"Suppes P. (1970) Probabilistic grammars for natural languages. Synthese 22: 95\u2013116","journal-title":"Synthese"},{"issue":"6","key":"9135_CR34","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1145\/363347.363387","volume":"11","author":"K. Thompson","year":"1968","unstructured":"Thompson K. (1968) Regular expression search algorithm. Communications of the ACM 11(6): 419\u2013422","journal-title":"Communications of the ACM"},{"key":"9135_CR35","doi-asserted-by":"crossref","unstructured":"Woods, W. A., Bates, M., Brown, G., Bruce, B., Cook, C., Klovstad, J., et\u00a0al. (1976). Speech understanding systems: final technical progress report.","DOI":"10.21236\/ADA026475"}],"container-title":["Journal of Logic, Language and Information"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-011-9135-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10849-011-9135-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10849-011-9135-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,22]],"date-time":"2021-11-22T12:45:06Z","timestamp":1637585106000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10849-011-9135-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,3]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"alternative-id":["9135"],"URL":"https:\/\/doi.org\/10.1007\/s10849-011-9135-z","relation":{},"ISSN":["0925-8531","1572-9583"],"issn-type":[{"value":"0925-8531","type":"print"},{"value":"1572-9583","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,3]]}}}