1052 search results - page 70 / 211 » The Regular Real-Time Languages |
104
Voted
IR
2007
15 years 3 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...
115
Voted
CONCUR
1998
Springer
15 years 7 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...
114
Voted
FINTAL
2006
15 years 7 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...
135
Voted
EACL
2003
ACL Anthology
15 years 5 months ago
2003
ACL Anthology
Syntactic constraints in Koskenniemi’s Finite-State Intersection Grammar (FSIG) are logically less complex than their formalism (Koskenniemi et al., 1992) would suggest: It turn...
115
Voted
FSMNLP
2005
Springer
15 years 9 months ago
2005
Springer
This paper presents SFST-PL, a programming language for finite state transducers which is based on extended regular expressions with variables. The programming language is both si...