Sciweavers

77 search results - page 14 / 16
» Polarized Unification Grammars
Sort
View
108
Voted
JOLLI
2006
86views more  JOLLI 2006»
15 years 1 months ago
Types as Graphs: Continuations in Type Logical Grammar
Applying the programming-language concept of continuations, we propose a new multimodal analysis of quantification in Type Logical Grammar. Our approach naturally gives rise to a n...
Chris Barker, Chung-chieh Shan
EACL
2006
ACL Anthology
15 years 3 months ago
Unifying Synchronous Tree Adjoining Grammars and Tree Transducers via Bimorphisms
We place synchronous tree-adjoining grammars and tree transducers in the single overarching framework of bimorphisms, continuing the unification of synchronous grammars and tree t...
Stuart M. Shieber
132
Voted
ACL
1997
15 years 3 months ago
Approximating Context-Free Grammars with a Finite-State Calculus
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Edmund Grimley-Evans
LNCS
1991
15 years 5 months ago
A Flexible Parser for a Linguistic Development Environment
We describe the parser of LEU/2, the Linguistic Experimentation Environment of the LILOG project. The parser is designed to support and encourage experimentation with different gr...
Gregor Erbach
115
Voted
ACL
1989
15 years 3 months ago
The Structure of Shared Forests in Ambiguous Parsing
The Context-Free backbone of some natural language analyzers produces all possible CF parses as some kind of shared forest, from which a single tree is to be chosen by a disambigu...
Sylvie Billot, Bernard Lang