Sciweavers

6943 search results - page 858 / 1389
» Representations for evolutionary algorithms
Sort
View
NAACL
2003
15 years 8 months ago
Syntax-based Alignment of Multiple Translations: Extracting Paraphrases and Generating New Sentences
We describe a syntax-based algorithm that automatically builds Finite State Automata (word lattices) from semantically equivalent translation sets. These FSAs are good representat...
Bo Pang, Kevin Knight, Daniel Marcu
ANLP
2000
123views more  ANLP 2000»
15 years 8 months ago
Noun Phrase Recognition by System Combination
The performance of machine learning algorithms can be improved by combining the output of different systems. In this paper we apply this idea to the recognition of noun phrases. W...
Erik F. Tjong Kim Sang
FTCS
1998
84views more  FTCS 1998»
15 years 8 months ago
On the Use of Formal Techniques for Validation
The traditional use of formal methods has been for the veri cation of algorithms or protocols. Given the high cost and limitations in state space coverage provided by conventional...
Neeraj Suri, Purnendu Sinha
178
Voted
GRAPHICSINTERFACE
2000
15 years 8 months ago
Triangle Strip Compression
In this paper we introduce a simple and efficient scheme for encodingthe connectivityand the stripification of a triangle mesh. Since generating a good set of triangle strips is a...
Martin Isenburg
129
Voted
COLING
1996
15 years 8 months ago
Unsupervised Discovery of Phonological Categories through Supervised Learning of Morphological Rules
We describe a case study in tit(', application of symbolic machinc learning techniques for the discow;ry of linguistic rules and categories. A supervised rule induction algor...
Walter Daelemans, Peter Berck, Steven Gillis