Sciweavers

40 search results - page 2 / 8
» A Recursive Treatment of Collocations
Sort
View
MICAI
2004
Springer
13 years 10 months ago
Automatic Enrichment of Very Large Dictionary of Word Combinations on the Basis of Dependency Formalism
The paper presents a method of automatic enrichment of a very large dictionary of word combinations. The method is based on results of automatic syntactic analysis (parsing) of sen...
Alexander F. Gelbukh, Grigori Sidorov, Sang-Yong H...
TSD
2001
Springer
13 years 9 months ago
Finding Semantically Related Words in Large Corpora
The paper deals with the linguistic problem of fully automatic grouping of semantically related words. We discuss the measures of semantic relatedness of basic word forms and descr...
Pavel Smrz, Pavel Rychlý
TPHOL
2002
IEEE
13 years 10 months ago
Type-Theoretic Functional Semantics
We describe the operational and denotational semantics of a small imperative language in type theory with inductive and recursive definitions. The operational semantics is given b...
Yves Bertot, Venanzio Capretta, Kuntal Das Barman
ICANN
2007
Springer
13 years 11 months ago
Recursive Principal Component Analysis of Graphs
Treatment of general structured information by neural networks is an emerging research topic. Here we show how representations for graphs preserving all the information can be devi...
Alessio Micheli, Alessandro Sperduti
CSL
2004
Springer
13 years 10 months ago
Fixed Points of Type Constructors and Primitive Recursion
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...
Andreas Abel, Ralph Matthes