Sciweavers

113 search results - page 13 / 23
» Deriving tolerant grammars from a base-line grammar
Sort
View
ECMDAFA
2009
Springer
98views Hardware» more  ECMDAFA 2009»
15 years 6 months ago
A Language-Theoretic View on Guidelines and Consistency Rules of UML
Abstract. Guidelines and consistency rules of UML are used to control the degrees of freedom provided by the language to prevent faults. Guidelines are used in specific domains (e...
Zhe Chen, Gilles Motet
ALT
1997
Springer
15 years 3 months ago
Synthesizing Noise-Tolerant Language Learners
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generat...
John Case, Sanjay Jain, Arun Sharma
DLT
2008
15 years 1 months ago
Derivation Tree Analysis for Accelerated Fixed-Point Computation
We show that for several classes of idempotent semirings the least fixed-point of a polynomial system of equations X = f(X) is equal to the least fixed-point of a linear system obt...
Javier Esparza, Stefan Kiefer, Michael Luttenberge...
EMNLP
2011
13 years 11 months ago
Relaxed Cross-lingual Projection of Constituent Syntax
We propose a relaxed correspondence assumption for cross-lingual projection of constituent syntax, which allows a supposed constituent of the target sentence to correspond to an u...
Wenbin Jiang, Qun Liu, Yajuan Lv
COLING
1996
15 years 1 months ago
Reversible delayed lexical choice in a bidirectional framework
We describe a bidirectional framework for natural language parsing and generation, using a typedfeatureformalismand an HPSG-based grammar with a parser and generator derived from ...
Graham Wilcock, Yuji Matsumoto