Abstract
The notion of constraints is generally used in modern linguistics (in particular in syntax and phonology) for representing properties that an object must satisfy (see [4], [15]). Constraints can be general (or universal), valid for different languages, or at the opposite very specific, representing for example the variability of a given language. In all cases, the idea consists of stipulating properties ruling out structures which don’t belong to the language.
Preview
Unable to display preview. Download preview PDF.
References
Archangeli D. & D.T. Langendoen eds. (1997) Optimality Theory, Blackwell.
Bès G. & P. Blache (1999) Propriétés et analyse d’un langage, in actes de TALN’99.
Blache P. (1999) Filtering and Fusion: A Technique for Parsing with Properties, in proceedings of NLPRS’99.
Borsley R. (1996), Modern Phrase Structure Grammars, Blackwell.
Carpenter B. & Penn G. (1995) “Compiling Typed Attribute-Value Logic Grammars”, in H. Bunt and M. Tomita (eds.), Current Issues in Parsing Technologies, Kluwer.
Duchier D. & Thater S. (1999) “Parsing with Tree Descriptions: a constraint based approach”, inproceedings of NLULP’99.
Götz T., D. Meurers& D. Gerdemann (1997), The ConTroll Manual, SFS Report.
Guenthner F. (1988) “Features and Values 1988”, CIS-Bericht-90-2, Universität München.
Karlsson F. (1990), “Constraint Grammar as a Framework for Parsing Running Text”, in Proceedings of COLING’90.
Marriott, K. & Stuckey, P.J. (1998) Programming with Constraints, MIT Press.
Maruyama H. (1990), “Structural Disambiguation with Constraint Propagation”, in proceedings of COLING-ACL’98 workshop on Dependency-based Grammars.
Menzel W.& I. Schröder (1998), “Decision Procedures for Dependency Parsing Using Graded Constraints”, in proceedings of ACL’90.
Meurers D.& Minnen G. (1998) “Off-line Constraint Propagation for Efficient HPSG Processing”, in G. Webelhuth, J.-P. Koenig, A. Kathol (eds.): Lexical and Constructional Aspects of Linguistic Explanation, CSLI.
Morawietz F.& Cornell T. (1997) “Representing Constraints with Automata”, in proceedings of the ACL/EACL.
Sag I.& T. Wasow (1999), Syntactic Theory. A Formal Introduction, CSLI.
Samuelsson C., P. Tapainen & A. Voutilainen (1996), “Inducing Constraint Grammars”, CLAUS Report 79.
Saraswat V. (1993), Concurrent Constraint Programming, MIT Press.
I. Schröder, W. Menzel, K. Foth & M. Schulz (2000), “Modeling Dependency Grammars with Restricted Constraints”, submitted to the journal TAL.
Shieber S. (1992) Constraint-Based Grammar Formalisms, MIT Press.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Blache, P. (2000). Constraints, Linguistic Theories, and Natural Language Processing. In: Christodoulakis, D.N. (eds) Natural Language Processing — NLP 2000. NLP 2000. Lecture Notes in Computer Science(), vol 1835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45154-4_21
Download citation
DOI: https://doi.org/10.1007/3-540-45154-4_21
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67605-8
Online ISBN: 978-3-540-45154-9
eBook Packages: Springer Book Archive