{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:47:27Z","timestamp":1725475647915},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354673"},{"type":"electronic","value":"9783540354697"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780885_9","type":"book-chapter","created":{"date-parts":[[2006,12,11]],"date-time":"2006-12-11T17:13:38Z","timestamp":1165857218000},"page":"78-85","source":"Crossref","is-referenced-by-count":1,"title":["Longest-Match Pattern Matching with Weighted Finite State Automata"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Hanneforth","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Abney, S.: Partial parsing via finite-state cascades. In: Proceedings of ESSLLI 1996, Robust Parsing Workshop (1996)","DOI":"10.1017\/S1351324997001599"},{"key":"9_CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A. Aho","year":"1974","unstructured":"Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading (1974)"},{"key":"9_CR3","volume-title":"Compilers. Principles, Techniques, and Tools","author":"A. Aho","year":"1986","unstructured":"Aho, A., Sethi, R., Ullman, J.: Compilers. Principles, Techniques, and Tools. Addison-Wesley, Reading (1986)"},{"key":"9_CR4","series-title":"CSLI Studies in Computational Linguistics","volume-title":"Finite State Morphology","author":"K.R. Beesley","year":"2003","unstructured":"Beesley, K.R., Karttunen, L.: Finite State Morphology. CSLI Studies in Computational Linguistics. CSLI Publications, Stanford (2003)"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/b95712","volume-title":"Semirings for Soft Constraint Solving and Programming","author":"S. Bistarelli","year":"2004","unstructured":"Bistarelli, S.: Semirings for Soft Constraint Solving and Programming. LNCS, vol.\u00a02962. Springer, Heidelberg (2004)"},{"key":"9_CR6","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.L., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Electrical Engineering and Computer Science Series. The MIT Press, Cambridge (2001)","edition":"2"},{"key":"9_CR7","unstructured":"Didakowski, J.: Robustes parsing und disambiguierung mit gewichteten transduktoren. Diploma thesis, University of Potsdam (2005)"},{"issue":"3","key":"9_CR8","first-page":"331","volume":"20","author":"R. Kaplan","year":"1994","unstructured":"Kaplan, R., Kay, M.: Regular models of phonological rule systems. Computational Linguistics\u00a020(3), 331\u2013378 (1994)","journal-title":"Computational Linguistics"},{"key":"9_CR9","doi-asserted-by":"crossref","unstructured":"Karttunen, L.: Directed replacement. In: Proceedings of the 34rd Annual Meeting of the ACL, Santa Cruz, CA (1996)","DOI":"10.3115\/981863.981878"},{"key":"9_CR10","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart & Winston, New York (1976)"},{"issue":"3","key":"9_CR11","first-page":"321","volume":"7","author":"M. Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. Journal of Automata, Language, and Combinatorics\u00a07(3), 321\u2013350 (2002)","journal-title":"Journal of Automata, Language, and Combinatorics"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Mohri, M., Sproat, R.: An efficient compiler for weighted rewrite rules. In: Proceedings of the 34rd Annual Meeting of the ACL, Santa Cruz, CA (1996)","DOI":"10.3115\/981863.981894"}],"container-title":["Lecture Notes in Computer Science","Finite-State Methods and Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780885_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:16:47Z","timestamp":1552360607000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780885_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354673","9783540354697"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11780885_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}