Please use this identifier to cite or link to this item: doi:10.22028/D291-25770
Title: Statistical A-star dependency parsing
Author(s): Dienes, Péter
Koller, Alexander
Kuhlmann, Marco
Language: German
Year of Publication: 2003
OPUS Source: Proceedings of the workshop on Prospects and Advances of the Syntax/Semantics Interface, Nancy, 2003, pp.85-89
SWD key words: Syntaktische Analyse ; Dependenzgrammatik
Free key words: Dependency Parsing
DDC notations: 004 Computer science, internet
Publikation type: Conference Paper
Abstract: Extensible Dependency Grammar (XDG; Duchier and Debusmann (2001)) is a recently developed dependency grammar formalism that allows the characterization of linguistic structures along multiple dimensions of description. It can be implemented efficiently using constraint programming (CP; Koller and Niehren 2002).In the CP context, parsing is cast as a search problem: The states of the search are partial parse trees, successful end states are complete and valid parses. In this paper, we propose a probability model for XDG dependency trees and an A-Star search control regime for the XDG parsing algorithm that guarantees the best parse to be found first. Extending XDG with a statistical component has the benefit of bringing the formalism further into the grammatical mainstream; it also enables XDG to efficiently deal with large, corpus-induced grammars that come with a high degree of ambiguity.
Link to this record: urn:nbn:de:bsz:291-scidok-2853
Date of registration: 5-Jul-2004
Faculty: MI - Fakultät für Mathematik und Informatik
Department: MI - Informatik
P - Sprachwissenschaft und Sprachtechnologie
Former Department: bis SS 2016: Fachrichtung 4.7 - Allgemeine Linguistik
Collections:SciDok - Der Wissenschaftsserver der Universität des Saarlandes

Files for this record:
File Description SizeFormat 
dienes2003statistical.pdf148,77 kBAdobe PDFView/Open

Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.