| 2 |
A Transformer-Based Neural Machine Translation Model for Arabic Dialects That Utilizes Subword Units
|
|
|
|
In: Sensors ; Volume 21 ; Issue 19 (2021)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Complete Variable-Length Codes: An Excursion into Word Edit Operations
|
|
|
|
In: LATA 2020 ; https://hal.archives-ouvertes.fr/hal-02389403 ; LATA 2020, Mar 2020, Milan, Italy (2020)
|
|
BASE
|
|
Show details
|
|
|
| 4 |
Acoustic Data-Driven Subword Units Obtained through Segment Embedding and Clustering for Spontaneous Speech Recognition
|
|
|
|
In: Applied Sciences ; Volume 10 ; Issue 6 (2020)
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Subunits Inference and Lexicon Development Based on Pairwise Comparison of Utterances and Signs
|
|
|
|
In: Information ; Volume 10 ; Issue 10 (2019)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Learning Subword Embedding to Improve Uyghur Named-Entity Recognition
|
|
|
|
In: Information ; Volume 10 ; Issue 4 (2019)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
Using pronunciation-based morphological subword units to improve OOV handling in keyword search
|
|
|
|
BASE
|
|
Show details
|
|
|
| 10 |
Quotient Complexity of Bifix-, Factor-, and Subword-Free Regular Language
|
|
|
|
Abstract:
A language $L$ is prefix-free if whenever words $u$ and $v$ are in $L$ and $u$ is a prefix of $v$, then $u=v$. Suffix-, factor-, and subword-free languages are defined similarly, where by ``subword" we mean ``subsequence", and a language is bifix-free if it is both prefix- and suffix-free. These languages have important applications in coding theory. The quotient complexity of an operation on regular languages is defined as the number of left quotients of the result of the operation as a function of the numbers of left quotients of the operands. The quotient complexity of a regular language is the same as its state complexity, which is the number of states in the complete minimal deterministic finite automaton accepting the language. The state/quotient complexity of operations in the classes of prefix- and suffix-free languages has been studied before. Here, we study the complexity of operations in the classes of bifix-, factor-, and subword-free languages. We find tight upper bounds on the quotient complexity of intersection, union, difference, symmetric difference, concatenation, star, and reversal in these three classes of languages. ; Natural Sciences and Engineering Research Council of Canada [OGP0000871] ; Slovak Research and Development Agency [APVV-0035-10] ; Algorithms, Automata, and Discrete Data Structures VEGA, [2/0183/11]
|
|
Keyword:
bifix-free; factor-free; finite automaton; quotient complexity; regular language; state complexity; subword-free; tight upper bound
|
|
URL: http://hdl.handle.net/10012/12532
https://doi.org/10.14232/actacyb.21.4.2014.1
|
|
BASE
|
|
Hide details
|
|
|
| 11 |
An STD system for OOV query terms using various subword units
|
|
|
|
In: http://research.nii.ac.jp/ntcir/workshop/OnlineProceedings9/NTCIR/10-NTCIR9-SpokenDoc-SaitoH.pdf (2011)
|
|
BASE
|
|
Show details
|
|
|
| 12 |
Contextual verification for open vocabulary spoken term detection
|
|
|
|
In: Fraunhofer IAIS (2011)
|
|
BASE
|
|
Show details
|
|
|
| 13 |
Volkov, Modular and threshold subword counting and matrix representations of finite monoids
|
|
|
|
In: http://www.fc.up.pt/cmup/home/jalmeida/preprints/radicalshort2.pdf (2005)
|
|
BASE
|
|
Show details
|
|
|
| 14 |
Verbumculus and the discovery of unusual words
|
|
|
|
In: Apostolico, A; Gong, F C; & Lonardi, S. (2004). Verbumculus and the discovery of unusual words. Journal of Computer Science and Technology, 19(1), 22 - 41. UC Riverside: Retrieved from: http://www.escholarship.org/uc/item/5m66k36w (2004)
|
|
BASE
|
|
Show details
|
|
|
| 15 |
On average sequence complexity � www.elsevier.com/locate/tcs
|
|
|
|
In: http://www.cs.ucr.edu/~stelo/papers/tcs04.pdf (2003)
|
|
BASE
|
|
Show details
|
|
|
| 16 |
SUBWORD LATENT SEMANTIC ANALYSIS FOR TEXTTILING-BASED AUTOMATIC STORY SEGMENTATION OF CHINESE BROADCAST NEWS
|
|
|
|
In: http://isca-speech.org/archive_open/archive_papers/iscslp2008/358.pdf
|
|
BASE
|
|
Show details
|
|
|
| 17 |
and
|
|
|
|
In: http://www.mimuw.edu.pl/~rytter/MYPAPERS/PSC08_journal.pdf
|
|
BASE
|
|
Show details
|
|
|
| 18 |
1 Performance Analysis of Instruction Set Architecture Extensions for Multimedia§
|
|
|
|
In: http://www.cs.berkeley.edu/~slingn/publications/mm_isa_perf/mm_isa_perf_msp3.pdf
|
|
BASE
|
|
Show details
|
|
|
| 19 |
Parikh Matrices and Words over Tertiary Ordered Alphabet
|
|
|
|
In: http://research.ijcaonline.org/volume85/number4/pxc3893069.pdf
|
|
BASE
|
|
Show details
|
|
|
| 20 |
Morph-Based Speech Recognition and Modeling of Out-of-Vocabulary Words Across Languages
|
|
|
|
In: http://www-speech.sri.com/cgi-bin/run-distill?papers/acm2007-morph-asr.ps.gz
|
|
BASE
|
|
Show details
|
|
|
|
|
