Sciweavers

170 search results - page 11 / 34
» Parsing with Non-Deterministic Functions
Sort
View
EACL
2003
ACL Anthology
13 years 8 months ago
Topological Parsing
We present a new grammar formalism for parsing with freer word-order languages, motivated by recent linguistic research in German and the Slavic languages. Unlike CFGs, these gram...
Gerald Penn, Mohammad Haji-Abdolhosseini
LREC
2008
158views Education» more  LREC 2008»
13 years 9 months ago
Linguistic Description and Automatic Extraction of Definitions from German Court Decisions
This paper discusses the use of computational linguistic technology to extract definitions from a large corpus of German court decisions. We present a corpus-based survey of defin...
Stephan Walter
EACL
2006
ACL Anthology
13 years 9 months ago
Developments in Affect Detection in E-drama
We report work1 in progress on adding affect-detection to an existing program for virtual dramatic improvisation, monitored by a human director. To partially automate the director...
Li Zhang, John A. Barnden, Robert J. Hendley, Alan...
ICDS
2007
IEEE
14 years 1 months ago
Automatic Acquisition of Translation Knowledge Using Structural Matching Between Parse Trees
— In this paper we present a rule-based formalism for the representation, acquisition, and application of translation knowledge. The formalism is being used successfully in a Jap...
Werner Winiwarter
EELC
2006
124views Languages» more  EELC 2006»
13 years 11 months ago
How Grammar Emerges to Dampen Combinatorial Search in Parsing
Abstract. According to the functional approach to language evolution (inspired by cognitive linguistics and construction grammar), grammar arises to deal with issues in communicati...
Luc Steels, Pieter Wellens