This paper will present an algorithm that evaluates links between one-word compounds and two-word compounds in a bilingual corpus that has been aligned at the sub-sentence level. The phenomenon of linking one-word compounds to multi-word compounds is common when English is being linked to other Germanic languages, and it is difficult to get the links right in the alignment process. The algorith...

Episturmian morphisms constitute a powerful tool to study episturmian words. Indeed, any episturmian word can be infinitely decomposed over the set of pure episturmian morphisms. Thus, an episturmian word can be defined by one of its morphic decompositions or, equivalently, by a certain directive word. Here we characterize pairs of words directing a common episturmian word. We also propose a wa...

Content word deletion has widely been identified as a common error in statistical machine translation systems. We refer to a translation error as “content word deletion” when a content word appears in the reference translation of some sentence, but is absent from the system output translation of that sentence. For our purposes, the term “content word” does not have a precise definition, but rep...

It is a common assumption that prosodic restrictions on the shape of children’s early productions refer to the prosodic word (cf. [1]). However, empirical research on word structure has focused almost exclusively on simplex words where the morphosyntactic and prosodic word boundaries coincide ([2], [3], [4], [5]). In this paper, we provide new evidence from the acquisition of German complex wor...

This paper introduces the concept of temporal word analogies: pairs of words which occupy the same semantic space at different points in time. One well-known property of word embeddings is that they are able to effectively model traditional word analogies (“word w1 is to word w2 as word w3 is to word w4”) through vector addition. Here, I show that temporal word analogies (“wordw1 at time tα is ...

The neighbourhood polynomial G , is generating function for the number of faces of each cardinality in the neighbourhood complex of a graph. In other word $N(G,x)=sum_{Uin N(G)} x^{|U|}$, where N(G) is neighbourhood complex of a graph, whose vertices are the vertices of the graph and faces are subsets of vertices that have a common neighbour. In this paper we compute this polynomial for some na...

A number of experimental results have shown that in terms of cognitive processing common words – words that occur frequently differ from uncommon words. People perceive common words more accurately and more quickly when listening (Savin, 1963) and also name them more quickly (Oldfield and Wingfield, 1965) while speaking. Also, people produce the common words in more reduced and shortened forms ...