{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T20:15:36Z","timestamp":1784837736038,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T00:00:00Z","timestamp":1380758400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10994-013-5416-x","type":"journal-article","created":{"date-parts":[[2013,10,2]],"date-time":"2013-10-02T22:38:08Z","timestamp":1380753488000},"page":"33-63","source":"Crossref","is-referenced-by-count":22,"title":["Spectral learning of weighted automata"],"prefix":"10.1007","volume":"96","author":[{"given":"Borja","family":"Balle","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xavier","family":"Carreras","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franco M.","family":"Luque","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariadna","family":"Quattoni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,10,3]]},"reference":[{"key":"5416_CR1","first-page":"926","volume-title":"NIPS","author":"A. Anandkumar","year":"2012","unstructured":"Anandkumar, A., Foster, D. P., Hsu, D., Kakade, S., & Liu, Y. K. (2012a). A spectral algorithm for latent Dirichlet allocation. In P. L. Bartlett, F. C. N. Pereira, C. J. C. Burges, L. Bottou, & K. Q. Weinberger (Eds.), NIPS (pp. 926\u2013934)."},{"key":"5416_CR2","doi-asserted-by":"crossref","unstructured":"Anandkumar, A., Ge, R., Hsu, D., Kakade, S. M., & Telgarsky, M. (2012b). Tensor decompositions for learning latent variable models. arXiv:1210.7559 .","DOI":"10.21236\/ADA604494"},{"key":"5416_CR3","first-page":"33.1","volume":"23","author":"A. Anandkumar","year":"2012","unstructured":"Anandkumar, A., Hsu, D., & Kakade, S. M. (2012c). A method of moments for mixture models and hidden Markov models. Journal of Machine Learning Research\u2014Proceedings Track, 23, 33.1\u201333.34.","journal-title":"Journal of Machine Learning Research\u2014Proceedings Track"},{"key":"5416_CR4","first-page":"147","volume":"20","author":"R. Bailly","year":"2011","unstructured":"Bailly, R. (2011). Quadratic weighted automata: spectral algorithm and likelihood maximization. Journal of Machine Learning Research\u2014Proceedings Track, 20, 147\u2013163.","journal-title":"Journal of Machine Learning Research\u2014Proceedings Track"},{"key":"5416_CR5","first-page":"33","volume-title":"Proceedings of the 26th international conference on machine learning","author":"R. Bailly","year":"2009","unstructured":"Bailly, R., Denis, F., & Ralaivola, L. (2009). Grammatical inference as a principal component analysis problem. In L. Bottou & M. Littman (Eds.), Proceedings of the 26th international conference on machine learning (pp. 33\u201340). Montreal: Omnipress."},{"key":"5416_CR6","first-page":"74","volume-title":"Lecture notes in computer science","author":"R. Bailly","year":"2010","unstructured":"Bailly, R., Habrard, A., & Denis, F. (2010). A spectral approach for probabilistic grammatical inference on trees. In M. Hutter, F. Stephan, V. Vovk, & T. Zeugmann (Eds.), Lecture notes in computer science (Vol.\u00a06331, pp. 74\u201388). Berlin: Springer."},{"key":"5416_CR7","first-page":"547","volume-title":"Speech communication papers for the 97th meeting of the Acoustical Society of America","author":"J. K. Baker","year":"1979","unstructured":"Baker, J. K. (1979). Trainable grammars for speech recognition. In D. H. Klatt & J. J. Wolf (Eds.), Speech communication papers for the 97th meeting of the Acoustical Society of America (pp. 547\u2013550)."},{"key":"5416_CR8","unstructured":"Balle, B. (2013). Learning finite-state machines: algorithmic and statistical aspects. PhD thesis, Universitat Polit\u00e8cnica de Catalunya."},{"key":"5416_CR9","first-page":"2168","volume-title":"Advances in neural information processing systems","author":"B. Balle","year":"2012","unstructured":"Balle, B., & Mohri, M. (2012). Spectral learning of general weighted automata via constrained matrix completion. In Advances in neural information processing systems (Vol.\u00a025, pp. 2168\u20132176)."},{"key":"5416_CR10","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/978-3-642-23780-5_20","volume-title":"ECML\/PKDD (1)","author":"B. Balle","year":"2011","unstructured":"Balle, B., Quattoni, A., & Carreras, X. (2011). A spectral learning algorithm for finite state transducers. In D. Gunopulos, T. Hofmann, D. Malerba, & M. Vazirgiannis (Eds.), Lecture notes in computer science: Vol.\u00a06911. ECML\/PKDD (1) (pp. 156\u2013171). Berlin: Springer."},{"key":"5416_CR11","first-page":"1879","volume-title":"Proceedings of the 29th international conference on machine learning (ICML-2012), ICML\u201912","author":"B. Balle","year":"2012","unstructured":"Balle, B., Quattoni, A., & Carreras, X. (2012). Local loss optimization in operator models: a new insight into spectral learning. In J. Langford & J. Pineau (Eds.), Proceedings of the 29th international conference on machine learning (ICML-2012), ICML\u201912 (pp. 1879\u20131886). New York: Omnipress."},{"key":"5416_CR12","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.tcs.2012.10.009","volume":"473","author":"B. Balle","year":"2013","unstructured":"Balle, B., Castro, J., & Gavald\u00e0, R. (2013). Learning probabilistic automata: a study in state distinguishability. Theoretical Computer Science, 473, 46\u201360.","journal-title":"Theoretical Computer Science"},{"key":"5416_CR13","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/337244.337257","volume":"47","author":"A. Beimel","year":"2000","unstructured":"Beimel, A., Bergadano, F., Bshouty, N., Kushilevitz, E., & Varricchio, S. (2000). Learning functions represented as multiplicity automata. Journal of the ACM, 47, 506\u2013530.","journal-title":"Journal of the ACM"},{"key":"5416_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-73235-5","volume-title":"Rational series and their languages","author":"J. Berstel","year":"1988","unstructured":"Berstel, J., & Reutenauer, C. (1988). Rational series and their languages. Berlin: Springer."},{"issue":"7","key":"5416_CR15","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1177\/0278364911404092","volume":"30","author":"B. Boots","year":"2011","unstructured":"Boots, B., Siddiqi, S., & Gordon, G. (2011). Closing the learning planning loop with predictive state representations. The International Journal of Robotics Research, 30(7), 954\u2013966.","journal-title":"The International Journal of Robotics Research"},{"issue":"1","key":"5416_CR16","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/S0022-0000(71)80005-3","volume":"5","author":"J. W. Carlyle","year":"1971","unstructured":"Carlyle, J. W., & Paz, A. (1971). Realizations by stochastic finite automata. Journal of Computer and System Sciences, 5(1), 26\u201340.","journal-title":"Journal of Computer and System Sciences"},{"key":"5416_CR17","first-page":"163","volume-title":"Proceedings of the 9th international colloquium on grammatical inference (ICGI)","author":"J. Castro","year":"2008","unstructured":"Castro, J., & Gavald\u00e0, R. (2008). Towards feasible PAC-learning of probabilistic deterministic finite automata. In Proceedings of the 9th international colloquium on grammatical inference (ICGI) (pp. 163\u2013174)."},{"key":"5416_CR18","first-page":"473","volume":"5","author":"A. Clark","year":"2004","unstructured":"Clark, A., & Thollard, F. (2004). PAC-learnability of probabilistic deterministic finite state automata. Journal of Machine Learning Research, 5, 473\u2013497.","journal-title":"Journal of Machine Learning Research"},{"key":"5416_CR19","first-page":"103","volume-title":"Proceedings of the 42nd meeting of the association for computational linguistics (ACL\u201904), main volume","author":"S. Clark","year":"2004","unstructured":"Clark, S., & Curran, J. R. (2004). Parsing the WSJ using CCG and log-linear models. In Proceedings of the 42nd meeting of the association for computational linguistics (ACL\u201904), main volume, Barcelona, Spain (pp. 103\u2013110)."},{"key":"5416_CR20","first-page":"223","volume-title":"Proceedings of the 50th annual meeting of the association for computational linguistics (Volume 1: Long papers)","author":"S. B. Cohen","year":"2012","unstructured":"Cohen, S. B., Stratos, K., Collins, M., Foster, D. P., & Ungar, L. (2012). Spectral learning of latent-variable PCFGS. In Proceedings of the 50th annual meeting of the association for computational linguistics (Volume 1: Long papers) (pp. 223\u2013231). Jeju Island: Association for Computational Linguistics."},{"key":"5416_CR21","first-page":"148","volume-title":"Proceedings of the 2013 conference of the North American chapter of the Association for Computational Linguistics: human language technologies","author":"S. B. Cohen","year":"2013","unstructured":"Cohen, S. B., Stratos, K., Collins, M., Foster, D. P., & Ungar, L. (2013). Experiments with spectral learning of latent-variable pcfgs. In Proceedings of the 2013 conference of the North American chapter of the Association for Computational Linguistics: human language technologies (pp. 148\u2013157). Atlanta: Association for Computational Linguistics."},{"issue":"1","key":"5416_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"A. P. Dempster","year":"1977","unstructured":"Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39(1), 1\u201338.","journal-title":"Journal of the Royal Statistical Society"},{"issue":"1\u20132","key":"5416_CR23","first-page":"41","volume":"86","author":"F. Denis","year":"2008","unstructured":"Denis, F., & Esposito, Y. (2008). On rational stochastic languages. Fundamenta Informaticae, 86(1\u20132), 41\u201377.","journal-title":"Fundamenta Informaticae"},{"key":"5416_CR24","first-page":"205","volume-title":"Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning","author":"P. Dhillon","year":"2012","unstructured":"Dhillon, P., Rodu, J., Collins, M., Foster, D., & Ungar, L. (2012). Spectral dependency parsing with latent variables. In Proceedings of the 2012 joint conference on empirical methods in natural language processing and computational natural language learning (pp. 205\u2013213). Jeju Island: Association for Computational Linguistics."},{"key":"5416_CR25","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/978-94-015-9470-7_3","volume-title":"Advances in probabilistic and other parsing technologies","author":"J. Eisner","year":"2000","unstructured":"Eisner, J. (2000). Bilexical grammars and their cubic-time parsing algorithms. In H. Bunt & A. Nijholt (Eds.), Advances in probabilistic and other parsing technologies (pp. 29\u201362). Norwell: Kluwer Academic."},{"key":"5416_CR26","first-page":"457","volume-title":"Proceedings of the 37th annual meeting of the Association for Computational Linguistics (ACL), University of Maryland","author":"J. Eisner","year":"1999","unstructured":"Eisner, J., & Satta, G. (1999). Efficient parsing for bilexical context-free grammars and head-automaton grammars. In Proceedings of the 37th annual meeting of the Association for Computational Linguistics (ACL), University of Maryland (pp. 457\u2013464)."},{"key":"5416_CR27","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/978-90-481-9352-3_8","volume-title":"Trends in parsing technology: dependency parsing, domain adaptation, and deep parsing","author":"J. Eisner","year":"2010","unstructured":"Eisner, J., & Smith, N. A. (2010). Favor short dependencies: parsing with soft and hard constraints on dependency length. In H. Bunt, P. Merlo, & J. Nivre (Eds.), Trends in parsing technology: dependency parsing, domain adaptation, and deep parsing (Vol.\u00a08, pp. 121\u2013150). Berlin: Springer."},{"key":"5416_CR28","first-page":"197","volume":"53","author":"M. Fliess","year":"1974","unstructured":"Fliess, M. (1974). Matrices de Hankel. Journal de Math\u00e9matiques Pures et Appliqu\u00e9es, 53, 197\u2013222.","journal-title":"Journal de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"5416_CR29","doi-asserted-by":"crossref","first-page":"177","DOI":"10.3115\/981863.981887","volume-title":"Proceedings of the 34th annual meeting of the Association for Computational Linguistics","author":"J. Goodman","year":"1996","unstructured":"Goodman, J. (1996). Parsing algorithms and metrics. In Proceedings of the 34th annual meeting of the Association for Computational Linguistics (pp. 177\u2013183). Santa Cruz: Association for Computational Linguistics."},{"key":"5416_CR30","volume-title":"Proceedings of the annual conference on computational learning theory (COLT)","author":"D. Hsu","year":"2009","unstructured":"Hsu, D., Kakade, S. M., & Zhang, T. (2009). A spectral algorithm for learning hidden Markov models. In Proceedings of the annual conference on computational learning theory (COLT)."},{"key":"5416_CR31","series-title":"Advances in neural information processing systems (NIPS)","volume-title":"Identifiability and unmixing of latent parse trees","author":"D. Hsu","year":"2012","unstructured":"Hsu, D., Kakade, S. M., & Liang, P. (2012). Identifiability and unmixing of latent parse trees. Advances in neural information processing systems (NIPS)."},{"key":"5416_CR32","series-title":"STOC \u201994","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1145\/195058.195155","volume-title":"Proceedings of the twenty-sixth annual ACM symposium on theory of computing","author":"M. Kearns","year":"1994","unstructured":"Kearns, M., Mansour, Y., Ron, D., Rubinfeld, R., Schapire, R. E., & Sellie, L. (1994). On the learnability of discrete distributions. STOC \u201994. In Proceedings of the twenty-sixth annual ACM symposium on theory of computing (pp. 273\u2013282). New York: ACM."},{"key":"5416_CR33","first-page":"409","volume-title":"Proceedings of the 13th conference of the European chapter of the Association for Computational Linguistics","author":"F. M. Luque","year":"2012","unstructured":"Luque, F. M., Quattoni, A., Balle, B., & Carreras, X. (2012). Spectral learning for non-deterministic dependency parsing. In Proceedings of the 13th conference of the European chapter of the Association for Computational Linguistics (pp. 409\u2013419). Avignon: Association for Computational Linguistics."},{"key":"5416_CR34","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"C. D. Manning","year":"2008","unstructured":"Manning, C. D., Raghavan, P., & Sch\u00fctze, H. (2008). Introduction to information retrieval (1st ed.). Cambridge: Cambridge University Press.","edition":"1"},{"key":"5416_CR35","first-page":"313","volume":"19","author":"M. P. Marcus","year":"1993","unstructured":"Marcus, M. P., Santorini, B., & Marcinkiewicz, M. A. (1993). Building a large annotated corpus of English: the Penn Treebank. Computational Linguistics, 19, 313\u2013330.","journal-title":"Computational Linguistics"},{"key":"5416_CR36","first-page":"81","volume-title":"Proceedings of the 11th conference of the European chapter of the Association for Computational Linguistics","author":"R. McDonald","year":"2006","unstructured":"McDonald, R., & Pereira, F. (2006). Online learning of approximate dependency parsing algorithms. In Proceedings of the 11th conference of the European chapter of the Association for Computational Linguistics (pp. 81\u201388)."},{"key":"5416_CR37","doi-asserted-by":"crossref","first-page":"523","DOI":"10.3115\/1220575.1220641","volume-title":"Proceedings of human language technology conference and conference on empirical methods in natural language processing","author":"R. McDonald","year":"2005","unstructured":"McDonald, R., Pereira, F., Ribarov, K., & Hajic, J. (2005). Non-projective dependency parsing using spanning tree algorithms. In Proceedings of human language technology conference and conference on empirical methods in natural language processing (pp. 523\u2013530). Vancouver: Association for Computational Linguistics."},{"key":"5416_CR38","series-title":"Monographs in theoretical computer science. An EATCS series","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-642-01492-5_6","volume-title":"Handbook of weighted automata","author":"M. Mohri","year":"2009","unstructured":"Mohri, M. (2009). Weighted automata algorithms. In M. Droste, W. Kuich, & H. Vogler (Eds.), Monographs in theoretical computer science. An EATCS series. Handbook of weighted automata (pp. 213\u2013254). Berlin: Springer."},{"key":"5416_CR39","first-page":"366","volume-title":"Proceedings of the 37th annual ACM symposium on theory of computing (STOC)","author":"E. Mossel","year":"2005","unstructured":"Mossel, E., & Roch, S. (2005). Learning nonsingular phylogenies and hidden Markov models. In Proceedings of the 37th annual ACM symposium on theory of computing (STOC) (pp. 366\u2013375)."},{"issue":"1","key":"5416_CR40","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.tcs.2007.07.023","volume":"387","author":"N. Palmer","year":"2007","unstructured":"Palmer, N., & Goldberg, P. W. (2007). PAC-learnability of probabilistic deterministic finite state automata in terms of variation distance. Theoretical Computer Science, 387(1), 18\u201331.","journal-title":"Theoretical Computer Science"},{"key":"5416_CR41","first-page":"1065","volume-title":"Proceedings of the 28th international conference on machine learning, ICML 2011 (ICML)","author":"A. Parikh","year":"2011","unstructured":"Parikh, A., Song, L., & Xing, E. (2011). A spectral algorithm for latent tree graphical models. In Proceedings of the 28th international conference on machine learning, ICML 2011 (ICML) (pp. 1065\u20131072)."},{"key":"5416_CR42","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1613\/jair.1236","volume":"21","author":"J. D. Park","year":"2004","unstructured":"Park, J. D., & Darwiche, A. (2004). Complexity results and approximation strategies for map explanations. Journal of Artificial Intelligence Research, 21, 101\u2013133.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5416_CR43","series-title":"Proceedings of the main conference, Association for Computational Linguistics","first-page":"404","volume-title":"Human language technologies 2007: the conference of the North American chapter of the Association for Computational Linguistics","author":"S. Petrov","year":"2007","unstructured":"Petrov, S., & Klein, D. (2007). Improved inference for unlexicalized parsing. Proceedings of the main conference, Association for Computational Linguistics. In Human language technologies 2007: the conference of the North American chapter of the Association for Computational Linguistics (pp. 404\u2013411). Rochester: Association for Computational Linguistics."},{"key":"5416_CR44","volume-title":"Proceedings of LREC","author":"S. Petrov","year":"2012","unstructured":"Petrov, S., Das, D., & McDonald, R. (2012). A universal part-of-speech tagset. In Proceedings of LREC."},{"issue":"2","key":"5416_CR45","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1006\/jcss.1997.1555","volume":"56","author":"D. Ron","year":"1998","unstructured":"Ron, D., Singer, Y., & Tishby, N. (1998). On the learnability and usage of acyclic probabilistic finite automata. Journal of Computing Systems Science, 56(2), 133\u2013152.","journal-title":"Journal of Computing Systems Science"},{"key":"5416_CR46","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-theoretic aspects of formal power series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa, A., & Soittola, M. (1978). Automata-theoretic aspects of formal power series. New York: Springer."},{"key":"5416_CR47","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"M. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M. (1961). On the definition of a family of automata. Information and Control, 4, 245\u2013270.","journal-title":"Information and Control"},{"key":"5416_CR48","first-page":"741","volume-title":"Proceedings of the thirteenth international conference on artificial intelligence and statistics (AISTATS)","author":"S. M. Siddiqi","year":"2010","unstructured":"Siddiqi, S. M., Boots, B., & Gordon, G. J. (2010). Reduced-rank hidden Markov models. In Proceedings of the thirteenth international conference on artificial intelligence and statistics (AISTATS) (pp. 741\u2013748)."},{"key":"5416_CR49","first-page":"991","volume-title":"Proceedings of the 27th international conference on machine learning (ICML-10)","author":"L. Song","year":"2010","unstructured":"Song, L., Siddiqi, S. M., Gordon, G., & Smola, A. (2010). Hilbert space embeddings of hidden Markov models. In J. F\u00fcrnkranz & T. Joachims (Eds.), Proceedings of the 27th international conference on machine learning (ICML-10) (pp. 991\u2013998). Haifa: Omnipress."},{"key":"5416_CR50","doi-asserted-by":"crossref","first-page":"560","DOI":"10.3115\/1610075.1610153","volume-title":"Proceedings of the 2006 conference on empirical methods in natural language processing","author":"I. Titov","year":"2006","unstructured":"Titov, I., & Henderson, J. (2006). Loss minimization in parse reranking. In Proceedings of the 2006 conference on empirical methods in natural language processing (pp. 560\u2013567). Sydney: Association for Computational Linguistics."},{"issue":"11","key":"5416_CR51","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L. G. Valiant","year":"1984","unstructured":"Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM, 27(11), 1134\u20131142.","journal-title":"Communications of the ACM"},{"key":"5416_CR52","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1145\/1102351.1102473","volume-title":"Proceedings of the 22nd international conference on machine learning","author":"E. Wiewiora","year":"2005","unstructured":"Wiewiora, E. (2005). Learning predictive representations from a history. In Proceedings of the 22nd international conference on machine learning (pp. 964\u2013971). New York: ACM."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5416-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5416-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5416-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,18]],"date-time":"2024-05-18T11:18:07Z","timestamp":1716031087000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5416-x"}},"subtitle":["A forward-backward perspective"],"short-title":[],"issued":{"date-parts":[[2013,10,3]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["5416"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5416-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,3]]}}}