Results 1 to 10 of about 172 (124)
On the Universal Generation Problem for Unification Grammars [PDF]
Computational Linguistics, 2021 The universal generation problem for unification grammars is the problem of determining whether a given grammar derives any terminal string with a given feature structure. It is known that the problem is decidable for LFG and PATR grammars if only acyclic feature structures are taken into consideration.
Jürgen Wedekind
doaj +3 more sources
Highly constrained unification grammars [PDF]
Journal of Logic, Language and Information, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shuly Wintner
exaly +3 more sources
Unification Grammars and Off-Line Parsability [PDF]
Journal of Logic, Language and Information, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nissim FRANCEZ +2 more
exaly +3 more sources
Feature-constraint logics for unification grammars
The Journal of Logic Programming, 1992 Summary: This paper studies feature-description languages that have been developed for use in unification grammars, logic programming, and knowledge representation. The distinctive notational primitive of these languages are features that can be understood as unary partial functions on a domain of abstract objects.
Gert Smolka
exaly +2 more sources
A Unified Framework to Compute over Tree Synchronized Grammars and Primal Grammars [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 Tree languages are powerful tools for the representation and schematization of infinite sets of terms for various purposes (unification theory, verification and specification ...).
Frédéric Saubion, Igor Stéphan
doaj +3 more sources
E-unification by means of tree tuple synchronized grammars [PDF]
Discrete Mathematics & Theoretical Computer Science, 1997 The goal of this paper is both to give an E-unification procedure that always terminates, and to decide unifiability. For this, we assume that the equational theory is specified by a confluent and constructor-based rewrite system, and that four ...
Sébastien Limet, Pierre Réty
doaj +3 more sources
Revista de Lingüística y Lenguas Aplicadas, 2023 This paper offers the basic guidelines of a formalized version of the Lexical Constructional Model (LCM; Ruiz de Mendoza & Mairal Usón, 2008, 2011; Ruiz de Mendoza & Galera, 2014), the Formalized Lexical-Constructional Grammar (FL_CxG), which will pave ...
Francisco J. Cortés-Rodríguez +1 more
doaj +1 more source
Typed unification grammars [PDF]
Proceedings of the 13th conference on Computational linguistics -, 1990 We introduce TFS, a computer formalism in the class of logic formalisms which integrates a powerful type system. Its basic data structures are typed feature structures. The type system encourages an object-oriented approach to linguistic description by providing a multiple inheritance mechanism and an inference mechanism which allows the specification ...
Martin C. Emele, Rémi Zajac
openaire +2 more sources
Trace & Unification Grammar [PDF]
Proceedings of the 14th conference on Computational linguistics -, 1992 This paper presents Trace & Unification Grammar (TUG), a declarative and reversible grammar formalism that brings together Unification Grammar (UG) and ideas of Government & Binding Theory (GB). The main part of the paper consists in a description of many free word order phenomena of German syntax.
Hans Ulrich Block, Stefanie Schachtl
openaire +2 more sources
Komunikačně-stylový a systémový pohyb v současné češtině
Stylistyka, 2020 The Czech language is socially stratified and regionally differentiated, although there are also processes of the opposite character going on in it, like unification and equalization. Language development includes in itself antinomies opposing each other,
Marie Čechová
doaj +1 more source