Sciweavers

113 search results - page 1 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
ICSM
2003
IEEE
13 years 9 months ago
Deriving tolerant grammars from a base-line grammar
A grammar-based approach to tool development in re- and reverse engineering promises precise structure awareness, but it is problematic in two respects. Firstly, it is a considera...
Steven Klusener, Ralf Lämmel
CORR
2008
Springer
129views Education» more  CORR 2008»
13 years 4 months ago
Feature Unification in TAG Derivation Trees
The derivation trees of a tree adjoining grammar provide a first insight into the sentence semantics, and are thus prime targets for generation systems. We define a formalism, fea...
Sylvain Schmitz, Joseph Le Roux
GRAMMARS
2002
119views more  GRAMMARS 2002»
13 years 4 months ago
Computational Complexity of Probabilistic Disambiguation
Recent models of natural language processing employ statistical reasoning for dealing with the ambiguity of formal grammars. In this approach, statistics, concerning the various li...
Khalil Sima'an
IWPC
2008
IEEE
13 years 10 months ago
The Reuse of Grammars with Embedded Semantic Actions
Reusing syntax specifications without embedded arbitrary semantic actions is straightforward because the semantic analysis phases of new applications can feed off trees or other ...
Terence Parr
EACL
2006
ACL Anthology
13 years 5 months ago
Generating Statistical Language Models from Interpretation Grammars in Dialogue Systems
In this paper, we explore statistical language modelling for a speech-enabled MP3 player application by generating a corpus from the interpretation grammar written for the applica...
Rebecca Jonson