Sciweavers

877 search results - page 49 / 176
» How to Cover a Grammar
Sort
View
COLING
1996
15 years 7 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
CSL
2002
Springer
15 years 6 months ago
Weighted finite-state transducers in speech recognition
We survey the use of weighted finite-state transducers (WFSTs) in speech recognition. We show that WFSTs provide a common and natural representation for HMM models, context-depend...
Mehryar Mohri, Fernando Pereira, Michael Riley
CSLP
2004
Springer
15 years 11 months ago
Metagrammar Redux
In this paper we introduce a general framework for describing the lexicon of a lexicalised grammar by means of elementary descriptive fragments. The system described hereafter cons...
Benoît Crabbé, Denys Duchier
ICRA
2003
IEEE
108views Robotics» more  ICRA 2003»
15 years 11 months ago
Trail-Laying Robots for Robust Terrain Coverage
— Robotics researchers have studied robots that can follow the trails laid by other robots. We, on the other hand, study robots that leave trails in the terrain to cover closed t...
Jonas Svennebring, Sven Koenig
KBSE
2005
IEEE
15 years 11 months ago
Constructing interaction test suites with greedy algorithms
Combinatorial approaches to testing are used in several fields, and have recently gained momentum in the field of software testing through software interaction testing. One-test...
Renée C. Bryce, Charles J. Colbourn