{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:36:29Z","timestamp":1725492989197},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432197"},{"type":"electronic","value":"9783540457152"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45715-1_20","type":"book-chapter","created":{"date-parts":[[2007,10,24]],"date-time":"2007-10-24T17:50:56Z","timestamp":1193248256000},"page":"220-229","source":"Crossref","is-referenced-by-count":3,"title":["Parsing Ill-Formed Inputs with Constraint Graphs"],"prefix":"10.1007","author":[{"given":"Philippe","family":"Blache","sequence":"first","affiliation":[]},{"given":"Azulay","family":"David-Olivier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,2,5]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Abney S. (1996) \u201cPartial Parsing via Finite-State Calculus\u201d, in proceedings of ESSLLI\u201996 Robust Parsing Workshop.","DOI":"10.1017\/S1351324997001599"},{"key":"20_CR2","unstructured":"B\u00e8s G. & P. Blache (1999) \u201cPropri\u00e9t\u00e9s et analyse d\u2019un langage\u201d, in proceedings of TALN\u201999."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Blache P. (2000) \u201cConstraints, Linguistic Theories and Natural Language Processing\u201d, in Natural Language Processing, D. Christodoulakis (ed.), Lecture Notes in Artificial Intelligence, Springer.","DOI":"10.1007\/3-540-45154-4_21"},{"key":"20_CR4","unstructured":"Blache P. & J.-M. Balfourier (2001) \u201cProperty Grammars: a Flexible Constraint-Based Approach to Parsing\u201d, in proceedings of IWPT-2001."},{"key":"20_CR5","unstructured":"Blanche-Benveniste C. (1997) Approches de la langue parl\u00e9e en fran\u00e7ais, Ophrys."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Bouma G., R. Malouf & I. Sag (2001) \u201cSatisfying Constraints on Extraction and Adjunction\u201d, in Natural Language and Linguistic Theory, 19:1, Kluwer.","DOI":"10.1023\/A:1006473306778"},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Chanod J.-P. (2000) \u201cRobust Parsing and Beyond\u201d, in Robustness in Language Technology, Kluwer.","DOI":"10.1007\/978-94-015-9719-7_8"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Duchier D. & R. Debusmann (2001) \u201cTopological Dependency Trees: A Constraint-Based Account of Linear Precedence\u201d, in proceedings of ACL.","DOI":"10.3115\/1073012.1073036"},{"key":"20_CR9","unstructured":"Gazdar G., E. Klein, G. Pullum, I. Sag (1985), Generalized Phrase Structure Grammar, Blackwell."},{"key":"20_CR10","unstructured":"Grinberg D., J. Lafferty & D. Sleator (1995), A robust parsing algorithm for link grammars, CMU-CS-95-125, Carnegie Mellon University."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"K\u00fcbler S. & E. Hinrichs (2001) \u201cFrom Chunks to Function-Argument Structure: A similarity-Based Approach\u201d, in proceedings of ACL.","DOI":"10.3115\/1073012.1073057"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Maruyama H. (1990), \u201cStructural Disambiguation with Constraint Propagation\u201d, in proceedings of ACL\u201990.","DOI":"10.3115\/981823.981828"},{"key":"20_CR13","unstructured":"Pollard C. & I. Sag (1994), Head-driven Phrase Structure Grammars, CSLI, Chicago University Press."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Sag I. & T. Wasow (1999), Syntactic Theory. A Formal Introduction, CSLI.","DOI":"10.1162\/coli.2000.26.2.295a"},{"key":"20_CR15","unstructured":"Tesni\u00e8re L. (1959) El\u00e9ments de syntaxe structurale, Klincksieck."},{"key":"20_CR16","unstructured":"van Noord G., G. Bouma, R. Koeling & M.-J. Nederhof (1998), in Natural Language Engineering, 4:1."}],"container-title":["Lecture Notes in Computer Science","Computational Linguistics and Intelligent Text Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45715-1_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T20:04:07Z","timestamp":1556913847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45715-1_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432197","9783540457152"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45715-1_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}