%
% GENERATED FROM https://www.coli.uni-saarland.de
%    by   : anonymous
%    IP   : coli2006.lst.uni-saarland.de
%    at   : Mon, 05 Feb 2024 15:43:08 +0100 GMT
%    
% Selection : Reference #385
%




@MastersThesis{Debusmann:2001_2,
      AUTHOR = {Debusmann, Ralph},
      TITLE = {A Declarative Grammar Formalism for Dependency Grammar},
      YEAR = {2001},
      ADDRESS = {Saarbrücken},
      SCHOOL = {Universität des Saarlandes, Department of Computational Linguistics},
      URL = {http://www.ps.uni-sb.de/~rade/papers/da.pdf},
      ABSTRACT = {Beginning with the groundbreaking work of Chomsky in the 1950s, syntactians have concentrated mostly on the English language. But English is not a typical natural language: in particular, its word order is very rigid, as opposed to most other languages which exhibit freer word order. The phrase structure-based approach employed for the analysis of English runs into severe problems when confronted with freer word order languages. Aside from the mainstream, linguists in Eastern Europe and Japan have pursued an approach to syntax which seemed better suited for the analysis of freer word order languages: dependency grammar. The key asset of dependency grammar is that it allows for a clean separation of syntactic dependency and surface word order. Unfortunately, none of the frameworks for dependency grammar has really caught on. We suggest two reasons for their failure: 1. many of the dependency-based frameworks lack proper formalization and, perhaps surprisingly, 2. most of them lack a realistic and workable account of word order. In this thesis, we try to remedy these problems in the setting of a constraint-based approach to dependency grammar based on (Duchier 1999). We present a new account of word order for dependency grammar couched in a declarative grammatical formalism called Topological Dependency Grammar (TDG). TDG allows to cleanly separate the two levels of syntactic dependency and surface word order, which greatly facilitates the conception of grammars for freer word order languages. In addition, we can efficiently parse with TDG grammars: using a reduction described in (Duchier 2000), we achieved an efficient parser implementation using modern constraint programming techniques.},
      ANNOTE = {COLIURL : Debusmann:2001:DGF.pdf}
}