759 search results - page 59 / 152 » Overlap-Free Regular Languages |
262
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
145
click to vote
CICLING
2007
Springer
15 years 11 months ago
2007
Springer
Finite-state technology is considered the preferred model for representing the phonology and morphology of natural languages. The attractiveness of this technology for natural lang...
115
Voted
IR
2007
15 years 4 months ago
2007
In information retrieval, the cluster hypothesis states: closely related documents tend to be relevant to the same request. We exploit this hypothesis directly by adjusting queryb...
127
click to vote
CONCUR
1998
Springer
15 years 9 months ago
1998
Springer
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest viewing PA-processes as trees, and using treeautomata technique...
128
Voted
FINTAL
2006
15 years 8 months ago
2006
We present a regular approximation of Link Grammar, a dependency-type formalism with context-free expressive power, as a first step toward a finite-state joint inference system. Th...