Search (1 results, page 1 of 1)

Did you mean:
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2f_documents %2f subject classification schemes%3a bliss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c heery evelyn %2f bliss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bliss%2c henry evelyn %2f bloss bibliographic classification %2f texts%22 1
precises%3a%2fdocuments %2f subject classification schemes%3a bloss%2c henry evelyn %2f bliss bibliographic classification %2f texts%22 1

Saeed, K.; Dardzinska, A.: Natural language processing : word recognition without segmentation (2001) 0.00
```
0.0024926048 = product of:
  0.034896467 = sum of:
    0.034896467 = product of:
      0.069792934 = sum of:
        0.069792934 = weight(_text_:texts in 7707) [ClassicSimilarity], result of:
          0.069792934 = score(doc=7707,freq=2.0), product of:
            0.16460659 = queryWeight, product of:
              5.4822793 = idf(docFreq=499, maxDocs=44218)
              0.03002521 = queryNorm
            0.42399842 = fieldWeight in 7707, product of:
              1.4142135 = tf(freq=2.0), with freq of:
                2.0 = termFreq=2.0
              5.4822793 = idf(docFreq=499, maxDocs=44218)
              0.0546875 = fieldNorm(doc=7707)
      0.5 = coord(1/2)
  0.071428575 = coord(1/14)
```
Abstract

In an earlier article about the methods of recognition of machine and hand-written cursive letters, we presented a model showing the possibility of processing, classifying, and hence recognizing such scripts as images. The practical results we obtained encouraged us to extend the theory to an algorithm for word recognition. In this article, we introduce our ideas, describe our achievements, and present our results of testing words for recognition without segmentation. This would lead to the possibility of applying the methods used in this work, together with other previously developed algorithms to process whole sentences and, hence, written and spoken texts with the goal of automatic recognition.