{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:34:22Z","timestamp":1725489262881},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676058"},{"type":"electronic","value":"9783540451549"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45154-4_11","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T01:55:49Z","timestamp":1186883749000},"page":"118-129","source":"Crossref","is-referenced-by-count":1,"title":["Preprocessing for Unification Parsing of Spoken Language"],"prefix":"10.1007","author":[{"given":"Mark-Jan","family":"Nederhof","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,5,25]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"J.W. Amtrup and V. Weber. Time mapping with hypergraphs. In 36th Annual Meeting of the Association for Computational Linguistics and 17th International Conference on Computational Linguistics, volume 1, pages 55\u201361, Montreal, Quebec, Canada, August 1998.","DOI":"10.3115\/980845.980855"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6393(95)00028-M","volume":"17","author":"H. Aust","year":"1995","unstructured":"H. Aust, M. Oerder, F. Seide, and V. Steinbiss. The Philips automatic train timetable information system. Speech Communication, 17:249\u2013262, 1995.","journal-title":"Speech Communication"},{"key":"11_CR3","unstructured":"Y. Bar-Hillel, M. Perles, and E. Shamir. On formal properties of simple phrase structure grammars. In Y. Bar-Hillel, editor, Language and Information: Selected Essays on their Theory and Application, chapter 9, pages 116\u2013150. Addison-Wesley, 1964."},{"key":"11_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1007\/3-540-55844-6_130","volume-title":"Programming Language Implementation and Logic Programming, 4th International Symposium","author":"F. Barth\u00e9lemy","year":"1992","unstructured":"F. Barth\u00e9lemy and E. Villemonte de la Clergerie. Subsumption-oriented push-down automata. In Programming Language Implementation and Logic Programming, 4th International Symposium, volume 631 of Lecture Notes in Computer Science, pages 100\u2013114, Leuven, Belgium, August 1992. Springer-Verlag."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"S. Billot and B. Lang. The structure of shared forests in ambiguous parsing. In 27th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 143\u2013151, Vancouver, British Columbia, Canada, June 1989.","DOI":"10.3115\/981623.981641"},{"key":"11_CR6","first-page":"529","volume":"12","author":"J.A. Brzozowski","year":"1962","unstructured":"J.A. Brzozowski. Canonical regular expressions and minimal state graphs for definite events. Mathematical Theory of Automata, 12:529\u2013561, 1962.","journal-title":"Mathematical Theory of Automata"},{"key":"11_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/BFb0055077","volume-title":"Automata, Languages and Programming, 25th International Colloquium","author":"A.L. Buchsbaum","year":"1998","unstructured":"A.L. Buchsbaum, R. Giancarlo, and J.R. Westbrook. On the determinization of weighted finite automata. In Automata, Languages and Programming, 25th International Colloquium, volume 1443 of Lecture Notes in Computer Science, pages 482\u2013493, Aalborg, Denmark, 1998. Springer-Verlag."},{"key":"11_CR8","first-page":"685","volume":"II","author":"A.L. Buchsbaum","year":"1998","unstructured":"A.L. Buchsbaum, R. Giancarlo, and J.R. Westbrook. Shrinking language models by robust approximation. In ICASSP\u2019 98, volume II, pages 685\u2013688, 1998.","journal-title":"ICASSP\u2019 98"},{"key":"11_CR9","unstructured":"T.H. Cormen, C.E. Leiserson, and R.L. Rivest. Introduction to Algorithms The MIT Press, 1990."},{"issue":"6","key":"11_CR10","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T. Jiang","year":"1993","unstructured":"T. Jiang and B. Ravikumar. Minimal NFA problems are hard. SIAM Journal on Computing, 22(6):1117\u20131141, 1993.","journal-title":"SIAM Journal on Computing"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"B. Kiefer, H.-U. Krieger, J. Carroll, and R. Malouf. A bag of useful techniques for efficient and robust parsing. In 37th Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, Maryland, June 1999.","DOI":"10.3115\/1034678.1034750"},{"issue":"2","key":"11_CR12","first-page":"269","volume":"23","author":"M. Mohri","year":"1997","unstructured":"M. Mohri. Finite-state transducers in language and speech processing. Computational Linguistics, 23(2):269\u2013311, 1997.","journal-title":"Computational Linguistics"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1109\/ICASSP.1993.319301","volume":"II","author":"H. Murveit","year":"1993","unstructured":"H. Murveit et al. Large-vocabulary dictation using SRI\u2019s DECIPHERTM speech recognition system: progressive search techniques. In ICASSP-93, volume II, pages 319\u2013322, 1993.","journal-title":"ICASSP-93"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"S.M. Shieber. Using restriction to extend parsing algorithms for complex-feature-based formalisms. In 23rd Annual Meeting of the Association for Computational Linguistics, Proceedings of the Conference, pages 145\u2013152, Chicago, Illinois, USA, July 1985.","DOI":"10.3115\/981210.981228"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"G. van Noord. Treatment of \u03b5-moves in subset construction. In Proceedings of the International Workshop on Finite State Methods in Natural Language Processing, pages 57\u201368, Ankara, Turkey, June\u2013July 1998.","DOI":"10.3115\/1611533.1611539"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R.A. Wagner","year":"1974","unstructured":"R.A. Wagner and M.J. Fischer. The string-to-string correction problem. Journal of the ACM, 21(1):168\u2013173, 1974.","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Natural Language Processing \u2014 NLP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45154-4_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T19:49:28Z","timestamp":1556740168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45154-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676058","9783540451549"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45154-4_11","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}