{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:28:16Z","timestamp":1725542896523},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540373346"},{"type":"electronic","value":"9783540373360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816508_56","type":"book-chapter","created":{"date-parts":[[2006,8,10]],"date-time":"2006-08-10T09:19:47Z","timestamp":1155201587000},"page":"564-575","source":"Crossref","is-referenced-by-count":2,"title":["Regular Approximation of Link Grammar"],"prefix":"10.1007","author":[{"given":"Filip","family":"Ginter","sequence":"first","affiliation":[]},{"given":"Sampo","family":"Pyysalo","sequence":"additional","affiliation":[]},{"given":"Jorma","family":"Boberg","sequence":"additional","affiliation":[]},{"given":"Tapio","family":"Salakoski","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Finite-State Language Processing","year":"1997","key":"56_CR1","unstructured":"Roche, E., Schabes, Y. (eds.): Finite-State Language Processing. MIT Press, Cambridge (1997)"},{"key":"56_CR2","first-page":"233","volume-title":"The Oxford Handbook of Computational Linguistics","author":"J. Carroll","year":"2003","unstructured":"Carroll, J.: Parsing. In: Mitkov, R. (ed.) The Oxford Handbook of Computational Linguistics, pp. 233\u2013248. Oxford University Press, Oxford (2003)"},{"issue":"1","key":"56_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1162\/089120100561610","volume":"26","author":"M.J. Nederhof","year":"2000","unstructured":"Nederhof, M.J.: Practical experiments with regular approximation of context-free languages. Computational Linguistics\u00a026(1), 17\u201344 (2000)","journal-title":"Computational Linguistics"},{"key":"56_CR4","doi-asserted-by":"crossref","unstructured":"Grimley Evans, E.: Approximating context-free grammars with a finite-state calculus. In: Proceedings of ACL\/EACL 1997, Association for Computational Linguistics, pp. 452\u2013459 (1997)","DOI":"10.3115\/979617.979675"},{"key":"56_CR5","doi-asserted-by":"crossref","unstructured":"Johnson, M.: Finite-state approximation of constraint-based grammars using left-corner grammar transforms. In: Proceedings of ACL\/COLING 1998, Association for Computational Linguistics, pp. 619\u2013623 (1998)","DOI":"10.3115\/980845.980948"},{"issue":"4","key":"56_CR6","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1162\/089120103322753338","volume":"29","author":"K. Oflazer","year":"2003","unstructured":"Oflazer, K.: Dependency parsing with an extended finite-state approach. Computational Linguistics\u00a029(4), 515\u2013544 (2003)","journal-title":"Computational Linguistics"},{"key":"56_CR7","unstructured":"Elworthy, D.: A finite state parser with dependency structure output. In: Proceedings of the Sixth International Workshop on Parsing Technologies IWPT 2000, Trento, Italy (2000)"},{"key":"56_CR8","doi-asserted-by":"crossref","unstructured":"Koskenniemi, K.: Finite-state parsing and disambiguation. In: Karlgren, H. (ed.) Proceedings of the 13th International Conference on Computational Linguistics COLING 1990, Helsinki, Finland, ACL, pp. 229\u2013232 (1990)","DOI":"10.3115\/997939.997979"},{"issue":"3","key":"56_CR9","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1142\/S0129054105003169","volume":"16","author":"A.M. Yli-Jyr\u00e4","year":"2005","unstructured":"Yli-Jyr\u00e4, A.M.: Approximating dependency grammars through intersection of star-free regular languages. International Journal of Foundations of Computer Science\u00a016(3), 565\u2013579 (2005)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"56_CR10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.2307\/411934","volume":"40","author":"D.G. Hays","year":"1964","unstructured":"Hays, D.G.: Dependency theory: A formalism and some observations. Language\u00a040, 511\u2013525 (1964)","journal-title":"Language"},{"key":"56_CR11","doi-asserted-by":"publisher","first-page":"304","DOI":"10.1016\/S0019-9958(65)90232-9","volume":"8","author":"H. Gaifman","year":"1965","unstructured":"Gaifman, H.: Dependency systems and phrase-structure systems. Information and Control\u00a08, 304\u2013337 (1965)","journal-title":"Information and Control"},{"key":"56_CR12","unstructured":"Sleator, D.D., Temperley, D.: Parsing English with a Link Grammar. In: Proceedings of the Third International Workshop on Parsing Technologies IWPT 1993, Tilburg, Netherlands (1993)"},{"key":"56_CR13","first-page":"226","volume-title":"Proceedings of NAACL 2000","author":"S. Miller","year":"2000","unstructured":"Miller, S., Fox, H., Ramshaw, L., Weischedel, R.: A novel use of statistical parsing to extract information from text. In: Proceedings of NAACL 2000, pp. 226\u2013233. Morgan Kaufmann, San Francisco (2000)"},{"key":"56_CR14","doi-asserted-by":"crossref","unstructured":"Ginter, F., Myll\u00e4ri, A., Salakoski, T.: A probabilistic search for the best solution among partially completed candidates. In: Proceedings of the HLT\/NAACL 2006 Workshop on Computationally Hard Problems and Joint Inference in Speech and Language Processing, Association for Computational Linguistics, pp. 33\u201340 (2006)","DOI":"10.3115\/1631828.1631833"},{"key":"56_CR15","unstructured":"Grinberg, D., Lafferty, J., Sleator, D.D.: A robust parsing algorithm for link grammars. In: Proceedings of the Fourth International Workshop on Parsing Technologies IWPT 1995, Prague, Czech Republic (1995)"},{"key":"56_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/3-540-63174-7_8","volume-title":"Automata Implementation","author":"G. Noord van","year":"1997","unstructured":"van Noord, G.: FSA utilities: A toolbox to manipulate finite-state automata. In: Wood, D., Darrell, R., Yu, S. (eds.) WIA 1996. LNCS, vol.\u00a01260, pp. 87\u2013108. Springer, Heidelberg (1997)"},{"key":"56_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/BFb0031388","volume-title":"Automata Implementation","author":"M. Mohri","year":"1998","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: A rational design for a weighted finite-state transducer library. In: Wood, D., Yu, S. (eds.) WIA 1997. LNCS, vol.\u00a01436, pp. 144\u2013158. Springer, Heidelberg (1998)"}],"container-title":["Lecture Notes in Computer Science","Advances in Natural Language Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816508_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:15:39Z","timestamp":1605644139000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816508_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540373346","9783540373360"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11816508_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}