Dependency Unification Grammar
نویسنده
چکیده
A grammar is a theory about a language. Theories may be formulated in a natural language, describing the properties of the object in question. Another way of providing information about an object is designing a model. A model is an artificial construct resembling the object in certain respects. In linguistics, formal models play a major role. A formal model (or formalism) consists of a set of symbols and a set of instructions for symbol manipulation. A popular type of formal model in linguistics is graphs consisting of nodes and edges, especially a particular type of graph called a "tree".
منابع مشابه
Parsing Korean based on Dependency Grammar and GULP
This paper presents a parsing algorithm in Prolog using GULP, based on dependency grammar and unification-based grammar.1 It parses declarative sentences of a free-word-order language, Korean. The dependency grammar accepts free order of the words in a sentence. Unification-based features separate the grammar from the parsing algorithm and also simplify the notation of the grammar. GULP (Graph ...
متن کاملEncoding a syntactic dictionary into a super granular unification grammar
We show how to turn a large-scale syntactic dictionary into a dependency-based unification grammar where each piece of lexical information calls a separate rule, yielding a super granular grammar. Subcategorization, raising and control verbs, auxiliaries and copula, passivization, and tough-movement are discussed. We focus on the semantics-syntax interface and offer a new perspective on syntact...
متن کاملDependency Unification Grammar for PROLOG
The programming language PROLOG has proved to be an excellent tool for implementing natural language processing systems. Its built-in resolution and unification mechanisms are well suited to both accept and generate sentences of artificial and natural languages. Although supporting many different linguistic formalisms, its straightforwardness and elegance have perhaps best been demonstrated wit...
متن کاملTree Unification Grammar Problems and Proposals for Topology , TAG , and
This work presents a lexicalized grammar formalism which can be seen as a variant of multi-component tree adjoining grammar (TAG). This formalism is well-suited for describing the syntax of German because it relates a syntactic dependency graph with a hierarchy of topological domains. The topological phrase structure encodes the placement of verbal and nominal elements in the (ordered) field st...
متن کاملTreebank-Based Acquisition of Multilingual Unification Grammar Resources
Deep unification(constraint-)based grammars are usually hand-crafted. Scaling such grammars from fragments to unrestricted text is time-consuming and expensive. This problem can be exacerbated in multilingual broad-coverage grammar development scenarios. Cahill et al. (2002, 2004) and O’Donovan et al. (2004) present an automatic f-structure annotation-based methodology to acquire broad-coverage...
متن کاملHow to define a context-free backbone for DGs: Implementing a DG in the LFG formalism
This paper presents a multidimensional Dependency Grammar (DG), which decouples the dependency tree from word order, such that surface ordering is not determined by traversing the dependency tree. We develop the notion of a word order domain structure, which is linked but structurally dissimilar to the syntactic dependency tree. We then discuss the implementation of such a DG using constructs f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1986