Sciweavers

595 search results - page 28 / 119
» Languages Of Analogical Strings
Sort
View
TAGT
1994
Springer
185views Graph Theory» more  TAGT 1994»
15 years 1 months ago
Concatenation of Graphs
An operation of concatenation is introduced for graphs. Then strings are viewed as expressions denoting graphs, and string languages are interpreted as graph languages. For a clas...
Joost Engelfriet, Jan Joris Vereijken
DLT
2009
14 years 7 months ago
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
Seki et al. (1991) proved a rather weak pumping lemma for multiple context-free languages, which says that any infinite m-multiple context-free language contains a string that is p...
Makoto Kanazawa
ASSETS
2005
ACM
14 years 11 months ago
Representing coordination and non-coordination in an american sign language animation
While strings and syntax trees are used by the Natural Language Processing community to represent the structure of spoken languages, these encodings are difficult to adapt to a si...
Matt Huenerfauth
78
Voted
FUIN
2010
89views more  FUIN 2010»
14 years 8 months ago
Computing Maximal Error-detecting Capabilities and Distances of Regular Languages
Abstract. A (combinatorial) channel consists of pairs of words representing all possible inputoutput channel situations. In a past paper, we formalized the intuitive concept of “...
Stavros Konstantinidis, Pedro V. Silva
LREC
2010
154views Education» more  LREC 2010»
14 years 11 months ago
Information Retrieval of Word Form Variants in Spoken Language Corpora Using Generalized Edit Distance
An important feature of spoken language corpora is existence of different spelling variants of words in transcription. So there is an important problem for linguist who works with...
Siim Orasmaa, Reina Käärik, Jaak Vilo, T...