Sciweavers

1999 search results - page 40 / 400
» Dependently Typed Grammars
Sort
View
POPL
1997
ACM
15 years 6 months ago
Shape Types
Type systems currently available for imperative languages are too weak to detect a significant class of programming errors. For example, they cannot express the property that a l...
Pascal Fradet, Daniel Le Métayer
MICAI
2004
Springer
15 years 7 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...
ACL
1998
15 years 3 months ago
A Stochastic Language Model using Dependency and Its Improvement by Word Clustering
In this paper, we present a stochastic language model for Japanese using dependency. The prediction unit in thismodel isallattributeof "bunsetsu". This isrepresented by ...
Shinsuke Mori, Makoto Nagao
ACL
1990
15 years 3 months ago
Licensing and Tree Adjoining Grammar in Government Binding Parsing
This paper presents an implemented, psychologicallyplausible parsing model for Government Binding theory grammars. I make use of two main ideas: (1) a generalization of the licens...
Robert Frank
OOPSLA
2007
Springer
15 years 8 months ago
Dependent classes
Dependent Classes Vaidas Gasiunas and Mira Mezini Technische Universit¨at Darmstadt, Germany Abstract. Dependent classes are parameterized classes, the interface and implementatio...
Vaidas Gasiunas, Mira Mezini, Klaus Ostermann