Skip to search formSkip to main contentSkip to account menu

Partial word

A partial word is a string that may contain a number of "do not know" or "do not care" symbols i.e. placeholders in the string where the symbol value… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
PSY 4999: Honors Thesis | Dr. Jo-Anne Bachorowski. This paper was completed under the advisement of Dr. Tedra Walden. This study… 
2016
2016
Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible… 
2015
2015
Objective: The aim of the present study was to clarify the characteristics of disfluencies in people who do not stutter to obtain… 
2011
2011
The problem of classifying all the avoidable binary patterns in (full) words has been completely solved (see Chapter 3 of M… 
2010
2010
Complex applications in natural language processing such as syntactic analysis, semantic annotation, machine translation and… 
2009
2009
We prove that there exist infinitely many infinite overlap-fr ee binary partial words containing at least one hole. Moreover, we… 
2005
2005
Automatic Information retrieval from document image databases is an important and challenging task. The main challenges are font… 
2001
2001
We propose a phrase alignment method that aims to acquire translation knowl- edge automatically from bilingual text. Here, phrase… 
1999
1999
Most research in text classification has used the “bag of words” representation of text. This paper examines some alternative… 
1998
1998
This paper describes a new search technique for large vocabulary speech recognition based on a stack decoder. Considerable memory…