In this paper we present an OCR validation module, implemented for the System for Preservation of Electronic Resources (SPER) developed at the U.S. National Library of Medicine.1 The module detects and corrects suspicious words in the OCR output of scanned textual documents through a procedure of deriving partial formats for each suspicious word, retrieving candidate words by partial-match sear...

During the last few years, word graphs have been gaining increasing interest within the speech community as the primary interface between speech recognizers and language processing modules. Both development and evaluation of graph-producing speech decoders require generally accepted measures of word graph quality. While the notion of recognition accuracy can easily be extended to word graphs, a...

Syntactic machine translation systems extract rules from bilingual, word-aligned, syntactically parsed text, but current systems for parsing and word alignment are at best cascaded and at worst totally independent of one another. This work presents a unified joint model for simultaneous parsing and word alignment. To flexibly model syntactic divergence, we develop a discriminative log-linear mo...

Acquiring the meaning of a new word in a foreign language can be achieved either by rote memorizing or, similar to meaning acquisition during infancy, by extracting it from context. Little is known about the brain mechanisms involved in word learning. Here we demonstrate, using event-related brain potentials, the rapid development of a brain signature related to lexical and semantic processing ...

This article deals with the peculiarities of mechanisms providing formation of semantics of compound words from the perspective of the cognitive approach. More to the point, it is a question of conceptual derivation, where meaning formation of compound words is carried out by the interaction of its component conceptual structures. The author has researched the main means which take part in the ...

We study convergent (terminating and confluent) presentations of n-categories. Using the notion of polygraph (or computad), we introduce the homotopical property of finite derivation type for n-categories, generalising the one introduced by Squier for word rewriting systems. We characterise this property by using the notion of critical branching. In particular, we define sufficient conditions f...

We describe a general decomposition mechanism to express the derivation relation of a word rewriting system R as the composition of a (regular) substitution followed by the derivation relation of a system R′ ∪ D, where R′ is a strict sub-system of R and D is the Dyck rewriting system. From this decomposition, we deduce that the system R (resp. R) preserves regular (resp. context-free) languages...

Here we sketch a new derivation of Zipf’s law for word frequencies based on optimal coding. The structure of the derivation is reminiscent of Mandelbrot’s random typing model but it has multiple advantages over random typing: (1) it starts from realistic cognitive pressures (2) it does not require fine tuning of parameters and (3) it sheds light on the origins of other statistical laws of langu...

In Nepali language, compound word formation is mostly associated with inflection, derivation, and postposition attachment. Inflection occurs due to suffixation, whereas derivation driven by both prefixation suffixation. The generated the rules may produce lots of out-of-vocabulary words limited lexical resources numerous exceptions. Hence, machine learning approach can help generate valid compo...

After introducing double derivations of $n$-Lie algebra $L$ we‎ ‎describe the relationship between the algebra $mathcal D(L)$ of double derivations and the usual‎ ‎derivation Lie algebra $mathcal Der(L)$‎. ‎In particular‎, ‎we prove that the inner derivation algebra $ad(L)$‎ ‎is an ideal of the double derivation algebra $mathcal D(L)$; we also show that if $L$ is a perfect $n$-Lie algebra‎ ‎wit...