Abstract
We present in this paper a constraint-based account of robust parsing. More precisely, we propose a parsing technique relying on constraint satisfaction and its implementation by means of graphs. We show how constraint graphs constitute a flexible parsing framework both in terms of representation and implementation. They allow in particular to take into account non-connected elements, frequent in particular when parsing spoken languages. This approach is illustrated with some problematic examples (hesitations, phatics, repairs, etc.) taken from spoken french corpora.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abney S. (1996) “Partial Parsing via Finite-State Calculus”, in proceedings of ESSLLI’96 Robust Parsing Workshop.
Bès G. & P. Blache (1999) “Propriétés et analyse d’un langage”, in proceedings of TALN’99.
Blache P. (2000) “Constraints, Linguistic Theories and Natural Language Processing”, in Natural Language Processing, D. Christodoulakis (ed.), Lecture Notes in Artificial Intelligence, Springer.
Blache P. & J.-M. Balfourier (2001) “Property Grammars: a Flexible Constraint-Based Approach to Parsing”, in proceedings of IWPT-2001.
Blanche-Benveniste C. (1997) Approches de la langue parlée en français, Ophrys.
Bouma G., R. Malouf & I. Sag (2001) “Satisfying Constraints on Extraction and Adjunction”, in Natural Language and Linguistic Theory, 19:1, Kluwer.
Chanod J.-P. (2000) “Robust Parsing and Beyond”, in Robustness in Language Technology, Kluwer.
Duchier D. & R. Debusmann (2001) “Topological Dependency Trees: A Constraint-Based Account of Linear Precedence”, in proceedings of ACL.
Gazdar G., E. Klein, G. Pullum, I. Sag (1985), Generalized Phrase Structure Grammar, Blackwell.
Grinberg D., J. Lafferty & D. Sleator (1995), A robust parsing algorithm for link grammars, CMU-CS-95-125, Carnegie Mellon University.
Kübler S. & E. Hinrichs (2001) “From Chunks to Function-Argument Structure: A similarity-Based Approach”, in proceedings of ACL.
Maruyama H. (1990), “Structural Disambiguation with Constraint Propagation”, in proceedings of ACL’90.
Pollard C. & I. Sag (1994), Head-driven Phrase Structure Grammars, CSLI, Chicago University Press.
Sag I. & T. Wasow (1999), Syntactic Theory. A Formal Introduction, CSLI.
Tesnière L. (1959) Eléments de syntaxe structurale, Klincksieck.
van Noord G., G. Bouma, R. Koeling & M.-J. Nederhof (1998), in Natural Language Engineering, 4:1.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blache, P., David-Olivier, A. (2002). Parsing Ill-Formed Inputs with Constraint Graphs. In: Gelbukh, A. (eds) Computational Linguistics and Intelligent Text Processing. CICLing 2002. Lecture Notes in Computer Science, vol 2276. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45715-1_20
Download citation
DOI: https://doi.org/10.1007/3-540-45715-1_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43219-7
Online ISBN: 978-3-540-45715-2
eBook Packages: Springer Book Archive