Sciweavers

223 search results - page 36 / 45
» Construction of Tree Automata from Regular Expressions
Sort
View
JMLR
2010
192views more  JMLR 2010»
13 years 2 months ago
Inducing Tree-Substitution Grammars
Inducing a grammar from text has proven to be a notoriously challenging learning task despite decades of research. The primary reason for its difficulty is that in order to induce...
Trevor Cohn, Phil Blunsom, Sharon Goldwater
BMCBI
2008
175views more  BMCBI 2008»
13 years 7 months ago
Synonym set extraction from the biomedical literature by lexical pattern discovery
Background: Although there are a large number of thesauri for the biomedical domain many of them lack coverage in terms and their variant forms. Automatic thesaurus construction b...
John McCrae, Nigel Collier
COLING
1992
13 years 8 months ago
Compiling and Using Finite-State Syntactic Rules
A language-independent framework for syntactic finlte-state parsing is discussed. The article presents a framework, a formalism, a compiler and a parser for grammars written in th...
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilain...
ESOP
2008
Springer
13 years 9 months ago
Verification of Higher-Order Computation: A Game-Semantic Approach
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
C.-H. Luke Ong
CONCUR
2005
Springer
14 years 1 months ago
The Individual and Collective Token Interpretations of Petri Nets
Starting from the opinion that the standard firing rule of Petri nets embodies the collective token interpretation of nets rather than their individual token interpretation, I pro...
Rob J. van Glabbeek