Results 11 to 20 of about 271 (223)
Polarized unification grammars [PDF]
Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06, 2006 This paper proposes a generic mathematical formalism for the combination of various structures: strings, trees, dags, graphs and products of them. The polarization of the objects of the elementary structures controls the saturation of the final structure. This formalism is both elementary and powerful enough to strongly simulate many grammar formalisms
openaire +2 more sources
Functional unification grammar revisited [PDF]
Proceedings of the 25th annual meeting on Association for Computational Linguistics -, 1987 In this paper, we show that one benefit of FUG, the ability to state global constraints on choice separately from syntactic rules, is difficult in generation systems based on augmented context free grammars (e.g., Definite Clause Grammars). They require that such constraints be expressed locally as part of syntactic rules and therefore, duplicated in ...
Kathleen R. McKeown, Cécile Paris
openaire +1 more source
Tree Unification Grammar [PDF]
Proceedings of the 27th annual meeting on Association for Computational Linguistics -, 1989 Tree Unification Grammar is a declarative unification-based linguistic framework. The basic grammar structures of this framework are partial descriptions of trees, and the framework requires only a single grammar rule to combine these partial descriptions.
openaire +1 more source
Defaults in unification grammar [PDF]
Proceedings of the 28th annual meeting on Association for Computational Linguistics -, 1990 Incorporation of defaults in grammar formalisms is important for reasons of linguistic adequacy and grammar organization. In this paper we present an algorithm for handling default information in unification grammar. The algorithm specifies a logical operation on feature structures, merging with the non-default structure only those parts of the default
openaire +1 more source
Polynomially parsable unification grammars [PDF]
Journal of Logic and Computation, 2013 Unification grammars (UG) are a grammatical formalism that underlies several contemporary linguistic theories, including Lexical-functional Grammar and Head-driven Phrase-structure Grammar. UG is an especially attractive formalism because of its expressivity, which facilitates the expression of complex linguistic structures and relations.
Hadas Peled, Shuly Wintner
openaire +1 more source
Categorial unification grammars [PDF]
Proceedings of the 11th coference on Computational linguistics -, 1986 Categorial unification grammars (CUGs) embody the essential properties of both unification and categorial grammar formalisms. Their efficient and uniform way of encoding linguistic knowledge in well-understood and widely used representations makes them attractive for computational applications and for linguistic research.In this paper, the basic ...
openaire +2 more sources
Dependency Unification Grammar [PDF]
Proceedings of the 11th coference on Computational linguistics -, 1986 This paper describes the analysis component of the language processing system PLAIN from the viewpoint of unification grammers. The principles of Dependency Unification grammar (DUG) are discussed. The computer language DRL (Dependency Representation Language) is introduced in which DUGs can be formulated.
openaire +2 more sources
Estimators for stochastic "Unification-Based" grammars [PDF]
Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics -, 1999 Log-linear models provide a statistically sound framework for Stochastic ``Unification-Based'' Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of
Mark Johnson 0001 +4 more
openaire +2 more sources
La utilización de formalismos basados en unificación para el análisis de las lenguas naturales
Revista de Filología y Lingüística de la Universidad de Costa Rica, 2015 Perspectivas de la Inteligencia Artificial y Ciencias de la Computación son muy fructífero en el desarrollo de formalismos para el análisis del lenguaje natural y la comprensión.
Celso Vargas
doaj +1 more source
The conceptual model of DFD-technology
Открытое образование (Москва), 2017 The presence of large number of models and methods for structural modeling of business processes and systems has made urgent the development of standardized language for structural analysis and design, suitable for modeling as organizational management ...
Georgiy N. Kalyanov
doaj +1 more source