595 search results - page 59 / 119 » Languages Of Analogical Strings |
FSMNLP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. Stochastic finite automata are useful for identifying substrings (chunks) within larger units of text. Relevant applications include tokenization, base-NP chunking, name...
100
click to vote
CSFW
2003
IEEE
15 years 3 months ago
2003
IEEE
SPKI/SDSI is a language for expressing distributed access control policy, derived from SPKI and SDSI. We provide a first-order logic (FOL) semantics for SDSI, and show that it ha...
PODS
2010
ACM
15 years 2 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
We propose a simple two-level hierarchical probability model for unsupervised word segmentation. By treating words as strings composed of morphemes/phonemes which are themselves c...
LACL
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. The principle of compositionality, as standardly defined, regards grammars as compositional that are not compositional in an intuitive sense of the word. There is, for ex...